Change search
ReferencesLink to record
Permanent link

Direct link
Worst case constant time priority queue
Luleå tekniska universitet.
Luleå tekniska universitet.
Department of Computer Science, University of Waterloo, Ontario.
2001 (English)In: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, IEEE Communications Society, 2001, 523-528 p.Conference paper (Refereed)
Abstract [en]

We present a new data structure of size 3M +o(M) bits for solving the "discrete priority queue " problem. When this data structure is used in combination with a new memory topology it provides an O(1) worst case time solution.

Place, publisher, year, edition, pages
IEEE Communications Society, 2001. 523-528 p.
Research subject
Dependable Communication and Computation Systems
URN: urn:nbn:se:ltu:diva-32998ScopusID: 65549083420Local ID: 7b3d05b0-07d8-11dd-97e0-000ea68e967bISBN: 0-89871-490-7OAI: diva2:1006233
Annual ACM-SIAM Symposium on Discrete Algorithms : 07/01/2001 - 09/01/2001
Godkänd; 2001; 20080411 (ysko)Available from: 2016-09-30 Created: 2016-09-30Bibliographically approved

Open Access in DiVA

fulltext(144 kB)2 downloads
File information
File name FULLTEXT01.pdfFile size 144 kBChecksum SHA-512
Type fulltextMimetype application/pdf


Search in DiVA

By author/editor
Brodnik, Andrej

Search outside of DiVA

GoogleGoogle Scholar
Total: 2 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 1 hits
ReferencesLink to record
Permanent link

Direct link