Searching rigid data structures

Extended abstract
  • Svante Carlsson
  • Jingsen Chen
Session 8A: Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 959)

Abstract

We study the exact complexity of searching for a given element in a rigid data structure (i.e., an implicit data structure consistent with a fixed family of partial orders). In particular, we show how the ordering information available in the structure facilitates the search operation. Some general lower bounds on the search complexity are presented, which apply to concrete rigid data structures as well. Optimal search algorithms for certain rigid structures are also developed. Moreover, we consider a general problem of searching for a number of elements in a given set. Non-trivial lower bounds are derived and efficient search algorithms are constructed.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    M. Atkinson, J.-R. Sack, N. Santoro, and T. Strothotte. Min-max heaps and generalized priority queues. Commun. ACM, 29:996–1000, 1986.CrossRefGoogle Scholar
  2. 2.
    A. Borodin, L. Guibas, N. Lynch, and A. Yao. Efficient searching using partial ordering. Inf. Process. Lett., 12:71–75, 1981.CrossRefGoogle Scholar
  3. 3.
    M. Brown. Implementation and analysis of binomial queue algorithms. SIAM J. Comput., 7:299–319, 1978.CrossRefGoogle Scholar
  4. 4.
    S. Carlsson. The deap — A double-ended heap to implement double-ended priority queues. Inf. Process. Lett., 26:33–36, 1987.CrossRefGoogle Scholar
  5. 5.
    R. Dilworth. A decomposition theorem for partially ordered sets. Annals of Mathematics, 51:161–166, 1950.Google Scholar
  6. 6.
    D. Knuth. The Art of Computer Programming, Vol. 3: Sorting and Searching. Addison-Wesley, Reading, Massachusetts, 1973.Google Scholar
  7. 7.
    N. Linial and M. Saks. Searching ordered structures. J. Algo., 6:86–103, 1985.CrossRefGoogle Scholar
  8. 8.
    J. Munro and H. Suwanda. Implicit data structures for fast search and update. J. Comput. Syst. Sci., 21:236–250, 1980.CrossRefGoogle Scholar
  9. 9.
    H. Noltemeier. On a generalization of heaps. In Proce. Int. Workshop on Graph-Theoretic Concepts in Comput. Sci., pages 127–136, 1980.Google Scholar
  10. 10.
    J. Vuillemin. A data structure for manipulating priority queues. Commun. ACM, 21:309–314, 1978.CrossRefGoogle Scholar
  11. 11.
    J. Williams. Algorithm 232: Heapsort. Commun. ACM, 7:347–348, 1964.Google Scholar

Copyright information

© Springer-Verlag 1995

Authors and Affiliations

  • Svante Carlsson
    • 1
  • Jingsen Chen
    • 1
  1. 1.Department of Computer ScienceLuleå UniversityLuleåSweden

Personalised recommendations