Laurent Kott
Proceedings of the 13th International Colloquium on Automata, Languages and Programming
ICALP, 1986.

@proceedings{ICALP-1986,
	address       = "Rennes, France",
	editor        = "Laurent Kott",
	isbn          = "3-540-16761-7",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 13th International Colloquium on Automata, Languages and Programming}",
	volume        = 226,
	year          = 1986,
}

Contents (48 items)

9 ×#algorithm
6 ×#on the
5 ×#complexity
4 ×#concurrent
4 ×#set
3 ×#parallel
3 ×#problem
3 ×#reduction
2 ×#approach
2 ×#automaton

ICALP-1986-Allender

Characterizations on PUNC and Precomputation (EA), pp. 1–10.

ICALP-1986-ArquesFGG #algorithm #approach #combinator #comparison #concurrent #database

Comparison of Algorithms Controlling Concurrent Access to a Database: A Combinatorial Approach (DA, JF, MTG, PG), pp. 11–20.

ICALP-1986-Aurenhammer #diagrams

A New Duality Result Concerning Voronoi Diagrams (FA), pp. 21–30.

ICALP-1986-AverbuchWG #algorithm #classification #polynomial

Classification of all the Minimal Bilinear Algorithms for Computing the Coefficients of the Product of Two Polynomials Modulo a Polynomial (AA, SW, ZG), pp. 31–39.

ICALP-1986-BookORW #exponential #on the

On Exponential Lowness (RVB, PO, DAR, OW), pp. 40–49.

ICALP-1986-BorodinFHUW #problem #taxonomy #trade-off

A Tradeoff Between Search and Update Time for the Implicit Dictionary Problem (AB, FEF, FMadH, EU, AW), pp. 50–59.

ICALP-1986-Brandenburg #product line

Intersections of Some Families of Languages (FJB), pp. 60–68.

ICALP-1986-BrzozowskiS #analysis #network #simulation

Correspondence between Ternary Simulation and Binary Race Analysis in Gate Networks (JAB, CJHS), pp. 69–78.

ICALP-1986-ChoffrutS

Counting with Rational Functions (CC, MPS), pp. 79–88.

ICALP-1986-Felice #finite #graph #set

Finite Biprefix Sets of Path in a Graph (CdF), pp. 89–94.

ICALP-1986-DymondR #context-free grammar #memory management #parallel #recognition

Parallel RAMs with Owned Global Memory and Deterministic Context-Free Language Recognition (PWD, WLR), pp. 95–104.

ICALP-1986-Fribourg #induction #strict

A Strong Restriction of the Inductive Completion Procedure (LF), pp. 105–115.

ICALP-1986-GoralcikK #automaton #on the #word

On Discerning Words by Automata (PG, VK), pp. 116–122.

ICALP-1986-HartmanisH #complexity

Complexity Classes Without Machines: On Complete Languages for UP (JH, LAH), pp. 123–135.

ICALP-1986-HartmanisLY #complexity #set

Containment, Separation, Complete Sets, and Immunity of Complexity Classes (JH, ML, YY), pp. 136–145.

ICALP-1986-HermannP #algorithm #on the

On Nontermination of Knuth-Bendix Algorithm (MH, IP), pp. 146–156.

ICALP-1986-Hromkovic #modelling #parallel #recognition #trade-off

Tradeoffs for Language Recognition on Parallel Computing Models (JH), pp. 157–166.

ICALP-1986-Johnson #equivalence

Rational Equivalence Relations (JHJ), pp. 167–176.

ICALP-1986-KirschenhoferP

Some Further Results on Digital Search Trees (PK, HP), pp. 177–185.

ICALP-1986-KrausL

Knowledge, Belief and Time (SK, DJL), pp. 186–195.

ICALP-1986-Lai #communication #detection #distributed #termination

A Termination Detector for Static and Dynamic Distributed Systems with Asynchronous Non-first-in-first-out Communication (THL), pp. 196–205.

ICALP-1986-Lange #nondeterminism #reduction

