Information and Computation, Volume 206
Volume 206, Number 1, January 2008
Philippe Moser:
Baire categories on small complexity classes and meager-comeager laws. 15-33
Volume 206, Numbers 2-4, February-April 2008
Joint Workshop on Foundations of Computer Security and Automated Reasoning for Security Protocol Analysis (FCS-ARSPA '06)
Thomas Santen:
Preservation of probabilistic information flow under refinement. 213-249
Volume 206, Number 5, May 2008
Special Issue:
The 17th International Conference on Concurrency Theory (CONCUR 2006)
Special Issue Articles
Regular Issue Articles
Frank Schulz:
Trees with exponentially growing costs. 569-578
Volume 206, Number 6, June 2008
Volume 206, Number 7, July 2008
Shih Ping Tung:
Computational complexity of sentences over fields. 791-805
Volume 206, Number 8, August 2008
Daniele Gorla:
Comparing communication primitives via their relative expressive power. 931-952
Volume 206, Numbers 9-10, September - October 2008
Miklós Krész:
Soliton automata with constant external edges. 1126-1141 Andreas Maletti:
Compositions of extended top-down tree transducers. 1187-1196 Pavel V. Martugin:
A series of slowly synchronizing automata with a zero state over a small alphabet. 1197-1203 Ralf Stiebe:
Slender Siromoney matrix languages. 1248-1258
Volume 206, Number 11, November 2008
Petr Jancar:
Bouziane's transformation of the Petri net reachability problem and incorrectness of the related algorithm. 1259-1263 Ruo-Wei Hung:
Optimal vertex ranking of block graphs. 1288-1302
Volume 206, Number 12, December 2008
Hayato Takahashi:
On a definition of random sequences with respect to conditional probability. 1375-1382 Ernst-Erich Doberkat:
Erratum and Addendum: Eilenberg-Moore algebras for stochastic relations. 1476-1484
maintained by

, founded at
