Minimal space, average linear time duplicate deletion
- 1 March 1991
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 34 (3) , 62-73
- https://doi.org/10.1145/102868.102872
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Stable duplicate-key extraction with optimal time and space boundsActa Informatica, 1989
- Approximating the number of unique values of an attribute without sortingInformation Systems, 1987
- Programming pearlsCommunications of the ACM, 1986
- Duplicate record elimination in large data filesACM Transactions on Database Systems, 1983
- Sorting a linked list with equal keysInformation Processing Letters, 1982
- Implementing Quicksort programsCommunications of the ACM, 1978
- Stable Sorting and Merging with Optimal Space and Time BoundsSIAM Journal on Computing, 1977
- Sorting and Searching in MultisetsSIAM Journal on Computing, 1976
- Key-to-address transform techniquesCommunications of the ACM, 1971
- Algorithm 245: TreesortCommunications of the ACM, 1964