Jan Paredaens
Proceedings of the 11th Colloquium on Automata, Languages and Programming
ICALP, 1984.

@proceedings{ICALP-1984,
	address       = "Antwerp, Belgium",
	editor        = "Jan Paredaens",
	isbn          = "3-540-13345-3",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 11th Colloquium on Automata, Languages and Programming}",
	volume        = 172,
	year          = 1984,
}

Contents (48 items)

6 ×#algorithm
6 ×#complexity
5 ×#algebra
4 ×#on the
3 ×#finite
3 ×#formal method
3 ×#linear
3 ×#performance
3 ×#problem
2 ×#analysis

ICALP-1984-FaginV #dependence #formal method #overview #perspective

The Theory of Data Dependencies — An Overview (RF, MYV), pp. 1–22.

ICALP-1984-Rosenberg

The VLSI Revolution in Theoretical Circles (ALR), pp. 23–40.

ICALP-1984-AbiteboulG #sequence #tuple

Tuple Sequences and Indexes (SA, SG), pp. 41–50.

ICALP-1984-AfratiPP #complexity #graph

The Complexity of Cubical Graphs (FNA, CHP, GP), pp. 51–57.

ICALP-1984-Ambos-Spies #set

P-Generic Sets (KAS), pp. 58–68.

ICALP-1984-AtzeniM #constraints #database #dependence #functional #null

Functional Dependencies and Disjunctive Existence Constraints in Database Relations with Null Values (PA, NMM), pp. 69–81.

ICALP-1984-BergstraK #algebra #process #recursion

The Algebra of Recursively Defined Processes and the Algebra of Regular Processes (JAB, JWK), pp. 82–94.

ICALP-1984-Bidoit #algebra #equation #exception #fault #specification

Algebraic Specification of Exception Handling and Error Recovery by Means of Declarations and Equations (MB), pp. 95–108.

ICALP-1984-BlumerBEHM #automaton #linear #online #set #word

Building the Minimal DFA for the Set of all Subwords of a Word On-line in Linear Time (AB, JB, AE, DH, RMM), pp. 109–118.

ICALP-1984-ChazelleOSW #complexity #decidability

The Complexity and Decidability of Separation (BC, TO, ESS, DW), pp. 119–127.

ICALP-1984-ColbournP #concurrent #network

Concurrent Transmissions in Broadcast Networks (CJC, AP), pp. 128–136.

ICALP-1984-Crochemore #linear #word

Linear Searching for a Square in a Word (MC), p. 137.

ICALP-1984-Dybjer #algebra

Domain Algebras (PD), pp. 138–150.

ICALP-1984-Ferment #matrix #product line

Principality Results About Some Matrix Languages Families (DF), pp. 151–161.

ICALP-1984-Fribourg #equation #programming language

Oriented Equational Clauses as a Programming Language (LF), pp. 162–173.

ICALP-1984-GardyP #algebra #relational

Relational Algebra Operations and Sizes of Relations (DG, CP), pp. 174–186.

ICALP-1984-Girault-Beauquier #automaton #behaviour #finite #infinity

Some Results About Finite and Infinite Behaviours of a Pushdown Automaton (DB), pp. 187–195.

ICALP-1984-GoltzM #on the #petri net

On the Relationship of CCS and Petri Nets (UG, AM), pp. 196–208.

ICALP-1984-GoudaR #communication #finite #state machine

Communicating Finite State Machines with Priority Channels (MGG, LER), pp. 209–221.

ICALP-1984-GrafS #congruence #finite

A Modal Characterization of Observational Congruence on Finite Terms of CCS (SG, JS), pp. 222–234.

ICALP-1984-Hromkovic #communication #complexity

Communication Complexity (JH), pp. 235–246.

ICALP-1984-IbarraKR #performance #simulation #strict

Space and Time Efficient Simulations and Characterizations of Some Restricted Classes of PDAs (OHI, SMK, LER), pp. 247–259.

ICALP-1984-IzumiIH #algebra #axiom #regular expression

