Summary: PREPRINT. Proc. STOC 2000
Tight(er) Worst­case Bounds on Dynamic Searching and
Priority Queues
Arne Andersson
Computing Science Department
Information Technology, Uppsala University
Box 311, SE ­ 751 05 Uppsala, Sweeden
arnea@csd.uu.se
http://www.csd.uu.se/¸arnea
Mikkel Thorup
AT&T Labs---Research
Shannon Laboratory
180 Park Avenue, Florham Park
NJ 07932, USA
mthorup@research.att.edu
ABSTRACT
We introduce a novel technique for converting static poly­
nomial space search structures for ordered sets into fully­
dynamic linear space data structures. Based on this we
present optimal bounds for dynamic integer searching, in­

Source: Andersson, Arne - Department of Information Technology, Uppsala Universitet

Collections: Computer Technologies and Information Sciences