Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > CAAP ' 81: Trees in Algebra and Programming /6th Colloquium, Genoa, March 5-7, 1981. Proceedings > Efficient optimization of monotonic functions on trees
CAAP ' 81: Trees in Algebra and Programming /6th Colloquium, Genoa, March 5-7, 1981. Proceedings |
E. Astesiano; C. Böhm
Springer Berlin Heidelberg
CAAP ' 81: Trees in Algebra and Programming /6th Colloquium, Genoa, March 5-7, 1981. Proceedings
Efficient optimization of monotonic functions on trees
Authors

Yehoshua Perl; Yossi Shiloach

ARI Id

1664964078780_4256842

Access

Not Available Free

Pages

332-339

DOI

10.1007/3-540-10828-9_73

Chapter URL

https://rd.springer.com/chapter/10.1007/3-540-10828-9_73

Table of Contents of Book
Showing 1 to 20 of 26 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
Algebraic theory of parameterized specifications with requirements
Hartmut Ehrig
1-24
A modal characterisation of observable machine-behaviour
R. Milner
25-34
Trees as data and file structures
J. Nievergelt
35-45
Infinitary relations
Maurice Nivat
46-75
Full approximability of a class of problems over power sets
G. Ausiello; A. Marchetti Spaccamela; M. Protasi
76-87
How to compute generators for the intersection of subgroups in free groups
J. Avenhaus; K. Madlener
88-100
Abstract data types and rewriting systems: Application to the programming of Algebraic Abstract Data Types in PROLOG
Marc Bergman; Pierre Deransart
101-116
Top-down tree-transducers for infinite trees I
J. Bilstein; W. Damm
117-134
Easy solutions are hard to find
Stephen L. Bloom; David B. Patterson
135-146
Une semantique pour les arbres non deterministes
G. Boudol
147-161
On the algebraic specification of nondeterministic programming languages
M. Broy; M. Wirsing
162-179
Applied tree enumerations
Nachum Dershowitz; Shmuel Zaks
180-193
Evaluation d'arbre pour un calcul formel (application a l'enumeration de proteines)
Marie-Pierre Franchi-Zannettacci
194-210
On pushdown tree automata
Irène Guessarian
211-223
Initial and terminal algebra semantics of parameterized abstract data type specifications with inequalities
Günter Hornung; Peter Raulefs
224-237
Calcul du rang des ∑-arbres infinis regulers
G. Jacob
238-254
A class of tree-like UNION-FIND data structures and the nonlinearity
Marek J. Lao
255-267
Grammars without erasing rules. the OI case
Bernard Leguy
268-279
Proprietes de cloture d'une extension de transducteurs d'arbres deterministes
Eric Lilin
280-289
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 26 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings