Volume 155,
Number 1,
26 February 1996
- Stephen L. Bloom, Zoltán Ésik:
Fixed-Point Operations on ccc's. Part I.
1-38
- Davide Sangiorgi:
Locality and Interleaving Semantics in Calculi for Mobile Processes.
39-83
- Fairouz Kamareddine, Rob Nederpelt:
A Useful lambda-Notation.
85-109
- Neil Immerman, Sushant Patnaik, David W. Stemple:
The Expressiveness of a Family of Finite Set Languages.
111-140
- Jean-Michel Fourneau, Erol Gelenbe, Rina Suros:
G-Networks with Multiple Classes of Negative and Positive Customers.
141-156
- Vadam Kagan, Anil Nerode, V. S. Subrahmanian:
Computing Minimal Models by Partial Instantiation.
157-177
- Flemming Nielson, Hanne Riis Nielson:
From CML to its Process Algebra.
179-219
- Guo-Qiang Zhang:
Quasi-Prime Algebraic Domains.
221-264
- Martin W. Bunder, J. Roger Hindley:
Two beta-Equal lambda-I-Terms with no Types in Common.
265-266
- Thomas Drakengren:
Uniqueness of Scott's Reflexive Domain in P-omega.
267-276
- Wenhui Zhang:
Number of Models and Satisfiability of Sets of Clauses.
277-288
Volume 155,
Number 2,
11 March 1996
- Gregory Kucherov, Pierre Lescanne, Peter D. Mosses:
Valentin M. Antimirov (1961-1995).
289-290
- Valentin M. Antimirov:
Partial Derivatives of Regular Expressions and Finite Automaton Constructions.
291-319
- Elena Barcucci, Alberto Del Lungo, Maurice Nivat, Renzo Pinzani:
Reconstructing Convex Polyominoes from Horizontal and Vertical Projections.
321-347
- Jörg Keller:
Fast Rehashing in PRAM Emulations.
349-363
- Steffen Lange, Thomas Zeugmann, Shyam Kapur:
Monotonic and Dual Monotonic Language Learning.
365-410
- Kazuo Iwama, Chuzo Iwamoto, Manzur Morshed:
Time Lower Bounds do not Exist for CRCW PRAMs.
411-424
- Andrzej Ehrenfeucht, Paulien ten Pas, Grzegorz Rozenberg:
A Note on Binary Grammatical Codes of Trees.
425-438
- Jean Berstel, Jean-Eric Pin:
Local Languages and the Berry-Sethi Algorithm.
439-446
- Lane A. Hemaspaandra, Albrecht Hoene, Mitsunori Ogihara:
Reducibility Classes of P-Selective Sets.
447-457
Copyright © Fri Mar 12 17:33:08 2010
by Michael Ley (ley@uni-trier.de)