The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Matti Linna
    On omega-sets Associated with Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1976, pp:1-19 [Conf]
  2. Eljas Soisalon-Soininen, Esko Ukkonen
    A Characterization of LL(k) Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1976, pp:20-30 [Conf]
  3. Leslie G. Valiant
    The Equivalence Problem for D0L Systems and its Decidability for Binary Alphabets. [Citation Graph (0, 0)][DBLP]
    ICALP, 1976, pp:31-37 [Conf]
  4. Antonio Restivo
    On a Family of Codes Related to Factorization of Cyclotomic Polynomials. [Citation Graph (0, 0)][DBLP]
    ICALP, 1976, pp:38-44 [Conf]
  5. Dominique Perrin
    Sur la longeur moyenne des codes préfixes. [Citation Graph (0, 0)][DBLP]
    ICALP, 1976, pp:45-51 [Conf]
  6. Jacques Sakarovitch
    Sur les monoïdes syntactiques des langages algébriques déterministes. [Citation Graph (0, 0)][DBLP]
    ICALP, 1976, pp:52-65 [Conf]
  7. Joffroy Beauquier
    Générateurs algébriques non-ambigus. [Citation Graph (0, 0)][DBLP]
    ICALP, 1976, pp:66-73 [Conf]
  8. André Arnold, Max Dauchet
    Bi-transductions de forêts. [Citation Graph (0, 0)][DBLP]
    ICALP, 1976, pp:74-86 [Conf]
  9. Fred Kröger
    Logical Rules of Natural Reasoning about Programs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1976, pp:87-98 [Conf]
  10. Maarten H. van Emden
    Verification Conditions as Programs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1976, pp:99-119 [Conf]
  11. Witold Lipski Jr.
    Informational Systems with Incomplete Information. [Citation Graph (2, 0)][DBLP]
    ICALP, 1976, pp:120-130 [Conf]
  12. J. Schwarz
    Event Based Reasoning - A System for Proving Correct Termination of Programs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1976, pp:131-146 [Conf]
  13. Giuseppe Longo, Marisa Venturini Zilli
    A Theory of Computation with an Identity Discriminator. [Citation Graph (0, 0)][DBLP]
    ICALP, 1976, pp:147-167 [Conf]
  14. Gérard Berry, Bruno Courcelle
    Program Equivalence and Canonical Forms in Stable Discrete Interpretations. [Citation Graph (0, 0)][DBLP]
    ICALP, 1976, pp:168-188 [Conf]
  15. Irène Guessarian
    Semantic Equivalence of Program Schemes and its Syntactic Characterization. [Citation Graph (0, 0)][DBLP]
    ICALP, 1976, pp:189-200 [Conf]
  16. Daniel Brand
    Proving Programs Incorrect. [Citation Graph (0, 0)][DBLP]
    ICALP, 1976, pp:201-227 [Conf]
  17. Robert Cartwright
    User-Defined Data Types as an Aid to Verifying LISP Programs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1976, pp:228-256 [Conf]
  18. Daniel P. Friedman, David S. Wise
    CONS Should Not Evaluate its Arguments. [Citation Graph (5, 0)][DBLP]
    ICALP, 1976, pp:257-284 [Conf]
  19. John Gill, István Simon
    Ink, Dirty-Tape Turing Machines, and Quasicomplexity Measures. [Citation Graph (0, 0)][DBLP]
    ICALP, 1976, pp:285-306 [Conf]
  20. William F. McColl
    The Depth of Boolean Functions. [Citation Graph (0, 0)][DBLP]
    ICALP, 1976, pp:307-321 [Conf]
  21. Claus-Peter Schnorr
    Optimal Algorithms for Self-Reducible Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 1976, pp:322-337 [Conf]
  22. Helmut Alt, Kurt Mehlhorn
    Lower Bounds for the Space Complexity of Context-Free Recognition. [Citation Graph (0, 0)][DBLP]
    ICALP, 1976, pp:338-354 [Conf]
  23. Zvi Galil
    On Enumeration Procedures for Theorem Proving and for Integer Programming. [Citation Graph (0, 0)][DBLP]
    ICALP, 1976, pp:355-381 [Conf]
  24. Jan van Leeuwen
    On the Construction of Huffman Trees. [Citation Graph (0, 0)][DBLP]
    ICALP, 1976, pp:382-410 [Conf]
  25. Max Fontet
    A Linear Algorithm for Testing Isomorphism of Planar Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1976, pp:411-424 [Conf]
  26. Peter A. Bloniarz, Michael J. Fischer, Albert R. Meyer
    A Note on the Average Time to Compute Transitive Closures. [Citation Graph (3, 0)][DBLP]
    ICALP, 1976, pp:425-434 [Conf]
  27. J. W. de Bakker
    Semantics and Termination of Nondeterministic Recursive Programs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1976, pp:435-477 [Conf]
  28. Matthew Hennessy, Edward A. Ashcroft
    The Semantics of Nondeterminism. [Citation Graph (0, 0)][DBLP]
    ICALP, 1976, pp:478-493 [Conf]
  29. Irene Greif
    On Proofs of Programs for Synchronization. [Citation Graph (0, 0)][DBLP]
    ICALP, 1976, pp:494-507 [Conf]
  30. Hans-Dieter Ehrich
    Outline of an Algebraic Theory of Structured Objects. [Citation Graph (0, 0)][DBLP]
    ICALP, 1976, pp:508-530 [Conf]
  31. Michel Sintzoff
    Eliminating Blind Alleys from Backtrack Programs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1976, pp:531-557 [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