Benchmarking Purely Functional Data Structures (1999)

Cached

Download Links

by Graeme E. Moss
Venue:Journal of Functional Programming
Citations:2 - 0 self

Active Bibliography

18 Optimal Purely Functional Priority Queues – Gerth Stølting Brodal, Chris Okasaki - 1996
17 Purely Functional Random-Access Lists – Chris Okasaki - 1995
11 Simple Confluently Persistent Catenable Lists – Haim Kaplan, Chris Okasaki, Robert E. Tarjan - 1998
13 Purely Functional, Real-Time Deques with Catenation – Haim Kaplan, Robert E. Tarjan - 1999
10 Making Data Structures Confluently Persistent – Amos Fiat, Haim Kaplan, Albert Einstein - 2001
1 Confluently Persistent Tries for Efficient Version Control – Erik D. Demaine, Stefan Langerman, Eric Price
16 Inductive Graphs and Functional Graph Algorithms – Martin Erwig - 2001
13 The Role of Lazy Evaluation in Amortized Data Structures – Chris Okasaki - 1996
4 Auburn: A Kit for Benchmarking Functional Data Structures – Graeme E. Moss, Colin Runciman - 1997
5 Automated Benchmarking of Functional Data Structures – Graeme E. Moss, Colin Runciman - 1999
5 Numerical Representations as Higher-Order Nested Datatypes – Ralf Hinze - 1998
7 Amortization, Lazy Evaluation, and Persistence: Lists with Catenation via Lazy Linking – Chris Okasaki - 1995
1 Initialising Neural Networks with Prior – Nathan Rountree - 2006
16 Purely Functional Representations of Catenable Sorted Lists. – Haim Kaplan, Robert E. Tarjan - 1996
29 Functional Programming with Graphs – Martin Erwig - 1997
2 Discrete-Event Simulation on the Bulk-Synchronous Parallel Model – Mauricio Marin, St Cross College, Supervisor Prof, W. F. Mccoll - 1998
4 An Empirical Comparison of Priority Queue Algorithms – Mauricio Marín
3 On the Pending Event Set and Binary Tournaments – Mauricio Marín
5 A Communication Architecture for Multiprocessor Networks – A. Nowatzyk - 1989