The following pages link to Richard John Cole (Q1108804):
Displayed 50 items.
- (Q202180) (redirect page) (← links)
- (Q600217) (redirect page) (← links)
- Evaluation of the integral \(\int^\infty_0t^n \exp(-t^2-x/t)dt\) (Q600219) (← links)
- (Q758187) (redirect page) (← links)
- Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms (Q758188) (← links)
- Edge-coloring bipartite multigraphs in \(O(E \log D)\) time (Q873646) (← links)
- On special families of morphisms related to \(\delta \)-matching and don't care symbols (Q1007535) (← links)
- A parallel median algorithm (Q1062763) (← links)
- Partitioning point sets in arbitrary dimension (Q1088420) (← links)
- The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time (Q1104105) (← links)
- An optimally efficient selection algorithm (Q1108805) (← links)
- A method for predicting the stability characteristics of three-term homogeneous recurrence relations (Q1153667) (← links)
- Two series representations of the integral \(\int_ 0^\infty \exp[- s(\psi + y \cos\psi - z \sin\psi)] d\psi\) (Q1164370) (← links)
- Optimal parallel algorithms for point-set and polygon problems (Q1187196) (← links)
- The leading edge signal on a flat plate in uniform shear (Q1242530) (← links)
- Overlap matching. (Q1401926) (← links)
- (Q1817000) (redirect page) (← links)
- A nearly optimal deterministic parallel Voronoi diagram algorithm (Q1817002) (← links)
- Faster optimal parallel prefix sums and list ranking (Q1825647) (← links)
- The expected advantage of asynchrony (Q1900933) (← links)
- On the existence of Pareto efficient and envy-free allocations (Q2025008) (← links)
- Tatonnement beyond gross substitutes? Gradient descent to the rescue (Q2206817) (← links)
- Fully asynchronous stochastic coordinate descent: a tight lower bound on the parallelism achieving linear speedup (Q2235160) (← links)
- Suffix trays and suffix trists: structures for faster text indexing (Q2354023) (← links)
- A unified access bound on comparison-based dynamic dictionaries (Q2381520) (← links)
- New linear-time algorithms for edge-coloring planar graphs (Q2479530) (← links)
- How much can taxes help selfish routing? (Q2495395) (← links)
- Decentralized utilitarian mechanisms for scheduling games (Q2516246) (← links)
- Definitional boolean calculi (Q2529624) (← links)
- An <i>O</i>(<i>n</i>log <i>n</i>) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees (Q2706115) (← links)
- (Q2754250) (← links)
- (Q2768267) (← links)
- (Q2768306) (← links)
- Revisiting the Cache Miss Analysis of Multithreaded Algorithms (Q2894463) (← links)
- Searching dynamic point sets in spaces with bounded doubling dimension (Q2931420) (← links)
- Approximating the Nash Social Welfare with Indivisible Items (Q2941527) (← links)
- (Q3007250) (← links)
- (Q3046822) (← links)
- (Q3138957) (← links)
- (Q3149793) (← links)
- Approximate String Matching: A Simpler Faster Algorithm (Q3149893) (← links)
- Faster suffix tree construction with missing suffix links (Q3192008) (← links)
- Towards Operational Abduction from a Cognitive Perspective (Q3411845) (← links)
- Applications of $$\alpha $$-Strongly Regular Distributions to Bayesian Auctions (Q3460792) (← links)
- (Q3549715) (← links)
- Verifying candidate matches in sparse and wildcard matching (Q3579248) (← links)
- Dictionary matching and indexing with errors and don't cares (Q3580961) (← links)
- Pricing network edges for heterogeneous selfish users (Q3581254) (← links)
- A fast algorithm for computing steiner edge connectivity (Q3581294) (← links)
- Bottleneck links, variable demand, and the tragedy of the commons (Q3581586) (← links)