Algebraic methods in the theory of lower bounds for Boolean circuit complexity
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Optimal bounds for decision problems on the CRCW PRAM
Journal of the ACM (JACM)
A bridging model for parallel computation
Communications of the ACM
Parallel algorithms for shared-memory machines
Handbook of theoretical computer science (vol. A)
SIAM Journal on Computing
Load balancing requires &OHgr;(log*n) expected time
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
LogP: towards a realistic model of parallel computation
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Exact lower time bounds for computing Boolean functions on CREW PRAMs
Journal of Computer and System Sciences
Lower bounds for randomized exclusive write PRAMs
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Communication primitive for BSP computers
Information Processing Letters
Communication-efficient parallel sorting (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Efficient low-contention parallel algorithms
Journal of Computer and System Sciences
Can shared-memory model serve as a bridging model for parallel computation?
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Modeling parallel bandwidth: local vs. global restrictions
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
The QRQW PRAM: accounting for contention in parallel algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Retrieval of scattered information by EREW, CREW and CRCW PRAMs
SWAT '92 Proceedings of the Third Scandinavian Workshop on Algorithm Theory
Limitations of the QRQW and EREW PRAM Models
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
A theorem on probabilistic constant depth Computations
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
A lower bound for the QRQW PRAM
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
Graphs and Hypergraphs
Probabilistic computations: Toward a unified measure of complexity
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Emulations between QSM, BSP, and LogP: a framework for general-purpose parallel algorithm design
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Parallel Algorithm Design with Coarse-Grained Synchronization
ICCS '01 Proceedings of the International Conference on Computational Science-Part II
Emulations between QSM, BSP and LogP: a framework for general-purpose parallel algorithm design
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |