Thomas Ottmann
Proceedings of the 14th International Colloquium on Automata, Languages and Programming
ICALP, 1987.
@proceedings{ICALP-1987,
	address       = "Karlsruhe, Germany",
	editor        = "Thomas Ottmann",
	isbn          = "3-540-18088-5",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 14th International Colloquium on Automata, Languages and Programming}",
	volume        = 267,
	year          = 1987,
}
Contents (49 items)
- ICALP-1987-PittS #learning #probability
 - Probability and Plurality for Aggregations of Learning Machines (LP, CHS), pp. 1–10.
 - ICALP-1987-Abdallah #logic programming
 - Logic Programming with Ions (MANA), pp. 11–20.
 - ICALP-1987-Dybjer #analysis #image
 - Inverse Image Analysis (PD), pp. 21–30.
 - ICALP-1987-Holldobler #algorithm #confluence #unification
 - A Unification Algorithms for Confluent Theories (SH), pp. 31–41.
 - ICALP-1987-Diekert #concurrent #on the #process
 - On the Knuth-Bendix Completion for Concurrent Processes (VD), pp. 42–53.
 - ICALP-1987-HsiangR #equation #on the #problem #word
 - On Word Problems in Equational Theories (JH, MR), pp. 54–71.
 - ICALP-1987-ShyamasundarNP #network #nondeterminism #semantics
 - Semantics for Nondeterministic Asynchronous Broadcast Networks (RKS, KTN, TP), pp. 72–83.
 - ICALP-1987-BaetenG #abstraction #algebra #process
 - Another Look at Abstraction in Process Algebra (JCMB, RJvG), pp. 84–94.
 - ICALP-1987-GerthB #communication #process
 - A Timed Failures Model for Extended Communicating Processes (RG, AB), pp. 95–114.
 - ICALP-1987-GrafS #process #semantics
 - Readiness Semantics for Regular Processes with Silent Actions (SG, JS), pp. 115–125.
 - ICALP-1987-LarsenM #bisimulation #protocol #using #verification
 - Verifying a Protocol Using Relativized Bisimulation (KGL, RM), pp. 126–135.
 - ICALP-1987-Karhumaki #formal method #on the #roadmap
 - On Recent Trends in Formal Language Theory (JK), pp. 136–162.
 - ICALP-1987-BarringtonT #automaton
 - Non-Uniform Automata Over Groups (DAMB, DT), pp. 163–173.
 - ICALP-1987-Beauquier #automaton
 - Minimal Automaton of a Rational Cover (DB), pp. 174–189.
 - ICALP-1987-ChoffrutD #monad #problem
 - A Star-Height Problem in Free Monoids with Partial Communications (CC, CD), pp. 190–201.
 - ICALP-1987-Johnson #finite
 - Single-Valued Finite Transduction (JHJ), pp. 202–211.
 - ICALP-1987-Kuich #theorem
 - The Kleene and the Parikh Theorem in Complete Semirings (WK), pp. 212–225.
 - ICALP-1987-Metivier #algorithm #automaton #graph
 - An Algorithm for Computing Asynchronous Automata in the Case of Acyclic Non-Commutation Graphs (YM), pp. 226–236.
 - ICALP-1987-Pin #automaton #finite #on the
 - On the Language Accepted by Finite Reversible Automata (JÉP), pp. 237–249.
 - ICALP-1987-AalbersbergH #problem
 - Decision Problems for Regular Trace Languages (IJA, HJH), pp. 250–259.
 - ICALP-1987-ChytilD
 - Panic Mode without Panic (MC, JD), pp. 260–268.
 - ICALP-1987-HaferT #logic #monad #quantifier
 - Computation Tree Logic CTL* and Path Quantifiers in the Monadic Theory of the Binary Tree (TH, WT), pp. 269–279.
 - ICALP-1987-Josko #liveness #model checking
 - Modelchecking of CTL Formulae under Liveness Assumptions (BJ), pp. 280–289.
 - ICALP-1987-LodayaT #logic #subclass
 - A Modal Logic for a Subclass of Event Structures (KL, PST), pp. 290–303.
 - ICALP-1987-HagerupCD #graph #parallel
 - Parallel 5-Colouring of Planar Graphs (TH, MC, KD), pp. 304–313.
 - ICALP-1987-LandauSV #parallel
 - Parallel Construction of a Suffix Tree (GML, BS, UV), pp. 314–325.
 - ICALP-1987-LiY #complexity #parallel #probability #symmetry
 - The Probabilistic and Deterministic Parallel Complexity of Symmetric Functions (ML, YY), pp. 326–335.
 - ICALP-1987-RameshVKR #parallel
 - Term Matching on Parallel Computers (RR, RMV, KT, IVR), pp. 336–346.
 - ICALP-1987-LeeuwenSUZ #distributed #game studies #network
 - Guessing Games and Distributed Computations in Synchronous Networks (JvL, NS, JU, SZ), pp. 347–356.
 - ICALP-1987-SchwartzS #on the #problem
 - On the Bivariate Function Minimization Problem And Its Applications to Motion Planning (JTS, MS), pp. 357–363.
 - ICALP-1987-EdelsbrunnerRW #testing
 - Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane (HE, GR, EW), pp. 364–375.
 - ICALP-1987-LevcopoulosLS #geometry #heuristic
 - Nearly Optimal Heuristics for Binary Search Trees with Geometric Generalizations (CL, AL, JRS), pp. 376–385.
 - ICALP-1987-PazS #approximate #integer
 - Approximating Integer Lattices by Lattices with Cyclic Factor Groups (AP, CPS), pp. 386–393.
 - ICALP-1987-CaiM #complexity #graph #on the
 - On the Complexity of Graph Critical Uncolorability (JyC, GEM), pp. 394–403.
 - ICALP-1987-GambosiNT
 - Posets, Boolean Representations and Quick Path Searching (GG, JN, MT), pp. 404–424.
 - ICALP-1987-Miyano #algorithm #problem
 - The Lexicographically First Maximal Subgraph Problems: P-Completeness and NC Algorithms (SM), pp. 425–434.
 - ICALP-1987-Muller #complexity
 - Uniform Computational Complexity of Taylor Series (NTM), pp. 435–444.
 - ICALP-1987-Marchetti-SpaccamelaV #algorithm #online #performance #problem
 - Efficient On-Line Algorithms for the Knapsack Problem (AMS, CV), pp. 445–456.
 - ICALP-1987-Dietzfelbinger #bound #sorting
 - Lower Bounds for Sorting of Sums (MD), pp. 457–466.
 - ICALP-1987-AggarwalV #complexity #problem #sorting
 - The I/O Complexity of Sorting and Related Problems (AA, JSV), pp. 467–478.
 - ICALP-1987-MehlhornNA #bound #complexity #problem
 - A Lower Bound for the Complexity of the Union-Split-Find Problem (KM, SN, HA), pp. 479–488.
 - ICALP-1987-Tsakalidis
 - The Nearest Common Ancestor in a Dynamic Tree (AKT), pp. 489–498.
 - ICALP-1987-Finkel
 - A Generalization of the Procedure of Karp and Miller to Well Structured Transition Systems (AF), pp. 499–508.
 - ICALP-1987-HowellR #equivalence #reachability
 - Completeness Rules for Reachability, Containment, and Equivalence, with Respect to Conflict-Free Vector Replacement Systems (RRH, LER), pp. 509–520.
 - ICALP-1987-Kreowski #algebra #specification
 - Partial Algebras Flow From Algebraic Specifications (HJK), pp. 521–530.
 - ICALP-1987-LangeJK
 - The Logarithmic Alternation Hierarchy Collapses: AΣᴸ₂=AΠᴸ₂ (KJL, BJ, BK), pp. 531–541.
 - ICALP-1987-Beaudry #commutative #testing
 - Testing Membership in Commutative Transformation Semigroups (MB), pp. 542–549.
 - ICALP-1987-IbarraJ #array #on the #power of
 - On the Computing Power of One-Way Cellular Arrays (OHI, TJ), pp. 550–562.
 - ICALP-1987-Valiant #formal method #learning
 - Recent Developments in the Theory of Learning (LGV), p. 563.
 
8 ×#problem
7 ×#on the
5 ×#complexity
4 ×#algorithm
4 ×#automaton
4 ×#parallel
4 ×#process
3 ×#graph
2 ×#algebra
2 ×#bound
7 ×#on the
5 ×#complexity
4 ×#algorithm
4 ×#automaton
4 ×#parallel
4 ×#process
3 ×#graph
2 ×#algebra
2 ×#bound











