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