ICALP A*

38 papers

YearTitle / Authors
1978(Semi)-separability of Finite Sets of Terms in Scott's D_infty-Models of the lambda-Calculus.
Mario Coppo, Mariangiola Dezani-Ciancaglini, Simona Ronchi Della Rocca
1978A PSPACE Complete Problem Related to a Pebble Game.
Andrzej Lingas
1978Admissible Coherent CPO's.
Edward Sciore, A. Tang
1978Ambiguite Forte.
Joffroy Beauquier
1978Arithmetical Completeness in Logics of Programs.
David Harel
1978Automata, Languages and Programming, Fifth Colloquium, Udine, Italy, July 17-21, 1978, Proceedings
Giorgio Ausiello, Corrado Böhm
1978Characterization Problems in the Theory of Inductive Inference.
Rolf Wiehagen
1978Codes: Unequal Probabilities, Unequal Letter Costs (Extended Abstract).
Doris Altenkamp, Kurt Mehlhorn
1978Comparisons and Reset Machines (Preliminary Report).
Ronald V. Book, Sheila A. Greibach, Celia Wrathall
1978Covering a Graph by Circuits.
Alon Itai, Michael Rodeh
1978Grammars with Dynamic Control Sets.
Gerhard Barth
1978Head Recurrent Terms in Combinatory Logic: A Generalization of the Notion of Head Normal Form.
Marisa Venturini Zilli
1978Integration of the Phase-Difference Relations in Asynchronous Sequential Networks.
Tommaso Toffoli
1978Multiterminal Network Flow and Connectivity in Unsymmetrical Networks.
Claus-Peter Schnorr
1978Mutual Exclusion of N Processors Using an O(N)-Valued Message Variable (Extended Abstract).
Armin B. Cremers, Thomas N. Hibbard
1978On Constructing Efficient Evaluators for Attribute Grammars.
Mikko Saarinen
1978On Improving the Worst Case Running Time of the Boyer-Moore String Matching Algorithm.
Zvi Galil
1978On the Parsing and Covering of Simple Chain Grammars.
Anton Nijholt
1978On the Power of Self-Application and Higher Type-Recursion.
Werner Damm, Elfriede Fehr
1978Parallel and Nondeterministic Time Complexity Classes (Preliminary Report).
Walter J. Savitch
1978Path Measures of Turing Machine Computations (Preliminary Report).
Joachim Biskup
1978Relationship Between Density and Deterministic Complexity of NP-Complete Languages.
Piotr Berman
1978Self-Modifying Nets, a Natural Extension of Petri Nets.
Rüdiger Valk
1978Semantics and Correctness of Nondeterministic Flowchart Programs with Recursive Procedures.
Jean H. Gallier
1978Simple EOL Forms under Uniform Interpretation Generating CF Languages.
Jürgen Albert, Hermann A. Maurer, Grzegorz Rozenberg
1978Size-Depth Tradeoff in Boolean Formulas.
Beate Commentz-Walter
1978Some Decision Results for Recognizable Sets in Arbitrary Monoids.
Antonio Restivo
1978Some Effective Results About Linear Recursive Sequences.
Maurice Mignotte
1978Stable Models of Typed lambda-Calculi.
Gérard Berry
1978States Can Sometimes Do More Than Stack Symbols in PDA's.
John K. Price, Detlef Wotschke
1978Stepwise Specification and Implementation of Abstract Data Types.
Hartmut Ehrig, Hans-Jörg Kreowski, Peter Padawitz
1978Sul l'inversion des morphisms d'arbres.
André Arnold, Max Dauchet
1978Sur les Series Rationnelles en Variables Non Commutatives.
Christophe Reutenauer
1978Sur un Cas Particulier de la Conjecture de Cerny.
Jean-Eric Pin
1978The Complexity of Equivalence and Containment for Free Single Variable Program Schemes.
Steven Fortune, John E. Hopcroft, Erik Meineche Schmidt
1978Time and Space Bounds for Selection Problems.
David P. Dobkin, J. Ian Munro
1978Une Extension de la Theorie des Types en lambda-Calcul.
Patrick Sale
1978Une Famille Remarquable de Codes Indecomposables.
Jean-Marie Boë