Towards a theory of nearly constant time parallel algorithms
- 9 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 698-710
- https://doi.org/10.1109/sfcs.1991.185438
Abstract
No abstract availableThis publication has 35 references indexed in Scilit:
- Parallel dictionaries on 2–3 treesPublished by Springer Nature ,2006
- On parallel hashing and integer sortingPublished by Springer Nature ,2005
- The parallel simplicity of compaction and chainingPublished by Springer Nature ,2005
- A new universal class of hash functions and dynamic hashing in real timePublished by Springer Nature ,2005
- Faster optimal parallel prefix sums and list rankingInformation and Computation, 1989
- An optimal parallel dictionaryPublished by Association for Computing Machinery (ACM) ,1989
- Optimal on-line load balancingPublished by Association for Computing Machinery (ACM) ,1989
- Data Structures and Algorithms 1Published by Springer Nature ,1984
- An O(logn) parallel connectivity algorithmJournal of Algorithms, 1982
- A fast probabilistic parallel sorting algorithmPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981