Back to Results
First PageMeta Content
Theoretical computer science / Computing / Splay tree / Binary search tree / Heap / Amortized analysis / Potential method / B-tree / Binary search algorithm / Binary trees / Analysis of algorithms / Graph theory


A Unified Access Bound on Comparison-Based Dynamic Dictionaries 1 Mihai B˘adoiu MIT Computer Science and Artificial Intelligence Laboratory, 32 Vassar Street, Cambridge, MA 02139, USA
Add to Reading List

Document Date: 2007-12-27 15:24:32


Open Document

File Size: 230,94 KB

Share Result on Facebook

City

Cambridge / Brooklyn / New York / /

Company

Artificial Intelligence Laboratory / /

Country

United States / /

/

Facility

MetroTech Center / Courant Institute of Mathematical Sciences / Polytechnic University / New York University / /

IndustryTerm

search sequences / search operation / finger search tree structure supporting insertions / search trees / comparison-based search structure / binary search trees / finger search tree changes / balanced search tree structure supporting insertions / comparison-based search structures / rotation-based binary search tree / search tree / binary search tree / finger search tree / /

Organization

MetroTech Center / New York University / Polytechnic University / National Science Foundation / Department of Computer and Information Science / MIT / Courant Institute of Mathematical Sciences / Computer Science Department / /

Person

John Iacono / Richard Cole / Erik D. Demaine / /

ProvinceOrState

New York / Massachusetts / /

SocialTag