Data Structures (1996)

Cached

Download Links

by Roberto Tamassia
Venue:ACM Computer Surveys
Citations:1 - 0 self

Documents Related by Co-Citation

4 Three algorithms on Braun trees – Chris Okasaki - 1997
3 Data-structural Bootstrapping and Catenable Deques – A L Buchsbaum - 1993
11 A symmetric set of efficient list operations – Rob R Hoogerwoord - 1992
1 Fully persistent data structures for disjoint set union problems – Giuseppe F Italiano, Neil Sarnak - 1991
1 On building trees with minimun height – Richard S Bird - 1997
1 Implementation of Flexible Arrays Using Balanced Trees – D J Challab - 1991
1 Dielissen and Anne Kaldewaij. A simple, efficient, and flexible implementation of flexible arrays – J Victor - 1995
1 Leaf Trees – Anne Kaldewaij, Victor J Dielissen - 1996
2 An Applicative Random-Access Stack. Information Processing letters – Eugene W Myers - 1983
1 den Broek. A new programming technique for lazy functional languages – F A van Gilst, P M van - 1995
23 Real-time queue operations – Robert Hood, Robert Melville - 1981
8 Circular programs and self-referential structures. Software—Practice and Experience – L Allison - 1989
2 Monads for functional programming. Lecture notes for – Philip Wadler - 1992
16 Efficient functional implementation of FIFO queues – F Warren Burton - 1982
8 Hugs 1.3 The Haskell User's Gofer System User Manual – Mark P. Jones - 1996
23 Persistent lists with catenation via recursive slow-down – Robert E Tarjan - 1995
13 The Role of Lazy Evaluation in Amortized Data Structures – Chris Okasaki - 1996
6 The Efficient Implementation of Very-High-Level Programming Language Constructs – Robert Hood - 1982
11 Functional Binomial Queues – David King - 1994