Timo Lepistö, Arto Salomaa
Proceedings of the 15th International Colloquium on Automata, Languages and Programming
ICALP, 1988.

@proceedings{ICALP-1988,
	address       = "Tampere, Finland",
	editor        = "Timo Lepistö and Arto Salomaa",
	isbn          = "3-540-19488-6",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 15th International Colloquium on Automata, Languages and Programming}",
	volume        = 317,
	year          = 1988,
}

Contents (51 items)

6 ×#algorithm
6 ×#complexity
6 ×#graph
4 ×#on the
4 ×#performance
3 ×#automaton
3 ×#semantics
3 ×#transitive
2 ×#analysis
2 ×#bound

ICALP-1988-AggarwalC #communication #complexity

Communication Complexity of PRAMs (AA, AKC), pp. 1–17.

ICALP-1988-AlbertF #algorithm #analysis #complexity #multi

Average Case Complexity Analysis of the Rete Multi-Pattern Match Algorithm (LA, FF), pp. 18–37.

ICALP-1988-ArnborgLS #graph #problem

Problems Easy for Tree-Decomposable Graphs (SA, JL, DS), pp. 38–51.

ICALP-1988-BackK #distributed

Serializability in Distributed Systems with Handshaking (RJB, RKS), pp. 52–66.

ICALP-1988-BajajK #algorithm #geometry #modelling

Algorithms for Planar Geometric Models (CLB, MSK), pp. 67–81.

ICALP-1988-BenedekI

Nonuniform Learnability (GMB, AI), pp. 82–92.

ICALP-1988-BerstelR

Zeta Functions of Recognizable Languages (JB, CR), pp. 93–104.

ICALP-1988-Bodlaender #bound #graph #programming

Dynamic Programming on Graphs with Bounded Treewidth (HLB), pp. 105–118.

ICALP-1988-ChangIP #bound #modelling #parallel #performance #simulation

Efficient Simulations of Simple Models of Parallel Computation by Time-Bounded ATM’s and Space-Bounded TM’s (JHC, OHI, MAP), pp. 119–132.

ICALP-1988-ColeSSS

Optimal Slope Selection (RC, JSS, WLS, ES), pp. 133–146.

ICALP-1988-CoriM #approximate #automaton #distributed

Approximation of a TRace, Asynchronous Automata and the Ordering of Events in a Distributed System (RC, YM), pp. 147–161.

ICALP-1988-Culik #decidability #equivalence #problem #proving

New Techniques for Proving the Decidability of Equivalence Problems (KCI), pp. 162–175.

ICALP-1988-Diekert #commutative #for free #monad #transitive

Transitive Orientations, Möbius Functions, and Complete Semi-Thue Systems for Free Partially Commutative Monoids (VD), pp. 176–187.

ICALP-1988-DietzfelbingerM #complexity #matrix #turing machine

The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines with Output Tape (MD, WM), pp. 188–200.

ICALP-1988-Edelsbrunner #geometry

Geometric Structures in Computational Geometry (HE), pp. 201–213.

ICALP-1988-EdelsbrunnerGPPSS #algorithm #combinator

Arrangements of Curves in the Plane — Topology, Combinatorics, and Algorithms (HE, LJG, JP, RP, RS, MS), pp. 214–229.

ICALP-1988-Eppstein #automaton #design #finite #sequence

Reset Sequences for Finite Automata with Application to Design of Parts Orienters (DE), pp. 230–238.

ICALP-1988-FlajoletGT #probability #random

Random Allocations and Probabilistic Languages (PF, DG, LT), pp. 239–253.

ICALP-1988-Gruska #architecture

Systolic Architectures, Systems and Computations (JG), pp. 254–270.

ICALP-1988-Hartmanis #complexity

New Developments in Structural Complexity Theory (JH), pp. 271–286.

ICALP-1988-KirchnerKM #semantics

Operational Semantics of OBJ-3 (CK, HK, JM), pp. 287–301.

ICALP-1988-KirschenhoferPS #question

Do We Really Need to Balance Patricia Trees? (PK, HP, WS), pp. 302–316.

ICALP-1988-KokR #concurrent #semantics

Contractions in Comparing Concurrent Semantics (JNK, JJMMR), pp. 317–332.

ICALP-1988-KruskalRS #algorithm #complexity #parallel #performance

A Complexity Theory of Efficient Parallel Algorithms (CPK, LR, MS), pp. 333–346.

ICALP-1988-KuceraMP #on the

On the Learnability of DNF Formulae (LK, AMS, MP), pp. 347–361.

ICALP-1988-Lautemann #algorithm #graph grammar #performance

Efficient Algorithms on Context-Free Graph Grammars (CL), pp. 362–378.

ICALP-1988-LengauerW #analysis #graph #performance

Efficient Analysis of Graph Properties on Context-free Graph Languages (TL, EW), pp. 379–393.

ICALP-1988-LingasS #algorithm #graph #morphism #polynomial

A Polynomial-Time Algorithm for Subgraph Isomorphism of Two-Connected Series-Parallel Graphs (AL, MMS), pp. 394–409.

ICALP-1988-MehlhornY #how #theorem

Constructive Hopf’s Theorem: Or How to Untangle Closed Planar Curves (KM, CKY), pp. 410–423.

ICALP-1988-Niemi

Maximal Dense Intervals of Grammar Forms (VN), pp. 424–438.

ICALP-1988-PanangadenS #nondeterminism #power of

Computations, Residuals, and the Power of Indeterminacy (PP, EWS), pp. 439–454.

ICALP-1988-RajasekaranR

Nested Annealing: A Provable Improvement to Simulated Annealing (SR, JHR), pp. 455–472.

ICALP-1988-RameshR #pattern matching

Nonlinear Pattern Matching in Trees (RR, IVR), pp. 473–488.

ICALP-1988-Tao #automaton #finite #linear

Invertibility of Linear Finite Automata Over a Ring (RjT), pp. 489–501.

ICALP-1988-Rohnert

Moving Discs Between Polygons (HR), pp. 502–515.

ICALP-1988-RudichB #morphism #transitive

Optimal Circuits and Transitive Automorphism Groups (SR, LB), pp. 516–524.

ICALP-1988-Schafer #approach #linear

A Kleene-Presburgerian Approach to Linear Production Systems (JS), pp. 525–534.

ICALP-1988-Simon #on the #reduction #transitive

On Minimum Flow and Transitive Reduction (KS), pp. 535–546.

ICALP-1988-Spehner #french

La Reconnaissance des Facteurs d’un Language Fini dans un Texte en Temps Lineaire (Resume) (JCS), pp. 547–560.

ICALP-1988-StraubingTT #quantifier #regular expression

regular Languages Defined with Generalized Quantifiers (HS, DT, WT), pp. 561–575.

ICALP-1988-Tamassia #data type #graph

A Dynamic Data Structure for Planar Graph Embedding (RT), pp. 576–590.

ICALP-1988-TangB #polynomial #reduction #set

Separating Polynomial-Time Turing and Truth-Table Reductions by Tally Sets (ST, RVB), pp. 591–599.

ICALP-1988-Tel #protocol #verification

Assertional Verification of a Timer Based Protocol (GT), pp. 600–614.

ICALP-1988-Thatte #type inference

Type Inference with Partial Types (ST), pp. 615–629.

ICALP-1988-Thiagarajan #aspect-oriented #behaviour

Some Behavioural Aspects of Net Theory (PST), pp. 630–653.

ICALP-1988-Turakainen #decidability #equivalence

The Equivalence of DGSM Replications on Q-Rational Languages is Decidable (PT), pp. 654–666.

ICALP-1988-VaziraniY #graph

Pfaffian Orientations, 0/1 Permanents, and Even Cycles in Directed Graphs (VVV, MY), pp. 667–681.

ICALP-1988-Wagner #on the #strict

On Restricting the Access to an NP-Oracle (KWW), pp. 682–696.

ICALP-1988-Watanabe #complexity #nondeterminism #on the

On ≤ᴾ₁₋tt-Sparseness and Nondeterministic Complexity Classes (OW0), pp. 697–709.

ICALP-1988-Weijland #logic programming #semantics #source code

Semantics for Logic Programs without Occur Check (WPW), pp. 710–726.

ICALP-1988-You #equation

Outer Narrowing for Equational Theories Based on Constructors (JHY), pp. 727–741.