Fast Meldable Priority Queues

We present priority queues that support the operations Find-Min, Insert, MakeQueue and Meld in worst case time O(1) and Delete and DeleteMin in worst case time O(log n). They can be implemented on the pointer machine and require linear space. The time bounds are optimal for all implementations where Meld takes worst case time o(n).

[1]  Michael J. Fischer,et al.  Fishspear: a priority queue algorithm , 1994, JACM.

[2]  Rajeev Raman,et al.  A Constant Update Time Finger Search Tree , 1990, Inf. Process. Lett..

[3]  David A. Basin,et al.  Hardware Verification using Monadic Second-Order Logic , 1995, CAV.

[4]  Leonidas J. Guibas,et al.  A new representation for linear lists , 1977, STOC '77.

[5]  A. Ingólfsdóttir.  A Semantic Theory for Value–Passing Processes Late Approach Part I: A Denotational Model and Its Complete Axiomatization , 1995 .

[6]  Nicola Santoro,et al.  Min-max heaps and generalized priority queues , 1986, CACM.

[7]  Jean Vuillemin,et al.  A data structure for manipulating priority queues , 1978, CACM.

[8]  Peter Bro Miltersen,et al.  Dynamic Algorithms for the Dyck Languages , 1995, WADS.

[9]  Gerth Stølting Brodal.  Fast Meldable Priority Queues , 1995 .

[10]  Peter Høyer,et al.  A general technique for implementation of efficient priority queues , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.

[11]  Igor Walukiewicz.  A Complete Deductive System for the-Calculus , 1995, LICS 1995.

[12]  Robert E. Tarjan,et al.  Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation , 1988, CACM.

[13]  Lars R. Knudsen.  Partial and Higher Order Differentials and Applications to the DES , 1995 .

[14]  L FredmanMichael,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1987 .

[15]  Kim G. Larsen,et al.  From Timed Automata to Logic - and Back , 1995, MFCS.

[16]  J. Ian Munro,et al.  An Implicit Binomial Queue with Constant Insertion Time , 1988, SWAT.

[17]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[18]  Alberto Apostolico,et al.  An Optimal O(log log N)-Time Parallel Algorithm for Detecting All Squares in a String , 1996, SIAM J. Comput..

[19]  R. Tarjan.  Amortized Computational Complexity , 1985 .

[20]  L. Aceto,et al.  A Complete Equational Axiomatization for Prefix Iteration with Silent Steps , 1995 .

[21]  Rajeev Raman,et al.  A Constant Update Time Finger Search Tree , 1990, ICCI.

[22]  Friedhelm Meyer auf der Heide,et al.  Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine , 1997, Inf. Process. Lett..