On a generalization of heaps

  • Hartmut Noltemeier
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 100)


The concept of ‘heap’ is generalized with respect to the representation of arbitrary partial orders. Lower complexity bounds for find-operations as well as delete — insert — operations in generalized heaps are given. Some special partial orders are analysed.


Partial Order Search Structure Complete Binary Tree Chain Partition Finite Directed Graph 
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.

Unable to display preview. Download preview PDF.


  1. [1]
    Aho, A.V., J.E. Hopcroft and J.D. Ullman: "The design and analysis of computer algorithms", Addision-Wesley, Reading 1976.Google Scholar
  2. [2]
    Blum, M.: "A machine independent theory of the complexity of recursive functions", JACM, 14, 1967.Google Scholar
  3. [3]
    Jacobs, K.: Selecta Mathematica I, Springer, Heidelberg, 1969.Google Scholar
  4. [4]
    Munro, J.J. and H. Suwanda: "Implicit Data Structures", Proc. 11th Annual ACM STOC, Atlanta 1979.Google Scholar
  5. [5]
    Noltemeier, H.: "Dilworth's theorem and lower complexity bounds in implicit data structures", Proc. V. Symposium on Oper. Research, Cologne 1980.Google Scholar
  6. [6]
    Paul, W.: Komplexitätstheorie; Teubner, Stuttgart 1978.Google Scholar
  7. [7]
    Snyder, L.: "On Uniquely Represented Data Structure", Proc. 18th IEEE Symp. on FOCS, 1977.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Hartmut Noltemeier
    • 1
  1. 1.Lehrstuhl für Informatik III, RWTH AachenAachen

Personalised recommendations