External Links

    Journal: Inf. Comput.

    Volume 126, Issue 2

    105 -- 113Manfred Droste. Aperiodic Languages in Concurrency Monoids
    114 -- 122Thomas R. Hancock, Tao Jiang, Ming Li, John Tromp. Lower Bounds on Learning Decision Lists and Trees
    123 -- 143Roel Bloo, Fairouz Kamareddine, Rob Nederpelt. The Barendregt Cube with Definitions and Generalised Reduction
    144 -- 160Christophe Ringeissen. Combining Decision Algorithms for Matching in the Union of Disjoint Equational Theories
    161 -- 168Shiva Chaudhuri. Sensitive Functions and Approximate Problems

    Volume 126, Issue 1

    1 -- 10Wan Fokkink, Rob J. van Glabbeek. Ntyft/Ntyxt Rules Reduce to Ntree Rules
    11 -- 33Martin Hofmann, Benjamin C. Pierce. Positive Subtyping
    34 -- 52Michele Boreale, Rocco De Nicola. A Symbolic Semantics for the pi-Calculus
    53 -- 61Hasan Md. Sayeed, Hosame Abu-Amara. Efficient Perfectly Secure Message Transmission in Synchronous Networks
    62 -- 73Rajeev Alur, Gadi Taubenfeld. Contention-Free Complexity of Shared Memory Algorithms
    74 -- 77Gordon D. Plotkin. On a Question of H. Friedman
    78 -- 82Toshiya Itoh. Simulating Fair Dice with Biased Coins
    83 -- 102Gérard Boudol, Cosimo Laneve. The Discriminating Power of Multiplicities in the Lambda-Calculus
    103 -- 104Jens Palsberg. Erratum: "Efficient Inference of Object Types" Volume123, Number 2 (1995), pages 198-209
    runs on