default search action
Theoretical Computer Science, Volume 113
Volume 113, Number 1, 1993
- 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
Volume 113, Number 2, 1993
- 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.