scientific article; zbMATH DE number 977284

Publication date: 11 February 1997

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

dynamic programming greedy algorithm thinning algorithms optimisation problems

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Discrete mathematics in relation to computer science (68R99)

Related Items

Components as coalgebras: the refinement dimension, Kleisli, Parikh and Peleg compositions and liftings for multirelations, Evolution of rule-based programs, Stone Relation Algebras, Allegories and Collagories for Transformation of Graph Structures Considered as Coalgebras, Unnamed Item, ``Keep definition, change category -- a practical approach to state-based system calculi, Why mathematics needs engineering, Formal derivation of greedy algorithms from relational specifications: a tutorial, Kernels, in a nutshell, Relation-Algebraic Verification of Prim’s Minimum Spanning Tree Algorithm, An Algebraic Calculus of Database Preferences, Convexity via Weak Distributive Laws, The HOL-Omega Logic, Typed Linear Algebra for Weigthed (Probabilistic) Automata, Relation Algebras, Matrices, and Multi-valued Decision Diagrams, Transposing partial components--an exercise on coalgebraic refinement, A perspective on service orchestration, A coalgebraic perspective on logical interpretations, Imperative abstractions for functional actions, Determinisation of relational substitutions in ordered categories with domain, Cardinality functions in allegories, Contributions to a computational theory of policy advice and avoidability, Transport of finiteness structures and applications, A Relation-Algebraic Approach to Multirelations and Predicate Transformers, Components and acyclicity of graphs. An exercise in combining precision with concision, Shortcut fusion rules for the derivation of circular and higher-order programs, Programming from metaphorisms, Verifying the Correctness of Disjoint-Set Forests with Kleene Relation Algebras, Typing theorems of omega algebra, Programming from Galois connections, Cardinality in Allegories, An Ordered Category of Processes, Towards ``mouldable code via nested code graph transformation, A relation-algebraic approach to the ``Hoare logic of functional dependencies, On difunctions, Synthesis of implementations for divide-and-conquer specifications, Map fusion for nested datatypes in intensional type theory, Towards a linear algebra of programming, Fantastic morphisms and where to find them. A guide to recursion schemes, Dependences between domain constructions in heterogeneous relation algebras, Characterizing functions mappable over GADTs, Lax Liftings and Lax Distributive Laws, Pointfree expression and calculation: From quantification to temporal logic, Unnamed Item, A calculus for generic, QoS-aware component composition, Unifying structured recursion schemes, Zippy Tabulations of Recursive Functions, Algebra of Programming Using Dependent Types, A representation theorem for second-order functionals, Indexed containers, Interleaving data and effects, Calculating a linear-time solution to the densest-segment problem, Hume box calculus: Robust system development through software transformation, Relational semigroupoids: abstract relation-algebraic interfaces for finite relations between infinite types, A Single Complete Relational Rule for Coalgebraic Refinement, Modelling higher-order dual nondeterminacy, NESTED ALGORITHMIC SKELETONS FROM HIGHER ORDER FUNCTIONS, Genetic programming \(+\) proof search \(=\) automatic improvement, An algebraic approach to multirelations and their properties, Verifying minimum spanning tree algorithms with Stone relation algebras, Process Calculi à la Bird-Meertens, When is a function a fold or an unfold?, Stably Compact Spaces and Closed Relations, A short cut to optimal sequences, Transformation of structure-shy programs with application to XPath queries and strategic functions, Dedekind categories with cutoff operators, Iteration and coiteration schemes for higher-order and nested datatypes, Fusion of recursive programs with computational effects, Finite quasivarieties and self-referential conditions, A formalisation of the copy-modify-merge approach to version control in MDE, Extended Static Checking by Calculation Using the Pointfree Transform, Normal forms for binary relations, Calculational relation-algebraic proofs in the teaching tool \textsc{CalcCheck}, An algebraic framework for minimum spanning tree problems, Incremental Computing with Abstract Data Structures, Type Fusion, Declarative pearl: deriving monadic quicksort, High-level signatures and initial semantics, Sufficient and necessary conditions for solution finding in valuation-based systems, Libraries for Generic Programming in Haskell, On the algebraic structure of declarative programming languages, Denotation by Transformation, A Local Graph-rewriting System for Deciding Equality in Sum-product Theories, Extensional equality preservation and verified generic programming, Point axioms and related conditions in Dedekind categories, A greedy algorithm for dropping digits, Longest segment of balanced parentheses: an exercise in program inversion in a segment problem, An Exercise on Transition Systems, A linear algebra approach to OLAP