Preserving total order in constant expected time
Part of the Lecture Notes in Computer Science book series (LNCS, volume 118)
KeywordsRandom Access Hash Table Sorting Algorithm Neighbour List Expected Time
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 1.Franklin, W. R., Padded lists: set operations in expected 0 (log log n) time. Information Processing Letters 9, 1979, pp. 161–166Google Scholar
- 2.Knuth, D. E., The Art of Computer Programming, Vol. III.: Sorting and Searching, Addison-Wesley, Reading, MA, 1973Google Scholar
- 3.Weide, B. W., Statistical methods in algorithm design and analysis. Ph.D. Dissertation, Carnegie-Mellon, University, PA, 1978Google Scholar
© Springer-Verlag Berlin Heidelberg 1981