Balanced search trees made simple (1993)

Cached

Download Links

by Arne Andersson
Venue:In Proc. 3rd Workshop on Algorithms and Data Structures
Citations:22 - 0 self

Documents Related by Co-Citation

179 An algorithm for the organization of information – G Adelson-Velskii, E M Landis - 1962
114 Symmetric binary B-trees: Data structure and maintenance algorithms – R Bayer - 1972
231 R.: A dichromatic framework for balanced trees – L J Guibas, Sedgewick - 1978
14 Binary B-Trees for Virtual Memory – R Bayer - 1971
12 Implicit dictionaries supporting searches and amortized updates in O(log n log log n – Gianni Franceschini, Roberto Grossi - 2003
36 An implicit data structure supporting insertion, deletion, and search in O(log 2 n) time – J I Munro - 1986
13 Implicit B-trees: New results for the dictionary problem – G Franceschini, R Grossi, J Munro, L Pagli - 2002
16 Optimal worst-case operations for implicit cache-oblivious search trees – G Franceschini, R Grossi
159 An optimal algorithm for intersecting line segments in the plane – Bernard Chazelle, Herbert Edelsbrunner - 1992
32 A Simple Trapezoid Sweep Algorithm for Reporting Red/Blue Segment Intersections – Timothy M. Chan - 1994
272 Algorithms for reporting and counting geometric intersections – J L Bentley, A Ottmann T - 1979
16 A new class of balanced search trees; half-balanced binary search trees – H J Olivie
80 Binary search trees of bounded balance – J Nievergelt, E M Reingold - 1973
3 Left-leaning red-black trees. www.cs.princeton.edu/ rs/talks/LLRB/LLRB.pdf – R SEDGEWICK - 2008
138 Amortized computational complexity – R E Tarjan - 1985
254 Organization and maintenance of large ordered indexes – R Bayer, E M McCreight - 1972
43 Zipf’s law and the internet – L A Adamic, B A Huberman
65 An optimal algorithm for finding segments intersections – I J Balaban - 1995
20 Space-efficient planar convex hull algorithms – Herve Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried Toussaint - 2002