default search action
Information and Computation, Volume 126
Volume 126, Number 1, 10 April 1996
- Wan J. 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 - Jens Palsberg:
Erratum: "Efficient Inference of Object Types" Volume123, Number 2 (1995), pages 198-209. 103-104
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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.