Guy E. Blelloch, Bruce M. Maggs, Shah Leung, Maverick Woo  Home/Search
Context Related
| cmu.edu/user/guyb/www/paper...BMW03.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cmu.edu/user/guyb/www/pubs (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We show how to support the finger search operation on degree-balanced search trees in a space-efficient manner that retains a worst-case time bound of O(log d), where d is the difference in rank between successive search targets. While most existing tree-based designs allocate linear extra storage in the nodes (e.g., for side links and parent pointers), our design maintains a compact auxiliary data structure called the "hand" during the lifetime of the tree and imposes no other storage... (Update)
Cited by: More
Compact Data Structures with Fast Queries - Blandford (2005) (Correct)
Data Streams: Algorithms and Applications - Muthukrishnan (2003) (Correct)
Putting Your Dictionary on a Diet - Morin (Correct)
Active bibliography (related documents): More All
1.2: Space-Ecient Finger Search on Degree-Balanced Search Trees - Guy Blelloch Bruce (Correct)
1.2: Space-Efficient Finger Search on Degree-Balanced Search.. - Blelloch, Maggs, Leung, Woo (2003) (Correct)
0.2: Fast Set Operations Using Treaps - Blelloch, Reid-Miller (1998) (Correct)
Similar documents based on text: More All
0.3: Finger Search Trees with Constant Insertion Time - Brodal (1998) (Correct)
0.2: The Hidden Cost of Low Bandwidth Communication - Blelloch, Maggs, Miller (1994) (Correct)
0.2: Tight(er) Worst-case Bounds on Dynamic Searching and Priority.. - Andersson (2000) (Correct)
Related documents from co-citation: More All
3: External memory algorithms and data structures: Dealing with MASSIVE DATA - Vitter - 2000
2: Selection and sorting with limited storage (context) - Munro, Paterson - 1980
2: Chromium: A Stream Processing Framework for Interactive Graphics on Clusters - Humphreys, Houston et al. - 2002
BibTeX entry: (Update)
G. E. Blelloch, B. Maggs, and M. Woo. Space-efficient finger search on degree-balanced search trees. In Proceedings of the 14th Annual ACM/SIAM Symposium on Discrete Algorithms (SODA 2003. http://citeseer.ist.psu.edu/article/blelloch03spaceefficient.html More
@misc{ blelloch03spaceefficient,
author = "G. Blelloch and B. Maggs and M. Woo",
title = "Space-efficient finger search on degree-balanced search trees",
text = "G. E. Blelloch, B. Maggs, and M. Woo. Space-efficient finger search on
degree-balanced search trees. In Proceedings of the 14th Annual ACM/SIAM
Symposium on Discrete Algorithms (SODA 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/article/blelloch03spaceefficient.html" }
Citations (may not include all citations):1450 The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
198 Organization and maintenance of large ordered indexes (context) - Bayer, McCreight - 1972
192 Self-adjusting binary search trees (context) - Sleator, Tarjan - 1985
124 A dichromatic frame- work for balanced trees (context) - Guibas, Sedgewick - 1978
67 A new data structure for representing sorted lists (context) - Huddleston, Mehlhorn - 1982
43 Randomized search trees - Seidel, Aragon - 1996
36 A new representation for linear lists (context) - Guibas, McCreight et al. - 1977
25 Design and analysis of a data structure for representing sor.. (context) - Brown, Tarjan - 1980
24 A fast merging algorithm (context) - Brown, Tarjan - 1979
23 time algorithm for triangulating a simple polygon (context) - Tarjan, Van Wyk et al. - 1998
20 An algo- rithm for the organization of information (context) - Adel'son-Vel'skii, Landis - 1962
16 Localized search in sorted lists (context) - Kosaraju - 1981
14 Prentice Hall PTR (context) - Knuth, Computer et al. - 1997
14 Purely functional repre- sentations of catenable sorted list.. - Kaplan, Tarjan - 1996
9 Finger search trees with constant inser- tion time - Brodal - 1998
8 Technical Report CS- TR (context) - Pugh, list - 1990
4 the dynamic finger conjecture for splay trees part II: The p.. - Cole
3 A Finger search pseudo-code We provide the pseudo-code of th.. (context) - Tsakalidis, localized et al. - 1985
1 The Design of Dynamic Data Stuc - tures (context) - Overmars - 1983
1 Some Fast Algorithms on Craphs and Trees (context) - Booth - 1990
1 An optimal RAM implementation of catenable rain doubled-ende.. (context) - Kosaraju - 1994
1 Data Stuctures and EJficient Algo- rithms (context) - Mehlhorn - 1984
Documents on the same site (http://www-2.cs.cmu.edu/afs/cs.cmu.edu/user/guyb/www/pubs.html): More
Compact Representations of Separable Graphs - Blandford, Blelloch, Kash (2003) (Correct)
A Provably Time-Efficient Parallel Implementation of Full.. - Greiner, Blelloch (1996) (Correct)
Selective Memoization - Acar, Blelloch, Harper (2003) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC