JCSS,
Volume 65
Volume 65,
Number 1,
August 2002
- Lenore Cowen, Ronald Fagin, Joe Kilian, Jon M. Kleinberg:
Guest Editor's Foreword.
1
- Miklós Ajtai:
Determinism versus Nondeterminism for Linear Time RAMs with Memory Restrictions.
2-37
- Paul Beame, Faith E. Fich:
Optimal Bounds for the Predecessor Problem and Related Problems.
38-72
- Ming Li, Bin Ma, Lusheng Wang:
Finding Similar Regions in Many Sequences.
73-96
- Ran Raz, Omer Reingold, Salil P. Vadhan:
Extracting all the Randomness and Reducing the Error in Trevisan's Extractors.
97-128
- Moses Charikar, Sudipto Guha, Éva Tardos, David B. Shmoys:
A Constant-Factor Approximation Algorithm for the k-Median Problem.
129-149
- Valerie King, Garry Sagert:
A Fully Dynamic Algorithm for Maintaining the Transitive Closure.
150-167
Volume 65,
Number 2,
September 2002
- Charles A. Stewart:
Reducibility between Classes of Port Graph Grammar.
169-223
- Atsuyoshi Nakamura, Naoki Abe:
Online Learning of Binary and n-ary Relations over Clustered Domains.
224-256
- Vikraman Arvind, Johannes Köbler:
New Lowness Results for ZPPNP and Other Complexity Classes.
257-277
- Tero Harju, Oscar H. Ibarra, Juhani Karhumäki, Arto Salomaa:
Some Decision Problems Concerning Semilinearity and Commutation.
278-294
- Dan E. Willard:
An Algorithm for Handling Many Relational Calculus Queries Efficiently.
295-331
- Piotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski, Wojciech Rytter:
On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts.
332-350
- Konstantin Skodinis, Egon Wanke:
Node Replacements in Embedding Normal Form.
351-376
- Juha Honkala:
The Equivalence Problem for DF0L Languages and Power Series.
377-392
- Giovanni Pighizzini, Jeffrey Shallit, Ming-wei Wang:
Unary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds.
393-414
- Llew Mason, Peter L. Bartlett, Mostefa Golea:
Generalization Error of Combined Classifiers.
415-438
Volume 65,
Number 3,
November 2002
- Ming Li, Pavel A. Pevzner, Ron Shamir:
Foreword.
441
- Nadia El-Mabrouk:
Reconstructing an ancestral genome using minimum segments duplications and reversals.
442-464
- Guo-Hui Lin, Zhi-Zhong Chen, Tao Jiang, Jianjun Wen:
The longest common subsequence problem for sequences with nested arc annotations.
465-480
- Jens Lagergren:
Combining polynomial running time and fast convergence for the disk-covering method.
481-493
- Deep Jaitly, Paul E. Kearney, Guo-Hui Lin, Bin Ma:
Methods for reconstructing the history of tandem repeats and their application to the human genome.
494-507
- Bernard M. E. Moret, Jijun Tang, Li-San Wang, Tandy Warnow:
Steps toward accurate reconstructions of phylogenies from gene-order data.
508-525
- Gopal Pandurangan, Ramesh Hariharan:
The restriction mapping problem revisited.
526-544
- Rune B. Lyngsø, Christian N. S. Pedersen:
The consensus string problem and the complexity of comparing hidden Markov models.
545-569
- Yaw-Ling Lin, Tao Jiang, Kun-Mao Chao:
Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis.
570-586
- Glenn Tesler:
Efficient algorithms for multichromosomal genome rearrangements.
587-609
Volume 65,
Number 4,
December 2002
Copyright © Mon Nov 2 21:44:17 2009
by Michael Ley (ley@uni-trier.de)
