Richard Cole
Richard Cole
Bookitis has not yet captured a biography for this author, but the catalog links below show the books currently associated with this profile.
Overview
Catalog identity and bibliographic footprint for this author.
Catalog identity
How this author appears inside the active Bookitis catalog.
Display name
Personal name
Source identifier
Featured books
Representative editions for works actually authored by this person.
- Image source: Open LibraryOT
Occupy this book
cover - Image source: Open LibraryGR
Geometric retrieval problems
cover - Image source: Open LibrarySF
Self-defense for radicals
cover - Image source: Open LibraryAA
An asynchronous parallel algorithm for undirected graph connectivity
cover - Image source: Open LibraryTA
The APRAM -- the rounds complexity measure and the explicit costs of synchronization
cover - Image source: Open LibraryTE
The expected advantage of asynchrony
cover - Image source: Open LibraryOA
Online algorithms for finger searching
cover - Image source: Open LibraryOT
On the detection of robust curves
cover - Image source: Open LibraryTB
Tight bounds on the complexity of the Boyer-Moore pattern matching algorithm
cover - Image source: Open LibraryOT
On the dynamic finger conjecture for splay trees. Part I: Splay sorting log n-block sequences
cover - Image source: Open LibraryAP
Approximate parallel scheduling. Part II: Applications to optimal parallel graph algorithms in logarithmic time
cover - Image source: Open LibraryFO
Faster optimal parallel prefix sums and list ranking
cover - Image source: Open LibraryOO
On optimal parallel algorithm for building a data structure for planar point location
cover - Image source: Open LibraryPM
Parallel merge sort
cover - Image source: Open LibraryAC
The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time
cover - Image source: Open LibraryAO
An optimal selection algorithm
cover - Image source: Open LibraryAP
Approximate parallel scheduling. Part I: The basic technique with applications to optimal parallel list ranking in logarithmic time
cover - Image source: Open LibraryNO
Note on the AKS sorting network (expository note)
cover - Image source: Open LibraryVP
Visibility problems for polyhedral terrains
cover - Image source: Open LibraryLB
Lower bounds on communication complexity in VLSI
cover - Image source: Open LibraryOV
Optimal VLSI circuits for sorting
cover - Image source: Open LibraryPP
Partitioning point sets in arbitrary dimension
cover - Image source: Open LibraryAP
A parallel median algorithm
cover - Image source: Open LibraryPP
Partitioning point sets in 4 dimensions
cover
Works in catalog
Quick navigation into the work-level grouping pages behind the featured books.
- Open Work
Occupy this book
- Open Work
Geometric retrieval problems
- Open Work
Self-defense for radicals
- Open Work
An asynchronous parallel algorithm for undirected graph connectivity
- Open Work
The APRAM -- the rounds complexity measure and the explicit costs of synchronization
- Open Work
The expected advantage of asynchrony
- Open Work
Online algorithms for finger searching
- Open Work
On the detection of robust curves
- Open Work
Tight bounds on the complexity of the Boyer-Moore pattern matching algorithm
- Open Work
On the dynamic finger conjecture for splay trees. Part I: Splay sorting log n-block sequences
- Open Work
Approximate parallel scheduling. Part II: Applications to optimal parallel graph algorithms in logarithmic time
- Open Work
Faster optimal parallel prefix sums and list ranking
- Open Work
On optimal parallel algorithm for building a data structure for planar point location
- Open Work
Parallel merge sort
- Open Work
The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time
- Open Work
An optimal selection algorithm
- Open Work
Approximate parallel scheduling. Part I: The basic technique with applications to optimal parallel list ranking in logarithmic time
- Open Work
Note on the AKS sorting network (expository note)
- Open Work
Visibility problems for polyhedral terrains
- Open Work
Lower bounds on communication complexity in VLSI
- Open Work
Optimal VLSI circuits for sorting
- Open Work
Partitioning point sets in arbitrary dimension
- Open Work
A parallel median algorithm
- Open Work
Partitioning point sets in 4 dimensions