Volume 184,
Number 1,
10 July 2003
- Anna Ingólfsdóttir:
A semantic theory for value-passing processes based on the late approach.
1-44
- Sanjay Jain, Efim B. Kinber, Christophe Papazian, Carl H. Smith, Rolf Wiehagen:
On the intrinsic complexity of learning recursive functions.
45-70
- Johannes Köbler, Jochen Messner, Jacobo Torán:
Optimal proof systems imply complete sets for promise classes.
71-92
- T. W. Sze, Samuel T. Chanson, Cunsheng Ding, Tor Helleseth, Matthew G. Parker:
Logarithm cartesian authentication codes.
93-108
- Yves Métivier, Nasser Saheb, Akka Zemmari:
Analysis of a randomized rendezvous algorithm.
109-128
- Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Steven Skiena:
The Lazy Bureaucrat scheduling problem.
129-146
- Faron Moller, Alexander Moshe Rabinovich:
Counting on CTL*: on the expressive power of monadic path logic.
147-159
- Josee Desharnais, Vineet Gupta, Radha Jagadeesan, Prakash Panangaden:
Approximating labelled Markov processes.
160-200
- Yuxi Fu:
Bisimulation congruence of chi calculus.
201-226
- Amir Pnueli, Yoav Rodeh, Ofer Strichman, Michael Siegel:
Erratum ("The small model property: how small can it be?" Volume 178, Number 1 [2002], pages 279-293).
227
Volume 184,
Number 2,
1 August 2003
Copyright © Sat Nov 28 22:29:17 2009
by Michael Ley (ley@uni-trier.de)
