Conferences in DBLP
Hartmut Ehrig Algebraic Theory of Parameterized Specifications with Requirements. [Citation Graph (0, 0)][DBLP ] CAAP, 1981, pp:1-24 [Conf ] Robin Milner A Modal Characterisation of Observable Machine-Behaviour. [Citation Graph (0, 0)][DBLP ] CAAP, 1981, pp:25-34 [Conf ] Jürg Nievergelt Trees as Data and File Structures. [Citation Graph (1, 0)][DBLP ] CAAP, 1981, pp:35-45 [Conf ] Maurice Nivat Infinitary Relations. [Citation Graph (0, 0)][DBLP ] CAAP, 1981, pp:46-75 [Conf ] Giorgio Ausiello , Alberto Marchetti-Spaccamela , Marco Protasi Full Approximatibility of a Class of Problems over Power Sets. [Citation Graph (0, 0)][DBLP ] CAAP, 1981, pp:76-87 [Conf ] Jürgen Avenhaus , Klaus Madlener How to Compute Generators for the Intersection of Subgroups in Free Groups. [Citation Graph (0, 0)][DBLP ] CAAP, 1981, pp:88-100 [Conf ] Marc Bergman , Pierre Deransart Abstract Data Types and Rewriting Systems: Application to the Programming of Algebraic Abstract Data Types in Prolog. [Citation Graph (0, 0)][DBLP ] CAAP, 1981, pp:101-116 [Conf ] J. Bilstein , Werner Damm Top-Down Tree-Transducers for Infinite Trees I. [Citation Graph (0, 0)][DBLP ] CAAP, 1981, pp:117-134 [Conf ] Stephen L. Bloom , David B. Patterson Easy Solutions are Hard To Find. [Citation Graph (0, 0)][DBLP ] CAAP, 1981, pp:135-146 [Conf ] Gérard Boudol Une Semantique Pour Les Arbres Non Deterministes. [Citation Graph (0, 0)][DBLP ] CAAP, 1981, pp:147-161 [Conf ] Manfred Broy , Martin Wirsing On the Algebraic Specification of Nondeterministic Programming Languages. [Citation Graph (0, 0)][DBLP ] CAAP, 1981, pp:162-179 [Conf ] Nachum Dershowitz , Shmuel Zaks Applied Tree Enumerations. [Citation Graph (0, 0)][DBLP ] CAAP, 1981, pp:180-193 [Conf ] Marie-Pierre Franchi-Zannettacci Evaluation d'Arbre Pour un Calcul Formel (Application a l'Enumeration de Proteines). [Citation Graph (0, 0)][DBLP ] CAAP, 1981, pp:194-210 [Conf ] Irène Guessarian On Pushdown Tree Automata. [Citation Graph (0, 0)][DBLP ] CAAP, 1981, pp:211-223 [Conf ] Günter Hornung , Peter Raulefs Initial and Terminal Algebra Semantics of Parameterized Abstract Data Type Specifications With Inequalities. [Citation Graph (0, 0)][DBLP ] CAAP, 1981, pp:224-237 [Conf ] Gérard Jacob Calcul du Rang des sum-Arbres Infinis Reguliers. [Citation Graph (0, 0)][DBLP ] CAAP, 1981, pp:238-254 [Conf ] Marek J. Lao A Class of Tree-Like UNION-FIND Data Structures and the Nonlinearity. [Citation Graph (0, 0)][DBLP ] CAAP, 1981, pp:255-267 [Conf ] Bernard Leguy Grammars Without Erasing Rules - The OI Case. [Citation Graph (0, 0)][DBLP ] CAAP, 1981, pp:268-279 [Conf ] Eric Lilin Proprietes de Cloture d'une Extension de Transducteurs d'Arbres Deterministes. [Citation Graph (0, 0)][DBLP ] CAAP, 1981, pp:280-289 [Conf ] Andrzej Lingas Certain Algorithms for Subgraph Isomorphism Problems. [Citation Graph (0, 0)][DBLP ] CAAP, 1981, pp:290-307 [Conf ] Giancarlo Mauri , Nicoletta Sabadini A # P-Complete Problem over Arithmetical Trees. [Citation Graph (0, 0)][DBLP ] CAAP, 1981, pp:308-315 [Conf ] Pierangelo Miglioli , Ugo Moscato , Mario Ornaghi Trees in Kripke Models and in an Intuitionistic Refutation System. [Citation Graph (0, 0)][DBLP ] CAAP, 1981, pp:316-331 [Conf ] Yehoshua Perl , Yossi Shiloach Efficient Optimization of Monotonic Functions on Trees. [Citation Graph (0, 0)][DBLP ] CAAP, 1981, pp:332-339 [Conf ] N. Polian Differents Types de Derivations Infinites Dans les Grammaires Algebriques d'Arbres. [Citation Graph (0, 0)][DBLP ] CAAP, 1981, pp:340-349 [Conf ] Simona Ronchi Della Rocca Discriminability of Infinite Sets of Terms in the Dinfinity -Models of the lambda-calculus. [Citation Graph (0, 0)][DBLP ] CAAP, 1981, pp:350-364 [Conf ]