Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/jcss/jcss65.bht:"
download as .bib file
@article{DBLP:journals/jcss/Ajtai02,
author = {Mikl{\'{o}}s Ajtai},
title = {Determinism versus Nondeterminism for Linear Time RAMs with Memory
Restrictions},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {1},
pages = {2--37},
year = {2002},
url = {https://doi.org/10.1006/jcss.2002.1821},
doi = {10.1006/JCSS.2002.1821},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Ajtai02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/ArvindK02,
author = {Vikraman Arvind and
Johannes K{\"{o}}bler},
title = {New Lowness Results for {ZPPNP} and Other Complexity Classes},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {2},
pages = {257--277},
year = {2002},
url = {https://doi.org/10.1006/jcss.2002.1835},
doi = {10.1006/JCSS.2002.1835},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/ArvindK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/AtseriasGP02,
author = {Albert Atserias and
Nicola Galesi and
Pavel Pudl{\'{a}}k},
title = {Monotone simulations of non-monotone proofs},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {4},
pages = {626--638},
year = {2002},
url = {https://doi.org/10.1016/S0022-0000(02)00020-X},
doi = {10.1016/S0022-0000(02)00020-X},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/AtseriasGP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BeameF02,
author = {Paul Beame and
Faith E. Fich},
title = {Optimal Bounds for the Predecessor Problem and Related Problems},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {1},
pages = {38--72},
year = {2002},
url = {https://doi.org/10.1006/jcss.2002.1822},
doi = {10.1006/JCSS.2002.1822},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/BeameF02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BermanKLPR02,
author = {Piotr Berman and
Marek Karpinski and
Lawrence L. Larmore and
Wojciech Plandowski and
Wojciech Rytter},
title = {On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional
Texts},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {2},
pages = {332--350},
year = {2002},
url = {https://doi.org/10.1006/jcss.2002.1852},
doi = {10.1006/JCSS.2002.1852},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BermanKLPR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/CharikarGTS02,
author = {Moses Charikar and
Sudipto Guha and
{\'{E}}va Tardos and
David B. Shmoys},
title = {A Constant-Factor Approximation Algorithm for the k-Median Problem},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {1},
pages = {129--149},
year = {2002},
url = {https://doi.org/10.1006/jcss.2002.1882},
doi = {10.1006/JCSS.2002.1882},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/CharikarGTS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/CowenFKK02,
author = {Lenore Cowen and
Ronald Fagin and
Joe Kilian and
Jon M. Kleinberg},
title = {Guest Editor's Foreword},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {1},
pages = {1},
year = {2002},
url = {https://doi.org/10.1006/jcss.2002.1834},
doi = {10.1006/JCSS.2002.1834},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/CowenFKK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/El-Mabrouk02,
author = {Nadia El{-}Mabrouk},
title = {Reconstructing an ancestral genome using minimum segments duplications
and reversals},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {3},
pages = {442--464},
year = {2002},
url = {https://doi.org/10.1016/S0022-0000(02)00003-X},
doi = {10.1016/S0022-0000(02)00003-X},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/El-Mabrouk02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Forster02,
author = {J{\"{u}}rgen Forster},
title = {A linear lower bound on the unbounded error probabilistic communication
complexity},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {4},
pages = {612--625},
year = {2002},
url = {https://doi.org/10.1016/S0022-0000(02)00019-3},
doi = {10.1016/S0022-0000(02)00019-3},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Forster02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/HarjuIKS02,
author = {Tero Harju and
Oscar H. Ibarra and
Juhani Karhum{\"{a}}ki and
Arto Salomaa},
title = {Some Decision Problems Concerning Semilinearity and Commutation},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {2},
pages = {278--294},
year = {2002},
url = {https://doi.org/10.1006/jcss.2002.1836},
doi = {10.1006/JCSS.2002.1836},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/HarjuIKS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/HesseAB02,
author = {William Hesse and
Eric Allender and
David A. Mix Barrington},
title = {Uniform constant-depth threshold circuits for division and iterated
multiplication},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {4},
pages = {695--716},
year = {2002},
url = {https://doi.org/10.1016/S0022-0000(02)00025-9},
doi = {10.1016/S0022-0000(02)00025-9},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/HesseAB02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Honkala02,
author = {Juha Honkala},
title = {The Equivalence Problem for {DF0L} Languages and Power Series},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {2},
pages = {377--392},
year = {2002},
url = {https://doi.org/10.1006/jcss.2002.1850},
doi = {10.1006/JCSS.2002.1850},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Honkala02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/ImpagliazzoKW02,
author = {Russell Impagliazzo and
Valentine Kabanets and
Avi Wigderson},
title = {In search of an easy witness: exponential time vs. probabilistic polynomial
time},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {4},
pages = {672--694},
year = {2002},
url = {https://doi.org/10.1016/S0022-0000(02)00024-7},
doi = {10.1016/S0022-0000(02)00024-7},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/ImpagliazzoKW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/JaitlyKLM02,
author = {Deep Jaitly and
Paul E. Kearney and
Guo{-}Hui Lin and
Bin Ma},
title = {Methods for reconstructing the history of tandem repeats and their
application to the human genome},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {3},
pages = {494--507},
year = {2002},
url = {https://doi.org/10.1016/S0022-0000(02)00006-5},
doi = {10.1016/S0022-0000(02)00006-5},
timestamp = {Thu, 16 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/JaitlyKLM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/KingS02,
author = {Valerie King and
Garry Sagert},
title = {A Fully Dynamic Algorithm for Maintaining the Transitive Closure},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {1},
pages = {150--167},
year = {2002},
url = {https://doi.org/10.1006/jcss.2002.1883},
doi = {10.1006/JCSS.2002.1883},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/KingS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Koucky02,
author = {Michal Kouck{\'{y}}},
title = {Universal traversal sequences with backtracking},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {4},
pages = {717--726},
year = {2002},
url = {https://doi.org/10.1016/S0022-0000(02)00023-5},
doi = {10.1016/S0022-0000(02)00023-5},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Koucky02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Lagergren02,
author = {Jens Lagergren},
title = {Combining polynomial running time and fast convergence for the disk-covering
method},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {3},
pages = {481--493},
year = {2002},
url = {https://doi.org/10.1016/S0022-0000(02)00005-3},
doi = {10.1016/S0022-0000(02)00005-3},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Lagergren02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/LiMW02,
author = {Ming Li and
Bin Ma and
Lusheng Wang},
title = {Finding Similar Regions in Many Sequences},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {1},
pages = {73--96},
year = {2002},
url = {https://doi.org/10.1006/jcss.2002.1823},
doi = {10.1006/JCSS.2002.1823},
timestamp = {Mon, 13 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/LiMW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/LiPS02,
author = {Ming Li and
Pavel A. Pevzner and
Ron Shamir},
title = {Foreword},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {3},
pages = {441},
year = {2002},
url = {https://doi.org/10.1016/S0022-0000(02)00002-8},
doi = {10.1016/S0022-0000(02)00002-8},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/LiPS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/LinCJW02,
author = {Guo{-}Hui Lin and
Zhi{-}Zhong Chen and
Tao Jiang and
Jianjun Wen},
title = {The longest common subsequence problem for sequences with nested arc
annotations},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {3},
pages = {465--480},
year = {2002},
url = {https://doi.org/10.1016/S0022-0000(02)00004-1},
doi = {10.1016/S0022-0000(02)00004-1},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/LinCJW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/LinJC02,
author = {Yaw{-}Ling Lin and
Tao Jiang and
Kun{-}Mao Chao},
title = {Efficient algorithms for locating the length-constrained heaviest
segments with applications to biomolecular sequence analysis},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {3},
pages = {570--586},
year = {2002},
url = {https://doi.org/10.1016/S0022-0000(02)00010-7},
doi = {10.1016/S0022-0000(02)00010-7},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/LinJC02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/LyngsoP02,
author = {Rune B. Lyngs{\o} and
Christian N. S. Pedersen},
title = {The consensus string problem and the complexity of comparing hidden
Markov models},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {3},
pages = {545--569},
year = {2002},
url = {https://doi.org/10.1016/S0022-0000(02)00009-0},
doi = {10.1016/S0022-0000(02)00009-0},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/LyngsoP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/MasonBG02,
author = {Llew Mason and
Peter L. Bartlett and
Mostefa Golea},
title = {Generalization Error of Combined Classifiers},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {2},
pages = {415--438},
year = {2002},
url = {https://doi.org/10.1006/jcss.2002.1854},
doi = {10.1006/JCSS.2002.1854},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/MasonBG02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/MoretTWW02,
author = {Bernard M. E. Moret and
Jijun Tang and
Li{-}San Wang and
Tandy J. Warnow},
title = {Steps toward accurate reconstructions of phylogenies from gene-order
data},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {3},
pages = {508--525},
year = {2002},
url = {https://doi.org/10.1016/S0022-0000(02)00007-7},
doi = {10.1016/S0022-0000(02)00007-7},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/MoretTWW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/MosselU02,
author = {Elchanan Mossel and
Christopher Umans},
title = {On the complexity of approximating the {VC} dimension},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {4},
pages = {660--671},
year = {2002},
url = {https://doi.org/10.1016/S0022-0000(02)00022-3},
doi = {10.1016/S0022-0000(02)00022-3},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/MosselU02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/NakamuraA02,
author = {Atsuyoshi Nakamura and
Naoki Abe},
title = {Online Learning of Binary and n-ary Relations over Clustered Domains},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {2},
pages = {224--256},
year = {2002},
url = {https://doi.org/10.1006/jcss.2002.1820},
doi = {10.1006/JCSS.2002.1820},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/NakamuraA02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/PanduranganH02,
author = {Gopal Pandurangan and
Ramesh Hariharan},
title = {The restriction mapping problem revisited},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {3},
pages = {526--544},
year = {2002},
url = {https://doi.org/10.1016/S0022-0000(02)00008-9},
doi = {10.1016/S0022-0000(02)00008-9},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/PanduranganH02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/PighizziniSW02,
author = {Giovanni Pighizzini and
Jeffrey O. Shallit and
Ming{-}wei Wang},
title = {Unary Context-Free Grammars and Pushdown Automata, Descriptional Complexity
and Auxiliary Space Lower Bounds},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {2},
pages = {393--414},
year = {2002},
url = {https://doi.org/10.1006/jcss.2002.1855},
doi = {10.1006/JCSS.2002.1855},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/PighizziniSW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/RazRV02,
author = {Ran Raz and
Omer Reingold and
Salil P. Vadhan},
title = {Extracting all the Randomness and Reducing the Error in Trevisan's
Extractors},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {1},
pages = {97--128},
year = {2002},
url = {https://doi.org/10.1006/jcss.2002.1824},
doi = {10.1006/JCSS.2002.1824},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/RazRV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Shpilka02,
author = {Amir Shpilka},
title = {Affine projections of symmetric polynomials},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {4},
pages = {639--659},
year = {2002},
url = {https://doi.org/10.1016/S0022-0000(02)00021-1},
doi = {10.1016/S0022-0000(02)00021-1},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/Shpilka02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/SkodinisW02,
author = {Konstantin Skodinis and
Egon Wanke},
title = {Node Replacements in Embedding Normal Form},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {2},
pages = {351--376},
year = {2002},
url = {https://doi.org/10.1006/jcss.2002.1851},
doi = {10.1006/JCSS.2002.1851},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/SkodinisW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Stewart02,
author = {Charles A. Stewart},
title = {Reducibility between Classes of Port Graph Grammar},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {2},
pages = {169--223},
year = {2002},
url = {https://doi.org/10.1006/jcss.2002.1814},
doi = {10.1006/JCSS.2002.1814},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/Stewart02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Sudan02,
author = {Madhu Sudan},
title = {Foreword},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {4},
pages = {611},
year = {2002},
url = {https://doi.org/10.1016/S0022-0000(02)00018-1},
doi = {10.1016/S0022-0000(02)00018-1},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/Sudan02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Tesler02,
author = {Glenn Tesler},
title = {Efficient algorithms for multichromosomal genome rearrangements},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {3},
pages = {587--609},
year = {2002},
url = {https://doi.org/10.1016/S0022-0000(02)00011-9},
doi = {10.1016/S0022-0000(02)00011-9},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Tesler02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Willard02,
author = {Dan E. Willard},
title = {An Algorithm for Handling Many Relational Calculus Queries Efficiently},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {2},
pages = {295--331},
year = {2002},
url = {https://doi.org/10.1006/jcss.2002.1848},
doi = {10.1006/JCSS.2002.1848},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Willard02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
retrieved on 2024-04-23 10:45 CEST from data curated 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:
