Back to Results
First PageMeta Content
Computer programming / Tango tree / Splay tree / Binary search tree / B-tree / T-tree / Rope / Tree / R-tree / Binary trees / Graph theory / Data management


Open Document

Share Result on Facebook

City

Washington / D.C. / Rome / Miami / Buenos Aires / Cambridge / /

Company

SIAM Journal / MIT Press / Artificial Intelligence Laboratory / /

Country

Italy / Argentina / United States / /

/

Event

Diplomatic Relations / /

Facility

MetroTech Center / Polytechnic University / /

IndustryTerm

search trees / access algorithm / search path / binary search trees / search cost / online binary search tree / static perfect binary search tree / Optimum binary search trees / binary search tree / search algorithm / /

Organization

MetroTech Center / Polytechnic University / National Science Foundation / Department of Computer and Information Science / MIT / Society for Industrial and Applied Mathematics / /

Person

Jonathan Derryberry / JOHN IACONO / Clifford Stein / Shuchi Chawla / Jeanette Schmidt / Avrim Blum / Robert Wilber / Adam Kalai / Michael L. Fredman / Chris Wang / Ronald L. Rivest / Chengwen Chris Wang / DION HARMON / Richard Cole / Donald E. Knuth / Stefan Langerman / Martin Farach-Colton / Bud Mishra / Daniel D. Sleator / Charles E. Leiserson / Thomas H. Cormen / Alan Siegel / Daniel Dominic Sleator / Haripriyan Hampapuram / ERIK D. DEMAINE / Robert Endre Tarjan / /

ProvinceOrState

Florida / Massachusetts / /

PublishedMedium

SIAM Journal on Computing / Journal of the ACM / Lecture Notes in Computer Science / /

Technology

RAM / search algorithm / BST access algorithm / Tango Algorithm / access algorithm / specific BST access algorithm / arbitrary BST access algorithm / /

URL

http /

SocialTag