Wilfried Brauer
Proceedings of the 12th Colloquium on Automata, Languages and Programming
ICALP, 1985.

@proceedings{ICALP-1985,
	address       = "Nafplion, Greece",
	editor        = "Wilfried Brauer",
	isbn          = "3-540-15650-X",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 12th Colloquium on Automata, Languages and Programming}",
	volume        = 194,
	year          = 1985,
}

Contents (51 items)

8 ×#algorithm
6 ×#on the
4 ×#logic
4 ×#problem
4 ×#set
3 ×#algebra
3 ×#performance
3 ×#semantics
3 ×#theorem
2 ×#automaton

ICALP-1985-Lovasz #algorithm

Vertex Packing Algorithms (LL), pp. 1–14.

ICALP-1985-Pnueli #branch #linear #logic #semantics

Linear and Branching Structures in the Semantics and Logics of Reactive Systems (AP), pp. 15–32.

ICALP-1985-BeauquierN #set #word

About Rational Sets of Factors of a Bi-Infinite Word (DB, MN), pp. 33–42.

ICALP-1985-Ben-OrGMR #contract #protocol

A Fair Protocol for Signing Contracts (MBO, OG, SM, RLR), pp. 43–52.

ICALP-1985-BilardiP #complexity #sorting

The Influence of Key Length on the Area-Time Complexity of Sorting (GB, FPP), pp. 53–62.

ICALP-1985-Bouge #csp #implementation

Repeated Synchronous Snapshots and Their Implementation in CSP (LB), pp. 63–70.

ICALP-1985-BucherEH #on the

On Total Regulators Generated by Derivation Relations (WB, AE, DH), pp. 71–79.

ICALP-1985-ChazelleE #problem #retrieval

Optimal Solutions for a Class of Point Retrieval Problems (BC, HE), pp. 80–89.

ICALP-1985-ChazelleG #geometry

Fractional Cascading: A Data Structuring Technique with Geometric Applications (BC, LJG), pp. 90–100.

ICALP-1985-Chrobak #automaton #multi

Hierarchies of One-Way Multihead Automata Languages (MC), pp. 101–110.

ICALP-1985-Cole #clustering #set

Partitioning Point Sets in 4 Dimensions (RC0), pp. 111–119.

ICALP-1985-Coppo #recursion #theorem

A Completeness Theorem for Recursively Defined Types (MC), pp. 120–129.

ICALP-1985-Curien #category theory #combinator #logic

Categorical Combinatory Logic (PLC), pp. 130–139.

ICALP-1985-BakkerK #towards

Towards a Uniform Topological Treatment of Streams and Functions on Streams (JWdB, JNK), pp. 140–148.

ICALP-1985-BakkerMO #concurrent #finite #infinity #semantics

Infinite Streams and Finite Observations in the Semantics of Uniform Concurrency (JWdB, JJCM, ERO), pp. 149–157.

ICALP-1985-Bra #dependence

Imposed-Functional Dependencies Inducing Horizontal Decompositions (PDB), pp. 158–170.

ICALP-1985-EngelfrietV #transducer

Characterization of High Level Tree Transducers (JE, HV), pp. 171–178.

ICALP-1985-Flajolet #ambiguity

Ambiguity and Transcendence (PF), pp. 179–188.

ICALP-1985-Fortune #algorithm #performance

A Fast Algorithm for Polygon Containment by Translation (SF), pp. 189–198.

ICALP-1985-Furer #algorithm #testing

Deterministic and Las Vegas Primality Testing Algorithms (MF), pp. 199–209.

ICALP-1985-GabowS #algorithm #performance

Efficient Algorithms for Graphic Matroid Intersection and Parity (HNG, MFMS), pp. 210–220.

ICALP-1985-GoguenJM #algebra #order #semantics

Operational Semantics for Order-Sorted Algebra (JAG, JPJ, JM), pp. 221–231.

ICALP-1985-Gunter

A Universal Domain Technique for Profinite Posets (CAG), pp. 232–243.

ICALP-1985-Hansel #proving #theorem

A Simple Proof of the Skolem-Mahler-Lech Theorem (GH), pp. 244–249.

ICALP-1985-HartmanisI #on the #problem

