Between Dynamic Programming and Greedy: Data Compression (1995)

Cached

Download Links

by Richard S. Bird , Oege De Moor
Venue:Programming Research Group, 11 Keble Road, Oxford OX1 3QD
Citations:5 - 0 self

Documents Related by Co-Citation

84 Algebraic Data Types and Program Transformation – G Malcolm - 1990
14 From Dynamic Programming to Greedy Algorithms – Richard Bird, Oege De Moor - 1992
1404 A Discipline of Programming – E W Dijkstra - 1976
96 Algorithmics: Towards programming as a mathematical activity – L Meertens - 1986
534 Shortest connection networks and some generalizations – R Prim - 1957
21 Formal derivation of a pattern matching algorithm – Richard S Bird, Jeremy Gibbons, Geraint Jones - 1989
11 Constructing a calculus of programs – L Meertens - 1989
9 Categories, relations and dynamic programming. D.Phil. thesis – O De Moor - 1992
7 List partitions – R S Bird, O De Moor - 1993
11 Solving Optimisation Problems with Catamorphisms – Richard Bird, Oege De Moor - 1992
16 Common phrases and minimum-space text storage – Robert A Wagner - 1973
1312 Monads for functional programming – Philip Wadler - 1995
31 O.: Categories, relations and dynamic programming – de Moor - 1992
439 On the shortest spanning subtree of a graph and the traveling salesman problem – J B Kruskal - 1956
215 An introduction to the theory of lists – R S Bird - 1987
6 A Graphical Calculus – Sharon Curtis, Gavin Lowe - 1995
7 Shorter paths to graph algorithms – B Moller, M Russling - 1994
3 A General Scheme for Breadth-First Graph Traversal – Martin Russling - 1995
477 Programming from Specifications – C C Morgan - 1998