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

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
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, Published 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
2000.
Identifiers
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

Authority records BETA

Andersson, Arne

Search in DiVA

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

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 437 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf