default search action
Search dblp for Publications
export results for "toc:db/conf/caap/caap81.bht:"
@inproceedings{DBLP:conf/caap/AusielloMP81, author = {Giorgio Ausiello and Alberto Marchetti{-}Spaccamela and Marco Protasi}, editor = {Egidio Astesiano and Corrado B{\"{o}}hm}, title = {Full Approximatibility of a Class of Problems over Power Sets}, booktitle = {{CAAP} '81, Trees in Algebra and Programming, 6th Colloquium, Genoa, Italy, March 5-7, 1981, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {112}, pages = {76--87}, publisher = {Springer}, year = {1981}, url = {https://doi.org/10.1007/3-540-10828-9\_55}, doi = {10.1007/3-540-10828-9\_55}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/caap/AusielloMP81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/caap/AvenhausM81, author = {J{\"{u}}rgen Avenhaus and Klaus Madlener}, editor = {Egidio Astesiano and Corrado B{\"{o}}hm}, title = {How to Compute Generators for the Intersection of Subgroups in Free Groups}, booktitle = {{CAAP} '81, Trees in Algebra and Programming, 6th Colloquium, Genoa, Italy, March 5-7, 1981, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {112}, pages = {88--100}, publisher = {Springer}, year = {1981}, url = {https://doi.org/10.1007/3-540-10828-9\_56}, doi = {10.1007/3-540-10828-9\_56}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/caap/AvenhausM81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/caap/BergmanD81, author = {Marc Bergman and Pierre Deransart}, editor = {Egidio Astesiano and Corrado B{\"{o}}hm}, title = {Abstract Data Types and Rewriting Systems: Application to the Programming of Algebraic Abstract Data Types in Prolog}, booktitle = {{CAAP} '81, Trees in Algebra and Programming, 6th Colloquium, Genoa, Italy, March 5-7, 1981, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {112}, pages = {101--116}, publisher = {Springer}, year = {1981}, url = {https://doi.org/10.1007/3-540-10828-9\_57}, doi = {10.1007/3-540-10828-9\_57}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/caap/BergmanD81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/caap/BilsteinD81, author = {J. Bilstein and Werner Damm}, editor = {Egidio Astesiano and Corrado B{\"{o}}hm}, title = {Top-Down Tree-Transducers for Infinite Trees {I}}, booktitle = {{CAAP} '81, Trees in Algebra and Programming, 6th Colloquium, Genoa, Italy, March 5-7, 1981, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {112}, pages = {117--134}, publisher = {Springer}, year = {1981}, url = {https://doi.org/10.1007/3-540-10828-9\_58}, doi = {10.1007/3-540-10828-9\_58}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/caap/BilsteinD81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/caap/BloomP81, author = {Stephen L. Bloom and David B. Patterson}, editor = {Egidio Astesiano and Corrado B{\"{o}}hm}, title = {Easy Solutions are Hard To Find}, booktitle = {{CAAP} '81, Trees in Algebra and Programming, 6th Colloquium, Genoa, Italy, March 5-7, 1981, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {112}, pages = {135--146}, publisher = {Springer}, year = {1981}, url = {https://doi.org/10.1007/3-540-10828-9\_59}, doi = {10.1007/3-540-10828-9\_59}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/caap/BloomP81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/caap/Boudol81, author = {G{\'{e}}rard Boudol}, editor = {Egidio Astesiano and Corrado B{\"{o}}hm}, title = {Une Semantique Pour Les Arbres Non Deterministes}, booktitle = {{CAAP} '81, Trees in Algebra and Programming, 6th Colloquium, Genoa, Italy, March 5-7, 1981, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {112}, pages = {147--161}, publisher = {Springer}, year = {1981}, url = {https://doi.org/10.1007/3-540-10828-9\_60}, doi = {10.1007/3-540-10828-9\_60}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/caap/Boudol81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/caap/BroyW81, author = {Manfred Broy and Martin Wirsing}, editor = {Egidio Astesiano and Corrado B{\"{o}}hm}, title = {On the Algebraic Specification of Nondeterministic Programming Languages}, booktitle = {{CAAP} '81, Trees in Algebra and Programming, 6th Colloquium, Genoa, Italy, March 5-7, 1981, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {112}, pages = {162--179}, publisher = {Springer}, year = {1981}, url = {https://doi.org/10.1007/3-540-10828-9\_61}, doi = {10.1007/3-540-10828-9\_61}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/caap/BroyW81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/caap/DershowitzZ81, author = {Nachum Dershowitz and Shmuel Zaks}, editor = {Egidio Astesiano and Corrado B{\"{o}}hm}, title = {Applied Tree Enumerations}, booktitle = {{CAAP} '81, Trees in Algebra and Programming, 6th Colloquium, Genoa, Italy, March 5-7, 1981, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {112}, pages = {180--193}, publisher = {Springer}, year = {1981}, url = {https://doi.org/10.1007/3-540-10828-9\_62}, doi = {10.1007/3-540-10828-9\_62}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/caap/DershowitzZ81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/caap/Ehrig81, author = {Hartmut Ehrig}, editor = {Egidio Astesiano and Corrado B{\"{o}}hm}, title = {Algebraic Theory of Parameterized Specifications with Requirements}, booktitle = {{CAAP} '81, Trees in Algebra and Programming, 6th Colloquium, Genoa, Italy, March 5-7, 1981, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {112}, pages = {1--24}, publisher = {Springer}, year = {1981}, url = {https://doi.org/10.1007/3-540-10828-9\_51}, doi = {10.1007/3-540-10828-9\_51}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/caap/Ehrig81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/caap/Franchi-Zannettacci81, author = {Marie{-}Pierre Franchi{-}Zannettacci}, editor = {Egidio Astesiano and Corrado B{\"{o}}hm}, title = {Evaluation d'Arbre Pour un Calcul Formel (Application a l'Enumeration de Proteines)}, booktitle = {{CAAP} '81, Trees in Algebra and Programming, 6th Colloquium, Genoa, Italy, March 5-7, 1981, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {112}, pages = {194--210}, publisher = {Springer}, year = {1981}, url = {https://doi.org/10.1007/3-540-10828-9\_63}, doi = {10.1007/3-540-10828-9\_63}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/caap/Franchi-Zannettacci81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/caap/Guessarian81, author = {Ir{\`{e}}ne Guessarian}, editor = {Egidio Astesiano and Corrado B{\"{o}}hm}, title = {On Pushdown Tree Automata}, booktitle = {{CAAP} '81, Trees in Algebra and Programming, 6th Colloquium, Genoa, Italy, March 5-7, 1981, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {112}, pages = {211--223}, publisher = {Springer}, year = {1981}, url = {https://doi.org/10.1007/3-540-10828-9\_64}, doi = {10.1007/3-540-10828-9\_64}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/caap/Guessarian81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/caap/HornungR81, author = {G{\"{u}}nter Hornung and Peter Raulefs}, editor = {Egidio Astesiano and Corrado B{\"{o}}hm}, title = {Initial and Terminal Algebra Semantics of Parameterized Abstract Data Type Specifications With Inequalities}, booktitle = {{CAAP} '81, Trees in Algebra and Programming, 6th Colloquium, Genoa, Italy, March 5-7, 1981, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {112}, pages = {224--237}, publisher = {Springer}, year = {1981}, url = {https://doi.org/10.1007/3-540-10828-9\_65}, doi = {10.1007/3-540-10828-9\_65}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/caap/HornungR81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/caap/Jacob81, author = {G{\'{e}}rard Jacob}, editor = {Egidio Astesiano and Corrado B{\"{o}}hm}, title = {Calcul du Rang des sum-Arbres Infinis Reguliers}, booktitle = {{CAAP} '81, Trees in Algebra and Programming, 6th Colloquium, Genoa, Italy, March 5-7, 1981, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {112}, pages = {238--254}, publisher = {Springer}, year = {1981}, url = {https://doi.org/10.1007/3-540-10828-9\_66}, doi = {10.1007/3-540-10828-9\_66}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/caap/Jacob81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/caap/Lao81, author = {Marek J. Lao}, editor = {Egidio Astesiano and Corrado B{\"{o}}hm}, title = {A Class of Tree-Like {UNION-FIND} Data Structures and the Nonlinearity}, booktitle = {{CAAP} '81, Trees in Algebra and Programming, 6th Colloquium, Genoa, Italy, March 5-7, 1981, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {112}, pages = {255--267}, publisher = {Springer}, year = {1981}, url = {https://doi.org/10.1007/3-540-10828-9\_67}, doi = {10.1007/3-540-10828-9\_67}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/caap/Lao81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/caap/Leguy81, author = {Bernard Leguy}, editor = {Egidio Astesiano and Corrado B{\"{o}}hm}, title = {Grammars Without Erasing Rules - The {OI} Case}, booktitle = {{CAAP} '81, Trees in Algebra and Programming, 6th Colloquium, Genoa, Italy, March 5-7, 1981, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {112}, pages = {268--279}, publisher = {Springer}, year = {1981}, url = {https://doi.org/10.1007/3-540-10828-9\_68}, doi = {10.1007/3-540-10828-9\_68}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/caap/Leguy81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/caap/Lilin81, author = {Eric Lilin}, editor = {Egidio Astesiano and Corrado B{\"{o}}hm}, title = {Proprietes de Cloture d'une Extension de Transducteurs d'Arbres Deterministes}, booktitle = {{CAAP} '81, Trees in Algebra and Programming, 6th Colloquium, Genoa, Italy, March 5-7, 1981, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {112}, pages = {280--289}, publisher = {Springer}, year = {1981}, url = {https://doi.org/10.1007/3-540-10828-9\_69}, doi = {10.1007/3-540-10828-9\_69}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/caap/Lilin81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/caap/Lingas81, author = {Andrzej Lingas}, editor = {Egidio Astesiano and Corrado B{\"{o}}hm}, title = {Certain Algorithms for Subgraph Isomorphism Problems}, booktitle = {{CAAP} '81, Trees in Algebra and Programming, 6th Colloquium, Genoa, Italy, March 5-7, 1981, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {112}, pages = {290--307}, publisher = {Springer}, year = {1981}, url = {https://doi.org/10.1007/3-540-10828-9\_70}, doi = {10.1007/3-540-10828-9\_70}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/caap/Lingas81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/caap/MauriS81, author = {Giancarlo Mauri and Nicoletta Sabadini}, editor = {Egidio Astesiano and Corrado B{\"{o}}hm}, title = {A {\#} P-Complete Problem over Arithmetical Trees}, booktitle = {{CAAP} '81, Trees in Algebra and Programming, 6th Colloquium, Genoa, Italy, March 5-7, 1981, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {112}, pages = {308--315}, publisher = {Springer}, year = {1981}, url = {https://doi.org/10.1007/3-540-10828-9\_71}, doi = {10.1007/3-540-10828-9\_71}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/caap/MauriS81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/caap/MiglioliMO81, author = {Pierangelo Miglioli and Ugo Moscato and Mario Ornaghi}, editor = {Egidio Astesiano and Corrado B{\"{o}}hm}, title = {Trees in Kripke Models and in an Intuitionistic Refutation System}, booktitle = {{CAAP} '81, Trees in Algebra and Programming, 6th Colloquium, Genoa, Italy, March 5-7, 1981, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {112}, pages = {316--331}, publisher = {Springer}, year = {1981}, url = {https://doi.org/10.1007/3-540-10828-9\_72}, doi = {10.1007/3-540-10828-9\_72}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/caap/MiglioliMO81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/caap/Milner81, author = {Robin Milner}, editor = {Egidio Astesiano and Corrado B{\"{o}}hm}, title = {A Modal Characterisation of Observable Machine-Behaviour}, booktitle = {{CAAP} '81, Trees in Algebra and Programming, 6th Colloquium, Genoa, Italy, March 5-7, 1981, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {112}, pages = {25--34}, publisher = {Springer}, year = {1981}, url = {https://doi.org/10.1007/3-540-10828-9\_52}, doi = {10.1007/3-540-10828-9\_52}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/caap/Milner81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/caap/Nievergelt81, author = {J{\"{u}}rg Nievergelt}, editor = {Egidio Astesiano and Corrado B{\"{o}}hm}, title = {Trees as Data and File Structures}, booktitle = {{CAAP} '81, Trees in Algebra and Programming, 6th Colloquium, Genoa, Italy, March 5-7, 1981, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {112}, pages = {35--45}, publisher = {Springer}, year = {1981}, url = {https://doi.org/10.1007/3-540-10828-9\_53}, doi = {10.1007/3-540-10828-9\_53}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/caap/Nievergelt81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/caap/Nivat81, author = {Maurice Nivat}, editor = {Egidio Astesiano and Corrado B{\"{o}}hm}, title = {Infinitary Relations}, booktitle = {{CAAP} '81, Trees in Algebra and Programming, 6th Colloquium, Genoa, Italy, March 5-7, 1981, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {112}, pages = {46--75}, publisher = {Springer}, year = {1981}, url = {https://doi.org/10.1007/3-540-10828-9\_54}, doi = {10.1007/3-540-10828-9\_54}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/caap/Nivat81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/caap/PerlS81, author = {Yehoshua Perl and Yossi Shiloach}, editor = {Egidio Astesiano and Corrado B{\"{o}}hm}, title = {Efficient Optimization of Monotonic Functions on Trees}, booktitle = {{CAAP} '81, Trees in Algebra and Programming, 6th Colloquium, Genoa, Italy, March 5-7, 1981, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {112}, pages = {332--339}, publisher = {Springer}, year = {1981}, url = {https://doi.org/10.1007/3-540-10828-9\_73}, doi = {10.1007/3-540-10828-9\_73}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/caap/PerlS81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/caap/Polian81, author = {N. Polian}, editor = {Egidio Astesiano and Corrado B{\"{o}}hm}, title = {Differents Types de Derivations Infinites Dans les Grammaires Algebriques d'Arbres}, booktitle = {{CAAP} '81, Trees in Algebra and Programming, 6th Colloquium, Genoa, Italy, March 5-7, 1981, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {112}, pages = {340--349}, publisher = {Springer}, year = {1981}, url = {https://doi.org/10.1007/3-540-10828-9\_74}, doi = {10.1007/3-540-10828-9\_74}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/caap/Polian81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/caap/Rocca81, author = {Simona Ronchi Della Rocca}, editor = {Egidio Astesiano and Corrado B{\"{o}}hm}, title = {Discriminability of Infinite Sets of Terms in the D\({}_{\mbox{infinity}}\)-Models of the lambda-calculus}, booktitle = {{CAAP} '81, Trees in Algebra and Programming, 6th Colloquium, Genoa, Italy, March 5-7, 1981, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {112}, pages = {350--364}, publisher = {Springer}, year = {1981}, url = {https://doi.org/10.1007/3-540-10828-9\_75}, doi = {10.1007/3-540-10828-9\_75}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/caap/Rocca81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/caap/1981, editor = {Egidio Astesiano and Corrado B{\"{o}}hm}, title = {{CAAP} '81, Trees in Algebra and Programming, 6th Colloquium, Genoa, Italy, March 5-7, 1981, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {112}, publisher = {Springer}, year = {1981}, url = {https://doi.org/10.1007/3-540-10828-9}, doi = {10.1007/3-540-10828-9}, isbn = {3-540-10828-9}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/caap/1981.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.