Skip to main content
SpringerLink
Log in

Searching rigid data structures

Extended abstract

  • Session 8A: Algorithms
  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 959))

Included in the following conference series:

  • 147 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Atkinson, J.-R. Sack, N. Santoro, and T. Strothotte. Min-max heaps and generalized priority queues. Commun. ACM, 29:996–1000, 1986.

    Article  Google Scholar 

  2. A. Borodin, L. Guibas, N. Lynch, and A. Yao. Efficient searching using partial ordering. Inf. Process. Lett., 12:71–75, 1981.

    Article  Google Scholar 

  3. M. Brown. Implementation and analysis of binomial queue algorithms. SIAM J. Comput., 7:299–319, 1978.

    Article  Google Scholar 

  4. S. Carlsson. The deap — A double-ended heap to implement double-ended priority queues. Inf. Process. Lett., 26:33–36, 1987.

    Article  Google Scholar 

  5. R. Dilworth. A decomposition theorem for partially ordered sets. Annals of Mathematics, 51:161–166, 1950.

    Google Scholar 

  6. D. Knuth. The Art of Computer Programming, Vol. 3: Sorting and Searching. Addison-Wesley, Reading, Massachusetts, 1973.

    Google Scholar 

  7. N. Linial and M. Saks. Searching ordered structures. J. Algo., 6:86–103, 1985.

    Article  Google Scholar 

  8. J. Munro and H. Suwanda. Implicit data structures for fast search and update. J. Comput. Syst. Sci., 21:236–250, 1980.

    Article  Google Scholar 

  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. J. Vuillemin. A data structure for manipulating priority queues. Commun. ACM, 21:309–314, 1978.

    Article  Google Scholar 

  11. J. Williams. Algorithm 232: Heapsort. Commun. ACM, 7:347–348, 1964.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Luleå University, S-971 87, Luleå, Sweden

    Svante Carlsson & Jingsen Chen

Authors
  1. Svante Carlsson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jingsen Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ding-Zhu Du Ming Li

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Carlsson, S., Chen, J. (1995). Searching rigid data structures. In: Du, DZ., Li, M. (eds) Computing and Combinatorics. COCOON 1995. Lecture Notes in Computer Science, vol 959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030864

Download citation

  • DOI: https://doi.org/10.1007/BFb0030864

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60216-3

  • Online ISBN: 978-3-540-44733-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation