Upper and lower time bounds for parallel random access machines without simultaneous writes
SIAM Journal on Computing
The parallel simplicity of compaction and chaining
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Improved upper and lower time bounds for parallel random access machines without simultaneous writes
SIAM Journal on Computing
Parallel algorithms for shared-memory machines
Handbook of theoretical computer science (vol. A)
SIAM Journal on Computing
Towards a theory of nearly constant time parallel algorithms
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Time complexity of Boolean functions on CREW PRAMs
SIAM Journal on Computing
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
Exact lower time bounds for computing Boolean functions on CREW PRAMs
Journal of Computer and System Sciences
Fast deterministic processor allocation
SODA '93 Proceedings of the fourth 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
Parallel Retrieval of Scattered Information
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Fast Integer Merging on the EREW PRAM
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Computational bounds for fundamental problems on general-purpose parallel models
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Approximate Compaction and Padded-Sorting on Exclusive Write PRAMs
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
| Hi-index | 0.00 |