Deletion algorithms for hashing that preserve randomness
- 30 September 1982
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 3 (3) , 261-275
- https://doi.org/10.1016/0196-6774(82)90024-4
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Analysis of the Search Performance of Coalesced HashingJournal of the ACM, 1983
- Deletions That Preserve RandomnessIEEE Transactions on Software Engineering, 1977
- Some Combinatorial Properties of Certain Trees With Applications to Searching and SortingJournal of the ACM, 1962
- Handling identifies as internal symbols in language processorsCommunications of the ACM, 1959