(Enter summary)
Abstract: views of amortization . . . . . . . . . . . . . . . . . . . 44
4 Implementation aspects 49
4.1 Functional program notation . . . . . . . . . . . . . . . . . . . . 50
4.2 Eager evaluation . . . . . . . . . . . . . . . . . . . . . . . . . . . 51
4.3 Pointer implementation of stacks . . . . . . . . . . . . . . . . . . 52
4.4 Destructivity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 54
4.5 Queues and concatenable deques . . . . . . . . . . . . . . . . . . 55
iv Contents
4.6 Linear... (Update)
Context of citations to this paper: More
.... after a sequence of updates, the newest version as well as all previous versions of the aggregate are still accessible [1, 5, 6, 8, 9, 10, 11, 15, 19, 22]. The challenge is to reduce as much as possible the associated overhead when maintaining multiple versions of an...
...been written about purely functional priority queues. To our knowledge, only Paulson (1991) Kaldewaij and Schoenmakers (1991) Schoenmakers (1992), and King (1994) have explicitly treated priority queues in a purely functional setting. We consider priority queues that support...
Cited by: More
A Systematic Analysis of Splaying - Schoenmakers (1993)
(Correct)
A Probabilistic Approach to the Problem of Automatic Selection .. - Chuang, Hwang (1996)
(Correct)
The Role of Lazy Evaluation in Amortized Data Structures - Okasaki (1996)
(Correct)
Similar documents (at the sentence level):
5.9%: Data Structures and Amortized Complexity in a Functional Setting - Schoenmakers (1992)
(Correct)
Active bibliography (related documents): More All
0.3: A Formal Semantics of State Modification Primitives of.. - Vignaga (2004)
(Correct)
0.2: A Tight Lower Bound for Top-Down Skew Heaps - Schoenmakers (1997)
(Correct)
0.2: On Parallel Hashing and Integer Sorting - Matias, Vishkin (1991)
(Correct)
Similar documents based on text: More All
0.1: The Derivation of a Tighter Bound for Top-Down Skew Heaps - Kaldewaij, Schoenmakers (1991)
(Correct)
0.1: Amortized Complexity of Data Structures - Sundar (1991)
(Correct)
0.1: A Secure and Optimally Efficient Multi-Authority Election .. - Cramer, Gennaro.. (1997)
(Correct)
Related documents from co-citation: More All
3: Purely functional random-access lists
- Okasaki - 1995
3: The pairing heap: A new form of self-adjusting heap (context) - Fredman, Sedgewick - 1986
3: Simple and efficient purely functional queues and deques
- Okasaki - 1995
BibTeX entry: (Update)
Schoenmakers B. Data Structures and Amortized Complexity in a Functional Setting. Ph.D. thesis, Eindhoven University of Technology, Eindhoven, Netherlands (1992). http://citeseer.ist.psu.edu/schoenmakers92data.html More
@misc{ schoenmakers92data,
author = "B. Schoenmakers",
title = "Data Structures and Amortized Complexity in a Functional Setting",
text = "Schoenmakers B. Data Structures and Amortized Complexity in a Functional
Setting. Ph.D. thesis, Eindhoven University of Technology, Eindhoven, Netherlands
(1992).",
year = "1992",
url = "citeseer.ist.psu.edu/schoenmakers92data.html" }
Citations (may not include all citations):
1450
The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
652
A Discipline of Programming (context) - Dijkstra - 1976
275
The Science of Programming (context) - Gries - 1981
192
Self-adjusting binary search trees (context) - Sleator, Tarjan - 1985
184
Linear types can change the world
- Wadler - 1990
141
Predicate Calculus and Program Semantics (context) - Dijkstra, Scholten - 1990
138
Lectures on Constructive Functional Programming (context) - Bird - 1988
91
Data Structures and Algorithms 1: Sorting and Searching (context) - Mehlhorn - 1984
80
Amortized computational complexity (context) - Tarjan - 1985
71
A data structure for manipulating priority queues (context) - Vuillemin - 1978
57
Scaling and related techniques for geometry problems (context) - Gabow, Bentley et al. - 1984
55
Worst-case analysis of set union algorithms (context) - Tarjan, Leeuwen - 1984
53
Prentice-Hall international series in computer science (context) - Jones, Implementation et al. - 1987
49
The pairing heap: a new form of self-adjusting heap (context) - Fredman, Sedgewick et al. - 1986
41
Data refinement of predicate transformers (context) - Morgan - 1991
40
Laws of data refinement (context) - Morris - 1989
34
Data Structures (context) - Mehlhorn, Tsakalidis - 1990
32
A unifying look at data structures (context) - Vuillemin - 1980
30
Self-adjusting heaps (context) - Sleator, Tarjan - 1986
23
SASL Language Manual (context) - Turner - 1976
17
Information Processing Letters (context) - Gajewska, Tarjan - 1986
13
Towards a calculus of data refinement (context) - Chen, Udding - 1989
12
A tight amortized bound for path reversal (context) - Ginat, Sleator et al. - 1989
9
trees with variable-length records (context) - of - 1977
8
The design of functional programs: a calculational approach (context) - Hoogerwoord - 1989
5
The derivation of a tighter bound for topdown skew heaps
- Kaldewaij, Schoenmakers - 1991
4
On saving space in parallel computation (context) - Hagerup - 1988
3
Prentice-Hall international series in computer science (context) - Programming, of - 1990
2
Fibonacci heaps and improved network optimization algorithms (context) - Fredman, Tarjan - 1987
2
Data structures and terminating Petri nets (context) - Sleator - 1992
2
Department of Mathematics and Computing Science (context) - queues, thesis et al. - 1989
2
Methodical competitive snoopy-caching (context) - Nelson - 1990
1
ciency of a path retrieval data structure (context) - Amortized - 1986
The graph only includes citing articles where the year of publication is known.
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