Theoretical Computer Science, Volume 113

Volume 113, Number 1, 1993

Selected Papers of the 8th Annual Symposium on Theoretical Aspects of Computer Science (STACS'91), Hamburg, Germany, February 14-16, 1991

Luc Albert, Rafael Casas, François Fages:
Average-Case Analysis of Unification Algorithms. 3-34
Volker Diekert:
On the Concentration of Infinite Traces. 35-54
Lance Fortnow, Carsten Lund:
Interactive Proof Systems and Alternating Time-Space Complexity. 55-73
Martin Hühne:
On the Power of Several Queues. 75-91
Thierry Jéron, Claude Jard:
Testing for Unboundedness of FIFO Channels. 93-117
Klaus Madlener, Paliath Narendran, Friedrich Otto, Louxin Zhang:
On Weakly Confluent Monadic String-Rewriting Systems. 119-165
Jun Tarui:
Probablistic Polynomials, AC0 Functions, and the Polynomial-Time Hierarchy. 167-183
Klaus Weihrauch:
Computability on Computable Metric Spaces. 191-210

Bo Yi, Jiafu Xu:
Analogy Calculus. 211-230
Ruqian Lu:
A True Concurrency Model of CCS Semantics. 231-258
Jianguo Lu, Jiafu Xu:
Analogical Program Derivation Based on Type Theory. 259-272
Antonio Bucciarelli, Thomas Ehrhard:
A Theory of Sequentiality. 273-291
Rob J. van Glabbeek, Frits W. Vaandrager:
Modular Specification of Process Algebras. 293-348
M. Masseron, Christophe Tollu, Jacqueline Vauzeilles:
Generating Plans in Linear Logic I. Actions as Proofs. 349-370
M. Masseron:
Generating Plans in Linear Logic I. A Geometry of Conjunctive Actions. 371-375

Last update Tue Feb 14 04:22:56 2012 CET by the DBLP Team —

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