Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

66

Voted

STOC
2002
ACM

103views Algorithms» more STOC 2002»

Optimal finger search trees in the pointer machine

16 years 2 months ago

Optimal finger search trees in the pointer machine

Download www.cs.au.dk

Gerth Stølting Brodal, George Lagogiannis,

Real-time Traffic

Algorithms | Optimal Finger Search | STOC 2002 |

claim paper

Related Content

» Finger Search Trees with Constant Insertion Time

» Improved Bounds for Finger Search on a RAM

» Topological Rearrangements and Local Search Method for Tandem Duplication Trees

» A Mathematical Cache Miss Analysis for Pointer Data Structures

» Randomized Search Trees

» An Optimal Minimum Spanning Tree Algorithm

» An Optimal Dynamic Data Structure for StabbingSemigroup Queries

» Head Automata and Bilingual Tiling Translation with Minimal Representations

» Cache Conscious Indexing for DecisionSupport in Main Memory

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2002
Where	STOC
Authors	Gerth Stølting Brodal, George Lagogiannis, Christos Makris, Athanasios K. Tsakalidis, Kostas Tsichlas

Comments (0)