Abstract
In this paper we study the time-space complexity of implicit priority queues supporting the decreasekey operation. Our first result is that by using one extra word of storage it is possible to match the performance of Fibonacci heaps: constant amortized time for insert and decreasekey and logarithmic time for deletemin. Our second result is a lower bound showing that that one extra word really is necessary. We reduce the decreasekey operation to a cell-probe type game called the Usher’s Problem, where one must maintain a simple data structure without the aid of any auxiliary storage.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
Andersson, A., Hagerup, T., Hastad, J., Petersson, O.: Tight bounds for searching a sorted array of strings. SIAM J. Comput. 30(5), 1552–1578 (2000)
Blum, M., Floyd, R.W., Pratt, V., Rivest, R.L., Tarjan, R.E.: Time bounds for selection. J. Comput. Syst. Sci. 7(4), 448–461 (1973)
Brodnik, A., Carlsson, S., Demaine, E., Munro, J.I., Sedgewick, R.: Resizable arrays in optimal time and space. In: WADS, p. 37 (1999)
Brodnik, A., Munro, J.I.: Membership in constant time and almost-minimum space. SIAM J. Comput. 28(5), 1627–1640 (1999)
Carlsson, S., Munro, J.I., Poblete, P.V.: An implicit binomial queue with constant insertion time. In: SWAT, pp. 1–13 (1988)
Driscoll, J.R., Gabow, H.N., Shrairman, R., Tarjan, R.E.: Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation. Comm. ACM 31(11), 1343–1354 (1988)
Fiat, A., Naor, M.: Implicit O(1) probe search. SIAM J. Comput. 22(1), 1–10 (1993)
Fiat, A., Naor, M., Schmidt, J.P., Siegel, A.: Nonoblivious hashing. J. ACM 39(4), 764–782 (1992)
Franceschini, G., Grossi, R.: Optimal worst-case operations for implicit cache-oblivious search trees. In: Proc. 8th WADS (2003)
Franceschini, G., Grossi, R.: No sorting? better searching! In: Proc. 45th IEEE Symp. on Foundations of Computer Science (FOCS), pp. 491–498 (2004)
Fredman, M.L.: On the efficiency of pairing heaps and related data structures. J. ACM 46(4), 473–501 (1999)
Fredman, M.L., Sedgewick, R., Sleator, D.D., Tarjan, R.E.: The pairing heap: a new form of self-adjusting heap. Algorithmica 1(1), 111–129 (1986)
Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34(3), 596–615 (1987)
Hagerup, T., Raman, R.: An efficient quasidictionary. In: Penttonen, M., Schmidt, E.M. (eds.) SWAT 2002. LNCS, vol. 2368, p. 1. Springer, Heidelberg (2002)
Harvey, N.J.A., Zatloukal, K.: The post-order heap. In: Proc. FUN (2004)
Iacono, J.: Improved upper bounds for pairing heaps. In: Halldórsson, M.M. (ed.) SWAT 2000. LNCS, vol. 1851, pp. 32–43. Springer, Heidelberg (2000)
Johnson, D.B.: Priority queues with update and finding minimum spanning trees. Info. Proc. Lett. 4(3), 53–57 (1975)
Kaplan, H., Tarjan, R.E.: New heap data structures. Technical Report TR-597-99, Computer Science Dept., Princeton University (March 1999)
Mortensen, C.W., Pettie, S.: The complexity of implicit and space-efficient priority queues. Manuscript (2005), http://www.mpi-sb.mpg.de/~pettie/
Munro, J.I.: An implicit data structure supporting insertion, deletion, and search in \(O({\rm log}\sp 2\, n)\) time. J. Comput. Syst. Sci. 33(1), 66–74 (1986)
Munro, J.I., Suwanda, H.: Implicit data structures for fast search and update. J. Comput. Syst. Sci. 21(2), 236–250 (1980)
Pagh, R.: Low redundancy in static dictionaries with constant query time. SIAM J. Comput. 31(2), 353–363 (2001)
Raman, R., Raman, V., Rao, S.S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: SODA, pp. 233–242 (2002)
Raman, R., Rao, S.S.: Succinct dynamic dictionaries and trees. In: Proc. 30th Int’l Colloq. on Automata, Languages and Programming (2003)
Takaoka, T.: Theory of 2–3 heaps. Discrete Appl. Math. 126(1), 115–128 (2003)
Williams, J.W.J.: Algorithm 232 (heapsort). Comm. ACM 7, 347–348 (1964)
Yao, A.C.C.: Should tables be sorted? J. ACM 28(3), 615–628 (1981)
Zuckerman, D.: Computing Efficiently Using General Weak Random Sources. Ph.D. Thesis, The University of California at Berkeley (August 1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mortensen, C.W., Pettie, S. (2005). The Complexity of Implicit and Space Efficient Priority Queues. In: Dehne, F., López-Ortiz, A., Sack, JR. (eds) Algorithms and Data Structures. WADS 2005. Lecture Notes in Computer Science, vol 3608. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11534273_6
Download citation
DOI: https://doi.org/10.1007/11534273_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28101-6
Online ISBN: 978-3-540-31711-1
eBook Packages: Computer ScienceComputer Science (R0)