## Fast meldable priority queues (1995)

### Cached

### Download Links

- [www.brics.dk]
- [www.brics.dk]
- [www.brics.dk]
- [www.brics.dk]
- [www.daimi.au.dk]
- DBLP

### Other Repositories/Bibliography

Venue: | Pages 282--290 of: Workshop on Algorithms and Data Structures. LNCS |

Citations: | 11 - 2 self |

### BibTeX

@INPROCEEDINGS{Brodal95fastmeldable,

author = {Gerth Stølting Brodal and Gerth Stølting Brodal},

title = {Fast meldable priority queues},

booktitle = {Pages 282--290 of: Workshop on Algorithms and Data Structures. LNCS},

year = {1995},

publisher = {Springer-Verlag}

}

### Years of Citing Articles

### OpenURL

### Abstract

is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent publications in the BRICS Report Series. Copies may be obtained by contacting: BRICS

### Citations

148 |
Algorithm 232: Heapsort
- Williams
- 1964
(Show Context)
Citation Context ...it is known where e is stored in Q (priority queues do not support the searching for an element). The implementation of priority queues is a classical problem in data structures. A few references are =-=[14, 13, 8, 7, 5, 6, 10]-=-. ? This work was partially supported by the ESPRIT II Basic Research Actions Program of the EC under contract no. 7141 (project ALCOM II) and by the Danish Natural Science Research Council (Grant No.... |

86 | A data structure for manipulating priority queues
- Vuillemin
- 1978
(Show Context)
Citation Context ...it is known where e is stored in Q (priority queues do not support the searching for an element). The implementation of priority queues is a classical problem in data structures. A few references are =-=[14, 13, 8, 7, 5, 6, 10]-=-. ? This work was partially supported by the ESPRIT II Basic Research Actions Program of the EC under contract no. 7141 (project ALCOM II) and by the Danish Natural Science Research Council (Grant No.... |

73 |
Relaxed heaps: An alternative to Fibonacci heaps with applications to parallel computation
- Driscoll, Gabow, et al.
- 1988
(Show Context)
Citation Context ...it is known where e is stored in Q (priority queues do not support the searching for an element). The implementation of priority queues is a classical problem in data structures. A few references are =-=[14, 13, 8, 7, 5, 6, 10]-=-. ? This work was partially supported by the ESPRIT II Basic Research Actions Program of the EC under contract no. 7141 (project ALCOM II) and by the Danish Natural Science Research Council (Grant No.... |

57 |
A new representation for linear lists
- Guibas, McCreight, et al.
- 1977
(Show Context)
Citation Context ...exponential in the rank. The last two properties are essential to achieve Meld in worst case constant time. The regularity constraint c) is a variation of the regularity constraint that Guibas et al. =-=[9]-=- used in their construction of finger search trees. The idea is that between two ranks where three sons have equal rank there is a rank of which there only is one son. Figure 1 shows a heap ordered tr... |

48 |
The pairing heap: A new form of self-adjusting heap
- Fredman, Sedgewick, et al.
- 1986
(Show Context)
Citation Context |

35 |
FREDMAN AND ROBERT ENDRE TARJAN: Fibonacci heaps and their uses in improved network optimization algorithms
- MICHAEL
- 1987
(Show Context)
Citation Context |

29 |
P.V.: An implicit binomial queue with constant insertion time
- Carlsson, Munro, et al.
- 1988
(Show Context)
Citation Context ...nstant time. If we want to perform Insert in worst case constant time a few efficient data structures exist. The priority queue of van Leeuwen [12], the implicit priority queues of Carlsson and Munro =-=[2]-=- and the relaxed heaps of Driscoll et al. [5], but neither of these support Meld efficiently. However the last two do support MakeQueue, FindMin and Insert in worst case constant time and Delete and D... |

21 |
T.: Min-max heaps and generalized priority queues
- Atkinson, Santoro, et al.
- 1986
(Show Context)
Citation Context ...t time. As a simple consequence of our construction we get a new implementation of meldable double ended priority queues, which is a data type that allows both FindMin/FindMax and DeleteMin/DeleteMax =-=[1, 4]-=-. For each queue we just have to maintain two heap ordered trees as described in section 1. One tree ordered with respect to minimum and the other with respect to maximum. If we let both trees contain... |

17 |
R.: A constant update time finger search tree
- Dietz, Raman
- 1994
(Show Context)
Citation Context ...ementations where Meld takes sublinear time. If Meld is allowed to take linear time it is possible to support DeleteMin in worst case constant time by using the finger search trees of Dietz and Raman =-=[3]-=-. By using their data structure MakeQueue, FindMin, DeleteMin, Delete can be supported in worst case time O(1), Insert in worst case time O(log n) and Meld in worst case time O(n). Theorem 4. If Meld ... |

15 |
Endre Tarjan. Amortized computational complexity
- Robert
- 1985
(Show Context)
Citation Context ...ect ALCOM II) and by the Danish Natural Science Research Council (Grant No. 9400044). ?? Basic Research in Computer Science, Centre of the Danish National Research Foundation. In the amortised sense, =-=[11]-=-, the best performance is achieved by binomial heaps [13]. They support Delete and DeleteMin in amortised time O(log n) and all other operations in amortised constant time. If we want to perform Inser... |

13 | A Complete Deductive System for the µ-Calculus - Walukiewicz - 1993 |

11 | Fishspear: A priority queue algorithm
- Fischer, Paterson
- 1994
(Show Context)
Citation Context |

11 | An Optimal O(log log n) Time Parallel Algorithm for Detecting all Squares in a String - Apostolico, Breslauer - 1995 |

11 | A semantic theory for value-passing processes, late appraoch—Parts - Ingolfsdottir - 1995 |

9 | A general technique for implementation of efficient priority queues - Høyer - 1995 |

8 | A complete equational axiomatization for prefix iteration with silent steps - Aceto, Ingólfsdóttir - 1995 |

7 | Type inference of Turbo Pascal - Hougaard, Schwartzbach, et al. - 1995 |

5 | Transforming comparison model lower bounds to the parallel-random-accessmachine - Breslauer, Czumaj, et al. - 1997 |

4 |
A general technique for implementation of efficient priority queues
- Hyer
- 1995
(Show Context)
Citation Context |

4 | Basin and Nils Klarlund. Hardware Verification using Monadic Second-Order Logic - David - 1995 |

4 | From Timed Automata to Logic - Back - 1995 |

3 |
The relaxed min-max heap
- Ding, Weiss
- 1993
(Show Context)
Citation Context ...t time. As a simple consequence of our construction we get a new implementation of meldable double ended priority queues, which is a data type that allows both FindMin/FindMax and DeleteMin/DeleteMax =-=[1, 4]-=-. For each queue we just have to maintain two heap ordered trees as described in section 1. One tree ordered with respect to minimum and the other with respect to maximum. If we let both trees contain... |

2 |
The composition of fast priority queues
- Leeuwen
- 1978
(Show Context)
Citation Context ...ed time O(log n) and all other operations in amortised constant time. If we want to perform Insert in worst case constant time a few efficient data structures exist. The priority queue of van Leeuwen =-=[12]-=-, the implicit priority queues of Carlsson and Munro [2] and the relaxed heaps of Driscoll et al. [5], but neither of these support Meld efficiently. However the last two do support MakeQueue, FindMin... |

2 | A new representation for linear lists - Roberts - 1977 |

1 | 4] Yuzheng Ding and Mark Allen Weiss. The relaxed min-max heap - Verlag, Berlin - 1990 |