Seonghun Cho and Sartaj Sahni Department of Computer and Information Science...  Home/Search
Context
Related
| ufl.edu/pub/techrepor...tr96001.ps.gz ufl.edu/cis/techreports/...tr96001.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: ufl.edu (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We develop a new class of weight balanced binary search trees called fi-balanced binary search trees (fi-BBSTs). fi-BBSTs are designed to have reduced internal path length. As a result, they are expected to exhibit good search time characteristics. Individual search, insert, and delete operations in an n node fi-BBST take O(log n) time for 0 ! fi p 2 \Gamma 1. Experimental results comparing the performance of fi-BBSTs, WB(ff) trees, AVL-trees, red/black trees, treaps, deterministic skip... (Update)
Similar documents (at the sentence level):
35.6%: A New Weight Balanced Binary Search Tree - Cho, Sahnit (Correct)
Active bibliography (related documents): More All
1.0: Biased Leftist Trees and Modified Skip Lists - Seonghun Cho (Correct)
0.2: Mergeable Double-Ended Priority Queues - Cho, Sahni (1999) (Correct)
0.2: Minimum Area Joining of Compacted Cells - Cho, Sahni (1994) (Correct)
Similar documents based on text: More All
0.5: Supernode Binary Search Trees - Haejae Jung And (Correct)
0.3: Biased Skip Lists for Highly Skewed Access Patterns - Funda Ergun Cenk (2001) (Correct)
0.1: Fast Set Operations Using Treaps - Blelloch, Reid-Miller (1998) (Correct)
BibTeX entry: (Update)
@article{ cho00new,
author = "Seonghun Cho and Sartaj Sahni",
title = "A New Weight Balanced Binary Search Tree",
journal = "International Journal of Foundations of Computer Science",
volume = "11",
number = "3",
pages = "485-513",
year = "2000",
url = "citeseer.ist.psu.edu/25570.html" }
Citations (may not include all citations):182 Skip Lists: a Probabilistic Alternative to Balanced Trees - Pugh - 1990
124 A Dichromatic Framework for Balanced Trees (context) - Guibas, Sedgewick - 1978
33 Binary Search Trees of Bounded Balance (context) - Nievergelt, Reingold - 1973
17 the Average Number of Rebalancing Operations in Weight-balan.. (context) - Blum, Mehlhorn - 1980
9 Skip Lists and Probabilistic Analysis of Algorithms (context) - Papadakis - 1993
8 Updating a Balanced Search Tree in O (context) - Tarjan - 1983
4 Fundatamentals of Data Structures in Pascal (context) - Horowitz, Sahni - 1994
4 IEEE Symposium on Foundations of Computer Science (context) - Aragon, Seidel et al. - 1989
2 Florida: NSPAN Printing and Publishing Co (context) - Sahni, in - 1993
1 rd Annual ACM-SIAM Symposium on Discrete Algorithms (context) - Munro, Papadakis et al. - 1992
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cise.ufl.edu.html): More
Flexible and Recoverable Interaction between.. - Hanson, Chen.. (1994) (Correct)
Extending Object-Oriented Design for Physical Modeling - Fishwick (1996) (Correct)
A Semi-Automated Method for Dynamic Model Abstraction - Lee, Fishwick (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