Adam Louis Buchsbaum  Home/Search
Context Related
| att.com/~alb/biblio/thesis.ps.Z 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: xoom.com/killough/heaps (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The list is a fundamental data structure. It stores a linearly ordered collection of elements and allows access only to the front and rear elements of the list. Catenation can be applied to lists, unifying the rear of one list with the front of another. Absent other requirements, the basic list operations, including catenation, have straightforward implementations. If the list has certain secondary properties, however, the operations, particularly catenation, become more difficult. (Update)
Context of citations to this paper: More
...in analogy to skew binary number systems. 4. Data structural bootstrapping. These technique was described in Buchsbaum s thesis [Buc93]. It consists of two basic ideas: Structural Abstraction and Structural Decomposition. Structural abstraction is typically used to provide...
...of priority queues. Constant worst case running time for ( is achieved using a technique called data structural bootstrapping (Buchsbaum, 1993). In essence ( is reduced to insert by allowing queues to contain other queues. 9 Acknowledgements Thanks are due to Michael...
Cited by: More
Reflected Min-Max Heaps - Christos Makris Athanasios (Correct)
Functional Pearls: Explaining Binomial Heaps - Hinze (1999) (Correct)
Sequence Implementations in Haskell - Borges (1997) (Correct)
Similar documents (at the sentence level):
28.2%: Confluently Persistent Deques via Data-Structural Bootstrapping - Buchsbaum, Tarjan (1993) (Correct)
9.6%: Data Structural Bootstrapping, Linear Path Compression.. - Buchsbaum, Sundar.. (1992) (Correct)
Active bibliography (related documents): More All
6.6: Data-Structural Bootstrapping And Catenable Deques - Buchsbaum (1993) (Correct)
0.9: Purely Functional Representations of Catenable Sorted Lists. - Kaplan, Tarjan (1996) (Correct)
0.8: Purely Functional, Real-Time Deques with Catenation - Kaplan, Tarjan (1999) (Correct)
Similar documents based on text: More All
0.7: Catenable Double-Ended Queues - Okasaki (1997) (Correct)
0.4: Simple Confluently Persistent Catenable Lists (Extended.. - Kaplan, Okasaki, Tarjan (1998) (Correct)
0.3: Fast Functional Lists, Hash-Lists, Deques and Variable Length.. - Bagwell (2002) (Correct)
Related documents from co-citation: More All
2: An applicative random-access stack (context) - Myers - 1983
2: Purely Functional Data Structures - Okasaki - 1998
2: A data structure for manipulating priority queues (context) - Vuillemin - 1978
BibTeX entry: (Update)
Adam Louis Buchsbaum. Data-structural Bootstrapping and catenable deques. PhD thesis, Department of Computer Science, Princeton University, June 1993. http://citeseer.ist.psu.edu/buchsbaum93datastructural.html More
@techreport{ buchsbaum93datastructural,
author = "Adam L. Buchsbaum",
title = "Data-Structural Bootstrapping and Catenable Deques",
number = "TR-423-93",
pages = "90",
year = "1993",
url = "citeseer.ist.psu.edu/buchsbaum93datastructural.html" }
Citations (may not include all citations):521 Compiling with Continuations (context) - Appel - 1992
353 Fibonacci heaps and their uses in improved network optimizat.. (context) - Fredman, Tarjan - 1987
249 volume 3: Sorting and Searching (context) - Knuth, of - 1973
183 A data structure for dynamic trees (context) - Sleator, Tarjan - 1983
164 Society for Industrial and Applied Mathematics (context) - Tarjan, Network et al. - 1983
129 Making data structures persistent (context) - Driscoll, Sarnak et al. - 1989
124 A dichromatic framework for balanced trees (context) - Guibas, Sedgewick - 1978
116 Planar point location using persistent search trees (context) - Sarnak, Tarjan - 1986
101 Sparsification--- A technique for speeding up dynamic graph .. (context) - Eppstein, Galil et al. - 1992
100 volume 1: Fundamental Algorithms (context) - Knuth, of - 1973
99 Two algorithms for maintaining order in a list (context) - Dietz, Sleator - 1987
80 Amortized computational complexity (context) - Tarjan - 1985
75 Nonlinearity of Davenport-Schinzel sequences and of generali.. (context) - Hart, Sharir - 1986
71 A data structure for manipulating priority queues (context) - Vuillemin - 1978
63 Notes on structured programming (context) - Dijkstra - 1972
61 Incremental context-dependent analysis for language-based ed.. (context) - Reps, Teitelbaum et al. - 1983
55 Worst-case analysis of set union algorithms (context) - Tarjan, van Leeuwen - 1984
55 Randomized search trees (context) - Aragon, Seidel - 1989
41 Log-logarithmic worst-case range queries are possible in spa.. (context) - Willard - 1983
36 Searching and storing similar lists (context) - Cole - 1986
33 Fully persistent arrays (context) - Dietz - 1989
32 A unifying look at data structures (context) - Vuillemin - 1980
28 volume 156 of Lecture Notes in Computer Science (context) - Overmars, of et al. - 1983
25 Maintaining order in a linked list (context) - Dietz - 1982
25 Fully persistent lists with catenation (context) - Driscoll, Sleator et al. - 1994
21 Real-time queue operations in pure LISP (context) - Hood, Melville - 1981
21 Notes on data structuring (context) - Hoare - 1972
19 Planar graph decomposition and all pairs shortest paths (context) - Frederickson - 1991
18 Efficient applicative data types (context) - Myers - 1984
17 Information Processing Letters (context) - Gajewska, Tarjan et al. - 1986
17 River routing every which way (context) - Cole, Siegel - 1984
16 Information and Control (context) - Chazelle, search - 1985
15 Improving partial rebuilding by using simple balance criteri.. - Andersson - 1989
14 amortization and randomization (context) - Dietz, Raman - 1991
14 Finding level-ancestors in dynamic trees (context) - Dietz - 1991
14 New trie data structures which support very fast search oper.. (context) - Willard - 1984
13 Maintaining order in a generalized linked list (context) - Tsakalidis - 1984
13 and catenable heap ordered double ended queues (context) - Buchsbaum, Sundar et al. - 1992
12 An applicative random-access stack (context) - Myers - 1983
11 Staticto -dynamic transformation (context) - Bentley, Saxe et al. - 1980
11 Scapegoat trees (context) - Galperin, Rivest - 1993
10 Linearity and unprovability of set union problem strategies (context) - Loebl, Nesetril - 1989
10 Linearity and unprovability of set union problem strategies (context) - Loebl, Nesetril - 1988
10 Confluently persistent deques via data structural bootstrapp.. - Buchsbaum, Tarjan - 1993
10 Binary search trees of almost optimal height - Andersson, Icking et al. - 1990
9 trees with variable-length records (context) - McCreight - 1977
9 Linear algorithms for analysis of minimum spanning and short.. - Booth, Westbrook - 1990
8 Real-time simulation of concatenable double-ended queues by .. (context) - Kosaraju - 1979
8 Postorder disjoint set union is linear (context) - Lucas - 1990
8 and purely functional programming (context) - Chuang, Goldberg et al. - 1993
7 trees with variablelength items (context) - Diehr, Faaland et al. - 1984
6 Description and analysis of an efficient priority queue repr.. (context) - Francon, Viennot et al. - 1978
6 A data structure technique (context) - Chazelle, Guibas - 1986
6 Technical Report RUU-CS (context) - Overmars, the et al. - 1981
6 Efficient uses of the past (context) - Dobkin, Munro - 1985
6 Computing external farthest neighbors for a simple polygon (context) - Agarwal, Aggarwal et al. - 1991
6 Technical Report RUU-CS (context) - Overmars, the - 1981
5 New applications of failure functions - Hirschberg, Larmore - 1987
5 Personal communication (context) - Kosaraju - 1992
5 AddisonWesley Series in Computer Science (context) - Sethi, Concepts - 1989
5 Efficient optimal pagination of scrolls - Larmore, Hirschberg - 1985
4 Maintaining ff-balanced trees by partial rebuilding (context) - Andersson - 1991
4 Department of Computer Science (context) - Sarnak, Structures - 1986
3 Postorder hierarchy for path compressions and set union (context) - Loebl, Nesetril - 1988
3 Worst-case data structures for the priority queue with attri.. (context) - Sundar - 1989
3 Technical Report (context) - Myers - 1982
3 Personal communication (context) - Sleator - 1992
3 Union-copy structures and dynamic segment trees (context) - van Kreveld, Overmars - 1993
Documents on the same site (http://members.xoom.com/killough/heaps.html): More
Data Structures and Amortized Complexity in a Functional Setting - Schoenmakers (1992) (Correct)
Binary Tournaments and Priority Queues: PRAM and BSP - Marín (Correct)
Analysis of an Efficient Algorithm for the Hard-Shere Problem - Krantz (1996) (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