Richard S. Bird, Oege de Moor  Home/Search
Context Related
| comlab.oxford.ac.uk/ouc...compact.ps.gz comlab.ox.ac.uk/oucl/pu...compact.ps.gz comlab.ox.ac.uk/oucl/us...compact.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: comlab.oxford.ac.uk/oucl/u...pubs (more) From: comlab.ox.ac.uk/ou...publications (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The derivation of certain algorithms can be seen as a hybrid form of dynamic programming and the greedy paradigm. We present a generic theorem about such algorithms, and show how it can be applied to the derivation of an algorithm for data compression. 1 Introduction Dynamic programming is a technique for solving optimisation problems. A typical dynamic programming algorithm proceeds by decomposing the input in all possible ways, recursively solving the subproblems, and combining optimal... (Update)
Context of citations to this paper: More
.... to a further point if the method was extended with tools to reason about implementation details (a possibility which is suggested in [7]) A first start for such an extension can be found in [5] imperative programming can profit from the BMF laws in correctness proofs for...
.... of optimisation problems, including some of the aforementioned graph problems, have been worked out within BdM s calculus [10, 11, 12, 13, 18]. Nevertheless, a number of them remain uncovered, which suggests more research to be undertaken with an eye to graph algorithms....
Cited by: More
The Greedy Algorithms Class: Formalization, Synthesis and.. - Charlier (1995) (Correct)
Partitions Revisited - Curtis (1993) (Correct)
A Relational Approach To Optimization Problems - Curtis (1996) (Correct)
Active bibliography (related documents): More All
0.7: Inductive Data Types for Predicate Transformers - de Moor (1995) (Correct)
0.4: An Algebraic Construction of Predicate Transformers - Gardiner, Martin, de Moor (1994) (Correct)
0.4: Dynamic Programming: a different perspective - Curtis (1997) (Correct)
Similar documents based on text: More All
0.1: Virtual Data Structures - Swierstra, de Moor (1993) (Correct)
0.1: Container Types Categorically - Hoogendijk, de Moor (2000) (Correct)
0.1: First-class Attribute Grammars - de Moor, Backhouse, Swierstra (2000) (Correct)
Related documents from co-citation: More All
4: From dynamic programming to greedy algorithms - Bird, de Moor - 1992
3: Shortest connection networks and some generalizations (context) - Prim - 1957
3: Available via anonymous ftp from ftp (context) - Aarts, Backhouse et al. - 1992
BibTeX entry: (Update)
R.S.Bird and O.de Moor. Between Dynamic Programming and Greedy: Data Compression. Lecture Notes, International Summer School on Constructive Algorithmics, vol. 2, 1992. http://citeseer.ist.psu.edu/bird95between.html More
@misc{ bird92between,
author = "R. Bird and O. de Moor",
title = "Between Dynamic Programming and Greedy: Data Compression",
text = "R.S.Bird and O.de Moor. Between Dynamic Programming and Greedy: Data Compression.
Lecture Notes, International Summer School on Constructive Algorithmics,
vol. 2, 1992.",
year = "1992",
url = "citeseer.ist.psu.edu/bird95between.html" }
Citations (may not include all citations):359 Introduction to Higher Order Categorical Logic (context) - Lambek, Scott - 1986
293 Programming from Specifications (context) - Morgan - 1990
114 A calculus of refinements for program derivation (context) - Back - 1988
67 Formal Aspects of Computing (context) - Meertens, appear - 1990
63 Data compression via textual substitution (context) - Storer, Szymanski - 1982
43 Logic and Computation (context) - Paulson - 1988
36 functions and machine learning (context) - Michie - 1968
34 Theoretical Computer Science (context) - Crochemore, repetitions - 1986
30 Texts and Monographs in Computer Science (context) - Wirth, Modula- - 1983
17 From dynamic programming to greedy algorithms - Bird, de Moor - 1992
16 Bicategories of spans and relations (context) - Carboni, Kasangian - 1984
15 Solving optimisation problems with catamorphisms - Bird, de Moor - 1992
11 Introduction to Operations Research (context) - Ecker, Kupferschmid - 1988
10 Technical Monograph PRG (context) - de Moor, relations et al. - 1992
9 volume 39 of Mathematical Library (context) - Freyd, Scedrov et al. - 1990
7 categorical approach to geometric morphisms (context) - Carboni, Kelly et al. - 1991
7 Galois connections presented calculationally - Aarts - 1992
7 Department of Mathematics and Computing Science (context) - Backhouse, Hoogendijk et al. - 1992
6 Journal of Pure and Applied Algebra (context) - Jay - 1988
6 Inductive data types for predicate transformers - de Moor - 1992
5 The principle of optimality in the design of efficient algor.. (context) - Helman - 1986
2 Available via anonymous ftp from cpsc (context) - Cockett, Fukushima et al. - 1991
1 volume 9 of Notes on Pure Mathematics (context) - Brook, Recursion - 1977
1 User's guide for the diagram macros (context) - Borceux - 1990
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.comlab.oxford.ac.uk/oucl/users/oege.demoor/pubs.htm): More
Bridging the Algorithm Gap: A Linear-time Functional Program .. - de Moor, Gibbons (1999) (Correct)
Higher-order Matching for Program Transformation - de Moor, Sittampalam (1999) (Correct)
What is a Data Type? - Hoogendijk, de Moor (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC