Volume 121, Number 1, August 15 1995
- Lane A. Hemaspaandra, Sudhir K. Jha:
Defying Upward and Downward Separation.
1-13
- Luc Longpré, Osamu Watanabe:
On Symmetry of Information and Polynomial Time Invertibility.
14-22
- Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano:
Zero-Knowledge Arguments and Public-Key Cryptography.
23-40
- Yosi Ben-Asher, Klaus-Jörn Lange, David Peleg, Assaf Schuster:
The Complexity of Reconfiguring Network Models.
41-58
- Rob J. van Glabbeek, Scott A. Smolka, Bernhard Steffen:
Reactive, Generative and Stratified Models of Probabilistic Processes.
59-80
- Georg Gottlob:
The Complexity of Default Reasoning under the Stationary Fixed Point Semantics.
81-92
- Leonard M. Adleman, Ming-Deh A. Huang, Kireeti Kompella:
Efficient Checkers for Number-Theoretic Computations.
93-102
- Peter Clote:
Cutting plane and Frege proofs.
103-122
- Iain A. Stewart:
Completeness of Path-Problems via Logical Reductions.
123-134
Volume 121, Number 2, September 1995
- Alexandru Mateescu, Arto Salomaa, Kai Salomaa, Sheng Yu:
P, NP and the Post Correspondence Problem.
135-142
- Søren Christensen, Hans Hüttel, Colin Stirling:
Bisimulation Equivalence is Decidable for All Context-Free Processes.
143-148
- Walter Vogler:
Timed Testing of Concurrent Systems.
149-171
- Leo Bachmair, Harald Ganzinger, Christopher Lynch, Wayne Snyder:
Basic Paramodulation.
172-192
- David A. McAllester, J. Kucan, D. F. Otth:
A Proof of Strong Normalization of F_2, F_omega and Beyond.
193-200
- Sanjay Jain, Arun Sharma, Mahendran Velauthapillai:
Finite Identification of Functions by Teams with Success Ratio 1\over2 and Above.
201-213
- Nancy A. Lynch, Frits W. Vaandrager:
Forward and Backward Simulations: I. Untimed Systems.
214-233
- Jos C. M. Baeten, Jan A. Bergstra, Scott A. Smolka:
Axiomatizing Probabilistic Processes: ACP with Generative Probabilities.
234-255
- Yoav Freund:
Boosting a Weak Learning Algorithm by Majority.
256-285
Copyright © Thu Nov 12 01:48:28 2009
by Michael Ley (ley@uni-trier.de)
