Optimal parallel generation of a computation tree form
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Routing, merging, and sorting on parallel models of computation
Journal of Computer and System Sciences
Optimal parallel pattern matching in strings
Information and Control
Optimal parallel algorithms for string matching
Information and Control
Deterministic coin tossing with applications to optimal parallel list ranking
Information and Control
Upper and lower time bounds for parallel random access machines without simultaneous writes
SIAM Journal on Computing
Optimal bounds for decision problems on the CRCW PRAM
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Efficient parallel solutions to some geometric problems
Journal of Parallel and Distributed Computing
Finding the convex hull of a sorted point set in parallel
Information Processing Letters
Relations between concurrent-write models of parallel computation
SIAM Journal on Computing
Two algorithms for constructing a binary tree from its traversals
Information Processing Letters
Efficient parallel triconnectivity in logarithmic time (extended abstract)
VLSI Algorithms and Architectures
Discrete Applied Mathematics
Journal of the ACM (JACM)
Parallel Generation of Postfix and Tree Forms
ACM Transactions on Programming Languages and Systems (TOPLAS)
A unifying look at data structures
Communications of the ACM
Space-time tradeoff for answering range queries (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Scaling and related techniques for geometry problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Efficient parallel techniques for computational geometry
Efficient parallel techniques for computational geometry
Optimal parallel suffix-prefix matching algorithm and applications
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Algorithms for string searching
ACM SIGIR Forum
Parallel tree pattern matching
Journal of Symbolic Computation
Parallel searching in generalized Monge arrays with applications
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Deterministic sampling—a new technique for fast pattern matching
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Parallel construction of trees with optimal weighted path length
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
In-place techniques for parallel convex hull algorithms (preliminary version)
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Ultra-fast expected time parallel algorithms
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Efficient Geometric Algorithms on the EREW PRAM
IEEE Transactions on Parallel and Distributed Systems
Optimal parallel dictionary matching and compression (extended abstract)
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Optimal parallel approximation for prefix sums and integer sorting
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Efficient pattern matching with scaling
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Faster algorithms for string matching with k mismatches
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Time-Optimal Visibility-Related Algorithms on Meshes with Multiple Broadcasting
IEEE Transactions on Parallel and Distributed Systems
Faster algorithms for string matching with k mismatches
Journal of Algorithms - Special issue: SODA 2000
Range mode and range median queries on lists and trees
Nordic Journal of Computing
On space efficient two dimensional range minimum data structures
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Finding Patterns In Given Intervals
Fundamenta Informaticae
Approximate matching in the L1 metric
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
A parallel algorithm for finding all successive minimal maximum subsequences
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Two-dimensional range minimum queries
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Linear time algorithms for two disjoint paths problems on directed acyclic graphs
Theoretical Computer Science
| Hi-index | 0.00 |