Volume 118, Number 1, 1995
- Amihood Amir, Martin Farach:
Efficient 2-Dimensional Approximate Matching of Half-Rectangular Figures.
1-11
- Peter J. Stuckey:
Negation and Constraint Logic Programming.
12-33
- Samir Khuller, Yossi Matias:
A Simple Randomized Sieve Algorithm for the Closest-Pair Problem.
34-37
- Walter Vogler:
Generalized OM-Bisimulation.
38-47
- William J. Bultman, Wolfgang Maass:
Fast Identification of Geometric Objects with Membership Queries.
48-64
- John Shawe-Taylor:
Sample Sizes for Threshold Networks with Equivalences.
65-72
- Gregory Kucherov, Mohamed Tajine:
Decidability of Regularity and Related Properties of Ground Normal Form Languages.
91-100
- Hervé J. Touati, Robert K. Brayton, Robert P. Kurshan:
Testing Language Containment for omega-Automata Using BDD's.
101-109
- Igor Litovsky, Yves Métivier, Wieslaw Zielonka:
On the Recognition of Families of Graphs with Local Computations.
110-119
- Masako Takahashi:
Parallel Reductions in lambda-Calculus.
120-127
- Jens Palsberg, Michael I. Schwartzbach:
Safety Analysis versus Type Inference.
128-141
- Rajeev Alur, Alon Itai, Robert P. Kurshan, Mihalis Yannakakis:
Timing Verification by Successive Approximation.
142-157
- Flaviu Cristian, Houtan Aghili, H. Raymond Strong, Danny Dolev:
Atomic Broadcast: From Simple Message Diffusion to Byzantine Agreement.
158-179
Volume 118, Number 2, 1995
- Jirí Adámek:
Recursive Data Types in Algebraically omega-Complete Categories.
181-190
- Mogens Nielsen, Grzegorz Rozenberg, P. S. Thiagarajan:
Transition Systems, Event Structures and Unfoldings.
191-207
- Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen:
How Inductive Inference Strategies Discover Their Errors.
208-226
- Rolf Niedermeier, Peter Rossmanith:
Unambiguous Auxiliary Pushdown Automata and Semi-unbounded Fan-in Circuits.
227-245
- Joseph Y. Halpern, Edward L. Wimmers:
Full Abstraction and Expressive Completeness for FP.
246-271
- Roberto Gorrieri, Cosimo Laneve:
Split and ST Bisimulation Semantics.
272-288
- Howard Straubing, Denis Thérien, Wolfgang Thomas:
Regular Languages Defined with Generalized Quanifiers.
289-301
- Juraj Hromkovic, Vladimír Müller, Ondrej Sýkora, Imrich Vrto:
On Embeddings in Cycles.
302-305
- Didier Caucal, Dung T. Huynh, Lu Tian:
Deciding Branching Bimiliarity of Normed Context-Free Processes Is in \Sigma^ p_2.
306-315
- Oded Maler, Amir Pnueli:
On the Learnability of Infinitary Regular Sets.
316-326
- Andreas Weber, Reinhard Klemm:
Economy of Description for Single-Valued Transducers.
327-340
Copyright © Mon Nov 30 20:27:01 2009
by Michael Ley (ley@uni-trier.de)
