|
14
|
An efficiency comparison of some representations of purely functional arrays
– Annika Aasa, Sören Holmström, Christina Nilsson
- 1988
|
|
14
|
Shallow Binding Makes Functional Arrays Fast
– Henry G. Baker
- 1991
|
|
31
|
Shallow Binding in Lisp 1.5
– Henry G. Baker
- 1978
|
|
15
|
Purely Functional Random-Access Lists
– Chris Okasaki
- 1995
|
|
86
|
A Lock-Free Multiprocessor OS Kernel
– Henry Massalin, Calton Pu
- 1991
|
|
13
|
A New Method for Functional Arrays
– Melissa O'Neill, F. Warren Burton
- 1997
|
|
295
|
A methodology for implementing highly concurrent data structures
– Ma. Urice Herlihy
- 1990
|
|
74
|
Impossibility and Universality Results for Wait-Free Synchronization,” PODC
– M Herlihy
- 1988
|
|
597
|
Transactional Memory: Architectural Support for Lock-Free Data Structures
– Maurice Herlihy, J. Eliot B. Moss
|
|
150
|
Obstruction-free synchronization: Double-ended queues as an example
– Maurice Herlihy, Victor Luchangco, Mark Moir
- 2003
|
|
13
|
An applicative random-access stack
– Eugene W Myers
- 1983
|
|
11
|
Real-Time Deques, Multihead Turing Machines, and Purely Functional Programming
– Tyng-Ruey Chuang, Benjamin Goldberg
- 1993
|
|
26
|
Unrolling Lists
– Zhong Shao, John H. Reppy, Andrew W. Appel, John H
- 1994
|
|
31
|
Efficient applicative data types
– Eugene W Myers
- 1984
|
|
24
|
Simple and efficient purely functional queues and deques
– Chris Okasaki
- 1995
|
|
231
|
Making Data Structures Persistent
– James R. Driscoll, Neil Sarnak, Daniel D. Sleator, Robert E. Tarjan
- 1989
|
|
56
|
Detecting global variables in denotational specifications
– D A Schmidt
- 1985
|
|
8
|
A logarithmic implementation of flexible arrays
– Rob R Hoogerwoord
|
|
352
|
ML for the Working Programmer
– L C Paulson
- 1996
|
