Back to Results
First PageMeta Content
Mathematics / Splay tree / AVL tree / Binary search tree / Self-balancing binary search tree / Red–black tree / Pointer / B-tree / Linked list / Binary trees / Graph theory / Computing


Alternatives to splay trees with O(log n) worst-case access times John Iacono* [removed]
Add to Reading List

Document Date: 2002-09-16 17:06:32

Open Document

File Size: 578,81 KB

Share Result on Facebook

City

Reading / /

Company

SIAM Journal / Bayer / /

/

Facility

Computer Hill Center University / New York University / /

IndustryTerm

computer-search trees / search set / Optimum binary search trees / search tree / search ends / search trees / search pointer / self adjusting search tree / binary search tree / search sets / order search set / binary search trees / basic insertion algorithm / /

Organization

Rutgers / New York University / National Science Foundation / Computer Hill Center University / /

Person

John Iacono / /

Product

Cowon D2+ Portable Audio Device / /

ProvinceOrState

Massachusetts / /

PublishedMedium

Theory of Computing / /

Technology

basic insertion algorithm / Computer Algorithms / /

SocialTag