Highly parallelizable problems
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Deterministic sampling—a new technique for fast pattern matching
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Fast hashing on a PRAM—designing by expectation
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Methods for message routing in parallel machines
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Optimal parallel two dimensional pattern matching
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
An efficient parallel algorithm for the single function coarsest partition problem
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
An Ω(√ log log n) lower bound for routing in optical networks
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Finding level-ancestors in trees
Journal of Computer and System Sciences
Optimal parallel string algorithms: sorting, merging and computing the minimum
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Work-time-optimal parallel algorithms for string problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Compression using efficient multicasting
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
An optimal simple parallel algorithm for testing isomorphism of maximal outerplanar graphs
Journal of Parallel and Distributed Computing
Parallel two dimensional witness computation
Information and Computation
Scheduling interval orders with communication delays in parallel
Journal of Parallel and Distributed Computing
Partially effective randomization in simulations between arbitrary and common PRAMs
Journal of Parallel and Distributed Computing
Efficient synchronous snapshots
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Parallel algorithms for separable permutations
Discrete Applied Mathematics
Optimal speedup on a low-degree multi-core parallel architecture (LoPRAM)
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Incomparability in parallel computation
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Theoretical Issues of Cluster Pattern Interfaces
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
Parallel algorithms for separable permutations
Discrete Applied Mathematics
| Hi-index | 0.00 |