| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Rolf Klein, Derick Wood |
On the Maximum Path Length of AVL Trees.  |
CAAP  |
1988 |
DBLP DOI BibTeX RDF |
brother trees, comparison cost, node visit cost, AVL trees, path length |
| 1 | Zdzislaw Habasinski |
Regular Automata and Model Checking. |
CAAP |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Max Dauchet, Maurice Nivat (eds.) |
CAAP '88, 13th Colloquium on Trees in Algebra and Programming, Nancy, France, March 21-24, 1988, Proceedings |
CAAP |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Cornelis Huizing, Rob Gerth, Willem P. de Roever |
Modeling Statecharts Behaviour in a Fully Abstract Way. |
CAAP |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | E. Pascal Gribomont |
Proving Systolic Arrays. |
CAAP |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Francesco Parisi-Presicce |
Product and Iteration of Module Specifications. |
CAAP |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Rachid Echahed |
On Comleteness of Narrowing Strategies. |
CAAP |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Nipkow |
Unification in Primal Algebras. |
CAAP |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | René Schott |
Random Walks on Trees. |
CAAP |
1986 |
DBLP DOI BibTeX RDF |
method of Darboux, generator, tree, Random walk, generating function, dynamic data structure, asymptotic behavior |
| 1 | Grazyna Mirkowska, Andrzej Salwicki |
On Applications of Algorithmic Logic. |
CAAP |
1986 |
DBLP DOI BibTeX RDF |
algorithmic logic, LOGLAN, verification, specification, program, implementation, computation, completeness, extension, modules, expressivity, inference rules, axioms, semantical properties |
| 1 | Robert Cori, Serge Dulucq |
Colourings of Planar Maps and the Equality of Two Languages. |
CAAP |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Elias Dahlhaus, Johann A. Makowsky |
Computable Directory Queries. |
CAAP |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Heiko Vogler |
Basic Tree Transducers. |
CAAP |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Philippe Devienne, Patrick Lebègue |
Weighted Graphs: A Tool for Logic Programming. |
CAAP |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Elias Dahlhaus, Manfred K. Warmuth |
Membership for Growing Context Sensitive Grammars is Polynomial. |
CAAP |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Alberto Pettorossi |
Transformation Strategies for Deriving On Line Programs. |
CAAP |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Alex Pelin, Jean H. Gallier |
Exact Computation Sequences. |
CAAP |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Philippe Jacquet, Mireille Régnier |
Trie Partitioning Process: Limiting Distributions. |
CAAP |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Bauderon, Bruno Courcelle |
An Algebraic Formalism for Graphs. |
CAAP |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Kai Salomaa |
Alternating Bottom-Up Tree Recognisers. |
CAAP |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Rafael Casas, Jean-Marc Steyaert |
Bottom-Up Recursion in Trees. |
CAAP |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrea Asperti, Giuseppe Longo |
Relating Type-Structures: Partial Variations on a Theme of Friedman and Statman. |
CAAP |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Joffroy Beauquier, Béatrice Bérard |
On the Equivalence of Synchronization Sets. |
CAAP |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Gheorghe Stefanescu |
An Algebraic Theory of Flowchart Schemes. |
CAAP |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Rinat, Nissim Francez, Orna Grumberg |
Infinite Trees, Markings and Well Foundedness. |
CAAP |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric G. Wagner |
A Categorical Treatment of Pre- and Post Conditions. |
CAAP |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Francesco Parisi-Presicce |
Inner and Mutual Compatibility of Basic Operations on Module Specifications. |
CAAP |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Gilberto Filé |
Classical and Incremental Evaluators for Attribute Grammars. |
CAAP |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Louchard |
Random Walks, Gaussian Processes, and List Structures. |
CAAP |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Franchi-Zannettacci (eds.) |
CAAP '86, 11th Colloquium on Trees in Algebra and Programming, Nice, France, March 24-26, 1986, Proceedings |
CAAP |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | David de Frutos-Escrig |
Probabilistic Ianov's Schemes. |
CAAP |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronald I. Becker, Stephen R. Schach |
A Bottom-Up Algorithm for Weight- and Height-Bounded Minimal Partitions of Trees. |
CAAP |
1984 |
DBLP BibTeX RDF |
|
| 1 | A. Kanda |
Numeration Models of Lambda-Calculus. |
CAAP |
1984 |
DBLP BibTeX RDF |
|
| 1 | Jean-Pierre Braquelaire |
Graphs and Rational Expressions Denoting Regular Trees. |
CAAP |
1984 |
DBLP BibTeX RDF |
|
| 1 | M. Soria, Jean-Marc Steyaert |
Average Efficiency of Pattern Matching on LISP Expressions. |
CAAP |
1984 |
DBLP BibTeX RDF |
|
| 1 | Bruno Courcelle (eds.) |
CAAP'84, 9th Colloquium on Trees in Algebra and Programming, Bordeaux, France, March 5-7, 1984, Proceedings |
CAAP |
1984 |
DBLP BibTeX RDF |
|
| 1 | Ingo Wegener |
Optimal Decisions Trees and One-Time-Only Branching Programs for Symmetric Boolean Functions. |
CAAP |
1984 |
DBLP BibTeX RDF |
|
| 1 | Wolfgang Thomas |
Logical Aspects in the Study of Tree Languages. |
CAAP |
1984 |
DBLP BibTeX RDF |
|
| 1 | K. Theobald |
A Theory of Representable Cpo's. |
CAAP |
1984 |
DBLP BibTeX RDF |
|
| 1 | Jean-Claude Raoult |
On Graph Rewritings. |
CAAP |
1984 |
DBLP BibTeX RDF |
|
| 1 | Giuseppe Longo |
Continuous Structures and Analytic Methods in Computer Science. |
CAAP |
1984 |
DBLP BibTeX RDF |
|
| 1 | Laurence Puel |
Proofs in the Final Algebra. |
CAAP |
1984 |
DBLP BibTeX RDF |
|
| 1 | Kurt Mehlhorn |
On Optimal VLSI-Circuits for the Basic Arithmetic Functions. |
CAAP |
1984 |
DBLP BibTeX RDF |
|
| 1 | Pierre Lescanne |
Uniform Termination of Term Rewriting Systems: Recursive Decomposition Ordering with Status. |
CAAP |
1984 |
DBLP BibTeX RDF |
|
| 1 | Michael Kaufmann 0001 |
Nearly Tight Bounds for the Longest Edge in an Tree in a VLSI Lay Out. |
CAAP |
1984 |
DBLP BibTeX RDF |
|
| 1 | Grzegorz Rozenberg, Emo Welzl |
Boundary NLC Grammars. |
CAAP |
1984 |
DBLP BibTeX RDF |
|
| 1 | Jean Françon, Claude Puech |
Histoires de Files de Priorite avec Fusions. |
CAAP |
1984 |
DBLP BibTeX RDF |
|
| 1 | E. Paul |
Proofs by Inducting in Equational Theories with Relations Between Constructors. |
CAAP |
1984 |
DBLP BibTeX RDF |
|
| 1 | Joost Engelfriet, Heiko Vogler |
Regular Characterizations of Macro Tree Transducers. |
CAAP |
1984 |
DBLP BibTeX RDF |
|
| 1 | Satoru Miyano, Takeshi Hayashi 0004 |
Alternating Finite Automata on omega-Words. |
CAAP |
1984 |
DBLP BibTeX RDF |
|
| 1 | Didier Arquès, Jean Françon |
Arbres Bien Etiquetes et Fractions Multicontinues. |
CAAP |
1984 |
DBLP BibTeX RDF |
|
| 1 | Martin Gogolla |
Partially Ordered Sorts in Algebraic Specifications. |
CAAP |
1984 |
DBLP BibTeX RDF |
|
| 1 | Nachum Dershowitz, Shmuel Zaks |
Patterns in Trees. |
CAAP |
1984 |
DBLP BibTeX RDF |
|
| 1 | E. Timmermann |
Yields of Infinite Trees. |
CAAP |
1984 |
DBLP BibTeX RDF |
|
| 1 | Mario Coppo, Mariangiola Dezani-Ciancaglini, Giuseppe Longo |
Applicative Information Systems. |
CAAP |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Giorgio Ausiello, Marco Protasi (eds.) |
CAAP'83, Trees in Algebra and Programming, 8th Colloquium, L'Aquila, Italy, March 9-11, 1983, Proceedings |
CAAP |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Giora Slutzki |
Alternating Tree Automata. |
CAAP |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Lingas |
An Application of Maximum Bipartite C-Matching to Subtree Isomorphism. |
CAAP |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Manfred Broy, Martin Wirsing |
Generalized Heterogeneous Algebras and Partial Interpretations. |
CAAP |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Burkhard Monien, Ewald Speckenmeyer |
Some Further Approximation Algorithms for the Vertex Cover Problem. |
CAAP |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Zvi Galil |
Efficient Algorithms for Finding Maximal Matching in Graphs. |
CAAP |
1983 |
DBLP DOI BibTeX RDF |
Shmathematics, algorithmic tools, monsters, polygamy, the asexual case, the assignment problem, moonlighting, augmenting path, ET, shrink, The Main Theorem of Botany, The ACM Longest Paper Award, generalized priority queue, d-heap, warm-up, primaldual, sexual discrimination, affirmative action, joint income tax return, data structures, matching, duality, blossoms |
| 1 | Marisa Venturini Zilli |
Cofinality in Reduction Graphs. |
CAAP |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Alberto Marchetti-Spaccamela, Maurizio Talamo |
Probabilistic Analysis of Graph Colouring Algorithms. |
CAAP |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Paredaens, Dirk Van Gucht |
An Application of the Theory of Graphs and Hypergraphs to the Decomposition of Relational Database Schemes. |
CAAP |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Sorin Istrail, Cristian Masalagiu |
Nivat-Processing Systems: Decision Problems Related to Protection and Synchronization. |
CAAP |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Dirk Janssens, Grzegorz Rozenberg |
A Survey of NLC Grammars. |
CAAP |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-Pierre Jouannaud |
Confluent and Coherent Equational Term Rewriting Systems: Application to Proofs in Abstract Data Types. |
CAAP |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Fillia Makedon, Christos H. Papadimitriou, Ivan Hal Sudborough |
Topological Bandwidth. |
CAAP |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Wojciech Rytter |
Remarks on the Pyramidal Structure. |
CAAP |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle, F. Lavandier |
A Class of Program Schemes Based on Tree Rewriting Systems. |
CAAP |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Donald Sannella, Rod M. Burstall |
Structured Theories in LCF. |
CAAP |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronald Fagin |
Acyclic Database Schemes (of Various Degrees): A Painless Introduction. |
CAAP |
1983 |
DBLP DOI BibTeX RDF |
Additional Key Words and Phrases acyclic, database scheme, relational database, hypergraph |
| 1 | Maurizio A. Bonuccelli, Elena Lodi, Fabrizio Luccio, Piero Maestrini, Linda Pagli |
VLSI Mesh of Trees for Data Base Processing. |
CAAP |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Eike Best, M. W. Shields |
Some Equivalence Results for Free Choice Nets and Simple Nets and on the Periodicity of Live Free Choice Nets. |
CAAP |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacob Gonczaroski |
Decidable Properties of Monadic Recursive Schemas with a Depth Parameter. |
CAAP |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Mario Coppo, Elio Giovannetti |
Completeness Results for a Polymorphic Type System. |
CAAP |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Philippe Flajolet, Nasser Saheb |
Digital Search Trees and the Generation of an Exponentially Distributed Variate. |
CAAP |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | M. F. Claerebout, Eric Lilin |
Continuite des transducteurs d'états finis d'arbes. |
CAAP |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Joffroy Beauquier |
Prefix and Perfect Languages. |
CAAP |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernd Mahr, Johann A. Makowsky |
Characterizing Specification Languages Which Admit Initial Semantics. |
CAAP |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | François Fages, Gérard P. Huet |
Complete Sets of Unifiers and Matchers in Equational Theories. |
CAAP |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Jürg Nievergelt |
Trees as Data and File Structures. |
CAAP |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Irène Guessarian |
On Pushdown Tree Automata. |
CAAP |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Gérard Boudol |
Une Semantique Pour Les Arbres Non Deterministes. |
CAAP |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi |
Trees in Kripke Models and in an Intuitionistic Refutation System. |
CAAP |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Günter Hornung, Peter Raulefs |
Initial and Terminal Algebra Semantics of Parameterized Abstract Data Type Specifications With Inequalities. |
CAAP |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Robin Milner |
A Modal Characterisation of Observable Machine-Behaviour. |
CAAP |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | N. Polian |
Differents Types de Derivations Infinites Dans les Grammaires Algebriques d'Arbres. |
CAAP |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Egidio Astesiano, Corrado Böhm (eds.) |
CAAP '81, Trees in Algebra and Programming, 6th Colloquium, Genoa, Italy, March 5-7, 1981, Proceedings |
CAAP |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek J. Lao |
A Class of Tree-Like UNION-FIND Data Structures and the Nonlinearity. |
CAAP |
1981 |
DBLP DOI BibTeX RDF |
computational complexity, data structures, trees, UNION-FIND, set union |
| 1 | J. Bilstein, Werner Damm |
Top-Down Tree-Transducers for Infinite Trees I. |
CAAP |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Lingas |
Certain Algorithms for Subgraph Isomorphism Problems. |
CAAP |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Maurice Nivat |
Infinitary Relations. |
CAAP |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Giorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi |
Full Approximatibility of a Class of Problems over Power Sets. |
CAAP |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Lilin |
Proprietes de Cloture d'une Extension de Transducteurs d'Arbres Deterministes. |
CAAP |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Giancarlo Mauri, Nicoletta Sabadini |
A # P-Complete Problem over Arithmetical Trees. |
CAAP |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Hartmut Ehrig |
Algebraic Theory of Parameterized Specifications with Requirements. |
CAAP |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Manfred Broy, Martin Wirsing |
On the Algebraic Specification of Nondeterministic Programming Languages. |
CAAP |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernard Leguy |
Grammars Without Erasing Rules - The OI Case. |
CAAP |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Gérard Jacob |
Calcul du Rang des sum-Arbres Infinis Reguliers. |
CAAP |
1981 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license