Back to Results
First PageMeta Content
AVL tree / Computer programming / Computing / Link/cut tree / Tango tree / Binary trees / Splay tree / Binary search tree


Document Date: 2009-12-08 09:41:33

Open Document

File Size: 145,04 KB

Share Result on Facebook

City

Dortmund / /

Country

Germany / /

/

Facility

Courant Institute / University of Bonn / G. Port / C library / /

IndustryTerm

randomized splaying algorithms / elegant solution / binary search trees / expected search time / optimum static search tree / search tree / randomized restructuring algorithm / binary search tree / search time / /

Organization

Max-Planck-Institut f¨ / Department of Computer Science / Courant Institute / NYU / University of Bonn / /

Person

Susanne Albers∗ Marek Karpinski / Marek Karpinski† Abstract Splay / Daniel Sleator / /

PublishedMedium

Journal of the ACM / Communications of the ACM / Theory of Computing / /

Technology

randomized algorithm / following algorithm / randomized restructuring algorithm / On-Line Algorithms / randomized splaying algorithms / Randomized algorithms / /

SocialTag