Raimund Seidel  Home/Search
Context Related
| tcs.cs.unisb.de/papers/rst.ps.gz 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: tcs.cs.unisb.de/index.en (more) (Enter author homepages) |
Rate this article:      (best)View Comments (0) |
Abstract: We present a randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior. In particular, in the expected case a search or an update takes logarithmic time, with the update requiring fewer than two rotations. Moreover, the update time remains logarithmic, even if the cost of a rotation is taken to be proportional to the size of the rotated subtree. Finger searches and splits and joins can be performed in optimal expected time also. We... (Update)
Cited by: More
Loops in Reeb Graphs of 2-Manifolds - Kree Cole-Mclaughlin Herbert (2004) (Correct)
Adaptive Memoization - Umut Acar Guy (Correct)
Space-Ecient Finger Search on Degree-Balanced Search Trees - Guy Blelloch Bruce (Correct)
Active bibliography (related documents): More All
0.6: Output-Sensitive Methods for Rectilinear Hidden Surface.. - Goodrich, Atallah.. (1993) (Correct)
0.5: Rotation Distance, Triangulations of Planar Surfaces and.. - Jin-Yi Cai Department (1994) (Correct)
0.5: Confluently Persistent Deques via Data-Structural Bootstrapping - Buchsbaum, Tarjan (1993) (Correct)
Similar documents based on text: More All
0.0: A Search Algorithm for Table Entries with Non-contiguous.. - Tsuchiya (1991) (Correct)
0.0: How Good are Convex Hull Algorithms? - Avis, Bremner, Seidel (1997) (Correct)
0.0: The K-band Hubble diagram for the brightest cluster.. - Alfonso.. (Correct)
Related documents from co-citation: More All
20: Skip Lists: a Probabilistic Alternative to Balanced Trees - Pugh - 1990
18: A Dichromatic Framework for Balanced Trees (context) - Guibas, Sedgewick - 1978
17: Self-adjusting binary search trees (context) - Sleator, Tarjan - 1985
BibTeX entry: (Update)
Raimund Seidel and Cecilia R. Aragon. Randomized search trees. Algorithmica 16 (1996), 464-497. http://citeseer.ist.psu.edu/seidel96randomized.html More
@article{ seidel96randomized,
author = "Raimund Seidel and Cecilia R. Aragon",
title = "Randomized Search Trees",
journal = "Algorithmica",
volume = "16",
number = "4/5",
pages = "464-497",
year = "1996",
url = "citeseer.ist.psu.edu/seidel96randomized.html" }
Citations (may not include all citations):198 Organization and maintenance of large ordered indices (context) - Bayer, McCreight - 1972
192 Self-adjusting binary search trees (context) - Sleator, Tarjan - 1985
186 Computational Geometry: An Introduction through Randomized A.. (context) - Mulmuley - 1994
182 Skip Lists: A Probabilistic Alternative to Balanced Trees - Pugh - 1990
124 A dichromatic framework for balanced trees (context) - Guibas, Sedgewick - 1978
106 Priority search trees (context) - McCreight - 1985
68 Incremental Computation via Function Caching (context) - Pugh, Teitelbaum - 1989
63 An algorithm for the organization of information (context) - Adel'son-Velskii, Landis - 1962
60 Multi-dimensional Searching and Computational Geometry (context) - Mehlhorn - 1984
51 Four results on randomized incremental construction - Clarkson, Mehlhorn et al. - 1993
49 A guided tour of Chernoff bounds (context) - Hagerup, Rub - 1989
42 A note on the height of binary search trees (context) - Devroye - 1986
42 Fast Multiple Precision Evaluation of Elementary Functions (context) - Brent - 1976
34 Max-PlanckInstitut fur Informatik (context) - Naher, Manual et al. - 1993
33 Binary search trees of bounded balance (context) - Nievergelt, Reingold - 1973
33 Biased search trees (context) - Bent, Sleator et al. - 1985
32 A Unifying Look at Data Structures (context) - Vuillemin - 1980
29 Dynamic point location in general subdivision (context) - Baumgarten, Jung et al. - 1992
23 Sorting and Searching (context) - Mehlhorn - 1984
17 Sorting Jordan sequences in linear time using level linked s.. (context) - Hoffman, Mehlhorn et al. - 1986
17 Algorithm Design and Software Libraries: Recent Developments.. - Mehlhorn, Naher - 1992
5 Faster uniquely represented dictionaries - Andersson, Ottmann - 1991
5 A Storage Scheme for Height-Balanced Trees (context) - Brown, to - 1979
3 private communication (context) - Mehlhorn
3 private communication (context) - Mehlhorn, Raman
2 private communication (context) - Sleator
2 private communication (context) - Tarjan
1 private communication (context) - Dietzfelbinger
1 th ACM-SIAM Symp (context) - Galperin, Rivest et al. - 1993
1 atorial and Geometric Computing. To appear in Commun (context) - Mehlhorn, Naher et al. - 1995
1 Randomly balanced search trees (context) - Bent, Driscoll - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www-tcs.cs.uni-sb.de/index.en.html): More
A Simple and Fast Incremental Randomized Algorithm for Computing.. - Seidel (1991) (Correct)
On the Exact Worst Case Query Complexity of Planar Point.. - Udo Adamy, Raimund Seidel (1998) (Correct)
How Good are Convex Hull Algorithms? - Avis, Bremner, Seidel (1997) (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