default search action
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
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
Extracting all the Randomness and Reducing the Error in Trevisan's Extractors. 97-128 - Moses Charikar
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
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
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
Unary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds. 393-414 - Llew Mason, Peter L. Bartlett
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
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
Steps toward accurate reconstructions of phylogenies from gene-order data. 508-525 - Gopal Pandurangan
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
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
- Madhu Sudan:
Foreword. 611 - Jürgen Forster:
A linear lower bound on the unbounded error probabilistic communication complexity. 612-625 - Albert Atserias, Nicola Galesi, Pavel Pudlák:
Monotone simulations of non-monotone proofs. 626-638 - Amir Shpilka
Affine projections of symmetric polynomials. 639-659 - Elchanan Mossel
On the complexity of approximating the VC dimension. 660-671 - Russell Impagliazzo
In search of an easy witness: exponential time vs. probabilistic polynomial time. 672-694 - William Hesse, Eric Allender, David A. Mix Barrington:
Uniform constant-depth threshold circuits for division and iterated multiplication. 695-716 - Michal Koucký
Universal traversal sequences with backtracking. 717-726
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-22 19:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: