The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Ralph-Johan Back, Heikki Mannila
    Locality in Modular Systems. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:1-13 [Conf]
  2. Mordechai Ben-Ari
    On-the-Fly Garbage Collection: New Algorithms Inspired by Program Proofs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:14-22 [Conf]
  3. Jan A. Bergstra, Jan Willem Klop
    Algebraic Specifications for Parametrized Data Types with Minimal Parameter and Target Algebras. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:23-34 [Conf]
  4. Klaus J. Berkling, Elfriede Fehr
    A Modification of the Lambda-Calculus as a Base for Functional Programming Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:35-47 [Conf]
  5. Piotr Berman, Joseph Y. Halpern, Jerzy Tiuryn
    On the Power of Nondeterminism in Dynamic Logic. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:48-60 [Conf]
  6. Alberto Bertoni, Giancarlo Mauri, Nicoletta Sabadini
    Equivalence and Membership Problems for Regular Trace Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:61-71 [Conf]
  7. Norbert Blum
    On the Power of Chain Rules in Context Free Grammars. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:72-82 [Conf]
  8. Franz-Josef Brandenburg
    Extended Chomsky-Schützenberger Theorems. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:83-93 [Conf]
  9. Luca Cardelli
    Real Time Agents. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:94-106 [Conf]
  10. John Case, Christopher Lynes
    Machine Inductive Inference and Language Identification. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:107-115 [Conf]
  11. Gérard Comyn, Max Dauchet
    Approximations of Infinitary Objects. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:116-127 [Conf]
  12. Karel Culik II
    On Test Sets and the Ehrenfeucht Conjecture. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:128-140 [Conf]
  13. Werner Damm, Andreas Goerdt
    An Automata-Theoretic Characterization of the OI-Hierarchy. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:141-153 [Conf]
  14. David P. Dobkin, David G. Kirkpatrick
    Fast Detection of Polyhedral Intersections. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:154-165 [Conf]
  15. Pavol Duris, Zvi Galil
    On Reversal-Bounded Counter Machines and on Pushdown Automata with a Bound on the Size of the Pushdown Store. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:166-175 [Conf]
  16. Pavol Duris, Juraj Hromkovic
    Multihead Finite State Automata and Concatenation. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:176-186 [Conf]
  17. Andrzej Ehrenfeucht, David Haussler, Grzegorz Rozenberg
    Conditions Enforcing Regularity of Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:187-191 [Conf]
  18. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    Repetitions in Homomorphisms and Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:192-211 [Conf]
  19. Antony A. Faustini
    An Operational Semantics for Pure Dataflow. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:212-224 [Conf]
  20. César Fernández, P. S. Thiagarajan
    Some Properties of D-Continuous Causal Nets. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:225-238 [Conf]
  21. Philippe Flajolet, Jean-Marc Steyaert
    A Branching Process Arising in Dynamic Hashing, Trie Searching and Polynomial Factorization. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:239-251 [Conf]
  22. Rob Gerth
    A Sound and Complete Hoare Axiomatization of the Ada-Rendevous. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:252-264 [Conf]
  23. Joseph A. Goguen, José Meseguer
    Universal Realization, Persistent Interconnection and Implementation of Abstract Modules. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:265-281 [Conf]
  24. Gaston H. Gonnet, J. Ian Munro
    Heaps on Heaps. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:282-291 [Conf]
  25. A. Goralciková, Pavel Goralcik, Václav Koubek
    A Boundary of Isomorphism Completeness in the Lattice of Semigroup Pseudovarieties. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:292-299 [Conf]
  26. John V. Guttag, Deepak Kapur, David R. Musser
    Derived Pairs, Overlap Closures, and Rewrite Dominoes: New Tools for Analyzing Term rewriting Systems. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:300-312 [Conf]
  27. David Harel, Dexter Kozen
    A Programming Language for the Inductive Sets, and Applications. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:313-329 [Conf]
  28. K. Kalorkoti
    A Lower Bound for the Formula Size of Rational Functions. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:330-338 [Conf]
  29. Juhani Karhumäki
    On the Equivalence Problem for Binary DOL Systems. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:339-347 [Conf]
  30. Dexter Kozen
    Results on the Propositional µ-Calculus. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:348-359 [Conf]
  31. Yael Krevner, Amiram Yehudai
    An Iteration Theorem for Simple Precedence Languages (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:360-368 [Conf]
  32. Andrzej Lingas
    The Power of Non-Rectilinear Holes. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:369-383 [Conf]
  33. Damian Niwinski
    Fixed-Point Semantics for Algebraic (Tree) Grammars (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:384-396 [Conf]
  34. Dominique Perrin
    Completing Biprefix Codes. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:397-406 [Conf]
  35. Nicholas Pippenger
    Advances in Pebbling (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:407-417 [Conf]
  36. Gordon D. Plotkin
    A Powerdomain for Countable Non-Determinism (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:418-428 [Conf]
  37. Jean-Claude Raoult, Ravi Sethi
    Properties of a Notation for Combining Functions. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:429-441 [Conf]
  38. John H. Reif
    On the Power of Probabilistic Choice in Synchronous Parallel Computations. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:442-450 [Conf]
  39. Christophe Reutenauer
    Biprefix Codes and Semisimple Algebras. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:451-457 [Conf]
  40. Andrzej Salwicki
    Algorithmic Theories of Data Structures. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:458-472 [Conf]
  41. Donald Sannella, Martin Wirsing
    Implementation of Parameterised Specifications (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:473-488 [Conf]
  42. Hartmut Schmeck
    Algebraic Semantics of Recursive Flowchart Schemes. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:489-501 [Conf]
  43. Alan L. Selman, Yacov Yacobi
    The Complexity of Promise Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:502-509 [Conf]
  44. Joseph Sifakis
    Global and Local Invariants in Transition Systems. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:510-522 [Conf]
  45. Michael Sipser
    On Relativization and the Existence of Complete Sets. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:523-531 [Conf]
  46. Robert D. Tennent
    Semantics of Interference Control. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:532-545 [Conf]
  47. Paul M. B. Vitányi
    Efficient Simulations of Multicounter Machines. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:546-560 [Conf]
  48. Glynn Winskel
    Event Structure Semantics for CCS and Related Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:561-576 [Conf]
  49. Dana S. Scott
    Domains for Denotational Semantics. [Citation Graph (4, 0)][DBLP]
    ICALP, 1982, pp:577-613 [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