External Links

    Journal: Theory Comput. Syst.

    Volume 27, Issue 5

    381 -- 430Robert F. Chamberlain, Charles M. Fiduccia. Universality of Iterated Networks
    431 -- 452Amotz Bar-Noy, Shlomo Kipnis. Designing Broadcasting Algorithms in the Postal Model for Message-Passing Systems
    453 -- 470Richard J. Anderson. Primitives for Asynchronous List Compression
    471 -- 489Christos Kaklamanis, Giuseppe Persiano. Branch-and-Bound and Backtrack Search on Mesh-Connected Arrays of Processors
    491 -- 508C. Greg Plaxton, Torsten Suel. A Lower Bound for Sorting Networks Based on the Shuffle Permutation
    runs on