Searching rigid data structures
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.
Unable to display preview. Download preview PDF.
- 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
- 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
- 11.J. Williams. Algorithm 232: Heapsort. Commun. ACM, 7:347–348, 1964.Google Scholar