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/jcss55.bht:"
download as .bib file
@article{DBLP:journals/jcss/Afrati97,
author = {Foto N. Afrati},
title = {Bounded Arity Datalog (not-)Queries on Graphs},
journal = {J. Comput. Syst. Sci.},
volume = {55},
number = {2},
pages = {210--228},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1521},
doi = {10.1006/JCSS.1997.1521},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Afrati97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Ben-DavidL97,
author = {Shai Ben{-}David and
Michael Lindenbaum},
title = {Learning Distributions by Their Density Levels: {A} Paradigm for Learning
without a Teacher},
journal = {J. Comput. Syst. Sci.},
volume = {55},
number = {1},
pages = {171--182},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1507},
doi = {10.1006/JCSS.1997.1507},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Ben-DavidL97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BerstelB97,
author = {Jean Berstel and
Luc Boasson},
title = {The Set of Minimal Words of a Context-Free Language is Context-Free},
journal = {J. Comput. Syst. Sci.},
volume = {55},
number = {3},
pages = {477--488},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1497},
doi = {10.1006/JCSS.1997.1497},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BerstelB97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BoyarFL97,
author = {Joan Boyar and
Rolf Fagerberg and
Kim S. Larsen},
title = {Amortization Results for Chromatic Search Trees, with an Application
to Priority Queues},
journal = {J. Comput. Syst. Sci.},
volume = {55},
number = {3},
pages = {504--521},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1511},
doi = {10.1006/JCSS.1997.1511},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BoyarFL97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/CaseKKK97,
author = {John Case and
Susanne Kaufmann and
Efim B. Kinber and
Martin Kummer},
title = {Learning Recursive Functions from Approximations},
journal = {J. Comput. Syst. Sci.},
volume = {55},
number = {1},
pages = {183--196},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1508},
doi = {10.1006/JCSS.1997.1508},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/CaseKKK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/ChaudhuriK97,
author = {Surajit Chaudhuri and
Phokion G. Kolaitis},
title = {Can Datalog Be Approximated?},
journal = {J. Comput. Syst. Sci.},
volume = {55},
number = {2},
pages = {355--369},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1528},
doi = {10.1006/JCSS.1997.1528},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/ChaudhuriK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Cohen97,
author = {Edith Cohen},
title = {Size-Estimation Framework with Applications to Transitive Closure
and Reachability},
journal = {J. Comput. Syst. Sci.},
volume = {55},
number = {3},
pages = {441--453},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1534},
doi = {10.1006/JCSS.1997.1534},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Cohen97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/EngelfrietO97,
author = {Joost Engelfriet and
Vincent van Oostrom},
title = {Logical Description of Contex-Free Graph Languages},
journal = {J. Comput. Syst. Sci.},
volume = {55},
number = {3},
pages = {489--503},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1510},
doi = {10.1006/JCSS.1997.1510},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/EngelfrietO97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/FaloutsosK97,
author = {Christos Faloutsos and
Ibrahim Kamel},
title = {Relaxing the Uniformity and Independence Assumptions Using the Concept
of Fractal Dimension},
journal = {J. Comput. Syst. Sci.},
volume = {55},
number = {2},
pages = {229--240},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1522},
doi = {10.1006/JCSS.1997.1522},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/FaloutsosK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/FreundS97,
author = {Yoav Freund and
Robert E. Schapire},
title = {A Decision-Theoretic Generalization of On-Line Learning and an Application
to Boosting},
journal = {J. Comput. Syst. Sci.},
volume = {55},
number = {1},
pages = {119--139},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1504},
doi = {10.1006/JCSS.1997.1504},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/FreundS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/FromentinR97,
author = {Eddy Fromentin and
Michel Raynal},
title = {Shared Global States in Distributed Computations},
journal = {J. Comput. Syst. Sci.},
volume = {55},
number = {3},
pages = {522--528},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1512},
doi = {10.1006/JCSS.1997.1512},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/FromentinR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GrumbachS97,
author = {St{\'{e}}phane Grumbach and
Jianwen Su},
title = {Finitely Representable Databases},
journal = {J. Comput. Syst. Sci.},
volume = {55},
number = {2},
pages = {273--298},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1524},
doi = {10.1006/JCSS.1997.1524},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/GrumbachS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GurvitsK97,
author = {Leonid Gurvits and
Pascal Koiran},
title = {Approximation and Learning of Convex Superpositions},
journal = {J. Comput. Syst. Sci.},
volume = {55},
number = {1},
pages = {161--170},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1506},
doi = {10.1006/JCSS.1997.1506},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/GurvitsK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Hariharan97,
author = {Ramesh Hariharan},
title = {Optimal Parallel Suffix Tree Construction},
journal = {J. Comput. Syst. Sci.},
volume = {55},
number = {1},
pages = {44--69},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1496},
doi = {10.1006/JCSS.1997.1496},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Hariharan97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/HemaspaandraO97,
author = {Lane A. Hemaspaandra and
Mitsunori Ogihara},
title = {Universally Serializable Computation},
journal = {J. Comput. Syst. Sci.},
volume = {55},
number = {3},
pages = {547--560},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1516},
doi = {10.1006/JCSS.1997.1516},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/HemaspaandraO97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/HenzingerKRS97,
author = {Monika Rauch Henzinger and
Philip N. Klein and
Satish Rao and
Sairam Subramanian},
title = {Faster Shortest-Path Algorithms for Planar Graphs},
journal = {J. Comput. Syst. Sci.},
volume = {55},
number = {1},
pages = {3--23},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1493},
doi = {10.1006/JCSS.1997.1493},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/HenzingerKRS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Jackson97,
author = {Jeffrey C. Jackson},
title = {An Efficient Membership-Query Algorithm for Learning {DNF} with Respect
to the Uniform Distribution},
journal = {J. Comput. Syst. Sci.},
volume = {55},
number = {3},
pages = {414--440},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1533},
doi = {10.1006/JCSS.1997.1533},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Jackson97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/KargerK97,
author = {David R. Karger and
Daphne Koller},
title = {(De)randomized Construction of Small Sample Spaces in {NC}},
journal = {J. Comput. Syst. Sci.},
volume = {55},
number = {3},
pages = {402--413},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1532},
doi = {10.1006/JCSS.1997.1532},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/KargerK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/KleitmanLM97,
author = {Daniel J. Kleitman and
Frank Thomson Leighton and
Yuan Ma},
title = {On the Design of Reliable Boolean Circuits That Contain Partially
Unreliable Gates},
journal = {J. Comput. Syst. Sci.},
volume = {55},
number = {3},
pages = {385--401},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1531},
doi = {10.1006/JCSS.1997.1531},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/KleitmanLM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/KrishnaswamyABA97,
author = {Vasudha Krishnaswamy and
Divyakant Agrawal and
John L. Bruno and
Amr El Abbadi},
title = {Relative Serializability: An Approach for Relaxing the Atomicity of
Transactions},
journal = {J. Comput. Syst. Sci.},
volume = {55},
number = {2},
pages = {344--354},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1527},
doi = {10.1006/JCSS.1997.1527},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/KrishnaswamyABA97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/LibkinW97,
author = {Leonid Libkin and
Limsoon Wong},
title = {Query Languages for Bags and Aggregate Functions},
journal = {J. Comput. Syst. Sci.},
volume = {55},
number = {2},
pages = {241--272},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1523},
doi = {10.1006/JCSS.1997.1523},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/LibkinW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/PatnaikI97,
author = {Sushant Patnaik and
Neil Immerman},
title = {Dyn-FO: {A} Parallel, Dynamic Complexity Class},
journal = {J. Comput. Syst. Sci.},
volume = {55},
number = {2},
pages = {199--209},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1520},
doi = {10.1006/JCSS.1997.1520},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/PatnaikI97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/RazborovR97,
author = {Alexander A. Razborov and
Steven Rudich},
title = {Natural Proofs},
journal = {J. Comput. Syst. Sci.},
volume = {55},
number = {1},
pages = {24--35},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1494},
doi = {10.1006/JCSS.1997.1494},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/RazborovR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Rissanen97,
author = {Jorma Rissanen},
title = {Stochastic Complexity in Learning},
journal = {J. Comput. Syst. Sci.},
volume = {55},
number = {1},
pages = {89--95},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1501},
doi = {10.1006/JCSS.1997.1501},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Rissanen97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Schuurmans97,
author = {Dale Schuurmans},
title = {Characterizing Rational Versus Exponential learning Curves},
journal = {J. Comput. Syst. Sci.},
volume = {55},
number = {1},
pages = {140--160},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1505},
doi = {10.1006/JCSS.1997.1505},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Schuurmans97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/SinhaT97,
author = {Rakesh K. Sinha and
Jayram S. Thathachar},
title = {Efficient Oblivious Branching Programs for Threshold and Mod Functions},
journal = {J. Comput. Syst. Sci.},
volume = {55},
number = {3},
pages = {373--384},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1530},
doi = {10.1006/JCSS.1997.1530},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/SinhaT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Solomonoff97,
author = {Ray J. Solomonoff},
title = {The Discovery of Algorithmic Probability},
journal = {J. Comput. Syst. Sci.},
volume = {55},
number = {1},
pages = {73--88},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1500},
doi = {10.1006/JCSS.1997.1500},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Solomonoff97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/SuciuP97,
author = {Dan Suciu and
Jan Paredaens},
title = {The Complexity of the Evaluation of Complex Algebra Expressions},
journal = {J. Comput. Syst. Sci.},
volume = {55},
number = {2},
pages = {322--343},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1526},
doi = {10.1006/JCSS.1997.1526},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/SuciuP97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/SuciuT97,
author = {Dan Suciu and
Val Tannen},
title = {A Query Language for {NC}},
journal = {J. Comput. Syst. Sci.},
volume = {55},
number = {2},
pages = {299--321},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1525},
doi = {10.1006/JCSS.1997.1525},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/SuciuT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Vovk97,
author = {V. G. Vovk},
title = {Learning about the Parameter of the Bernoulli Model},
journal = {J. Comput. Syst. Sci.},
volume = {55},
number = {1},
pages = {96--104},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1502},
doi = {10.1006/JCSS.1997.1502},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Vovk97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Weihe97,
author = {Karsten Weihe},
title = {Maximum (s, t)-Flows in Planar Networks in O({\(\vert\)}V{\(\vert\)}log{\(\vert\)}V{\(\vert\)})-Time},
journal = {J. Comput. Syst. Sci.},
volume = {55},
number = {3},
pages = {454--476},
year = {1997},
timestamp = {Thu, 20 Nov 2003 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Weihe97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Yamanishi97,
author = {Kenji Yamanishi},
title = {On-Line Maximum Likelihood Prediction with Respect to General Loss
Functions},
journal = {J. Comput. Syst. Sci.},
volume = {55},
number = {1},
pages = {105--118},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1503},
doi = {10.1006/JCSS.1997.1503},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Yamanishi97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/YanAYW97,
author = {G. Y. Yan and
Andreas Alexander Albrecht and
G. H. F. Young and
Chak{-}Kuen Wong},
title = {The Steiner Tree Problem in Orientation Metrics},
journal = {J. Comput. Syst. Sci.},
volume = {55},
number = {3},
pages = {529--546},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1513},
doi = {10.1006/JCSS.1997.1513},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/YanAYW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Yao97,
author = {Andrew Chi{-}Chih Yao},
title = {Decision Tree Complexity and Betti Numbers},
journal = {J. Comput. Syst. Sci.},
volume = {55},
number = {1},
pages = {36--43},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1495},
doi = {10.1006/JCSS.1997.1495},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Yao97.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-07-17 12:52 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:
