Journal: J. Comput. Syst. Sci.

Volume 65, Issue 4

611 -- 0Madhu Sudan. Foreword
612 -- 625Jürgen Forster. A linear lower bound on the unbounded error probabilistic communication complexity
626 -- 638Albert Atserias, Nicola Galesi, Pavel Pudlák. Monotone simulations of non-monotone proofs
639 -- 659Amir Shpilka. Affine projections of symmetric polynomials
660 -- 671Elchanan Mossel, Christopher Umans. On the complexity of approximating the VC dimension
672 -- 694Russell Impagliazzo, Valentine Kabanets, Avi Wigderson. In search of an easy witness: exponential time vs. probabilistic polynomial time
695 -- 716William Hesse, Eric Allender, David A. Mix Barrington. Uniform constant-depth threshold circuits for division and iterated multiplication
717 -- 726Michal Koucký. Universal traversal sequences with backtracking

Volume 65, Issue 3

441 -- 0Ming Li, Pavel A. Pevzner, Ron Shamir. Foreword
442 -- 464Nadia El-Mabrouk. Reconstructing an ancestral genome using minimum segments duplications and reversals
465 -- 480Guo-Hui Lin, Zhi-Zhong Chen, Tao Jiang, Jianjun Wen. The longest common subsequence problem for sequences with nested arc annotations
481 -- 493Jens Lagergren. Combining polynomial running time and fast convergence for the disk-covering method
494 -- 507Deep Jaitly, Paul E. Kearney, Guo-Hui Lin, Bin Ma. Methods for reconstructing the history of tandem repeats and their application to the human genome
508 -- 525Bernard M. E. Moret, Jijun Tang, Li-San Wang, Tandy Warnow. Steps toward accurate reconstructions of phylogenies from gene-order data
526 -- 544Gopal Pandurangan, Ramesh Hariharan. The restriction mapping problem revisited
545 -- 569Rune B. Lyngsø, Christian N. S. Pedersen. The consensus string problem and the complexity of comparing hidden Markov models
570 -- 586Yaw-Ling Lin, Tao Jiang, Kun-Mao Chao. Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis
587 -- 609Glenn Tesler. Efficient algorithms for multichromosomal genome rearrangements

Volume 65, Issue 2

169 -- 223Charles A. Stewart. Reducibility between Classes of Port Graph Grammar
224 -- 256Atsuyoshi Nakamura, Naoki Abe. Online Learning of Binary and n-ary Relations over Clustered Domains
257 -- 277Vikraman Arvind, Johannes Köbler. New Lowness Results for ZPPNP and Other Complexity Classes
278 -- 294Tero Harju, Oscar H. Ibarra, Juhani Karhumäki, Arto Salomaa. Some Decision Problems Concerning Semilinearity and Commutation
295 -- 331Dan E. Willard. An Algorithm for Handling Many Relational Calculus Queries Efficiently
332 -- 350Piotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski, Wojciech Rytter. On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts
351 -- 376Konstantin Skodinis, Egon Wanke. Node Replacements in Embedding Normal Form
377 -- 392Juha Honkala. The Equivalence Problem for DF0L Languages and Power Series
393 -- 414Giovanni Pighizzini, Jeffrey Shallit, Ming-wei Wang. Unary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds
415 -- 438Llew Mason, Peter L. Bartlett, Mostefa Golea. Generalization Error of Combined Classifiers

Volume 65, Issue 1

1 -- 0Lenore Cowen, Ronald Fagin, Joe Kilian, Jon M. Kleinberg. Guest Editor s Foreword
2 -- 37Miklós Ajtai. Determinism versus Nondeterminism for Linear Time RAMs with Memory Restrictions
38 -- 72Paul Beame, Faith E. Fich. Optimal Bounds for the Predecessor Problem and Related Problems
73 -- 96Ming Li, Bin Ma, Lusheng Wang. Finding Similar Regions in Many Sequences
97 -- 128Ran Raz, Omer Reingold, Salil P. Vadhan. Extracting all the Randomness and Reducing the Error in Trevisan s Extractors
129 -- 149Moses Charikar, Sudipto Guha, Éva Tardos, David B. Shmoys. A Constant-Factor Approximation Algorithm for the k-Median Problem
150 -- 167Valerie King, Garry Sagert. A Fully Dynamic Algorithm for Maintaining the Transitive Closure