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
Efficient Data Structures in a Lazy Functional Language – Martin Holters - 2003
Sequence Implementations in Haskell – Pedro R. Borges, Pedro R. Borges - 1997
18 Optimal Purely Functional Priority Queues – Gerth Stølting Brodal, Chris Okasaki - 1996
17 Purely Functional Random-Access Lists – Chris Okasaki - 1995
246 Making Data Structures Persistent – James R. Driscoll, Neil Sarnak, Daniel D. Sleator, Robert E. Tarjan - 1989
Purely Functional Worst Case Constant Time Catenable Sorted Lists – Gerth Stølting Brodal, Christos Makris, Kostas Tsichlas
Exploring Datatype Usage Space – Graeme E. Moss, Colin Runciman - 1998
6 A Probabilistic Approach to the Problem of Automatic Selection of Data Representations – Tyng-Ruey Chuang, Wen L. Hwang - 1996