Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goodrich  Home/Search
Context
Related
| poly.edu/~bagchi/bsl.ps 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: poly.edu/~bagchi/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We design a variation of skip lists that performs well for generally biased access sequences. (Update)
Similar documents (at the sentence level):
35.0%: Biased Skip Lists - Bagchi, Buchsbaum, Goodrich (2004) (Correct)
33.3%: Efficient Strategies for Topics in Internet Algorithmics - Bagchi (2002) (Correct)
Active bibliography (related documents): More All
0.3: Biased Skip Lists for Highly Skewed Access Patterns - Funda Ergun Cenk (2001) (Correct)
0.2: Self-adjusting Data Structures for External Memory.. - Ciriani, Ferragina.. (Correct)
0.2: Efficient Techniques for Maintaining Multidimensional Keys.. - Grossi, Italiano (1999) (Correct)
Similar documents based on text: More All
0.5: Cv - Bagchi (Correct)
0.4: Range Searching Over Tree Cross Products - Buchsbaum, Goodrich, Westbrook (2000) (Correct)
0.3: Skip trees, an alternative data structure to Skip lists in a.. - Messeguer (1997) (Correct)
BibTeX entry: (Update)
@misc{ bagchi-biased,
author = "Amitabha Bagchi and Adam L. Buchsbaum and Michael T. Goodrich",
title = "Biased Skip Lists",
url = "citeseer.ist.psu.edu/article/bagchi04biased.html" }
Citations (may not include all citations):249 volume 3: Sorting and Searching (context) - Knuth, of - 1973
192 Self-adjusting binary search trees (context) - Sleator, Tarjan - 1985
192 System design issues for internet middleware services: Deduc.. - Gribble, Brewer - 1997
183 A data structure for dynamic trees (context) - Sleator, Tarjan - 1983
182 Skip lists: A probabilistic alternative to balanced trees - Pugh - 1990
124 A dichromatic framework for balanced trees (context) - Guibas, Sedgewick - 1978
67 A new data structure for representing sorted lists (context) - Huddleston, Mehlhorn - 1982
51 Optimum binary search trees (context) - Knuth - 1971
47 Information Theory and Coding (context) - Abramson - 1963
43 Randomized search trees - Seidel, Aragon - 1996
33 Biased search trees (context) - Bent, Sleator et al. - 1985
24 Proactive caching of DNS records: Addressing a performance b.. - Cohen, Kaplan - 2001
19 Operating Systems: Internals and Design Principles (context) - Stallings - 2001
17 Dynamic ray shooting and shortest paths in planar subdivisio.. - Goodrich, Tamassia - 1997
17 Algorithm design and software libraries: Recent developments.. - Mehlhorn, Naher - 1992
15 Deterministic skip lists (context) - Munro, Papadakis et al. - 1992
11 Dynamization of the trapezoid method for planar point locati.. - Chiang, Tamassia - 1992
10 Evaluation of self-adjusting binary search tree techniques - Bell, Gupta - 1993
6 An algorithm for the organisation of information (context) - Adel'son-Vel'skii, Landis - 1962
6 Two new kinds of biased search trees (context) - Feigenbaum, Tarjan - 1983
6 Biased dictionaries with fast inserts /deletes (context) - Ergun, Sahinalp et al. - 2001
5 Biased skip lists for highly skewed access patterns - Ergun, Sahinalp et al. - 2001
3 Optimal and nearly optimal static weighted skip lists (context) - Martnez, Roura - 1995
Documents on the same site (http://cis.poly.edu/~bagchi/): More
Algorithms for Fault-Tolerant Routing in Circuit.. - Bagchi.. (2002) (Correct)
Efficient Strategies for Topics in Internet Algorithmics - Bagchi (2002) (Correct)
Short Length Menger's Theorem and Reliable Optical Routing - Bagchi, Chaudhary, Kolman (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