External Links

    Journal: Theory Comput. Syst.

    Volume 36, Issue 6

    597 -- 609Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro. Avoiding Routing Loops on the Internet
    611 -- 629Konrad Schlude, Eljas Soisalon-Soininen, Peter Widmayer. Distributed Search Trees: Fault Tolerance in an Asynchronous Environment
    631 -- 654Emmanuel Godard, Yves Métivier. Deducible and Equivalent Structural Knowledges in Distributed Algorithms
    655 -- 661Prosenjit Bose, Danny Krizanc, Stefan Langerman, Pat Morin. Asymmetric Communication Protocols via Hotlink Assignments
    663 -- 682Jean-Claude Bermond, Sébastien Choplin, Stephane Perennes. Hierarchical Ring Network design
    683 -- 693Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis. Approximate Equilibria and Ball Fusion
    695 -- 709Stefan Dobrev. Communication-Efficient Broadcasting in Complete Networks with Dynamic Faults
    711 -- 733Bogdan S. Chlebus, Karol Golab, Dariusz R. Kowalski. Broadcasting Spanning Forests on a Multiple-Access Channel

    Volume 36, Issue 5

    397 -- 430Guy E. Blelloch, Perry Cheng, Phillip B. Gibbons. Scalable Room Synchronizations
    431 -- 460Anne Condon, Alan J. Hu. Automatable Verification of Sequential Consistency
    461 -- 478Robert Elsässer, Thomas Lücking, Burkhard Monien. On Spectral Bounds for the k-Partitioning of Graphs
    479 -- 495Shay Kutten, David Peleg, Uzi Vishkin. Deterministic Resource Discovery in Distributed Networks
    497 -- 519Christof Krick, Harald Räcke, Matthias Westermann. Approximation Algorithms for Data Management in Networks
    521 -- 552Dorit Naishlos, Joseph Nuzman, Chau-Wen Tseng, Uzi Vishkin. Towards a First Vertical Prototyping of an Extremely Fine-Grained Parallel Programming Approach
    553 -- 574Sotiris E. Nikoletseas, Grigorios Prasinos, Paul G. Spirakis, Christos D. Zaroliagis. Attack Propagation in Networks
    575 -- 593Francisca Quintana, Jesús Corbal, Roger Espasa, Mateo Valero. A Cost-Effective Architecture for Vectorizable Numerical and Multimedia Applications

    Volume 36, Issue 4

    303 -- 328Eric Allender, Vikraman Arvind, Meena Mahajan. Arithmetic Complexity, Kleene Closure, and Formal Power Series
    329 -- 358Yossi Matias, Jeffrey Scott Vitter, Wen-Chun Ni. Dynamic Generation of Discrete Random Variates
    359 -- 374Alina Beygelzimer, Mitsunori Ogihara. The (Non)Enumerability of the Determinant and the Rank
    375 -- 386Jörg Rothe, Holger Spakowski, Jörg Vogel. Exact Complexity of the Winner Problem for Young Elections
    387 -- 391Vince Grolmusz, Gábor Tardos. A Note on Non-Deterministic Communication Complexity with Few Witnesses

    Volume 36, Issue 3

    217 -- 229Fabrice Noilhan, Miklos Santha. Semantical Counting Circuits
    231 -- 245Vincent D. Blondel, Vincent Canterini. Undecidable Problems for Probabilistic Automata of Fixed Dimension
    247 -- 293Zoltán Fülöp, Heiko Vogler. Tree Series Transformations that Respect Copying
    295 -- 299Richard J. Lipton, Mitsunori Ogihara, Yechezkel Zalcstein. A Note on Square Rooting of Time Functions of Turing Machines

    Volume 36, Issue 2

    105 -- 135Jin-yi Cai. Essentially Every Unimodular Matrix Defines an Expander
    137 -- 157Paola Flocchini, Flaminia L. Luccio. Routing in Series Parallel Networks
    159 -- 182Juraj Hromkovic, Martin Sauerhoff. The Power of Nondeterminism and Randomness for Oblivious Branching Programs
    183 -- 197Symeon Bozapalidis. Extending Stochastic and Quantum Functions
    199 -- 212Stephen A. Fenner. PP-Lowness and a Simple Definition of AWPP

    Volume 36, Issue 1

    1 -- 15Patrizio Cintioli, Riccardo Silvestri. Polynomial Time Introreducibility
    17 -- 27Debashis Bera, Madhumangal Pal, Tapan Kumar Pal. An Efficient Algorithm for Finding All Hinge Vertices on Trapezoid Graphs
    29 -- 69Howard Straubing, Denis Thérien. Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables
    71 -- 88Satyanarayana V. Lokam. Graph Complexity and Slice Functions
    89 -- 103Juha Honkala. The Equivalence Problem of Polynomially Bounded D0L Systems - a Bound Depending Only on the Size of the Alphabet
    runs on