Volume 117, Number 1, 1995
- Robert P. Kurshan, Kenneth L. McMillan:
A Structural Induction Theorem for Processes.
1-11 BibTeX
- Hans Kleine Büning, Marek Karpinski, Andreas Flögel:
Resolution for Quantified Boolean Formulas.
12-18 BibTeX
- Amir M. Ben-Amram, Zvi Galil:
On the Power of the Shift Instruction.
19-36 BibTeX
- Georg Lausen, Eljas Soisalon-Soininen:
Safety by Uninterpreted Locks.
37-49 BibTeX
- Rodney R. Howell, Muralidhar K. Venkatrao:
On Non-Preemptive Scheduling of Recurring Tasks Using Inserted Idle Times.
50-62 BibTeX
- Changwook Kim, Dong Hoon Lee:
Node Replacement Graph Languages Squeezed with Chains, Trees, and Forests.
63-77 BibTeX
- Ramana M. Idury, Alejandro A. Schäffer:
Multiple Matching of Rectangular Patterns.
78-90 BibTeX
- Oded Shmueli:
A Single Recursive Predicate is Sufficient for Pure Datalog.
91-97 BibTeX
- P. W. Hoogers, H. C. M. Kleijn, P. S. Thiagarajan:
A Trace Semantics for Petri Nets.
98-114 BibTeX
- Giuseppe Castagna, Giorgio Ghelli, Giuseppe Longo:
A Calculus for Overloaded Functions with Subtyping.
115-135 BibTeX
- Marco Bellia, M. Eugenia Occhiuto:
Suprema of Open and Closed Formulas and Their Application to Resolution.
136-150 BibTeX
- Walter Ludwig:
A Subexponential Randomized Algorithm for the Simple Stochastic Game Problem.
151-155 BibTeX
Volume 117, Number 2, 1995
- Marianne Baudinet:
On the Expressiveness of Temporal Logic Programming.
157-180 BibTeX
- David Aldous, Umesh V. Vazirani:
A Markovian Extension of Valiant's Learning Model.
181-186 BibTeX
- Ramamohan Paturi, Sanguthevar Rajasekaran, John H. Reif:
The Light Bulb Problem.
187-192 BibTeX
- Dung T. Huynh, Lu Tian:
On Deciding Readiness and Failure Equivalences for Processes.
193-205 BibTeX
- Hirofumi Yokouchi:
Embedding a Second Order Type System into an Intersection Type System.
206-220 BibTeX
- Matthew Hennessy, Tim Regan:
A Process Algebra for Timed Systems.
221-239 BibTeX
- Shai Ben-David, Alon Itai, Eyal Kushilevitz:
Learning by Distances.
240-250 BibTeX
- Francis Bossut, Max Dauchet, Bruno Warin:
A Kleene Theorem for a Class of Planar Acyclic Graphs.
251-265 BibTeX
- Ashok Subramanian:
The Parallel Complexity of Propagation in Boolean Circuits.
266-275 BibTeX
- Sally A. Goldman, Michael J. Kearns, Robert E. Schapire:
On the Sample Complexity of Weakly Learning.
276-287 BibTeX
Copyright © Wed Jun 4 19:10:17 2008
by Michael Ley (ley@uni-trier.de)
