Theoretical Computer Science, Volume 102
Volume 102, Number 1, 1992
Klaus Grue: Map Theory. 1-133- Steffen van Bakel: Complete Restrictions of the Intersection Type Discipline. 135-163
- Raymond R. Devillers: Maximality Preserving Bisimulation. 165-183
- Javier Esparza, Manuel Silva: A Polynomial-Time Algorithm to Decide Liveness of Bounded Free Choice Nets. 185-205
- Kosta Dosen: Nonmodal Classical Linear Predicate Logic is a Fragment of Intuitionistic Linear Logic. 207-214
Volume 102, Number 2, 1992
- Danilo Bruschi: Strong Separations of the Polynomial Hierarchy with Oracles: Constructive Separations by Immune and Simple Sets. 215-252
- Marcin Skubiszewski: Binary Periodic Synchronizing Sequences. 253-281
- Roland Mirwald, Claus-Peter Schnorr: The Multiplicative Complexity of Quadratic Boolean Forms. 307-328
- Liam Halpenny, Christopher J. Smyth: A Classification of Minimal Standard-Path 2x2 Switching Networks. 329-354
- Lakshman Prasad, S. Sitharama Iyengar: An Asymptotic Equality for the Number of Necklaces in a Shuffle-Exchange Network. 355-365
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T203413 by the dblp team