Fast Meldable Priority Queues release_dxsmuwetabfvfebajaisjcfply

by Gerth Stølting Brodal

Published in BRICS Report Series by Aarhus University Library.

1995   Issue 12

Abstract

We present priority queues that support the operations MakeQueue,<br />FindMin, Insert and Meld in worst case time O(1) and Delete and<br />DeleteMin in worst case time O(log n). They can be implemented on the<br />pointer machine and require linear space. The time bounds are optimal for<br />all implementations where Meld takes worst case time o(n).<br />To our knowledge this is the first priority queue implementation that<br />supports Meld in worst case constant time and DeleteMin in logarithmic<br />time.
In application/xml+jats format

Archived Files and Locations

application/pdf  205.1 kB
file_x5hkiilitra7bcypa5enruxnmq
www.cs.au.dk (web)
web.archive.org (webarchive)
application/pdf  174.0 kB
file_24k6gsqk7bbolmztnbytwy3i4u
web.archive.org (webarchive)
www.cs.au.dk (web)
application/pdf  344.3 kB
file_7m3gule4m5ex5ay23u52uucsii
web.archive.org (webarchive)
tidsskrift.dk (web)
www.brics.dk (web)
core.ac.uk (web)
web.archive.org (webarchive)
+ 1 more URLs
Read Archived PDF
Preserved and Accessible
Type  article-journal
Stage   published
Date   1995-01-12
Container Metadata
Not in DOAJ
Not in Keepers Registry
ISSN-L:  0909-0878
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 99cba99f-7423-448e-88db-86360fd1cd46
API URL: JSON