External Links

    Journal: Theory Comput. Syst.

    Volume 35, Issue 6

    567 -- 597Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari. Bulk Synchronous Parallel Algorithms for the External Memory Model
    599 -- 623Micah Adler, Arnold L. Rosenberg, Ramesh K. Sitaraman, Walter Unger. Scheduling Time-Constrained Communication in Linear Networks
    625 -- 639Grammati E. Pantziou, George P. Pentaris, Paul G. Spirakis. Competitive Call Control in Mobile Networks
    641 -- 665Johanne Cohen, Pierre Fraigniaud, Margarida Mitjana. Polynomial-Time Algorithms for Minimum-Time Broadcast in Trees
    667 -- 683Zvi Lotker, Boaz Patt-Shamir. Average-Case Analysis of Greedy Packet Scheduling

    Volume 35, Issue 5

    469 -- 0Mitsunori Ogihara, Anne Condon. Guest Editors Foreword
    471 -- 481Andrei Paun. P Systems with Global Rules
    483 -- 500Julia Khodor, David K. Gifford. Programmed Mutagenesis Is Universal
    501 -- 519Andrzej Ehrenfeucht, Tero Harju, Ion Petre, Grzegorz Rozenberg. Characterizing the Micronuclear Gene Patterns in Ciliates
    521 -- 543Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou. Efficient On-Line Frequency Allocation and Call Control in Cellular Networks
    545 -- 558Shimon Even, Roni Kupershtok. Laying Out the Interconnection Network of the Transpose Bijection
    559 -- 564Yingjie Liu. The Fully Polynomial Approximation Algorithm for the 0-1 Knapsack Problem

    Volume 35, Issue 4

    389 -- 0. Editorial Statement
    391 -- 432Phillip B. Gibbons, John L. Bruno, Steven Phillips. Black-Box Correctness Tests for Basic Parallel Data Structures
    433 -- 448Olivier Bournez, Michael S. Branicky. The Mortality Problem for Matrices of Low Dimensions
    449 -- 463Shin Aida, Rainer Schuler, Tatsuie Tsukiji, Osamu Watanabe. The Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems
    465 -- 466Takashi Yokomori. Corrigendum Learning Two-Type Automata from Queries and Counterexamples

    Volume 35, Issue 3

    249 -- 0Shang-Hua Teng. Guest Editor s Foreward
    251 -- 267Susanne Albers. On Generalized Connection Caching
    269 -- 287An-Chow Lai, Babak Falsafi. Optimizing Traffic in DSM Clusters: Fine-Grain Memory Caching versus Page Migration/Replication
    289 -- 304Michael A. Bender, Michael O. Rabin. Online Scheduling of Parallel Programs on Heterogeneous Systems with Applications to Cilk
    305 -- 320Robert Elsässer, Burkhard Monien, Robert Preis. Diffusion Schemes for Load Balancing on Heterogeneous Networks
    321 -- 347Umut A. Acar, Guy E. Blelloch, Robert D. Blumofe. The Data Locality of Work Stealing
    349 -- 386Ole Agesen, David Detlefs, Christine H. Flood, Alexander T. Garthwaite, Paul A. Martin, Mark Moir, Nir Shavit, Guy L. Steele Jr.. DCAS-Based Concurrent Deques

    Volume 35, Issue 2

    97 -- 0Vijaya Ramachandran, Ramesh K. Sitaraman. SPAA 1999 - Guest Editors Foreword
    99 -- 128Costas Busch, Maurice Herlihy. Sorting and Counting Networks of Arbitrary Width and Small Depth
    129 -- 150Bradley C. Kuszmaul, Dana S. Henry, Gabriel H. Loh. A Comparison of Asymptotically Scalable Superscalar Processors
    151 -- 187Girija J. Narlikar. Scheduling Threads for Low Space Requirement and Good Locality
    189 -- 215Rakesh D. Barve, Jeffrey Scott Vitter. A Simple and Efficient Parallel Disk Mergesort
    217 -- 245Christof Krick, Friedhelm Meyer auf der Heide, Harald Räcke, Berthold Vöcking, Matthias Westermann. Data Management in Networks: Experimental Evaluation of a Provably Good Strategy

    Volume 35, Issue 1

    1 -- 11Amir M. Ben-Amram, Holger Petersen. Improved Bounds for Functions Related to Busy Beavers
    13 -- 38Pierre B. A. Lecomte, Michel Rigo. On the Representation of Real Numbers Using Regular Languages
    39 -- 57Palash Sarkar, Subhamoy Maitra. Cross-Correlation Analysis of Cryptographically Useful Boolean Functions and S-Boxes
    59 -- 79Jung-Sheng Fu, Gen-Huey Chen. Hamiltonicity of the Hierarchical Cubic Network
    81 -- 93André Große, Jörg Rothe, Gerd Wechsung. Computing Complete Graph Isomorphisms and Hamiltonian Cycles from Partial Ones
    runs on