Automata, Languages, and Programming, ICALP '97

A semantics preserving actor translation
- Periodic and non-periodic min-max equations
- Efficient parallel graph algorithms for coarse grained multicomputers and BSP
- Upper bound on the communication complexity of private information retrieval
- Computation paths logic: An expressive, yet elementary, process logic
- Model checking the full modal mu-calculus for infinite sequential processes
- Symbolic model checking for probabilistic processes
- On the concentration of the height of binary search trees
- An improved master theorem for divide-and-conquer recurrences
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- Distributed processes and location failures
- Basic observables for processes
- Constrained bipartite edge coloring with applications to wavelength routing
- Colouring paths in directed symmetric trees with applications to WDM routing
- On-line routing in all-optical networks
- A complete characterization of the path layout construction problem for ATM networks with given hop count and load
- Efficiency of asynchronous systems and read arcs in petri nets
- Bisimulation equivalence is decidable for one-counter processes
- Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
- Axiomatizations for the perpetual loop in process algebra
- Discrete-time control for rectangular hybrid automata
- Maintaining minimum spanning trees in dynamic graphs
- Efficient splitting and merging algorithms for order decomposable problems
- Efficient array partitioning
- Constructive linear time algorithms for branchwidth
- The word matching problem is undecidable for finite special string-rewriting systems that are confluent
- The geometry of orthogonal reduction spaces
- The theory of vaccines
- The equivalence problem for deterministic pushdown automata is decidable
- On recognizable and rational formal power series in partially commuting variables
- On a conjecture of J. Shallit
- On characterizations of escrow encryption schemes
- Randomness-efficient non-interactive zero knowledge
- Approximation results for the optimum cost chromatic partition problem
- The minimum color sum of bipartite graphs
- A primal-dual approach to approximation of node-deletion problems for matroidal properties
- Independent sets in asteroidal triple-free graphs
- Refining and compressing abstract domains
- Labelled reductions, runtime errors, and operational subsumption
- A complete and efficiently computable topological classification of D-dimensional linear cellular automata over Z m
- Recognizability equals definability for partial k-paths
- Molecular computing, bounded nondeterminism, and efficient recursion
- Constructing big trees from short sequences
- Termination of constraint logic programs
- The expressive power of unique total stable model semantics