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/jcss50.bht:"
download as .bib file
@article{DBLP:journals/jcss/AbiteboulV95,
author = {Serge Abiteboul and
Victor Vianu},
title = {Computing with First-Order Logic},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {2},
pages = {309--335},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1025},
doi = {10.1006/JCSS.1995.1025},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/AbiteboulV95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/AngluinK95,
author = {Dana Angluin and
Michael Kharitonov},
title = {When Won't Membership Queries Help?},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {2},
pages = {336--355},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1026},
doi = {10.1006/JCSS.1995.1026},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/AngluinK95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BabaiCFLS95,
author = {L{\'{a}}szl{\'{o}} Babai and
Gene Cooperman and
Larry Finkelstein and
Eugene M. Luks and
{\'{A}}kos Seress},
title = {Fast Monte Carlo Algorithms for Permutation Groups},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {2},
pages = {296--308},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1024},
doi = {10.1006/JCSS.1995.1024},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/BabaiCFLS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BarringtonS95,
author = {David A. Mix Barrington and
Howard Straubing},
title = {Superlinear Lower Bounds for Bounded-Width Branching Programs},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {3},
pages = {374--381},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1029},
doi = {10.1006/JCSS.1995.1029},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BarringtonS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BeaudryM95,
author = {Martin Beaudry and
Pierre McKenzie},
title = {Circuits, Matrices, and Nonassociative Computation},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {3},
pages = {441--455},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1035},
doi = {10.1006/JCSS.1995.1035},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BeaudryM95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BeigelRS95,
author = {Richard Beigel and
Nick Reingold and
Daniel A. Spielman},
title = {{PP} Is Closed under Intersection},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {2},
pages = {191--202},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1017},
doi = {10.1006/JCSS.1995.1017},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BeigelRS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Ben-DavidCHL95,
author = {Shai Ben{-}David and
Nicol{\`{o}} Cesa{-}Bianchi and
David Haussler and
Philip M. Long},
title = {Characterizations of Learnability for Classes of \{0, ..., n\}-Valued
Functions},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {1},
pages = {74--86},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1008},
doi = {10.1006/JCSS.1995.1008},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Ben-DavidCHL95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BlumHL95,
author = {Avrim Blum and
Lisa Hellerstein and
Nick Littlestone},
title = {Learning in the Presence of Finitely or Infinitely Many Irrelevant
Attributes},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {1},
pages = {32--40},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1004},
doi = {10.1006/JCSS.1995.1004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BlumHL95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BorodinIRS95,
author = {Allan Borodin and
Sandy Irani and
Prabhakar Raghavan and
Baruch Schieber},
title = {Competitive Paging with Locality of Reference},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {2},
pages = {244--258},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1021},
doi = {10.1006/JCSS.1995.1021},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BorodinIRS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BovetCS95,
author = {Daniel P. Bovet and
Pierluigi Crescenzi and
Riccardo Silvestri},
title = {Complexity Classes and Sparse Oracles},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {3},
pages = {382--390},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1030},
doi = {10.1006/JCSS.1995.1030},
timestamp = {Sun, 12 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BovetCS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BshoutyHH95,
author = {Nader H. Bshouty and
Thomas R. Hancock and
Lisa Hellerstein},
title = {Learning Boolean Read-Once Formulas over Generalized Bases},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {3},
pages = {521--542},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1042},
doi = {10.1006/JCSS.1995.1042},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BshoutyHH95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/ChangKR95,
author = {Richard Chang and
Jim Kadin and
Pankaj Rohatgi},
title = {On Unique Satisfiability and the Threshold Behavior of Randomized
Reductions},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {3},
pages = {359--373},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1028},
doi = {10.1006/JCSS.1995.1028},
timestamp = {Tue, 14 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/ChangKR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/CondonL95,
author = {Anne Condon and
Richard E. Ladner},
title = {Interactive Proof Systems with Polynomially Bounded Strategies},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {3},
pages = {506--518},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1040},
doi = {10.1006/JCSS.1995.1040},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/CondonL95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/DaleyKV95,
author = {Robert P. Daley and
Bala Kalyanasundaram and
Mahendran Velauthapillai},
title = {Breaking the Probability 1/2 Barrier in FIN-Type Learning},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {3},
pages = {574--599},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1045},
doi = {10.1006/JCSS.1995.1045},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/DaleyKV95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/DingleS95,
author = {Adair Dingle and
Ivan Hal Sudborough},
title = {Single Row Routing on Multilayers},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {1},
pages = {126--131},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1012},
doi = {10.1006/JCSS.1995.1012},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/DingleS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Gabow95,
author = {Harold N. Gabow},
title = {A Matroid Approach to Finding Edge Connectivity and Packing Arborescences},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {2},
pages = {259--273},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1022},
doi = {10.1006/JCSS.1995.1022},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Gabow95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Gavalda95,
author = {Ricard Gavald{\`{a}}},
title = {Bounding the Complexity of Advice Functions},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {3},
pages = {468--475},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1037},
doi = {10.1006/JCSS.1995.1037},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Gavalda95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GoldmanK95,
author = {Sally A. Goldman and
Michael J. Kearns},
title = {On the Complexity of Teaching},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {1},
pages = {20--31},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1003},
doi = {10.1006/JCSS.1995.1003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/GoldmanK95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GreenKRT95,
author = {Frederic Green and
Johannes K{\"{o}}bler and
Kenneth W. Regan and
Thomas Schwentick and
Jacobo Tor{\'{a}}n},
title = {The Power of the Middle Bit of a {\#}P Function},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {3},
pages = {456--467},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1036},
doi = {10.1006/JCSS.1995.1036},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/GreenKRT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GrigniS95,
author = {Michelangelo Grigni and
Michael Sipser},
title = {Monotone Separation of Logarithmic Space from Logarithmic Depth},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {3},
pages = {433--437},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1033},
doi = {10.1006/JCSS.1995.1033},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/GrigniS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Gupta95,
author = {Sanjay Gupta},
title = {Closure Properties and Witness Reduction},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {3},
pages = {412--432},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1032},
doi = {10.1006/JCSS.1995.1032},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Gupta95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/HelmboldW95,
author = {David P. Helmbold and
Manfred K. Warmuth},
title = {On Weak Learning},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {3},
pages = {551--573},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1044},
doi = {10.1006/JCSS.1995.1044},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/HelmboldW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/HoffgenSH95,
author = {Klaus{-}Uwe H{\"{o}}ffgen and
Hans Ulrich Simon and
Kevin S. Van Horn},
title = {Robust Trainability of Single Neurons},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {1},
pages = {114--125},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1011},
doi = {10.1006/JCSS.1995.1011},
timestamp = {Fri, 08 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/HoffgenSH95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/ItoW95,
author = {Minoru Ito and
Grant E. Weddell},
title = {Implication Problems for Functional Constraints on Databases Supporting
Complex Objects},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {1},
pages = {165--187},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1015},
doi = {10.1006/JCSS.1995.1015},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/ItoW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/JiangSSY95,
author = {Tao Jiang and
Arto Salomaa and
Kai Salomaa and
Sheng Yu},
title = {Decision Problems for Patterns},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {1},
pages = {53--63},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1006},
doi = {10.1006/JCSS.1995.1006},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/JiangSSY95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/KalpakisY95,
author = {Konstantinos Kalpakis and
Yaacov Yesha},
title = {On the Power of the Linear Array Architecture for Performing Tree-Structured
Computations},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {1},
pages = {1--10},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1001},
doi = {10.1006/JCSS.1995.1001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/KalpakisY95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Kaltofen95,
author = {Erich L. Kaltofen},
title = {Effective Noether Irreducibility Forms and Applications},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {2},
pages = {274--295},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1023},
doi = {10.1006/JCSS.1995.1023},
timestamp = {Mon, 03 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/Kaltofen95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/KarhumakiPR95,
author = {Juhani Karhum{\"{a}}ki and
Wojciech Plandowski and
Wojciech Rytter},
title = {Polynomial Size Test Sets for Context-Free Languages},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {1},
pages = {11--19},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1002},
doi = {10.1006/JCSS.1995.1002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/KarhumakiPR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Kharitonov95,
author = {Michael Kharitonov},
title = {Cryptographic Lower Bounds for Learnability of Boolean Functions on
the Uniform Distribution},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {3},
pages = {600--610},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1046},
doi = {10.1006/JCSS.1995.1046},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Kharitonov95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/KinberSVW95,
author = {Efim B. Kinber and
Carl H. Smith and
Mahendran Velauthapillai and
Rolf Wiehagen},
title = {On Learning Multiple Concepts in Parallel},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {1},
pages = {41--52},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1005},
doi = {10.1006/JCSS.1995.1005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/KinberSVW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/KolaitisT95,
author = {Phokion G. Kolaitis and
Madhukar N. Thakur},
title = {Approximation Properties of {NP} Minimization Classes},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {3},
pages = {391--411},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1031},
doi = {10.1006/JCSS.1995.1031},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/KolaitisT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/LeightonMPSST95,
author = {Frank Thomson Leighton and
Fillia Makedon and
Serge A. Plotkin and
Clifford Stein and
{\'{E}}va Tardos and
Spyros Tragoudas},
title = {Fast Approximation Algorithms for Multicommodity Flow Problems},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {2},
pages = {228--243},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1020},
doi = {10.1006/JCSS.1995.1020},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/LeightonMPSST95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Mansour95,
author = {Yishay Mansour},
title = {An O(n(log log n)) Learning Algorithm for {DNT} under the Uniform
Distribution},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {3},
pages = {543--550},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1043},
doi = {10.1006/JCSS.1995.1043},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Mansour95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Matousek95,
author = {Jir{\'{\i}} Matousek},
title = {Approximations and Optimal Geometric Divide-an-Conquer},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {2},
pages = {203--208},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1018},
doi = {10.1006/JCSS.1995.1018},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Matousek95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Nishimura95,
author = {Naomi Nishimura},
title = {Efficient Asynchronous Simulation of a Class of Synchronous Parallel
Algorithms},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {1},
pages = {98--113},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1010},
doi = {10.1006/JCSS.1995.1010},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Nishimura95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Parberry95,
author = {Ian Parberry},
title = {Load Sharing with Parallel Priority Queues},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {1},
pages = {64--73},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1007},
doi = {10.1006/JCSS.1995.1007},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Parberry95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Rohatgi95,
author = {Pankaj Rohatgi},
title = {Saving Queries with Randomness},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {3},
pages = {476--492},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1038},
doi = {10.1006/JCSS.1995.1038},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Rohatgi95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/SalujaST95,
author = {Sanjeev Saluja and
K. V. Subrahmanyam and
Madhukar N. Thakur},
title = {Descriptive Complexity of {\#}P Functions},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {3},
pages = {493--505},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1039},
doi = {10.1006/JCSS.1995.1039},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/SalujaST95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/SiegelmannS95,
author = {Hava T. Siegelmann and
Eduardo D. Sontag},
title = {On the Computational Power of Neural Nets},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {1},
pages = {132--150},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1013},
doi = {10.1006/JCSS.1995.1013},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/SiegelmannS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Sutner95,
author = {Klaus Sutner},
title = {On the Computational Complexity of Finite Cellular Automata},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {1},
pages = {87},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1009},
doi = {10.1006/JCSS.1995.1009},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Sutner95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/WangB95,
author = {Jie Wang and
Jay Belanger},
title = {On the NP-Isomorphism Problem with Respect to Random Instances},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {1},
pages = {151--164},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1014},
doi = {10.1006/JCSS.1995.1014},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/WangB95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/YannakakisL95,
author = {Mihalis Yannakakis and
David Lee},
title = {Testing Finite State Machines: Fault Detection},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {2},
pages = {209--227},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1019},
doi = {10.1006/JCSS.1995.1019},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/YannakakisL95.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-06 16:35 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:
