The SCEAS System
Navigation Menu

Conferences in DBLP

International Colloquium on Automata, Languages and Programming (ICALP) (icalp)
1979 (conf/icalp/1979)

  1. Egidio Astesiano, Gerardo Costa
    Sharing in Nondeterminism. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:1-15 [Conf]
  2. Jean Berstel
    Sur les mots sans carré définis par un morphisme. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:16-25 [Conf]
  3. Alberto Bertoni, Giancarlo Mauri, Pierangelo Miglioli
    A Characterization of Abstract Data as Model-Theoretic Invariants. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:26-37 [Conf]
  4. Meera Blattner
    Inherent Ambiguities in Families of Grammars (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:38-48 [Conf]
  5. Ronald V. Book, Franz-Josef Brandenburg
    Representing Complexity Classes by Equality Sets (Preliminary Report). [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:49-57 [Conf]
  6. Burchard von Braunmühl, Eckehart Hotzel
    Supercounter Machines. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:58-72 [Conf]
  7. Manfred Broy, Walter Dosch, Helmuth Partsch, Peter Pepper, Martin Wirsing
    Existential Quantifiers in Abstract Data Types. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:73-87 [Conf]
  8. Christian Choffrut
    A Generalization of Ginsburg and Rose's Characterization of G-S-M Mappings. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:88-103 [Conf]
  9. Laurent Chottin
    Strict Deterministic Languages and Controlled Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:104-117 [Conf]
  10. Beate Commentz-Walter
    A String Matching Algorithm Fast on the Average. [Citation Graph (1, 0)][DBLP]
    ICALP, 1979, pp:118-132 [Conf]
  11. Mario Coppo, Mariangiola Dezani-Ciancaglini, Patrick Sallé
    Functional Characterization of Some Semantic Equalities inside Lambda-Calculus. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:133-146 [Conf]
  12. Armin B. Cremers, Thomas N. Hibbard
    Arbitration and Queuing Under Limited Shared Storage Requirements (Preliminary Report). [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:147-160 [Conf]
  13. Karel Culik II
    On the Homomorphic Characterizations of Families of Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:161-170 [Conf]
  14. Piotr Dembinski, Jan Maluszynski
    Two Level Grammars: CF-Grammars with Equation Schemes. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:171-187 [Conf]
  15. Nachum Dershowitz, Zohar Manna
    Proving termination with Multiset Orderings. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:188-202 [Conf]
  16. Peter Deussen
    One Abstract Accepting Algorithm for all Kinds of Parsers. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:203-217 [Conf]
  17. Arthur G. Duncan, Lawrence Yelowitz
    Studies in Abstract/Concrete Mappings in Proving Algorithm Correctness. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:218-229 [Conf]
  18. Faith E. Fich, Janusz A. Brzozowski
    A Characterization of a Dot-Depth Two Analogue of Generalized Definite Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:230-244 [Conf]
  19. Dietmar Friede
    Partitioned LL(k) Grammars. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:245-255 [Conf]
  20. Jean H. Gallier
    Recursion Schemes and Generalized Interpretations (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:256-270 [Conf]
  21. Jonathan Goldstine
    A Rational Theory of AFLS. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:271-281 [Conf]
  22. Juris Hartmanis
    On the Succintness of Different Representations of Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:282-288 [Conf]
  23. Sorin Istrail
    A Fixed-Point Theorem for Recursive-Enumerable Languages and Some Considerations About Fixed-Point Semantics of Monadic Programs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:289-303 [Conf]
  24. Wolfgang Janko
    Hierarchic Index Sequential Search with Optimal Variable Block Size and Its Minimal Expected Number of Comparisons. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:304-315 [Conf]
  25. Hans-Josef Jeanrond
    A Unique Termination Theorem for a Theory with Generalised Commutative Axioms. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:316-330 [Conf]
  26. Tsutomu Kamimura, Giora Slutzki
    DAGs and Chomsky Hierarchy (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:331-337 [Conf]
  27. Richard M. Karp
    Recent Advances in the Probabilistic Analysis of Graph-Theoretic Algorithms (Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:338-339 [Conf]
  28. Rainer Kemp
    On the Average Stack Size of Regularly Distributed Binary Trees. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:340-355 [Conf]
  29. Wolfgang Kowalk, Rüdiger Valk
    On Reductions of Parallel Programs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:356-369 [Conf]
  30. Werner Kuich, Helmut Prodinger, Friedrich J. Urbanek
    On the Height of Derivation Trees. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:370-384 [Conf]
  31. Zohar Manna, Amir Pnueli
    The Modal Logic of Programs. [Citation Graph (3, 0)][DBLP]
    ICALP, 1979, pp:385-409 [Conf]
  32. Friedhelm Meyer auf der Heide
    A Comparison Between Two Variations of a Pebble Game on Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:411-421 [Conf]
  33. D. R. Milton, Charles N. Fischer
    LL(k) Parsing for Attributed Grammars. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:422-430 [Conf]
  34. Burkhard Monien, Ivan Hal Sudborough
    On Eliminating Nondeterminism From Turing Machines Which Use Less Than Logarithmic Worktape Space. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:431-445 [Conf]
  35. Anton Nijholt
    Structure Preserving Transformations on Non-Left-Recursive Grammars (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:446-459 [Conf]
  36. Christos H. Papadimitriou, Mihalis Yannakakis
    The Complexity of Restricted Minimum Spanning Tree Problems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:460-470 [Conf]
  37. Grzegorz Rozenberg
    A Systematic Approach to Formal Language Theory Through Parallel Rewriting. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:471-478 [Conf]
  38. Grzegorz Rozenberg, Dirk Vermeir
    Extending the Notion of Finite Index. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:479-488 [Conf]
  39. Walter L. Ruzzo
    On the Complexity of General Context-Free Language Parsing and Recognition (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:489-497 [Conf]
  40. John E. Savage, Sowmitri Swamy
    Space-Time Tradeoffs for Oblivious Interger Multiplications. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:498-504 [Conf]
  41. Gunther Schmidt
    Investigating Programs in Terms of Partial Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:505-519 [Conf]
  42. Arnold Schönhage
    On the Power of Random Access Machines. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:520-529 [Conf]
  43. Richard L. Schwartz
    An Aximatic Treatment of Algol 68 Routines. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:530-545 [Conf]
  44. Alan L. Selman
    P-Selective Sets, Tally Languages, and the Behavior of Polynomial Time Reducibilities on NP. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:546-555 [Conf]
  45. Ravi Sethi, Adrian Tang
    Constructing Call-by-Value Continuation Semantics. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:556-570 [Conf]
  46. M. W. Shields, Peter E. Lauer
    A Formal Semantics for Concurrent Systems. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:571-584 [Conf]
  47. Seppo Sippu, Eljas Soisalon-Soininen
    Con Constructing LL(k) Parsers. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:585-595 [Conf]
  48. James W. Thatcher, Eric G. Wagner, Jesse B. Wright
    More on Advice on Structuring Compilers and Proving Them Correct. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:596-615 [Conf]
  49. Denis Thérien
    Languages of Nilpotent and Solvable Groups (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:616-632 [Conf]
  50. Jerzy Tiuryn
    Unique Fixed Points v. Least Fixed Points. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:633-645 [Conf]
  51. Esko Ukkonen
    A Modification of the LR(k) Method for Constructing Compact Bottom-Up Parsers. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:646-658 [Conf]
  52. László Úry
    Optimal Decomposition of Linear Automata. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:659-667 [Conf]
  53. Lutz Michael Wegner
    Bracketed Two-Level Grammars - A Decidable and Practical Approach to Language Definitions. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:668-682 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002