External Links

    Journal: J. Comput. Syst. Sci.

    Volume 47, Issue 3

    376 -- 404Johan Håstad, A. W. Schrift, Adi Shamir. The Discrete Logarithm Modulo a Composite Hides O(n) Bits
    405 -- 423Mario Szegedy. Functions with Bounded Symmetric Communication Complexity, Programs over Commutative Monoids, and ACC
    424 -- 436Michael L. Fredman, Dan E. Willard. Surpassing the Information Theoretic Bound with Fusion Trees
    437 -- 458Ketan Mulmuley. Output Sensitive and Dynamic Constructions of Higher Order Voronoi Diagrams and Levels in Arrangements
    459 -- 500Ming-Yang Kao, Philip N. Klein. Towards Overcoming the Transitive-Closure Bottleneck: Efficient Parallel Algorithms for Planar Digraphs
    501 -- 548Robert Cypher, C. Greg Plaxton. Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers
    549 -- 595Manuel Blum, Michael Luby, Ronitt Rubinfeld. Self-Testing/Correcting with Applications to Numerical Problems
    runs on