A Randomized Implementation of Multiple Functional Arrays (1994)

Cached

Download Links

by Tyng-Ruey Chuang
Venue:In Proceedings of 1994 ACM Conference on Lisp and Functional Programming
Citations:5 - 1 self

Documents Related by Co-Citation

14 An efficiency comparison of some representations of purely functional arrays – Annika Aasa, Sören Holmström, Christina Nilsson - 1988
32 Shallow Binding in Lisp 1.5 – Henry G. Baker - 1978
15 Shallow Binding Makes Functional Arrays Fast – Henry G. Baker - 1991
13 A New Method for Functional Arrays – Melissa O'Neill, F. Warren Burton - 1997
17 Purely Functional Random-Access Lists – Chris Okasaki - 1995
320 A methodology for implementing highly concurrent data structures – Ma. Urice Herlihy - 1990
97 A Lock-Free Multiprocessor OS Kernel – Henry Massalin, Calton Pu - 1991
738 Transactional Memory: Architectural Support for Lock-Free Data Structures – Maurice Herlihy, J. Eliot B. Moss
166 Obstruction-free synchronization: Double-ended queues as an example – Maurice Herlihy, Victor Luchangco, Mark Moir - 2003
83 Impossibility and universality results for wait–free synchronization – Maurice Herlihy - 1988
13 An applicative random-access stack – Eugene W. Myers - 1983
35 Efficient Applicative Data Types – E W Myers - 1984
12 Real-Time Deques, Multihead Turing Machines, and Purely Functional Programming – Tyng-Ruey Chuang, Benjamin Goldberg - 1993
25 Simple and efficient purely functional queues and deques – Chris Okasaki - 1995
247 Making Data Structures Persistent – James R. Driscoll, Neil Sarnak, Daniel D. Sleator, Robert E. Tarjan - 1989
26 Unrolling lists – Zhong Shao - 1994
8 A logarithmic implementation of flexible arrays – Rob R Hoogerwoord
56 Detecting global variables in denotational specifications. ACM transactions on programming languages and systems – D A Schmidt - 1985
366 ML for the Working Programmer – L C Paulson - 1991