Optimal parallel generation of a computation tree form
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
An optimal parallel algorithm for dynamic expression evaluation and its applications
Proc. of the sixth conference on Foundations of software technology and theoretical computer science
The page number of genus g graphs is (g)
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Optimal parallel parsing of bracket languages
Theoretical Computer Science
Optimal parallel evaluation of tree-structured computations by raking (extended abstract)
VLSI Algorithms and Architectures
Tight bounds on the complexity of parallel sorting
IEEE Transactions on Computers
An O(logN) deterministic packet routing scheme
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Fast computation using faulty hypercubes
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Fast algorithms for bit-serial routing on a hypercube
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Deterministic sorting in nearly logarithmic time on the hypercube and related computers
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
On the parallel recognition of ambiguous context-free languages
Theoretical Computer Science
Optimal parallel recognition of bracket languages as hypercubes
STACS 91 Proceedings of the 8th annual symposium on Theoretical aspects of computer science
On Self-Routing in Benes and Shuffle-Exchange Networks
IEEE Transactions on Computers
Parallel permutation and sorting algorithms and a new generalized connection network
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Parallel Generation of Postfix and Tree Forms
ACM Transactions on Programming Languages and Systems (TOPLAS)
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A logarithmic time sort for linear size networks
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Pipelined parallel computations, and sorting on a pipelined hypercube.
Pipelined parallel computations, and sorting on a pipelined hypercube.
All Nearest Smaller Values on the Hypercube
IEEE Transactions on Parallel and Distributed Systems
Efficient EREW PRAM Algorithms for Parentheses-Matching
IEEE Transactions on Parallel and Distributed Systems
A new Parallel Algorithm for the Parentheses-Matching Problem
PAS '97 Proceedings of the 2nd AIZU International Symposium on Parallel Algorithms / Architecture Synthesis
Hi-index | 0.00 |