The following pages link to Uzi Vishkin (Q690246):
Displaying 34 items.
- Deterministic coin tossing with applications to optimal parallel list ranking (Q3753489) (← links)
- Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems (Q3766845) (← links)
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time (Q3777447) (← links)
- (Q3783605) (← links)
- (Q3795246) (← links)
- (Q3798227) (← links)
- (Q3798229) (← links)
- Tight Comparison Bounds on the Complexity of Parallel Sorting (Q3801082) (← links)
- On Finding Lowest Common Ancestors: Simplification and Parallelization (Q3823152) (← links)
- Finding the maximum, merging, and sorting in a parallel computation model (Q3906428) (← links)
- An O(n2log n) parallel max-flow algorithm (Q3942729) (← links)
- An O(logn) parallel connectivity algorithm (Q3957960) (← links)
- On parallel hashing and integer sorting (Q3988822) (← links)
- Efficient pattern matching with scaling (Q3990613) (← links)
- A parallel blocking flow algorithm for acyclic networks (Q4020359) (← links)
- Recursive Star-Tree Parallel Data Structure (Q4032934) (← links)
- (Q4036578) (← links)
- (Q4038730) (← links)
- Fast parallel and serial approximate string matching (Q4203810) (← links)
- (Q4206396) (← links)
- (Q4234153) (← links)
- Biconnectivity approximations and graph carvings (Q4299007) (← links)
- Top-Bottom Routing around a Rectangle is as Easy as Computing Prefix Minima (Q4302276) (← links)
- A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Covers (Q4312226) (← links)
- (Q4547736) (← links)
- Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values (Q4696645) (← links)
- Implementation of simultaneous memory address access in models that forbid it (Q4747506) (← links)
- (Q4763433) (← links)
- A FAST PARALLEL ALGORITHM FOR FINDING THE CONVEX HULL OF A SORTED POINT SET (Q4889509) (← links)
- (Q4952617) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311137) (← links)
- Experiments with list ranking for explicit multi-threaded (XMT) instruction parallelism (Q5463407) (← links)
- Trade-offs between communication throughput and parallel time (Q5890843) (← links)
- Trade-offs between communication throughput and parallel time (Q5906374) (← links)
