default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID8. CAAP 1983: L'Aquila, Italy
- Giorgio Ausiello, Marco Protasi:
CAAP'83, Trees in Algebra and Programming, 8th Colloquium, L'Aquila, Italy, March 9-11, 1983, Proceedings. Lecture Notes in Computer Science 159, Springer 1983, ISBN 3-540-12727-5
Invited Lectures
- Manfred Broy, Martin Wirsing:
Generalized Heterogeneous Algebras and Partial Interpretations. 1-34 - Mario Coppo, Mariangiola Dezani-Ciancaglini, Giuseppe Longo:
Applicative Information Systems. 35-64 - Ronald Fagin:
Acyclic Database Schemes (of Various Degrees): A Painless Introduction. 65-89 - Zvi Galil:
Efficient Algorithms for Finding Maximal Matching in Graphs. 90-113 - Dirk Janssens, Grzegorz Rozenberg:
A Survey of NLC Grammars. 114-128
Contributed Papers
- Joffroy Beauquier:
Prefix and Perfect Languages. 129-140 - Eike Best, M. W. Shields:
Some Equivalence Results for Free Choice Nets and Simple Nets and on the Periodicity of Live Free Choice Nets. 141-154 - Maurizio A. Bonuccelli, Elena Lodi, Fabrizio Luccio, Piero Maestrini, Linda Pagli:
VLSI Mesh of Trees for Data Base Processing. 155-166 - M. F. Claerebout, Eric Lilin:
Continuite des transducteurs d'états finis d'arbes. 167-178 - Mario Coppo, Elio Giovannetti:
Completeness Results for a Polymorphic Type System. 179-190 - Bruno Courcelle, F. Lavandier:
A Class of Program Schemes Based on Tree Rewriting Systems. 191-204 - François Fages, Gérard P. Huet:
Complete Sets of Unifiers and Matchers in Equational Theories. 205-220 - Philippe Flajolet, Nasser Saheb:
Digital Search Trees and the Generation of an Exponentially Distributed Variate. 221-235 - Jacob Gonczaroski:
Decidable Properties of Monadic Recursive Schemas with a Depth Parameter. 236-254 - Sorin Istrail, Cristian Masalagiu:
Nivat-Processing Systems: Decision Problems Related to Protection and Synchronization. 255-268 - Jean-Pierre Jouannaud:
Confluent and Coherent Equational Term Rewriting Systems: Application to Proofs in Abstract Data Types. 269-283 - Andrzej Lingas:
An Application of Maximum Bipartite C-Matching to Subtree Isomorphism. 284-299 - Bernd Mahr, Johann A. Makowsky:
Characterizing Specification Languages Which Admit Initial Semantics. 300-316 - Fillia Makedon, Christos H. Papadimitriou, Ivan Hal Sudborough:
Topological Bandwidth. 317-331 - Alberto Marchetti-Spaccamela
, Maurizio Talamo:
Probabilistic Analysis of Graph Colouring Algorithms. 332-340 - Burkhard Monien, Ewald Speckenmeyer:
Some Further Approximation Algorithms for the Vertex Cover Problem. 341-349 - Jan Paredaens, Dirk Van Gucht:
An Application of the Theory of Graphs and Hypergraphs to the Decomposition of Relational Database Schemes. 350-366 - Wojciech Rytter:
Remarks on the Pyramidal Structure. 367-376 - Donald Sannella, Rod M. Burstall:
Structured Theories in LCF. 377-391 - Giora Slutzki:
Alternating Tree Automata. 392-404 - Marisa Venturini Zilli:
Cofinality in Reduction Graphs. 405-416
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-11-11 21:35 CET 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:
