Javier Leach Albert, Burkhard Monien, Mario Rodríguez-Artalejo
Proceedings of the 18th International Colloquium on Automata, Languages and Programming
ICALP, 1991.

@proceedings{ICALP-1991,
	address       = "Madrid, Spain",
	editor        = "Javier Leach Albert and Burkhard Monien and Mario Rodríguez-Artalejo",
	isbn          = "3-540-54233-7",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 18th International Colloquium on Automata, Languages and Programming}",
	volume        = 510,
	year          = 1991,
}

Contents (60 items)

8 ×#algorithm
6 ×#graph
5 ×#on the
5 ×#problem
4 ×#generative
4 ×#parallel
4 ×#performance
3 ×#automaton
3 ×#power of
3 ×#probability

ICALP-1991-GabbrielliL #logic programming #on the #semantics #source code

On the Semantics of Logic Programs (MG, GL), pp. 1–19.

ICALP-1991-ChenH #logic programming

Logic Programming with Recurrence Domains (HC, JH), pp. 20–34.

ICALP-1991-BucciarelliE

Extensional Embedding of a Strongly Stable Model of PCF (AB, TE), pp. 35–46.

ICALP-1991-ErnoultM #analysis #strict

Uniform Ideals and Strictness Analysis (CE, AM), pp. 47–59.

ICALP-1991-TannenS #aspect-oriented #logic #programming #set

Logical and Computational Aspects of Programming with Sets/Bags/Lists (VT, RS), pp. 60–75.

ICALP-1991-BouajjaniFGRS #branch #safety #semantics

Safety for Branching Time Semantics (AB, JCF, SG, CR, JS), pp. 76–92.

ICALP-1991-FixFG #composition #verification

Program Composition and Modular Verification (LF, NF, OG), pp. 93–114.

ICALP-1991-AlurCD #model checking #probability #realtime

Model-Checking for Probabilistic Real-Time Systems (RA, CC, DLD), pp. 115–126.

ICALP-1991-CleavelandS #behaviour

Computing Behavioural Relations, Logically (RC, BS), pp. 127–138.

ICALP-1991-Ben-AsherPRS #configuration management #power of

The POwer of Reconfiguration (YBA, DP, RR, AS), pp. 139–150.

ICALP-1991-Fouks

General Resolution of Tseitin Formulas is Hard (JDF), pp. 151–162.

ICALP-1991-KannanY #generative #probability

Program Checkers for Probability Generation (SK, ACCY), pp. 163–173.

ICALP-1991-KanepsF #automaton #probability #regular expression

Running Time to Recognize Nonregular Languages by 2-Way Probabilistic Automata (JK, RF), pp. 174–185.

ICALP-1991-CasasDM #random

Static on Random Trees (RC, JD, CM), pp. 186–203.

ICALP-1991-Larsen #power of #specification

The Expressive Power of Implicit Specifications (KGL), pp. 204–216.

ICALP-1991-Yi #realtime

CCS + Time = An Interleaving Model for Real Time Systems (WY0), pp. 217–228.

ICALP-1991-DiekertOR #complexity #confluence #decidability #on the

On Confluent Semi-Commutations — Decidability and Complexity Results (VD, EO, KR), pp. 229–241.

ICALP-1991-DuchampK #commutative #monad

Lazard’s Factorizations of Free Partially Commutative Monoids (GD, DK), pp. 242–253.

ICALP-1991-GastinPZ #infinity #theorem

A Kleene Theorem for Infinite Trace Languages (PG, AP, WZ), pp. 254–266.

ICALP-1991-Dershowitz #horn clause #set

Cononical Sets of Horn Clauses (ND), pp. 267–278.

ICALP-1991-MadlenerNO #monad #string #term rewriting

A Specialized Completion Procedure for Monadic String-Rewriting Systems Presenting Groups (KM, PN, FO), pp. 279–290.

ICALP-1991-CurienC #reduction #λ-calculus

A Concluent Reduction for the λ-Calculus with Surjective Pairing and Terminal Object (PLC, RDC), pp. 291–302.

ICALP-1991-Fernando #recursion #source code

Provably Recursive Programs and Program Extraction (TF), pp. 303–313.

ICALP-1991-LengauerT #algorithm #performance #problem

Efficient Algorithms for Path Problems with Gernal Cost Citeria (TL, DT), pp. 314–326.

ICALP-1991-DjidjevPZ #graph

Computing Shortest Paths and Distances in Planar Graphs (HD, GEP, CDZ), pp. 327–338.

ICALP-1991-GalilI #component #graph #maintenance

Maintaining Biconnected Components of Dynamic Planar Graphs (ZG, GFI), pp. 339–350.

ICALP-1991-Loebl #graph #performance #polynomial

Efficient Maximal Cubic Graph Cuts (ML), pp. 351–362.

ICALP-1991-Vishkin #algorithm #parallel

Strutural Parallel Algorithmics (UV), pp. 363–380.

ICALP-1991-RanjanCR

Improving Known Solutions is Hard (DR, SC, PR), pp. 381–392.

ICALP-1991-HemachandraH

Collapsing Degrees via Strong Computation (LAH, AH), pp. 393–404.

ICALP-1991-Hagerup #generative #parallel #performance #permutation #random

Fast Parallel Generation of Random Permutations (TH), pp. 405–416.

ICALP-1991-JungSS #algorithm #constraints #parallel #precedence #scheduling

A Parallel Algorithm for Two Processors Precedence Constraint Scheduling (HJ, MJS, PGS), pp. 417–428.

ICALP-1991-Furer #algorithm #graph #performance

An Efficient NC Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs (MF), pp. 429–440.

ICALP-1991-Thomas #automaton #logic #on the

On Logics, Tilings, and Automata (WT), pp. 441–454.

ICALP-1991-JouannaudO #decidability #satisfiability

Satisfiability of Systems of Ordinal Notations with the Subterm Property is Decidable (JPJ, MO), pp. 455–468.

ICALP-1991-Comon #algebra #axiom

Complete Axiomatizations of Some Quotient Term Algebras (HC), pp. 469–480.

ICALP-1991-BolG #specification

The Meaning of Negative Premises in Transition System Specifications (RNB, JFG), pp. 481–494.

ICALP-1991-Vogler #similarity

Deciding History Preserving Bisimilarity (WV), pp. 495–505.

ICALP-1991-AcetoH #algebra #finite #process #refinement

Adding Action Refinement to a Finite Process Algebra (LA, MH), pp. 506–519.

ICALP-1991-BiniGP #matrix #parallel

Improved Parallel Computations with Matrices and Polynomials (DB, LG, VYP), pp. 520–531.

ICALP-1991-LagergrenA #congruence #finite #using

Finding Minimal Forbidden Minors Using a Finite Congruence (JL, SA), pp. 532–543.

ICALP-1991-BodlaenderK #algorithm #graph

Better Algorithms for the Pathwidth and Treewidth of Graphs (HLB, TK), pp. 544–555.

ICALP-1991-CuckerT #formal method #problem

Two P-Complete Problems in the Theory of the Reals (FC, AT), pp. 556–565.

ICALP-1991-HonkalaS #ambiguity #bound #morphism

L Morphisms: Bounded Delay and Regularity of Ambiguity (JH, AS), pp. 566–574.

ICALP-1991-BruyereF

Degree and Decomposability of Variable-Length Codes (VB, CdF), pp. 575–587.

ICALP-1991-Wilke #theorem

An Eilenberg Theorem for Infinity-Languages (TW), pp. 588–599.

ICALP-1991-CulikD #generative #image #order

Balancing Order and Chaos in Image Generation (KCI, SD), pp. 600–614.

ICALP-1991-Gurevich #complexity

Average Case Complexity (YG), pp. 615–628.

ICALP-1991-JiangR #automaton #nondeterminism #problem

Minimal NFA Problems Are Hard (TJ, BR), pp. 629–640.

ICALP-1991-Hashiguchi #algorithm #generative #regular expression

Algorithms for Determining the Smallest Number of Nonterminals (States) Sufficient for Generating (Accepting) a Regular Language (KH), pp. 641–648.

ICALP-1991-BhattacharyaT

Computing Shortest Transversals (BKB, GTT), pp. 649–660.

ICALP-1991-ChazelleEGGHSS #using

Ray Shooting in Polygons Using Geodesic Triangulations (BC, HE, MG, LJG, JH, MS, JS), pp. 661–646.

ICALP-1991-BernEY

The Expected Extremes in a Delaunay Triangulation (MWB, DE, FFY), pp. 674–685.

ICALP-1991-Chazelle #geometry

Computational Geometry for the Gourmet: Old Fare and New Dishes (BC), pp. 686–696.

ICALP-1991-DurisG #multi #on the #power of

On the Power of Multiple Reads in a Chip (PD, ZG), pp. 697–706.

ICALP-1991-GrogerT #linear #on the

On Linear Decision Trees Computing Boolean Functions (HDG, GT), pp. 707–718.

ICALP-1991-GalilM #algorithm #linear #problem

An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem (ZG, OM), pp. 719–727.

ICALP-1991-KhullerMV #algorithm #online

On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages (SK, SGM, VVV), pp. 728–738.

ICALP-1991-Naor #preprocessor #string

String Matching with Preprocessing of Text and Pattern (MN), pp. 739–750.

ICALP-1991-RaviAK #approximate #graph #problem #scheduling

Ordering Problems Approximated: Single-Processor Scheduling and Interval Graph Completion (RR, AA, PNK), pp. 751–762.