The Complexity of Implicit and Space Efficient Priority Queues

  • Christian W. Mortensen
  • Seth Pettie
Conference paper

DOI: 10.1007/11534273_6

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3608)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Christian W. Mortensen
    • 1
  • Seth Pettie
    • 2
  1. 1.IT University of Copenhagen 
  2. 2.Max Planck Institut für Informatik 

Personalised recommendations