The following pages link to Richard John Cole (Q1108804):
Displaying 50 items.
- Resource Oblivious Sorting on Multicores (Q3587382) (← links)
- (Q3687757) (← links)
- Geometric retrieval problems (Q3719869) (← links)
- New upper bounds for neighbor searching (Q3727397) (← links)
- Searching and storing similar lists (Q3742729) (← links)
- Deterministic coin tossing with applications to optimal parallel list ranking (Q3753489) (← links)
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time (Q3777447) (← links)
- On <i>k</i>-Hulls and Related Problems (Q3777473) (← links)
- Shape from probing (Q3786056) (← links)
- (Q3795242) (← links)
- Parallel Merge Sort (Q3796769) (← links)
- (Q3798227) (← links)
- Optimal VLSI circuits for sorting (Q3816988) (← links)
- Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms (Q3833604) (← links)
- An Optimal-Time Algorithm for Slope Selection (Q3835020) (← links)
- Complementary variational principles and the Bubnov-Galerkin method (Q3871455) (← links)
- Complementary variational principles for free molecular channel flow (Q3877280) (← links)
- Possibility matrices (Q3895429) (← links)
- Complementary bivariational principles for linear problems involving non-self-adjoint operators (Q3927778) (← links)
- On Edge Coloring Bipartite Graphs (Q3947136) (← links)
- RANDOMIZED PARALLEL ALGORITHMS FOR TRAPEZOIDAL DIAGRAMS (Q4017519) (← links)
- ERRATUM: "RANDOMIZED PARALLEL ALGORITHMS FOR TRAPEZOIDAL DIAGRAMS" (Q4030354) (← links)
- (Q4038709) (← links)
- (Q4049292) (← links)
- Some complementary bivariational principles for linear integral equations of Fredholm type (Q4089410) (← links)
- Complementary Variational Principles for Knudsen Flow Rates (Q4142890) (← links)
- ON PROJECTION AND VARIATIONAL METHODS IN KINETIC THEORY (Q4198012) (← links)
- (Q4228434) (← links)
- (Q4250214) (← links)
- (Q4252293) (← links)
- (Q4252294) (← links)
- (Q4252740) (← links)
- Correction: Parallel Merge Sort (Q4277548) (← links)
- Tighter Lower Bounds on the Exact Complexity of String Matching (Q4326851) (← links)
- An Asynchronous Parallel Algorithm for Undirected Graph Connectivity (Q4327814) (← links)
- Tighter Upper Bounds on the Exact Complexity of String Matching (Q4340774) (← links)
- Reconfiguring Arrays with Faults Part I: Worst-Case Faults (Q4376192) (← links)
- (Q4411353) (← links)
- (Q4411355) (← links)
- Tree Pattern Matching to Subset Matching in Linear Time (Q4429673) (← links)
- Faster Suffix Tree Construction with Missing Suffix Links (Q4441899) (← links)
- (Q4449230) (← links)
- (Q4471382) (← links)
- On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log <i>n</i>-Block Sequences (Q4507338) (← links)
- On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof (Q4507339) (← links)
- (Q4526971) (← links)
- (Q4542556) (← links)
- Approximating the Nash Social Welfare with Indivisible Items (Q4571931) (← links)
- Slowing down sorting networks to obtain faster sorting algorithms (Q4601942) (← links)
- (Q4737157) (← links)