Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID6. CAAP 1981: Genoa, Italy
- Egidio Astesiano, Corrado Böhm:
CAAP '81, Trees in Algebra and Programming, 6th Colloquium, Genoa, Italy, March 5-7, 1981, Proceedings. Lecture Notes in Computer Science 112, Springer 1981, ISBN 3-540-10828-9
Invited Lectures
- Hartmut Ehrig:
Algebraic Theory of Parameterized Specifications with Requirements. 1-24 - Robin Milner:
A Modal Characterisation of Observable Machine-Behaviour. 25-34 - Jürg Nievergelt:
Trees as Data and File Structures. 35-45 - Maurice Nivat:
Infinitary Relations. 46-75
Contributed Papers
- Giorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi:
Full Approximatibility of a Class of Problems over Power Sets. 76-87 - Jürgen Avenhaus, Klaus Madlener:
How to Compute Generators for the Intersection of Subgroups in Free Groups. 88-100 - Marc Bergman, Pierre Deransart:
Abstract Data Types and Rewriting Systems: Application to the Programming of Algebraic Abstract Data Types in Prolog. 101-116 - J. Bilstein, Werner Damm:
Top-Down Tree-Transducers for Infinite Trees I. 117-134 - Stephen L. Bloom, David B. Patterson:
Easy Solutions are Hard To Find. 135-146 - Gérard Boudol:
Une Semantique Pour Les Arbres Non Deterministes. 147-161 - Manfred Broy, Martin Wirsing:
On the Algebraic Specification of Nondeterministic Programming Languages. 162-179 - Nachum Dershowitz, Shmuel Zaks:
Applied Tree Enumerations. 180-193 - Marie-Pierre Franchi-Zannettacci:
Evaluation d'Arbre Pour un Calcul Formel (Application a l'Enumeration de Proteines). 194-210 - Irène Guessarian:
On Pushdown Tree Automata. 211-223 - Günter Hornung, Peter Raulefs:
Initial and Terminal Algebra Semantics of Parameterized Abstract Data Type Specifications With Inequalities. 224-237 - Gérard Jacob:
Calcul du Rang des sum-Arbres Infinis Reguliers. 238-254 - Marek J. Lao:
A Class of Tree-Like UNION-FIND Data Structures and the Nonlinearity. 255-267 - Bernard Leguy:
Grammars Without Erasing Rules - The OI Case. 268-279 - Eric Lilin:
Proprietes de Cloture d'une Extension de Transducteurs d'Arbres Deterministes. 280-289 - Andrzej Lingas:
Certain Algorithms for Subgraph Isomorphism Problems. 290-307 - Giancarlo Mauri
, Nicoletta Sabadini:
A # P-Complete Problem over Arithmetical Trees. 308-315 - Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi:
Trees in Kripke Models and in an Intuitionistic Refutation System. 316-331 - Yehoshua Perl, Yossi Shiloach:
Efficient Optimization of Monotonic Functions on Trees. 332-339 - N. Polian:
Differents Types de Derivations Infinites Dans les Grammaires Algebriques d'Arbres. 340-349 - Simona Ronchi Della Rocca:
Discriminability of Infinite Sets of Terms in the Dinfinity-Models of the lambda-calculus. 350-364
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-18 20:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