Decompositions of Nondeterministic Reductions (KJL), pp. 206–214.

ICALP-1986-Lengauer #algorithm #testing

Hierarchical Planary Testing Algorithms (TL), pp. 215–225.

ICALP-1986-Lisper #concurrent #equivalence #synthesis

Synthesis and Equivalence of Concurrent Systems (BL), pp. 226–235.

ICALP-1986-MannilaU #backtracking #problem #set

The Set Union Problem with Backtracking (HM, EU), pp. 236–243.

ICALP-1986-Mascle #matrix

Torsion Matrix Semigroups and Recognizable Transductions (JPM), pp. 244–253.

ICALP-1986-Metivier #commutative #monad #on the #set

On Recognizable Subsets of Free Partially Commutative Monoids (YM), pp. 254–264.

ICALP-1986-MonienS

Min Cut is NP-Complete for Edge Weighted Trees (BM, IHS), pp. 265–274.

ICALP-1986-MullerSS #automaton #complexity #monad

Alternating Automata. The Weak Monadic Theory of the Tree, and its Complexity (DEM, AS, PES), pp. 275–283.

ICALP-1986-Muller #complexity

Subpolynomial Complexity Classes of Real Functions and Real Numbers (NTM), pp. 284–293.

ICALP-1986-Pechuchet #french

Etude Syntaxique des Parties Reconnaissables de Mots Infinis (JPP), pp. 294–303.

ICALP-1986-Phillips #testing

Refusal Testing (IP), pp. 304–313.

ICALP-1986-ReedR #communication #csp #process

A Timed Model for Communicating Sequential Processes (GMR, AWR), pp. 314–323.

ICALP-1986-Regan #reduction #theorem

A Uniform Reduction Theorem — Extending a Result of J. Grollmann and A. Selman (KWR), pp. 324–333.

ICALP-1986-RosierY #complexity #concurrent #finite #on the #probability #source code #termination

On The Complexity of Deciding Fair Termination of Probabilistic Concurrent Finite-State Programs (LER, HCY), pp. 334–343.

ICALP-1986-ShavitF #approach #detection

A New Approach to Detection of Locally Indicative Stability (NS, NF), pp. 344–358.

ICALP-1986-Schnorr #algorithm #performance #reduction

A More Efficient Algorithm for Lattice Basis Reduction (CPS), pp. 359–369.

ICALP-1986-Schoning #bound #recursion

Lower Bounds by Recursion Theoretic Arguments (US), pp. 370–375.

ICALP-1986-Simon #algorithm #graph #transitive

An Improved Algorithm for Transitive Closure on Acyclic Digraphs (KS), pp. 376–386.

ICALP-1986-Spehner #french

Un Algorithme Determinant les Melanges de Deux Mots (JCS), pp. 387–396.

ICALP-1986-SpirakisT #algorithm #performance

A Very Fast, Practical Algorithm for Finding a Negative Cycle in a Digraph (PGS, AKT), pp. 397–406.

ICALP-1986-Stirling #composition #concurrent #correctness #logic

A Compositional Reformulation of Owicki-Gries’s Partial Correctness Logic for a Concurrent While Language (CS), pp. 407–415.

ICALP-1986-Straubing

Semigroups and Languages of Dot-Depth 2 (HS), pp. 416–423.

ICALP-1986-VarmanD #algorithm #parallel

A Parallel Vertex Insertion Algorithm For Minimum Spanning Trees (PJV, KD), pp. 424–433.

ICALP-1986-Wagner

More Complicated Questions About Maxima and Minima, and Some Closures of NP (KWW), pp. 434–443.

ICALP-1986-Willard #bound #problem #query

Lower Bounds for Dynamic Range Query Problems That Permit Subtraction (DEW), pp. 444–453.

ICALP-1986-YouS #algorithm #confluence #term rewriting

E-Unification Algorithms for a Class of Confluent Term Rewriting Systems (JHY, PAS), pp. 454–463.

ICALP-1986-Niwinski #fixpoint #on the

On Fixed-Point Clones (DN), pp. 464–473.