The following pages link to Uzi Vishkin (Q690246):
Displaying 50 items.
- On parallel integer merging (Q690247) (← links)
- Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms (Q758188) (← links)
- A parallel-design distributed-implementation (PDDI) general-purpose computer (Q797283) (← links)
- An optimal parallel connectivity algorithm (Q797997) (← links)
- Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories (Q799371) (← links)
- Finding Euler tours in parallel (Q801686) (← links)
- Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm (Q919827) (← links)
- Solving NP-hard problems in 'almost trees': vertex cover (Q1062757) (← links)
- Efficient implementation of a shifting algorithm (Q1070825) (← links)
- Efficient string matching with k mismatches (Q1079377) (← links)
- On efficient parallel strong orientation (Q1082819) (← links)
- Parallel ear decomposition search (EDS) and st-numbering in graphs (Q1095666) (← links)
- Parallel construction of a suffix tree with applications (Q1104104) (← links)
- The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time (Q1104105) (← links)
- Fast string matching with k differences (Q1109574) (← links)
- On finding a minimum dominating set in a tournament (Q1113678) (← links)
- Matching patterns in strings subject to multi-linear transformations (Q1115200) (← links)
- (Q1166532) (redirect page) (← links)
- Golden ratios in a pairs covering problem (Q1166533) (← links)
- Complexity of finding k-path-free dominating sets in graphs (Q1167535) (← links)
- Randomized range-maxima in nearly-constant parallel time (Q1210333) (← links)
- Finding level-ancestors in trees (Q1329158) (← links)
- Pattern matching in a digitized image (Q1336966) (← links)
- On the parallel complexity of digraph reachability (Q1339381) (← links)
- Almost fully-parallel parentheses matching (Q1345960) (← links)
- Sorting strings and constructing digital search trees in parallel (Q1365679) (← links)
- Faster optimal parallel prefix sums and list ranking (Q1825647) (← links)
- Deterministic resource discovery in distributed networks (Q1879187) (← links)
- Towards a first vertical prototyping of an extremely fine-grained parallel programming approach (Q1879192) (← links)
- Oblivious network RAM and leveraging parallelism to achieve obliviousness (Q2318092) (← links)
- Parallel algorithms for Burrows-Wheeler compression and decompression (Q2437742) (← links)
- (Q2764055) (← links)
- Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness (Q2811137) (← links)
- Symmetry breaking for suffix tree construction (Q2817621) (← links)
- (Q3128883) (← links)
- (Q3128924) (← links)
- (Q3138911) (← links)
- Deterministic Sampling–A New Technique for Fast Pattern Matching (Q3204065) (← links)
- (Q3313267) (← links)
- Simulation of Parallel Random Access Machines by Circuits (Q3316595) (← links)
- Dynamic parallel memories (Q3321444) (← links)
- Constant Depth Reducibility (Q3325043) (← links)
- (Q3340151) (← links)
- (Q3670587) (← links)
- Optimal parallel generation of a computation tree form (Q3678673) (← links)
- (Q3687751) (← links)
- Trade-Offs between Depth and Width in Parallel Computation (Q3691060) (← links)
- An Efficient Parallel Biconnectivity Algorithm (Q3694710) (← links)
- Optimal parallel pattern matching in strings (Q3716299) (← links)
- (Q3727398) (← links)
