Journal: Theory Comput. Syst.

Volume 31, Issue 6

629 -- 662Lenwood S. Heath, John Paul C. Vergara. Edge-Packing in Planar Graphs
663 -- 677F. Fagnani, Luciano Margara. Expansivity, Permutivity, and Chaos for Cellular Automata
679 -- 693Bernd Borchert, Desh Ranjan, Frank Stephan. On the Computational Complexity of Some Classical Equivalence Relations on Boolean Functions

Volume 31, Issue 5

491 -- 506Tzuoo-Hawn Yeh, Cheng-Ming Kuo, Chin-Laung Lei, Hsu-Chun Yen. Competitive Analysis of On-Line Disk Scheduling
507 -- 538Andrzej Lingas, V. Soltan. Minimum Convex Partition of a Polygon with Holes by Cuts in Given Directions
539 -- 550Eric Allender, Klaus-Jörn Lange. RUSPACE(log ::::n::::) /subseteq DSPACE (log:::2::: ::::n:::: / log log ::::n::::)
551 -- 578Miroslaw Kutylowski, Krzysztof Lorys, Brigitte Oesterdiekhoff. Periodic Merging Networks
570 -- 591Kazuyoshi Hayase, Hiroshi Imai. OBDDs of a Monotone Function and Its Prime Implicants
593 -- 611Tatsuya Hayashi, Koji Nakano, Stephan Olariu. Efficient List Ranking on the Reconfigurable Mesh with Applications
613 -- 628Mark de Berg, Otfried Cheong, Olivier Devillers, Marc J. van Kreveld, Monique Teillaud. Computing the Maximum Overlap of Two Convex Polygons under Translations

Volume 31, Issue 4

331 -- 354S. Muthukrishnan, Bhaskar Ghosh, Martin H. Schultz. First- and Second-Order Diffusive Methods for Rapid, Coarse, Distributed Load Balancing
355 -- 376Seungjoon Park, David L. Dill. Verification of Cache Coherence Protocols by Aggregation of Distributed Transactions
377 -- 401Micah Adler. Asynchronous Shared Memory Search Structures
403 -- 423Nir Shavit, Eli Upfal, Asaph Zemach. A Steady State Analysis of Diffracting Trees
425 -- 449Christian Scheideler, Berthold Vöcking. Universal Continuous Routing Strategies
451 -- 473Liviu Iftode, Jaswinder Pal Singh, Kai Li. Scope Consistency: A Bridge between Release Consistency and Entry Consistency
475 -- 488Aythan Avior, Tiziana Calamoneri, Shimon Even, Ami Litman, Arnold L. Rosenberg. A Tight Layout of the Butterfly Network

Volume 31, Issue 3

215 -- 229Ludwig Staiger. A. Tight Upper Bound on Kolmogorov Complexity and Uniformly Optimal Prediction
231 -- 249Marc Gemis, Jan Paredaens, Peter Peelman, Jan Van den Bussche. Expressiveness and Complexity of Generic Graph Machines
251 -- 278Thomas H. Cormen, Kristin Bruhl. Don t Be Too Clever: Routing BMMC Permutations on the MasPar MP-2
279 -- 305A. Bouabdallah, Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau. Embedding Complete Binary Trees Into Star and Pancake Graphs
307 -- 325Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel. R:::::::S N:::::::::1-tt:: (NP) Distinguishes Robust Many-One and Turing Completeness

Volume 31, Issue 2

111 -- 133M. Hollander. Greedy Numeration Systems and Regularity
135 -- 167Bruce M. Maggs, C. Greg Plaxton, Stephen J. Smith, Marco Zagha. Sorting Algorithms
135 -- 167Guy E. Blelloch, Charles E. Leiserson. An Experimental Analysis of Parallel
169 -- 185Fabien Durand. A Generalization of Cobham s Theorem
187 -- 214Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith. Sharply Bounded Alternation and Quasilinear Time

Volume 31, Issue 1

1 -- 4Daniel Hammer, Alexander Shen. A Strange Application of Kolmogorov Complexity
5 -- 26Fabrizio Luccio, Linda Pagli. Computing with Time-Varying Data: Sequential Complexity and Parallel Speed-Up
27 -- 40Sanjay Gupta. Isolating an Odd Number of Elements and Applications in Complexity Theory
41 -- 61Amir Ben-Dor, Shai Halevi, Assaf Schuster. Potential Function Analysis of Greedy Hot-Potato Routing
63 -- 66Frank K. Hwang, Y. C. Yao. Comments on the Oblivious Routing Algorithm of Kaklamanis, Krizanc, and Tsantilas in the Hypercube
67 -- 75Jin-yi Cai. Frobenius s Degree Formula and Toda s Polynomials
77 -- 92Harry Buhrman, Jim Kadin, Thomas Thierauf. Functions Computable with Nonadaptive Queries to NP
93 -- 108K. Cronauer, Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner. The Chain Method to Separate Counting Classes