External Links

    Journal: Theory Comput. Syst.

    Volume 29, Issue 6

    551 -- 572Zevi Miller, Dan Pritikin, Ivan Hal Sudborough. Bounded Dilation Maps of Hypercubes into Cayley Graphs on the Symmetric Group
    573 -- 587Jin-yi Cai, Zicheng Liu. The Bounded Membership Problem of the Monoid SL_2(N)
    589 -- 598Simon R. Blackburn. Node Bisectors of Cayley Graphs
    599 -- 634Steffen Lange, Thomas Zeugmann. Set-Driven and Rearrangement-Independent Learning of Recursive Languages
    635 -- 647Felipe Cucker, Martín Matamala. On Digital Nondeterminism
    649 -- 659Christoph Meinel, Stephan Waack. Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems
    661 -- 672Sanjay Gupta. Alternating Time Versus Deterministic Time: A Separation

    Volume 29, Issue 5

    423 -- 449Ming-Jye Sheu, Timothy J. Long. UP and the Low and High Hierarchies: A Relativized Separatin
    451 -- 470Jonathan L. Gross, Jianer Chen. Algebraic Specification of Interconnection Network Relationships by Permutation Voltage Graph Mappings
    471 -- 485Rainer Feldmann, Peter Mysliwietz. The Shuffle Exchange Network has a Hamiltonian Path
    487 -- 505Manindra Agrawal, Somenath Biswas. NP-Creative Sets: A New Class of Creative Sets in NP
    507 -- 534G. Dányi, Zoltán Fülöp. Superlinear Deterministic Top-Down Tree Transducers
    535 -- 548Lane A. Hemaspaandra, Marius Zimand. Strong Self-Reducibility Precludes Strong Immunity

    Volume 29, Issue 4

    311 -- 330Fillia Makedon, Antonios Symvonis. Flit-Serial Packet Routing on Meshes and Tori
    331 -- 356Masafumi Yamashita, Tiko Kameda. Computing Functions on Asynchronous Anonymous Networks
    357 -- 374Jaikumar Radhakrishnan. Pi-Sigma-Pi Threshold Formulas
    375 -- 386Amir M. Ben-Amram, Bryant A. Julstrom, Uri Zwick. A Note on Busy Beavers and Other Creatures
    387 -- 405Tao Jiang, Ming Li. DNA Sequencing and String Learning
    407 -- 409Yahya Ould Hamidoune, Oriol Serra. On Small Cuts Separating an Abelian Cayley Graph into Two Equal Parts
    411 -- 421Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner. On Balanced Versus Unbalanced Computation Trees

    Volume 29, Issue 3

    191 -- 226Jean-Camille Birget. Two-Way Automata and Length-Preserving Homomorphisms
    227 -- 244Wolfgang Golubski, Wolfram-Manfred Lippe. Tree-Stack Automata
    245 -- 258Jin-yi Cai, Frederic Green, Thomas Thierauf. On the Correlation of Symmetric Functions
    259 -- 270Takashi Yokomori. Learning Two-Tape Automata from Queries and Counterexamples
    271 -- 292Vladimir A. Uspensky, A. Shen. Relations Between Varieties of Kolmogorov Complexities
    293 -- 303Luis B. Morales, John S. Lew. An Enlarged Family of Packing Polynomials on Multidemensional Lattices
    305 -- 310John S. Lew, Luis B. Morales, A. Sánchez-Flores. Diagonal Polynomials for Small Dimensions

    Volume 29, Issue 2

    97 -- 110Christos H. Papadimitriou, Martha Sideri. The Bisection Width of Grid Graphs
    111 -- 156Kieran T. Herley. Representing Shared Data in Distributed-Memory Parallel Computers
    157 -- 167Spyros Tragoudas. Improved Approximations for the Minimum-Cut Ratio and the Flux
    169 -- 188Giora Slutzki, Sándor Vágvölgyi. A Hierarchy of Deterministic Top-Down Tree Transformations

    Volume 29, Issue 1

    3 -- 4Catherine C. McGeoch. Experimental Studies of Algorithms
    5 -- 31S. Jesi, Giovanni Pighizzini, Nicoletta Sabadini. Probabilistic Asynchronous Automata
    33 -- 46Johannes Köbler, Seinosuke Toda. On the Power of Generalized MOD-Classes
    47 -- 61Jarkko Kari. Representation of Reversible Cellular Automata with Block Permutations
    63 -- 94Vikraman Arvind, Johannes Köbler, Martin Mundhenk. Upper Bounds for the Complexity of Sparse and Tally Descriptions
    runs on