|
12
|
Purely Functional, Real-Time Deques with Catenation
– Haim Kaplan, Robert E. Tarjan
- 1999
|
|
15
|
Purely Functional Random-Access Lists
– Chris Okasaki
- 1995
|
|
6
|
Amortization, Lazy Evaluation, and Persistence: Lists with Catenation via Lazy Linking
– Chris Okasaki
- 1995
|
|
15
|
Optimal Purely Functional Priority Queues
– Gerth Stølting Brodal, Gerth Stlting Brodal, Chris Okasaki, Chris Okasaki
- 1996
|
|
6
|
A Probabilistic Approach to the Problem of Automatic Selection of Data Representations
– Tyng-Ruey Chuang, Wen L. Hwang
- 1996
|
|
43
|
The Under-Appreciated Unfold
– Jeremy Gibbons, Geraint Jones
- 1998
|
|
|
A Functional Semantics for Space and Time
– Catherine Hope
- 2008
|
|
9
|
Inductive Graphs and Functional Graph Algorithms
– Martin Erwig
- 2001
|
|
15
|
Confluently Persistent Deques via Data-Structural Bootstrapping
– Adam L. Buchsbaum, Robert E. Tarjan
- 1993
|
|
11
|
Real-Time Deques, Multihead Turing Machines, and Purely Functional Programming
– Tyng-Ruey Chuang, Benjamin Goldberg
- 1993
|
|
|
Purity, Impurity and Efficiency in Graph Algorithms
– n.n.
|
|
10
|
Simple Confluently Persistent Catenable Lists
– Haim Kaplan, Chris Okasaki, Robert, Robert E. Tarjan
- 1998
|
|
6
|
Interpreter Prototypes From Formal Language Definitions
– Gregory John Michaelson
- 1993
|
|
8
|
Real-time Garbage Collection of a Functional Persistent Heap
– Tekij"a Kenneth Oksanen
- 1999
|
|
|
Abstract Interpretation and Low-Level Code Optimization
– Saumya Debray
- 1995
|
|
40
|
A Naïve Time Analysis and its Theory of Cost Equivalence
– David Sands
- 1995
|
|
24
|
A sized time system for a parallel functional language
– Hans-wolfgang Loidl, Kevin Hammond
- 2003
|
|
|
Improvements for Free
– Daniel Seidel, Janis Voigtländer
|
|
19
|
Breadth-First Numbering: Lessons from a Small Exercise in Algorithm Design
– Chris Okasaki
- 2000
|
