External Links

    Journal: Inf. Comput.

    Volume 105, Issue 2

    159 -- 267Samson Abramsky, C.-H. Luke Ong. Full Abstraction in the Lazy Lambda Calculus
    268 -- 288Leslie Ann Goldberg. Automating Pólya Theory: The Computational Complexity of the Cycle Index Polynomial

    Volume 105, Issue 1

    1 -- 29John C. Reynolds, Gordon D. Plotkin. On Functors Expressible in the Polymorphic Typed Lambda Calculus
    30 -- 41L. S. van Benthem Jutting. Typing in Pure Type Systems
    42 -- 71R. Hoofman. Continuous Information Systems
    72 -- 93William I. Gasarch, Lane A. Hemachandra, Albrecht Hoene. On Checking Versus Evaluation of Multiple Queries
    94 -- 104Hermann Jung, Lefteris M. Kirousis, Paul G. Spirakis. Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Directed Acyclic Graphs with Communication Delays
    105 -- 131Eric Sven Ristad. The Anaphora Problem
    132 -- 158Soma Chaudhuri. More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems
    runs on