The parallel simplicity of compaction and chaining
- 27 June 2005
- book chapter
- Published by Springer Nature
- p. 744-751
- https://doi.org/10.1007/bfb0032071
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Perfect hashing, graph entropy, and circuit complexityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Parallel retrieval of scattered informationPublished by Springer Nature ,1989
- Recursive *-tree parallel data-structurePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Simulations among concurrent-write PRAMsAlgorithmica, 1988
- Optimal bounds for decision problems on the CRCW PRAMPublished by Association for Computing Machinery (ACM) ,1987
- Approximate and exact parallel scheduling with applications to list, tree and graph problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Unbounded fan-in circuits and associative functionsJournal of Computer and System Sciences, 1985
- Relations between concurrent-write models of parallel computationPublished by Association for Computing Machinery (ACM) ,1984
- Storing a sparse table with O(1) worst case access timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979