Chapter PDF
Keywords
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.
9. References
A. V. Aho, J. E. Hopcroft and J. D. Ullman, "The Design And Analysis Of Computer Algorithms", Addison-Wesley, 1974.
J. L. Bentley, D. Detig, L. Guibas and J. Saxe, "An Optimal Data Structure For Minimal-Storage Dynamic Searching", Computer Science Department, Carnegie-Mellon University, 1978.
M. R. Brown and R. E. Tarjan, "A Representation For Linear Lists With Moveable Fingers", Tenth Annual Symposium on the Theory of Computing, San Diego, California, 1978.
J. L. Bently and A. C. Yao, "An Almost Optimal Algorithm For Searching", Information Processing Letters, 5, 3, 1976, pp. 82–87.
W. Feller, "An Introduction To Probability Theory And Its Applications", Volume 1, John Wiley, 1950.
W. R. Franklin, "Padded Lists: Set Operations In Expected O(log log N) Time", Information Processing Letters, 9, 4, November 1979, pp. 161–166.
L. J. Guibas, E. M. McCreight, M. F. Plass and J. R. Roberts, "A New Representation For Linear Lists", 9th Annual Symposium Theory Of Complexity, pp. 49–60, 1977.
A.Itai, A. G. Konheim and M. Rodeh, "A Sparse Table Implementation Of Priority Queues", RC-8550, IBM Thomas J. Watson Research Center, November 1980.
D. E. Knuth, "The Art Of Computer Programming: Fundmanetal Algorithms", Addison-Wesley, 1969.
__________, "The Art Of Computer Programming: Searching And Sorting", Addison-Wesley, 1973.
A. G. Konheim and B. Weiss, "An Occupancy Discipline and Applications", SIAM Journal Of Applied Mathematics, 14, 6, November 1966, pp. 1266–1274.
R. Melville and D. Gries, "Sorting And Searching Using Controlled Density Arrays", TR 78-362, Cornell University, Ithaca, New York, 1978. (See also IPL, July 1980, pp. 169–172.)
Y. Perl, A. Itai and H. Avni, "Interpolation Search a LogLog N Search", CACM, 21, 1978, pp. 550–553.
E. M. Reingold, J. Nievergelt and N. Deo, "Combinatorial Algorithms: Theory And Practice", Prentice Hall, 1977.
V. Vuillemin, "A Data Structure For Manipulating Priority Queues", CACM, 21, pp. 309–315, 1978.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Itai, A., Konheim, A.G., Rodeh, M. (1981). A sparse table implementation of priority queues. In: Even, S., Kariv, O. (eds) Automata, Languages and Programming. ICALP 1981. Lecture Notes in Computer Science, vol 115. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10843-2_34
Download citation
DOI: https://doi.org/10.1007/3-540-10843-2_34
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10843-6
Online ISBN: 978-3-540-38745-9
eBook Packages: Springer Book Archive