uu.seUppsala University Publications
Change search
ReferencesLink to record
Permanent link

Direct link
Tight(er) Worst-case Bounds on Dynamic Searching and Priority Queues.
Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science.
2000 (English)In: IEEE Symposium on Theory of Computing (STOC), 2000Conference paper (Refereed)
Abstract [en]

We introduce a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structures. Based on this we present optimal bounds for dynamic integer searching, including finger search, and exponentially improved bounds for priority queues.

Place, publisher, year, edition, pages
URN: urn:nbn:se:uu:diva-25793OAI: oai:DiVA.org:uu-25793DiVA: diva2:53567
Available from: 2007-02-13 Created: 2007-02-13

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Andersson, Arne
By organisation
Department of Information TechnologyComputing Science

Search outside of DiVA

GoogleGoogle Scholar
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: 196 hits
ReferencesLink to record
Permanent link

Direct link