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/jcss53.bht:"
download as .bib file
@article{DBLP:journals/jcss/Agrawal96,
author = {Manindra Agrawal},
title = {On the Isomorphism Conjecture for Weak Reducibilities},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {2},
pages = {267--282},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0068},
doi = {10.1006/JCSS.1996.0068},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/Agrawal96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/AgrawalB96,
author = {Manindra Agrawal and
Somenath Biswas},
title = {Polynomial-Time Isomorphism of 1-L-Complete Sets},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {2},
pages = {155--160},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0057},
doi = {10.1006/JCSS.1996.0057},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/AgrawalB96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BaligaC96,
author = {Ganesh Baliga and
John Case},
title = {Learnability: Admissible, Co-Finite, and Hypersimple Languages},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {1},
pages = {26--32},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0047},
doi = {10.1006/JCSS.1996.0047},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BaligaC96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BlairL96,
author = {Jean R. S. Blair and
Errol L. Lloyd},
title = {River Routing with a Generalized Model},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {3},
pages = {525--544},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0085},
doi = {10.1006/JCSS.1996.0085},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BlairL96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BuhrmanO96,
author = {Harry Buhrman and
Pekka Orponen},
title = {Random Strings Make Hard Instances},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {2},
pages = {261--266},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0067},
doi = {10.1006/JCSS.1996.0067},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BuhrmanO96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BuhrmanT96,
author = {Harry Buhrman and
Leen Torenvliet},
title = {P-Selektive Self-Reducible Sets: {A} New Characterization of {P}},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {2},
pages = {210--217},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0062},
doi = {10.1006/JCSS.1996.0062},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BuhrmanT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Chang96,
author = {Richard Chang},
title = {On the Query Complexity of Clique Size and Maximum Satisfiability},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {2},
pages = {298--313},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0070},
doi = {10.1006/JCSS.1996.0070},
timestamp = {Tue, 14 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Chang96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/ChariR96,
author = {Suresh Chari and
Pankaj Rohatgi},
title = {On Completeness Under Random Reductions},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {3},
pages = {545--555},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0086},
doi = {10.1006/JCSS.1996.0086},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/ChariR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/ComptonG96,
author = {Kevin J. Compton and
Erich Gr{\"{a}}del},
title = {Logical Definability of Counting Functions},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {2},
pages = {283--297},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0069},
doi = {10.1006/JCSS.1996.0069},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/ComptonG96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Dietz96,
author = {Paul F. Dietz},
title = {A Space Efficient Variant of Path Copying for Partially Persistent
Sorted Sets},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {1},
pages = {148--152},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0055},
doi = {10.1006/JCSS.1996.0055},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Dietz96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Drewes96,
author = {Frank Drewes},
title = {Language Theoretic and Algorithmic Properties of d-dimensional Collages
and Patterns in a Grid},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {1},
pages = {33--66},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0048},
doi = {10.1006/JCSS.1996.0048},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Drewes96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/DymondFNRR96,
author = {Patrick W. Dymond and
Faith E. Fich and
Naomi Nishimura and
Prabhakar Ragde and
Walter L. Ruzzo},
title = {Pointers versus Arithmetic in PRAMs},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {2},
pages = {218--232},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0063},
doi = {10.1006/JCSS.1996.0063},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/DymondFNRR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/EiterG96,
author = {Thomas Eiter and
Georg Gottlob},
title = {The Complexity of Nested Counterfactuals and Iterated Knowledge Base
Revisions},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {3},
pages = {497--512},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0083},
doi = {10.1006/JCSS.1996.0083},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/EiterG96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/EngelfrietO96,
author = {Joost Engelfriet and
Vincent van Oostrom},
title = {Regular Description of Context-Free Graph Languages},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {3},
pages = {556--574},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0087},
doi = {10.1006/JCSS.1996.0087},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/EngelfrietO96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/FichIKKK96,
author = {Faith E. Fich and
Russell Impagliazzo and
Bruce M. Kapron and
Valerie King and
Miroslaw Kutylowski},
title = {Limits on the Power of Parallel Random Access Machines with Weak Forms
of Write Conflict Resolution},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {1},
pages = {104--111},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0052},
doi = {10.1006/JCSS.1996.0052},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/FichIKKK96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GabowX96,
author = {Harold N. Gabow and
Ying Xu},
title = {Efficient Theoretic and Practical Algorithms for Linear Matroid Intersection
Problems},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {1},
pages = {129--147},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0054},
doi = {10.1006/JCSS.1996.0054},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/GabowX96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Gao96,
author = {Feng Gao},
title = {Towards Structured Parallel Computing on Architecture-Independent
Parallel Algorithm Design for Distributed-Memory Architectures},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {1},
pages = {112--128},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0053},
doi = {10.1006/JCSS.1996.0053},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Gao96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GhoshM96,
author = {Bhaskar Ghosh and
S. Muthukrishnan},
title = {Dynamic Load Balancing by Random Matchings},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {3},
pages = {357--370},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0075},
doi = {10.1006/JCSS.1996.0075},
timestamp = {Wed, 12 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/GhoshM96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GibbonsMR96,
author = {Phillip B. Gibbons and
Yossi Matias and
Vijaya Ramachandran},
title = {Efficient Low-Contention Parallel Algorithms},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {3},
pages = {417--442},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0079},
doi = {10.1006/JCSS.1996.0079},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/GibbonsMR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Goerdt96,
author = {Andreas Goerdt},
title = {A Threshold for Unsatisfiability},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {3},
pages = {469--486},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0081},
doi = {10.1006/JCSS.1996.0081},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Goerdt96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Grzymala-BusseT96,
author = {Jerzy W. Grzymala{-}Busse and
Soe Than},
title = {Partition Triples: {A} Tool for Reduction of Data Sets},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {3},
pages = {575--582},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0088},
doi = {10.1006/JCSS.1996.0088},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Grzymala-BusseT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/HalperinZ96,
author = {Shay Halperin and
Uri Zwick},
title = {An Optimal Randomised Logarithmic Time Connectivity Algorithm for
the {EREW} {PRAM}},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {3},
pages = {395--416},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0078},
doi = {10.1006/JCSS.1996.0078},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/HalperinZ96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/HemaspaandraNOS96,
author = {Edith Hemaspaandra and
Ashish V. Naik and
Mitsunori Ogihara and
Alan L. Selman},
title = {P-Selektive Sets and Reducing Search to Decision vs Self-Reducibility},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {2},
pages = {194--209},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0061},
doi = {10.1006/JCSS.1996.0061},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/HemaspaandraNOS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/HirstH96a,
author = {Tirza Hirst and
David Harel},
title = {Taking It to the Limit: On Infinite Variants of NP-Complete Problems},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {2},
pages = {180--193},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0060},
doi = {10.1006/JCSS.1996.0060},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/HirstH96a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Jain96,
author = {Sanjay Jain},
title = {Program Synthesis in the Presence of Infinite Number of Inaccuracies},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {3},
pages = {583--591},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0089},
doi = {10.1006/JCSS.1996.0089},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Jain96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/JiangL96,
author = {Tao Jiang and
Ming Li},
title = {K One-Way Heads Cannot Do String-Matching},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {3},
pages = {513--524},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0084},
doi = {10.1006/JCSS.1996.0084},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/JiangL96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/KariT96,
author = {Lila Kari and
Gabriel Thierrin},
title = {Maximal and Minimal Solutions to Language Equations},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {3},
pages = {487--496},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0082},
doi = {10.1006/JCSS.1996.0082},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/KariT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/KautzM96,
author = {Steven M. Kautz and
Peter Bro Miltersen},
title = {Relative to a Random Oracle, {NP} Is Not Small},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {2},
pages = {235--250},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0065},
doi = {10.1006/JCSS.1996.0065},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/KautzM96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/LangeZ96,
author = {Steffen Lange and
Thomas Zeugmann},
title = {Incremental Learning from Positive Data},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {1},
pages = {88--103},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0051},
doi = {10.1006/JCSS.1996.0051},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/LangeZ96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Leoncini96,
author = {Mauro Leoncini},
title = {On the Parallel Complexity of Gaussian Elimination with Pivoting},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {3},
pages = {380--394},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0077},
doi = {10.1006/JCSS.1996.0077},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Leoncini96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/MeghiniT96,
author = {Carlo Meghini and
Costantino Thanos},
title = {An Optimal Predicate Locking Scheduler},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {3},
pages = {443--468},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0080},
doi = {10.1006/JCSS.1996.0080},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/MeghiniT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Mitzenmacher96,
author = {Michael Mitzenmacher},
title = {Bounds on the Greedy Routing Algorithm for Array Networks},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {3},
pages = {317--327},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0072},
doi = {10.1006/JCSS.1996.0072},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Mitzenmacher96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/MoranTY96,
author = {Shlomo Moran and
Gadi Taubenfeld and
Irit Yadin},
title = {Concurrent Counting},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {1},
pages = {61--78},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0049},
doi = {10.1006/JCSS.1996.0049},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/MoranTY96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/OgiharaTTW96,
author = {Mitsunori Ogihara and
Thomas Thierauf and
Seinosuke Toda and
Osamu Watanabe},
title = {On Closure Properties of {\#}P in the Context of {PF} {\textdegree}
{\#}P},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {2},
pages = {171--179},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0059},
doi = {10.1006/JCSS.1996.0059},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/OgiharaTTW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/PapadimitriouY96,
author = {Christos H. Papadimitriou and
Mihalis Yannakakis},
title = {On Limited Nondeterminism and the Complexity of the {V-C} Dimension},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {2},
pages = {161--170},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0058},
doi = {10.1006/JCSS.1996.0058},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/PapadimitriouY96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Reid-Miller96,
author = {Margaret Reid{-}Miller},
title = {List Ranking and List Scan on the {CRAY} {C90}},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {3},
pages = {344--356},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0074},
doi = {10.1006/JCSS.1996.0074},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Reid-Miller96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/SchwabeS96,
author = {Eric J. Schwabe and
Ian M. Sutherland},
title = {Improved Parity-Declustered Layouts for Disk Arrays},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {3},
pages = {328--343},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0073},
doi = {10.1006/JCSS.1996.0073},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/SchwabeS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/ShallitB96,
author = {Jeffrey O. Shallit and
Yuri Breitbart},
title = {Automaticity {I:} Properties of a Measure of Descriptional Complexity},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {1},
pages = {10--25},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0046},
doi = {10.1006/JCSS.1996.0046},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/ShallitB96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Sieling96,
author = {Detlef Sieling},
title = {New Lower Bounds and Hierarchy Results for Restricted Branching Programs},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {1},
pages = {79--87},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0050},
doi = {10.1006/JCSS.1996.0050},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Sieling96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Tamaki96,
author = {Hisao Tamaki},
title = {Construction of the Mesh and the Torus Tolerating a Large Number of
Faults},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {3},
pages = {371--379},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0076},
doi = {10.1006/JCSS.1996.0076},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Tamaki96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Tardos96,
author = {G{\'{a}}bor Tardos},
title = {Multi-prover Encoding Schemes and Three-prover Proof Systems},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {2},
pages = {251--260},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0066},
doi = {10.1006/JCSS.1996.0066},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Tardos96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Vikas96,
author = {Narayan Vikas},
title = {An O(n) Algorithm for Abelian p-Group Isomorphism and an O(n log n)
Algorithm for Abelian Group Isomorphism},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {1},
pages = {1--9},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0045},
doi = {10.1006/JCSS.1996.0045},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Vikas96.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-19 19:34 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:
