| Publication | Date of Publication | Type |
|---|
Oblivious network RAM and leveraging parallelism to achieve obliviousness
Journal of Cryptology | 2019-08-13 | Paper |
Trade-offs between communication throughput and parallel time
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Symmetry breaking for suffix tree construction
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Oblivious network RAM and leveraging parallelism to achieve obliviousness
Advances in Cryptology -- ASIACRYPT 2015 | 2016-06-10 | Paper |
Parallel algorithms for Burrows-Wheeler compression and decompression
Theoretical Computer Science | 2014-03-13 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Experiments with list ranking for explicit multi-threaded (XMT) instruction parallelism
ACM Journal of Experimental Algorithmics | 2005-08-04 | Paper |
Deterministic resource discovery in distributed networks
Theory of Computing Systems | 2004-09-22 | Paper |
Towards a first vertical prototyping of an extremely fine-grained parallel programming approach
Theory of Computing Systems | 2004-09-22 | Paper |
scientific article; zbMATH DE number 1786447 (Why is no real title available?)
| 2002-08-21 | Paper |
scientific article; zbMATH DE number 1693481 (Why is no real title available?)
| 2002-01-22 | Paper |
scientific article; zbMATH DE number 1263280 (Why is no real title available?)
| 2001-08-28 | Paper |
On the parallel complexity of digraph reachability
Information Processing Letters | 2000-06-21 | Paper |
scientific article; zbMATH DE number 1445304 (Why is no real title available?)
| 2000-05-10 | Paper |
Trade-offs between communication throughput and parallel time
Journal of Complexity | 1999-05-11 | Paper |
Sorting strings and constructing digital search trees in parallel
Theoretical Computer Science | 1997-09-09 | Paper |
scientific article; zbMATH DE number 1003294 (Why is no real title available?)
| 1997-08-04 | Paper |
scientific article; zbMATH DE number 1003255 (Why is no real title available?)
| 1997-04-23 | Paper |
A FAST PARALLEL ALGORITHM FOR FINDING THE CONVEX HULL OF A SORTED POINT SET
International Journal of Computational Geometry & Applications | 1996-08-12 | Paper |
Pattern matching in a digitized image
Algorithmica | 1996-02-26 | Paper |
Biconnectivity approximations and graph carvings
Journal of the ACM | 1995-10-09 | Paper |
scientific article; zbMATH DE number 742993 (Why is no real title available?)
| 1995-04-11 | Paper |
Almost fully-parallel parentheses matching
Discrete Applied Mathematics | 1995-03-19 | Paper |
A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Covers
Journal of Algorithms | 1994-11-30 | Paper |
scientific article; zbMATH DE number 432781 (Why is no real title available?)
| 1994-09-20 | Paper |
Top-Bottom Routing around a Rectangle is as Easy as Computing Prefix Minima
SIAM Journal on Computing | 1994-08-14 | Paper |
Finding level-ancestors in trees
Journal of Computer and System Sciences | 1994-06-29 | Paper |
On parallel integer merging
Information and Computation | 1993-12-20 | Paper |
Randomized range-maxima in nearly-constant parallel time
Computational Complexity | 1993-09-16 | Paper |
Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
Journal of Algorithms | 1993-06-29 | Paper |
scientific article; zbMATH DE number 177852 (Why is no real title available?)
| 1993-05-18 | Paper |
scientific article; zbMATH DE number 176748 (Why is no real title available?)
| 1993-05-18 | Paper |
Recursive Star-Tree Parallel Data Structure
SIAM Journal on Computing | 1993-05-17 | Paper |
A parallel blocking flow algorithm for acyclic networks
Journal of Algorithms | 1993-01-16 | Paper |
Efficient pattern matching with scaling
Journal of Algorithms | 1992-06-28 | Paper |
On parallel hashing and integer sorting
Journal of Algorithms | 1992-06-28 | Paper |
Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms
Information and Computation | 1991-01-01 | Paper |
Deterministic Sampling–A New Technique for Fast Pattern Matching
SIAM Journal on Computing | 1991-01-01 | Paper |
Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm
Discrete Applied Mathematics | 1990-01-01 | Paper |
scientific article; zbMATH DE number 4126695 (Why is no real title available?)
| 1990-01-01 | Paper |
Faster optimal parallel prefix sums and list ranking
Information and Computation | 1989-01-01 | Paper |
Fast parallel and serial approximate string matching
Journal of Algorithms | 1989-01-01 | Paper |
Parallel construction of a suffix tree with applications
Algorithmica | 1988-01-01 | Paper |
On Finding Lowest Common Ancestors: Simplification and Parallelization
SIAM Journal on Computing | 1988-01-01 | Paper |
scientific article; zbMATH DE number 4064469 (Why is no real title available?)
| 1988-01-01 | Paper |
Matching patterns in strings subject to multi-linear transformations
Theoretical Computer Science | 1988-01-01 | Paper |
Fast string matching with k differences
Journal of Computer and System Sciences | 1988-01-01 | Paper |
Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
SIAM Journal on Computing | 1988-01-01 | Paper |
On finding a minimum dominating set in a tournament
Theoretical Computer Science | 1988-01-01 | Paper |
The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time
Algorithmica | 1988-01-01 | Paper |
scientific article; zbMATH DE number 4060743 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4064467 (Why is no real title available?)
| 1988-01-01 | Paper |
Tight Comparison Bounds on the Complexity of Parallel Sorting
SIAM Journal on Computing | 1987-01-01 | Paper |
scientific article; zbMATH DE number 4047160 (Why is no real title available?)
| 1987-01-01 | Paper |
Efficient string matching with k mismatches
Theoretical Computer Science | 1986-01-01 | Paper |
Deterministic coin tossing with applications to optimal parallel list ranking
Information and Control | 1986-01-01 | Paper |
Parallel ear decomposition search (EDS) and st-numbering in graphs
Theoretical Computer Science | 1986-01-01 | Paper |
scientific article; zbMATH DE number 3958744 (Why is no real title available?)
| 1986-01-01 | Paper |
An Efficient Parallel Biconnectivity Algorithm
SIAM Journal on Computing | 1985-01-01 | Paper |
On efficient parallel strong orientation
Information Processing Letters | 1985-01-01 | Paper |
Efficient implementation of a shifting algorithm
Discrete Applied Mathematics | 1985-01-01 | Paper |
Trade-Offs between Depth and Width in Parallel Computation
SIAM Journal on Computing | 1985-01-01 | Paper |
scientific article; zbMATH DE number 3911754 (Why is no real title available?)
| 1985-01-01 | Paper |
Optimal parallel pattern matching in strings
Information and Control | 1985-01-01 | Paper |
Optimal parallel generation of a computation tree form
ACM Transactions on Programming Languages and Systems | 1985-01-01 | Paper |
Solving NP-hard problems in 'almost trees': vertex cover
Discrete Applied Mathematics | 1985-01-01 | Paper |
Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
Acta Informatica | 1984-01-01 | Paper |
An optimal parallel connectivity algorithm
Discrete Applied Mathematics | 1984-01-01 | Paper |
Simulation of Parallel Random Access Machines by Circuits
SIAM Journal on Computing | 1984-01-01 | Paper |
Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems
Journal of the ACM | 1984-01-01 | Paper |
Constant Depth Reducibility
SIAM Journal on Computing | 1984-01-01 | Paper |
A parallel-design distributed-implementation (PDDI) general-purpose computer
Theoretical Computer Science | 1984-01-01 | Paper |
Finding Euler tours in parallel
Journal of Computer and System Sciences | 1984-01-01 | Paper |
scientific article; zbMATH DE number 3825195 (Why is no real title available?)
| 1983-01-01 | Paper |
Dynamic parallel memories
Information and Control | 1983-01-01 | Paper |
Implementation of simultaneous memory address access in models that forbid it
Journal of Algorithms | 1983-01-01 | Paper |
scientific article; zbMATH DE number 3843145 (Why is no real title available?)
| 1983-01-01 | Paper |
scientific article; zbMATH DE number 3874614 (Why is no real title available?)
| 1983-01-01 | Paper |
An O(logn) parallel connectivity algorithm
Journal of Algorithms | 1982-01-01 | Paper |
An O(n2log n) parallel max-flow algorithm
Journal of Algorithms | 1982-01-01 | Paper |
Golden ratios in a pairs covering problem
Discrete Mathematics | 1982-01-01 | Paper |
Complexity of finding k-path-free dominating sets in graphs
Information Processing Letters | 1982-01-01 | Paper |
Finding the maximum, merging, and sorting in a parallel computation model
Journal of Algorithms | 1981-01-01 | Paper |