On Complete Problems for NP∩CoNP (JH, NI), pp. 250–259.

ICALP-1985-Hennessy #algebra #communication #process

An Algebraic Theory of Fair Asynchronous Communicating Processes (MH), pp. 260–269.

ICALP-1985-Hortala-GonzalezR #hoare #logic #nondeterminism #source code #standard #theorem

Hoare’s Logic for Nondeterministic Regular Programs: A Nonstandard Completeness Theorem (MTHG, MRA), pp. 270–280.

ICALP-1985-Hrbacek #algebra

Powerdomains as Algebraic Lattices (KH), pp. 281–289.

ICALP-1985-Jerrum #combinator #generative #random

Random Generation of Combinatorial Structures from a Uniform Distribution (MJ), pp. 290–299.

ICALP-1985-Johnson #equivalence #question

Do Rational Equivalence Relations have Regular Cross-Sections? (JHJ), pp. 300–309.

ICALP-1985-Jung #on the #probability

On Probabilistic Time and Space (HJ), pp. 310–317.

ICALP-1985-KarlssonMR #bound #nearest neighbour #problem

The Nearest Neighbor Problem on Bounded Domains (RGK, JIM, ELR), pp. 318–327.

ICALP-1985-KaufmannM

Routing Through a Generalized Switchbox (MK, KM), pp. 328–337.

ICALP-1985-Keranen #morphism #on the #word

On k-Repetition Free Words Generated by Length Uniform Morphisms Over a Binary Alphabet (VK), pp. 338–347.

ICALP-1985-Kortelainen #commutative #regular expression

Every Commutative Quasirational Language is Regular (JK), pp. 348–355.

ICALP-1985-KurtzM #algorithm #analysis #distributed #probability #set

A Probabilistic Distributed Algorithm for Set Intersection and Its Analysis (TGK, UM), pp. 356–362.

ICALP-1985-LandauYG #algorithm #distributed #network

Distributed Algorithms in Synchronous Broadcasting Networks (GML, MMY, ZG), pp. 363–372.

ICALP-1985-Larsen #equivalence #process

A Context Dependent Equivalence between Processes (KGL), pp. 373–382.

ICALP-1985-Li #bound

Lower Bounds by Kolmogorov-Complexity (ML0), pp. 383–393.

ICALP-1985-LubyR #algorithm #behaviour #bidirectional

A Bidirectional Shortest-Path Algorithm With Good Average-Case Behavior (ML, PR), pp. 394–403.

ICALP-1985-MainBH #infinity

Applications of an Infinite Squarefree CO-CFL (MGM, WB, DH), pp. 404–412.

ICALP-1985-MannaW #automation #deduction

Special Relations in Automated Deduction (ZM, RJW), pp. 413–423.

ICALP-1985-MehlhornT

Dynamic Interpolation Search (KM, AKT), pp. 424–434.

ICALP-1985-OrponenRS #complexity #polynomial

Polynomial Levelability and Maximal Complexity Cores (PO, DAR, US), pp. 435–444.

ICALP-1985-Pin #finite #for free #monad

Finite Group Topology and p-Adic Topology for Free Monoids (JÉP), pp. 445–455.

ICALP-1985-SippuS #algorithm #design #on the #performance #relational #using

On the Use of Relational Expressions in the Design of Efficient Algorithms (SS, ESS), pp. 456–464.

ICALP-1985-SistlaVW #automaton #logic #problem

The Complementation Problem for Büchi Automata with Applications to Temporal Logic (APS, MYV, PW), pp. 465–474.

ICALP-1985-Stirling #composition #proving #set

A Complete Compositional Model Proof System for a Subset of CCS (CS), pp. 475–486.

ICALP-1985-VarmanR #array #matrix #multi #on the #using

On Matrix Multiplication Using Array Processors (PJV, IVR), pp. 487–496.

ICALP-1985-Vishkin #parallel #pattern matching #string

Optimal Parallel Pattern Matching in Strings (UV), pp. 497–508.

ICALP-1985-ZwiersRB #composition #concurrent #network

Compositionality and Concurrent Networks: Soundness and Completeness of a Proofsystem (JZ, WPdR, PvEB), pp. 509–519.