Advertisement

A sparse table implementation of priority queues

  • Alon Itai
  • Alan G. Konheim
  • Michael Rodeh
Session 13: A. Salomaa, Chairman
Part of the Lecture Notes in Computer Science book series (LNCS, volume 115)

Keywords

Hash Table Binary Search Priority Queue Table State Implicit Representation 
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

  1. [AHU]
    A. V. Aho, J. E. Hopcroft and J. D. Ullman, "The Design And Analysis Of Computer Algorithms", Addison-Wesley, 1974.Google Scholar
  2. [BDGS]
    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.Google Scholar
  3. [BT]
    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.Google Scholar
  4. [BY]
    J. L. Bently and A. C. Yao, "An Almost Optimal Algorithm For Searching", Information Processing Letters, 5, 3, 1976, pp. 82–87.Google Scholar
  5. [Fe]
    W. Feller, "An Introduction To Probability Theory And Its Applications", Volume 1, John Wiley, 1950.Google Scholar
  6. [Fr]
    W. R. Franklin, "Padded Lists: Set Operations In Expected O(log log N) Time", Information Processing Letters, 9, 4, November 1979, pp. 161–166.Google Scholar
  7. [GMPR]
    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.Google Scholar
  8. [IKR]
    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.Google Scholar
  9. [KN1]
    D. E. Knuth, "The Art Of Computer Programming: Fundmanetal Algorithms", Addison-Wesley, 1969.Google Scholar
  10. [KN2]
    __________, "The Art Of Computer Programming: Searching And Sorting", Addison-Wesley, 1973.Google Scholar
  11. [KW]
    A. G. Konheim and B. Weiss, "An Occupancy Discipline and Applications", SIAM Journal Of Applied Mathematics, 14, 6, November 1966, pp. 1266–1274.Google Scholar
  12. [MG]
    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.)Google Scholar
  13. [PIA]
    Y. Perl, A. Itai and H. Avni, "Interpolation Search a LogLog N Search", CACM, 21, 1978, pp. 550–553.Google Scholar
  14. [RND]
    E. M. Reingold, J. Nievergelt and N. Deo, "Combinatorial Algorithms: Theory And Practice", Prentice Hall, 1977.Google Scholar
  15. [V]
    V. Vuillemin, "A Data Structure For Manipulating Priority Queues", CACM, 21, pp. 309–315, 1978.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Alon Itai
    • 1
  • Alan G. Konheim
    • 2
  • Michael Rodeh
    • 3
  1. 1.Computer Science DepartmentTechnion — Israel Institute of TechnologyHaifaIsrael
  2. 2.Mathematical Sciences DepartmentIBM Thomas J. Watson Research CenterIsrael
  3. 3.IBM Research, San Jose LaboratoryOn sabbatical from IBM Israel Scientific CenterTechnion City, HaifaIsrael

Personalised recommendations