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/jcss69.bht:"
download as .bib file
@article{DBLP:journals/jcss/Alexeev04,
author = {Boris Alexeev},
title = {Minimal {DFA} for testing divisibility},
journal = {J. Comput. Syst. Sci.},
volume = {69},
number = {2},
pages = {235--243},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2004.02.001},
doi = {10.1016/J.JCSS.2004.02.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Alexeev04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/AlonS04,
author = {Noga Alon and
Asaf Shapira},
title = {Testing subgraphs in directed graphs},
journal = {J. Comput. Syst. Sci.},
volume = {69},
number = {3},
pages = {354--382},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2004.04.008},
doi = {10.1016/J.JCSS.2004.04.008},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/AlonS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/AzarCFKR04,
author = {Yossi Azar and
Edith Cohen and
Amos Fiat and
Haim Kaplan and
Harald R{\"{a}}cke},
title = {Optimal oblivious routing in polynomial time},
journal = {J. Comput. Syst. Sci.},
volume = {69},
number = {3},
pages = {383--394},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2004.04.010},
doi = {10.1016/J.JCSS.2004.04.010},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/AzarCFKR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BachCGJW04,
author = {Eric Bach and
Susan N. Coppersmith and
Marcel Paz Goldschen and
Robert Joynt and
John Watrous},
title = {One-dimensional quantum walks with absorbing boundaries},
journal = {J. Comput. Syst. Sci.},
volume = {69},
number = {4},
pages = {562--592},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2004.03.005},
doi = {10.1016/J.JCSS.2004.03.005},
timestamp = {Wed, 01 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BachCGJW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Bar-YehudaK04,
author = {Reuven Bar{-}Yehuda and
Zehavit Kehat},
title = {Approximating the dense set-cover problem},
journal = {J. Comput. Syst. Sci.},
volume = {69},
number = {4},
pages = {547--561},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2004.03.006},
doi = {10.1016/J.JCSS.2004.03.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Bar-YehudaK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BarnumS04,
author = {Howard Barnum and
Michael E. Saks},
title = {A lower bound on the quantum query complexity of read-once functions},
journal = {J. Comput. Syst. Sci.},
volume = {69},
number = {2},
pages = {244--258},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2004.02.002},
doi = {10.1016/J.JCSS.2004.02.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BarnumS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BeierV04,
author = {Ren{\'{e}} Beier and
Berthold V{\"{o}}cking},
title = {Random knapsack in expected polynomial time},
journal = {J. Comput. Syst. Sci.},
volume = {69},
number = {3},
pages = {306--329},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2004.04.004},
doi = {10.1016/J.JCSS.2004.04.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BeierV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/CaseJSW04,
author = {John Case and
Sanjay Jain and
Frank Stephan and
Rolf Wiehagen},
title = {Robust learning--rich and poor},
journal = {J. Comput. Syst. Sci.},
volume = {69},
number = {2},
pages = {123--165},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2003.10.005},
doi = {10.1016/J.JCSS.2003.10.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/CaseJSW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/ChawlaLS04,
author = {Deepak Chawla and
Lin Li and
Stephen Scott},
title = {On approximating weighted sums with exponentially many terms},
journal = {J. Comput. Syst. Sci.},
volume = {69},
number = {2},
pages = {196--234},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2004.01.006},
doi = {10.1016/J.JCSS.2004.01.006},
timestamp = {Wed, 12 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/ChawlaLS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/ChenDS04,
author = {Ning Chen and
Xiaotie Deng and
Xiaoming Sun},
title = {On complexity of single-minded auction},
journal = {J. Comput. Syst. Sci.},
volume = {69},
number = {4},
pages = {675--687},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2004.04.012},
doi = {10.1016/J.JCSS.2004.04.012},
timestamp = {Wed, 26 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/ChenDS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Condon04,
author = {Anne Condon},
title = {Guest editor's foreword},
journal = {J. Comput. Syst. Sci.},
volume = {69},
number = {1},
pages = {1--2},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2004.01.005},
doi = {10.1016/J.JCSS.2004.01.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Condon04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/DammKMW04,
author = {Carsten Damm and
Matthias Krause and
Christoph Meinel and
Stephan Waack},
title = {On relations between counting communication complexity classes},
journal = {J. Comput. Syst. Sci.},
volume = {69},
number = {2},
pages = {259--280},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2004.03.002},
doi = {10.1016/J.JCSS.2004.03.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/DammKMW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/DemaineHNRT04,
author = {Erik D. Demaine and
Mohammad Taghi Hajiaghayi and
Naomi Nishimura and
Prabhakar Ragde and
Dimitrios M. Thilikos},
title = {Approximation algorithms for classes of graphs excluding single-crossing
graphs as minors},
journal = {J. Comput. Syst. Sci.},
volume = {69},
number = {2},
pages = {166--195},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2003.12.001},
doi = {10.1016/J.JCSS.2003.12.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/DemaineHNRT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/FakcharoenpholRT04,
author = {Jittat Fakcharoenphol and
Satish Rao and
Kunal Talwar},
title = {A tight bound on approximating arbitrary metrics by tree metrics},
journal = {J. Comput. Syst. Sci.},
volume = {69},
number = {3},
pages = {485--497},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2004.04.011},
doi = {10.1016/J.JCSS.2004.04.011},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/FakcharoenpholRT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/FeigeM04,
author = {Uriel Feige and
Daniele Micciancio},
title = {The inapproximability of lattice and coding problems with preprocessing},
journal = {J. Comput. Syst. Sci.},
volume = {69},
number = {1},
pages = {45--67},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2004.01.002},
doi = {10.1016/J.JCSS.2004.01.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/FeigeM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Green04,
author = {Frederic Green},
title = {The correlation between parity and quadratic polynomials mod 3},
journal = {J. Comput. Syst. Sci.},
volume = {69},
number = {1},
pages = {28--44},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2004.01.003},
doi = {10.1016/J.JCSS.2004.01.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Green04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Gurvits04,
author = {Leonid Gurvits},
title = {Classical complexity and quantum entanglement},
journal = {J. Comput. Syst. Sci.},
volume = {69},
number = {3},
pages = {448--484},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2004.06.003},
doi = {10.1016/J.JCSS.2004.06.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Gurvits04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GusfieldS04,
author = {Dan Gusfield and
Jens Stoye},
title = {Linear time algorithms for finding and representing all the tandem
repeats in a string},
journal = {J. Comput. Syst. Sci.},
volume = {69},
number = {4},
pages = {525--546},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2004.03.004},
doi = {10.1016/J.JCSS.2004.03.004},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/GusfieldS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/HitchcockLM04,
author = {John M. Hitchcock and
Jack H. Lutz and
Elvira Mayordomo},
title = {Scaled dimension and nonuniform complexity},
journal = {J. Comput. Syst. Sci.},
volume = {69},
number = {2},
pages = {97--122},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2003.09.001},
doi = {10.1016/J.JCSS.2003.09.001},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/HitchcockLM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/HuangCQ04,
author = {He Huang and
Jinde Cao and
Yuzhong Qu},
title = {Global robust stability of delayed neural networks with a class of
general activation functions},
journal = {J. Comput. Syst. Sci.},
volume = {69},
number = {4},
pages = {688--700},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2004.05.002},
doi = {10.1016/J.JCSS.2004.05.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/HuangCQ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/JayramKKR04,
author = {T. S. Jayram and
Subhash Khot and
Ravi Kumar and
Yuval Rabani},
title = {Cell-probe lower bounds for the partial match problem},
journal = {J. Comput. Syst. Sci.},
volume = {69},
number = {3},
pages = {435--447},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2004.04.006},
doi = {10.1016/J.JCSS.2004.04.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/JayramKKR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/KerenidisW04,
author = {Iordanis Kerenidis and
Ronald de Wolf},
title = {Exponential lower bound for 2-query locally decodable codes via a
quantum argument},
journal = {J. Comput. Syst. Sci.},
volume = {69},
number = {3},
pages = {395--420},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2004.04.007},
doi = {10.1016/J.JCSS.2004.04.007},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/KerenidisW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/KhannaS04,
author = {Sanjeev Khanna and
Aravind Srinivasan},
title = {Special issue: 35th Annual {ACM} Symposium on Theory of Computing},
journal = {J. Comput. Syst. Sci.},
volume = {69},
number = {3},
pages = {305},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2004.06.004},
doi = {10.1016/J.JCSS.2004.06.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/KhannaS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/LomonosovSP04,
author = {Andrew Lomonosov and
Meera Sitharam and
Kihong Park},
title = {Network QoS games: stability vs optimality tradeoff},
journal = {J. Comput. Syst. Sci.},
volume = {69},
number = {2},
pages = {281--302},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2004.03.001},
doi = {10.1016/J.JCSS.2004.03.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/LomonosovSP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/MaassM04,
author = {Wolfgang Maass and
Henry Markram},
title = {On the computational power of circuits of spiking neurons},
journal = {J. Comput. Syst. Sci.},
volume = {69},
number = {4},
pages = {593--616},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2004.04.001},
doi = {10.1016/J.JCSS.2004.04.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/MaassM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/MosselOS04,
author = {Elchanan Mossel and
Ryan O'Donnell and
Rocco A. Servedio},
title = {Learning functions of k relevant variables},
journal = {J. Comput. Syst. Sci.},
volume = {69},
number = {3},
pages = {421--434},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2004.04.002},
doi = {10.1016/J.JCSS.2004.04.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/MosselOS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/ODonnell04,
author = {Ryan O'Donnell},
title = {Hardness amplification within \({}_{\mbox{NP}}\)},
journal = {J. Comput. Syst. Sci.},
volume = {69},
number = {1},
pages = {68--94},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2004.01.001},
doi = {10.1016/J.JCSS.2004.01.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/ODonnell04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/OgiharaT04,
author = {Mitsunori Ogihara and
Till Tantau},
title = {On the reducibility of sets inside {NP} to sets with low information
content},
journal = {J. Comput. Syst. Sci.},
volume = {69},
number = {4},
pages = {499--524},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2004.03.003},
doi = {10.1016/J.JCSS.2004.03.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/OgiharaT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Razborov04,
author = {Alexander A. Razborov},
title = {Resolution lower bounds for perfect matching principles},
journal = {J. Comput. Syst. Sci.},
volume = {69},
number = {1},
pages = {3--27},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2004.01.004},
doi = {10.1016/J.JCSS.2004.01.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Razborov04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Szeider04,
author = {Stefan Szeider},
title = {Minimal unsatisfiable formulas with bounded clause-variable difference
are fixed-parameter tractable},
journal = {J. Comput. Syst. Sci.},
volume = {69},
number = {4},
pages = {656--674},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2004.04.009},
doi = {10.1016/J.JCSS.2004.04.009},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Szeider04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Thorup04,
author = {Mikkel Thorup},
title = {Integer priority queues with decrease key in constant time and the
single source shortest paths problem},
journal = {J. Comput. Syst. Sci.},
volume = {69},
number = {3},
pages = {330--353},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2004.04.003},
doi = {10.1016/J.JCSS.2004.04.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Thorup04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/VandeurzenGG04,
author = {Luc Vandeurzen and
Marc Gyssens and
Dirk Van Gucht},
title = {An expressive language for linear spatial database queries},
journal = {J. Comput. Syst. Sci.},
volume = {69},
number = {4},
pages = {617--655},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2004.04.005},
doi = {10.1016/J.JCSS.2004.04.005},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/VandeurzenGG04.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-05-29 04:59 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:
