Back to Results
First PageMeta Content
Computer programming / Computing / Binary search tree / Self-balancing binary search tree / Binary search algorithm / Heap / Tree rotation / Tango tree / Scapegoat tree / Binary trees / Splay tree / Data management


Key Independent Optimality John Iacono∗ Abstract A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, keyindependent optimality, is motivated by applications that as
Add to Reading List

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

Open Document

File Size: 67,90 KB

Share Result on Facebook

Company

SIAM J. Comp. / /

Country

United States / /

Facility

The State University of New Jersey / /

IndustryTerm

binary search tree data structure / offline binary search tree algorithm / static balanced binary search tree / Optimum binary search trees / binary search tree structure / search trees / search path / binary search tree / search path moves / binary search trees / binary search structure / empty non-balanced binary search tree / binary search tree storing / /

Organization

MetroTech Center / Rutgers / Graduate School / State University of New Jersey / National Science Foundation / Department of Computer / /

Position

Prime Minister / Theorem Pm / /

ProvinceOrState

New Jersey / New Brunswick / /

PublishedMedium

Theory of Computing / /

Technology

offline binary search tree algorithm / /

URL

http /

SocialTag