Information and Computation
, Volume 126
Volume 126, Number 1, 10 April 1996
Wan Fokkink
,
Rob J. van Glabbeek
:
Ntyft/Ntyxt Rules Reduce to Ntree Rules.
1-10
Martin Hofmann
,
Benjamin C. Pierce
:
Positive Subtyping.
11-33
Michele Boreale
,
Rocco De Nicola
:
A Symbolic Semantics for the pi-Calculus.
34-52
Hasan Md. Sayeed
,
Hosame Abu-Amara
:
Efficient Perfectly Secure Message Transmission in Synchronous Networks.
53-61
Rajeev Alur
,
Gadi Taubenfeld
:
Contention-Free Complexity of Shared Memory Algorithms.
62-73
Gordon D. Plotkin
:
On a Question of H. Friedman.
74-77
Toshiya Itoh
:
Simulating Fair Dice with Biased Coins.
78-82
Gérard Boudol
,
Cosimo Laneve
:
The Discriminating Power of Multiplicities in the Lambda-Calculus.
83-102
Volume 126, Number 2, 1 May 1996
Manfred Droste
:
Aperiodic Languages in Concurrency Monoids.
105-113
Thomas R. Hancock
,
Tao Jiang
,
Ming Li
,
John Tromp
:
Lower Bounds on Learning Decision Lists and Trees.
114-122
Roel Bloo
,
Fairouz Kamareddine
,
Rob Nederpelt
:
The Barendregt Cube with Definitions and Generalised Reduction.
123-143
Christophe Ringeissen
:
Combining Decision Algorithms for Matching in the Union of Disjoint Equational Theories.
144-160
Shiva Chaudhuri
:
Sensitive Functions and Approximate Problems.
161-168
Last update Tue May 21 18:57:01 2013 CET by the
DBLP Team
—
Data released under the
ODC-BY 1.0 license
— See also our
legal information page