A Complete Axiom System for Algebra of Closed-Regular Expression (HI, YI, NH), pp. 260–269.

ICALP-1984-Jerrum #complexity #generative #sequence

The Complexity of Finding Minimum-Length Generator Sequences (MJ), pp. 270–280.

ICALP-1984-Jung #complexity #matrix #on the #performance #probability #problem

On Probabilistic Tape Complexity and Fast Circuits for Matrix Inversion Problems (HJ), pp. 281–291.

ICALP-1984-Karhumaki #on the

On Three-Element Codes (JK), pp. 292–302.

ICALP-1984-KirschenhoferP #algorithm #analysis #recursion #traversal

Recursion Depth Analysis for Special Tree Traversal Algorithms (PK, HP), pp. 303–311.

ICALP-1984-Lagarias #analysis #performance

Performance Analysis of Shamir’s Attack on the Basic Merkle-Hellman Knapsack Cryptosystem (JCL), pp. 312–323.

ICALP-1984-Mannila #algorithm #metric #sorting

Measures of Presortedness and Optimal Sorting Algorithms (HM), pp. 324–336.

ICALP-1984-MargolisP

Languages and Inverse Semigroups (SWM, JÉP), pp. 337–346.

ICALP-1984-MehlhornP #integer #multi

Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time (KM, FPP), pp. 347–357.

ICALP-1984-Abdallah #infinity #logic programming #on the

On the Interpretation of Infinite Computations in Logic Programming (MANA), pp. 358–370.

ICALP-1984-PaigeT #algorithm #linear #problem

A Linear Time Algorithm to Solve the Single Function Coarsest Partition Problem (RP, RET), pp. 371–379.

ICALP-1984-Pansiot #french

Complexité des Facteurs des Mots Infinis Engendrés par Morphimes Itérés (JJP), pp. 380–389.

ICALP-1984-Pecuchet #french

Automates Boustrophendon, Semi-Groupe de Birget et Monoide Inversiv Libre (Abstract/ Résumé) (JPP), p. 390.

ICALP-1984-ReifS #distributed #probability #resource management

Probabilistic Bidding Gives Optimal Distributed Resource Allocation (JHR, PGS), pp. 391–402.

ICALP-1984-Reisig #partial order #semantics

Partial Order Semantics versus Interleaving Semantics for CSP-like Languages and its Impact on Fairness (WR), pp. 403–413.

ICALP-1984-RestivoR #formal method #permutation

Cancellation, Pumping and Permutation in Formal Languages (AR, CR), pp. 414–422.

ICALP-1984-RonRP #csp #hardware #implementation #verification

A Hardware Implementation of the CSP Primitives and its Verification (DR, FR, AP), pp. 423–435.

ICALP-1984-Schonhage #algorithm #integer #reduction

Factorization of Univariate Integer Polynomials by Diophantine Aproximation and an Improved Basis Reduction Algorithm (AS), pp. 436–447.

ICALP-1984-Schoning #algorithm #approach #robust

Robust Algorithms: A Different Approach to Oracles (US), pp. 448–453.

ICALP-1984-SpencerM

Node Weighted Matching (THS, EWM), pp. 454–464.

ICALP-1984-StreettE #calculus #μ-calculus

The Propositional μ-Calculus is Elementary (RSS, EAE), pp. 465–472.

ICALP-1984-Tsakalidis #locality

AVL-Trees for Localized Search (AKT), pp. 473–485.

ICALP-1984-Vitanyi #realtime

The Simple Roots of Real-Time Computation Hierarchies (PMBV), pp. 486–489.

ICALP-1984-Vitter #complexity #interface

Computational Complexity of an Optical Disk Interface (JSV), pp. 490–502.

ICALP-1984-Welzl #encoding #formal method #graph #graph grammar

Encoding Graphs by Derivations and Implications for the Theory of Graph Grammars (EW), pp. 503–513.

ICALP-1984-Willard #algorithm #difference #problem #retrieval

Sampling Algorithms for Differential Batch Retrieval Problems (DEW), pp. 514–526.