- 1984
- M. A. Nait Abdallah:
On the Interpretation of Infinite Computations in Logic Programming. ICALP 1984: 358-370 - Serge Abiteboul, Seymour Ginsburg:
Tuple Sequences and Indexes. ICALP 1984: 41-50 - Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou:
The Complexity of Cubical Graphs (Extended Abstract). ICALP 1984: 51-57 - Klaus Ambos-Spies:
P-Generic Sets. ICALP 1984: 58-68 - Paolo Atzeni, Nicola M. Morfuni:
Functional Dependencies and Disjunctive Existence Constraints in Database Relations with Null Values. ICALP 1984: 69-81 - Jan A. Bergstra, Jan Willem Klop:
The Algebra of Recursively Defined Processes and the Algebra of Regular Processes. ICALP 1984: 82-94 - Michel Bidoit:
Algebraic Specification of Exception Handling and Error Recovery by Means of Declarations and Equations. ICALP 1984: 95-108 - Anselm Blumer, J. Blumer, Andrzej Ehrenfeucht, David Haussler, Ross M. McConnell:
Building the Minimal DFA for the Set of all Subwords of a Word On-line in Linear Time. ICALP 1984: 109-118 - Bernard Chazelle, Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood:
The Complexity and Decidability of Separation. ICALP 1984: 119-127 - Charles J. Colbourn, Andrzej Proskurowski:
Concurrent Transmissions in Broadcast Networks. ICALP 1984: 128-136 - Maxime Crochemore:
Linear Searching for a Squre in a Word (Abstract). ICALP 1984: 137 - Peter Dybjer:
Domain Algebras. ICALP 1984: 138-150 - Ronald Fagin, Moshe Y. Vardi:
The Theory of Data Dependencies - An Overview. ICALP 1984: 1-22 - Didier Ferment:
Principality Results About Some Matrix Languages Families. ICALP 1984: 151-161 - Laurent Fribourg:
Oriented Equational Clauses as a Programming Language. ICALP 1984: 162-173 - Danièle Gardy, Claude Puech:
Relational Algebra Operations and Sizes of Relations. ICALP 1984: 174-186 - Danièle Beauquier:
Some Results About Finite and Infinite Behaviours of a Pushdown Automaton. ICALP 1984: 187-195 - Ursula Goltz, Alan Mycroft:
On the Relationship of CCS and Petri Nets. ICALP 1984: 196-208 - Mohamed G. Gouda, Louis E. Rosier:
Communicating Finite State Machines with Priority Channnels. ICALP 1984: 209-221 - Susanne Graf, Joseph Sifakis:
A Modal Characterization of Observational Congruence on Finite Terms of CCS. ICALP 1984: 222-234 - Juraj Hromkovic:
Communication Complexity. ICALP 1984: 235-246 - Oscar H. Ibarra, Sam M. Kim, Louis E. Rosier:
Space and Time Efficient Simulations and Characterizations of Some Restricted Classes of PDAs. ICALP 1984: 247-259 - Hiroyuki Izumi, Yasuyoshi Inagaki, Namio Honda:
A Complete Axiom System for Algebra of Closed-Regular Expression. ICALP 1984: 260-269 - Mark Jerrum:
The Complexity of Finding Minimum-Length Generator Sequences (Extended Abstract). ICALP 1984: 270-280 - Hermann Jung:
On Probabilistic Tape Complexity and Fast Circuits for Matrix Inversion Problems (Extended Abstract). ICALP 1984: 281-291 - Juhani Karhumäki:
On Three-Element Codes. ICALP 1984: 292-302 - Peter Kirschenhofer, Helmut Prodinger:
Recursion Depth Analysis for Specail Tree Traversal Algorithms. ICALP 1984: 303-311 - J. C. Lagarias:
Performance Analysis of Shamir's Attack on the Basic Merkle-Hellman Knapsack Cryptosystem. ICALP 1984: 312-323 - Heikki Mannila:
Measures of Presortedness and Optimal Sorting Algorithms (Extended Abstract). ICALP 1984: 324-336 - Stuart W. Margolis, Jean-Eric Pin:
Languages and Inverse Semigroups. ICALP 1984: 337-346