Information and Computation, Volume 130

Volume 130, Number 1, 10 October 1996

Stephen A. Fenner, Lance Fortnow, Lide Li:
Gap-Definability as a Closure Property. 1-17
Sanjay Jain, Arun Sharma:
Computational Limits on Team Identification of Languages. 19-60
Thomas Wilke, Haiseung Yoo:
Computing the Rabin Index of a Regular Language of Infinite Words. 61-70
Parosh Aziz Abdulla, Bengt Jonsson:
Undecidable Verification Problems for Programs with Unreliable Channels. 71-90
Carsten Damm, Markus Holzer:
Inductive Counting for Width-Restricted Branching Programs. 91-99

Paul Beame, Allan Borodin, Prabhakar Raghavan, Walter L. Ruzzo, Martin Tompa:
Time-Space Tradeoffs for Undirected Graph Traversal by Graph Automata. 101-129
Farn Wang:
Parametric Timing Analysis for Real-Time Systems. 131-150
Raffaele Giancarlo, Roberto Grossi:
On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications. 151-182
Véronique Bruyère, Clelia de Felice:
Any Lifting of a Trace Coding is a Word Coding. 183-193

Last update Sat May 18 20:28:09 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page