Data Structures and Amortized Complexity in a Functional Setting (1992)

by Berry Schoenmakers
Citations:11 - 3 self

Documents Related by Co-Citation

12 A symmetric set of efficient list operations – R R Hoogerwoord - 1992
250 Making Data Structures Persistent – James R. Driscoll, Neil Sarnak, Daniel D. Sleator, Robert E. Tarjan - 1989
25 Simple and efficient purely functional queues and deques – Chris Okasaki - 1995
86 A data structure for manipulating priority queues – J Vuillemin - 1978
11 Functional Binomial Queues – David King - 1994
15 Confluently Persistent Deques via Data-Structural Bootstrapping – Adam L. Buchsbaum, Robert E. Tarjan - 1993
4 The Derivation of a Tighter Bound for Top-Down Skew Heaps – Anne Kaldewaij, Berry Schoenmakers - 1991
138 Amortized computational complexity – R E Tarjan - 1985
23 Real-time queue operations – Robert Hood, Robert Melville - 1981
12 Real-Time Deques, Multihead Turing Machines, and Purely Functional Programming – Tyng-Ruey Chuang, Benjamin Goldberg - 1993
469 The Science of Programming – D Gries - 1981
13 Persistent data structures – Neil Ivor Sarnak - 1986
35 Efficient Applicative Data Types – E W Myers - 1984
32 Shallow Binding in Lisp 1.5 – Henry G. Baker - 1978
6 The Efficient Implementation of Very-High-Level Programming Language Constructs – Robert Hood - 1982
1565 The Definition of Standard ML – Robin Milner, Mads Tofte - 1990
25 Persistent lists with catenation via recursive slow-down – H Kaplan, R E Tarjan - 1995
13 An applicative random-access stack – Eugene W. Myers - 1983
377 Self-adjusting binary search trees – D D Sleator, R E Tarjan - 1985