Automated Benchmarking of Functional Data Structures (1999)

Cached

Download Links

by Graeme E. Moss , Colin Runciman
Venue:In Practical Aspects of Declarative Languages
Citations:5 - 2 self

Active Bibliography

2 Benchmarking Purely Functional Data Structures – Graeme E. Moss - 1999
18 Optimal Purely Functional Priority Queues – Gerth Stølting Brodal, Chris Okasaki - 1996
17 Purely Functional Random-Access Lists – Chris Okasaki - 1995
6 A Probabilistic Approach to the Problem of Automatic Selection of Data Representations – Tyng-Ruey Chuang, Wen L. Hwang - 1996
15 An Overview of Edison – Chris Okasaki - 2000
16 Inductive Graphs and Functional Graph Algorithms – Martin Erwig - 2001
8 Real-time Garbage Collection of a Functional Persistent Heap – Tekij"a Kenneth Oksanen - 1999
5 Numerical Representations as Higher-Order Nested Datatypes – Ralf Hinze - 1998
1 Confluently Persistent Tries for Efficient Version Control – Erik D. Demaine, Stefan Langerman, Eric Price
7 Fast Functional Lists, Hash-Lists, Deques and Variable Length Arrays – Phil Bagwell - 2002
16 Purely Functional Representations of Catenable Sorted Lists. – Haim Kaplan, Robert E. Tarjan - 1996
15 Confluently Persistent Deques via Data-Structural Bootstrapping – Adam L. Buchsbaum, Robert E. Tarjan - 1993
250 Making Data Structures Persistent – James R. Driscoll, Neil Sarnak, Daniel D. Sleator, Robert E. Tarjan - 1989
12 Real-Time Deques, Multihead Turing Machines, and Purely Functional Programming – Tyng-Ruey Chuang, Benjamin Goldberg - 1993
7 Amortization, Lazy Evaluation, and Persistence: Lists with Catenation via Lazy Linking – Chris Okasaki - 1995
7 Persistent Triangulations – Guy Blelloch, Hal Burch, Karl Crary, Robert Harper, Gary Miller, Noel Walkington - 2001
23 Fast Mergeable Integer Maps – Chris Okasaki, Andrew Gill - 1998
1 Functional Data Structures for Typed Racket – Hari Prashanth K R, Sam Tobin-hochstadt
Relational Programming in MiniKanren: Techniques, . . . – William E. Byrd - 2009