CAAP '83
8th Colloquium on Trees in Algebra and Programming, March 9-11, 1983, Proceedings. Partly in French
(Sprache: Englisch, Französisch)
With contributions by numerous experts
Leider schon ausverkauft
versandkostenfrei
Buch
Fr. 139.90
inkl. MwSt.
- Kreditkarte, Paypal, Rechnungskauf
- 30 Tage Widerrufsrecht
Produktdetails
Produktinformationen zu „CAAP '83 “
With contributions by numerous experts
Klappentext zu „CAAP '83 “
With contributions by numerous experts
Inhaltsverzeichnis zu „CAAP '83 “
Generalized heterogeneous algebras and partial interpretations.- Applicative information systems.- Acyclic database schemes (of various degrees): A painless introduction.- Efficient algorithms for finding maximal matching in graphs.- A survey of NLC grammars.- Prefix and perfect languages.- Some equivalence results for free choice nets and simple nets and on the periodicity of live free choice nets.- VLSI mesh of trees for data base processing.- Continuite des transducteurs d'etats finis d'arbres.- Completeness results for a polymorphic type system.- A class of program schemes based on tree rewriting systems.- Complete sets of unifiers and matchers in equational theories.- Digital search trees and the generation of an exponentially distributed variate.- Decidable properties of monadic recursive schemas with a depth parameter.- Nivat-processing systems: Decision problems related to protection and synchronization.- Confluent and coherent equational term rewriting systems application to proofs in abstract data types.- An application of maximum bipartite c-matching to subtree isomorphism'.- Characterizing specification languages which admit initial semantics.- Topological bandwidth.- Probabilistic analysis of graph colouring algorithms.- Some further approximation algorithms for the vertex cover problem.- An application of the theory of graphs and hypergraphs to the decomposition of relational database schemes.- Remarks on the pyramidal structure.- Structured theories in LCF.- Alternating tree automata.- Cofinality in reduction graphs.
Autoren-Porträt
Giorgio Ausiello is Professor Emeritus in the Dipartimento di Ingegneria Informatica, Automatica e Gestionale, Università di Roma "La Sapienza". He has coauthored numerous formal academic journal and conference publications. He has chaired many related conferences and research groups, and he was a founding member of the European Association for Theoretical Computer Science (EATCS), and its President from 2006 to 2009. His main research interests include on-line algorithms, approximation algorithms, dynamic graph algorithms, optimization problems in vehicle routing and logistics, and streaming algorithms; he has also researched and published on programming theorys, computational complexity, and database theory.
Bibliographische Angaben
- 1983, 1983, 418 Seiten, Masse: 15,5 x 23,5 cm, Kartoniert (TB), Französisch/Englisch
- Mitarbeit: Ausiello, Giorgio; Protasi, M.
- Herausgegeben: M. Protasi, G. Ausiello
- Verlag: Springer
- ISBN-10: 3540127275
- ISBN-13: 9783540127277
- Erscheinungsdatum: 01.10.1983
Sprache:
Englisch, Französisch
Kommentar zu "CAAP '83"
0 Gebrauchte Artikel zu „CAAP '83“
Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
---|
Schreiben Sie einen Kommentar zu "CAAP '83".
Kommentar verfassen