|
196
|
Functional Data Structures
– Chris Okasaki
- 1996
|
|
15
|
Purely Functional Random-Access Lists
– Chris Okasaki
- 1995
|
|
27
|
Functional Programming with Graphs
– Martin Erwig
- 1997
|
|
163
|
Programming Parallel Algorithms
– Guy E. Blelloch
- 1996
|
|
14
|
An efficiency comparison of some representations of purely functional arrays
– Annika Aasa, Sören Holmström, Christina Nilsson
- 1988
|
|
3
|
Auburn: A kit for benchmarking functional data structures
– Graeme E Moss, Colin Runciman
- 1997
|
|
3
|
Making data structures persistent. Journal of computer and system sciences
– James R Driscoll, Neil Sarnak, Daniel D Sleator
- 1989
|
|
2
|
Computing the convex hull in a functional language
– Hal Burch, Gary Miller
- 2000
|
|
2
|
Fully persistent arrays. Pages 67–74 of: Workshop on algorithms and data structures
– Paul F Dietz
- 1989
|
|
2
|
Efficient applicative data structures. Pages 66–75 of
– Eugene W Myers
- 1984
|
|
4
|
The (Q)uickhull algorithm for convex hulls,” ACMTrans
– C B Barber, D B Dobkin, H Huhdanpaa
- 1996
|
|
131
|
Fast Polygonal Approximation of Terrains and Height Fields
– Michael Garland, Paul S. Heckbert
- 1995
|
|
23
|
An optimal convex hull algorithm and new results on cuttings
– B Chazelle
- 1991
|
|
102
|
Symmetric Binary B-Trees: Data Structure and Maintenance Algorithms
– R Bayer
- 1972
|
|
422
|
Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams
– Leonidas John Guibas, Jorge Stolfi
- 1983
|
|
573
|
The Definition of Standard ML (Revised
– Robin Milner, Mads Tofte, Robert Harper, David MacQueen
- 1997
|
|
40
|
Elementary Concepts of Topology
– P Alexandroff
- 1961
|
|
1567
|
Randomized Algorithms
– R Motwani, P Raghavan
- 1995
|
|
357
|
Applications of Random Sampling in Computational Geometry, II
– Kenneth L. Clarkson, Peter W. Shor
- 1995
|
