Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/jcss/jcss21.bht:"
@article{DBLP:journals/jcss/Angluin80, author = {Dana Angluin}, title = {Finding Patterns Common to a Set of Strings}, journal = {J. Comput. Syst. Sci.}, volume = {21}, number = {1}, pages = {46--62}, year = {1980}, url = {https://doi.org/10.1016/0022-0000(80)90041-0}, doi = {10.1016/0022-0000(80)90041-0}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/Angluin80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/AusielloDP80, author = {Giorgio Ausiello and Alessandro D'Atri and Marco Protasi}, title = {Structure Preserving Reductions among Convex Optimization Problems}, journal = {J. Comput. Syst. Sci.}, volume = {21}, number = {1}, pages = {136--153}, year = {1980}, url = {https://doi.org/10.1016/0022-0000(80)90046-X}, doi = {10.1016/0022-0000(80)90046-X}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/AusielloDP80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/Brandenburg80, author = {Franz{-}Josef Brandenburg}, title = {Multiple Equality Sets and Post Machines}, journal = {J. Comput. Syst. Sci.}, volume = {21}, number = {3}, pages = {292--316}, year = {1980}, url = {https://doi.org/10.1016/0022-0000(80)90026-4}, doi = {10.1016/0022-0000(80)90026-4}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/Brandenburg80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/ChandraH80, author = {Ashok K. Chandra and David Harel}, title = {Computable Queries for Relational Data Bases}, journal = {J. Comput. Syst. Sci.}, volume = {21}, number = {2}, pages = {156--178}, year = {1980}, url = {https://doi.org/10.1016/0022-0000(80)90032-X}, doi = {10.1016/0022-0000(80)90032-X}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/ChandraH80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/Fujishige80, author = {Satoru Fujishige}, title = {An Efficient PQ-Graph Algorithm for Solving the Graph-Realization Problem}, journal = {J. Comput. Syst. Sci.}, volume = {21}, number = {1}, pages = {63--86}, year = {1980}, url = {https://doi.org/10.1016/0022-0000(80)90042-2}, doi = {10.1016/0022-0000(80)90042-2}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/Fujishige80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/GalilN80, author = {Zvi Galil and Amnon Naamad}, title = {An O(EVlog{\({^2}\)}V) Algorithm for the Maximal Flow Problem}, journal = {J. Comput. Syst. Sci.}, volume = {21}, number = {2}, pages = {203--217}, year = {1980}, url = {https://doi.org/10.1016/0022-0000(80)90035-5}, doi = {10.1016/0022-0000(80)90035-5}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/GalilN80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/Gonnet80, author = {Gaston H. Gonnet}, title = {Open-Addressing Hashing with Unequal-Probability Keys}, journal = {J. Comput. Syst. Sci.}, volume = {21}, number = {3}, pages = {354--367}, year = {1980}, url = {https://doi.org/10.1016/0022-0000(80)90028-8}, doi = {10.1016/0022-0000(80)90028-8}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/Gonnet80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/Head80, author = {Tom Head}, title = {A-Transducers and the Monotonicity of {IL} Schemes}, journal = {J. Comput. Syst. Sci.}, volume = {21}, number = {1}, pages = {87--91}, year = {1980}, url = {https://doi.org/10.1016/0022-0000(80)90043-4}, doi = {10.1016/0022-0000(80)90043-4}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/Head80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/Jaffe80, author = {Jeffrey M. Jaffe}, title = {The Equivalence of {RE} Program Schemes and Data Flow Schemes}, journal = {J. Comput. Syst. Sci.}, volume = {21}, number = {1}, pages = {92--109}, year = {1980}, url = {https://doi.org/10.1016/0022-0000(80)90044-6}, doi = {10.1016/0022-0000(80)90044-6}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/Jaffe80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/Ladner80, author = {Richard E. Ladner}, title = {The Complexity of Problems in Systems of Communicating Sequential Processes}, journal = {J. Comput. Syst. Sci.}, volume = {21}, number = {2}, pages = {179--194}, year = {1980}, url = {https://doi.org/10.1016/0022-0000(80)90033-1}, doi = {10.1016/0022-0000(80)90033-1}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/Ladner80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/Lehmann80, author = {Daniel J. Lehmann}, title = {On the Algebra of Order}, journal = {J. Comput. Syst. Sci.}, volume = {21}, number = {1}, pages = {1--23}, year = {1980}, url = {https://doi.org/10.1016/0022-0000(80)90038-0}, doi = {10.1016/0022-0000(80)90038-0}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/Lehmann80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/Lewis80, author = {Harry R. Lewis}, title = {Complexity Results for Classes of Quantificational Formulas}, journal = {J. Comput. Syst. Sci.}, volume = {21}, number = {3}, pages = {317--353}, year = {1980}, url = {https://doi.org/10.1016/0022-0000(80)90027-6}, doi = {10.1016/0022-0000(80)90027-6}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/Lewis80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/Lynch80, author = {Nancy A. Lynch}, title = {Straight-Line Program Length as a Parameter for Complexity Analysis}, journal = {J. Comput. Syst. Sci.}, volume = {21}, number = {3}, pages = {251--280}, year = {1980}, url = {https://doi.org/10.1016/0022-0000(80)90024-0}, doi = {10.1016/0022-0000(80)90024-0}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/Lynch80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/MaierMSU80, author = {David Maier and Alberto O. Mendelzon and Fereidoon Sadri and Jeffrey D. Ullman}, title = {Adequacy of Decompositions of Relational Databases}, journal = {J. Comput. Syst. Sci.}, volume = {21}, number = {3}, pages = {368--379}, year = {1980}, url = {https://doi.org/10.1016/0022-0000(80)90029-X}, doi = {10.1016/0022-0000(80)90029-X}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/MaierMSU80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/MaurerSW80, author = {Hermann A. Maurer and Arto Salomaa and Derick Wood}, title = {Context-Free Grammar Forms with Strict Interpretations}, journal = {J. Comput. Syst. Sci.}, volume = {21}, number = {1}, pages = {110--135}, year = {1980}, url = {https://doi.org/10.1016/0022-0000(80)90045-8}, doi = {10.1016/0022-0000(80)90045-8}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/MaurerSW80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/Mavrides80, author = {Lazaros P. Mavrides}, title = {A Finite Step-Size Procedure for the {F-W} Method}, journal = {J. Comput. Syst. Sci.}, volume = {21}, number = {1}, pages = {24--29}, year = {1980}, url = {https://doi.org/10.1016/0022-0000(80)90039-2}, doi = {10.1016/0022-0000(80)90039-2}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/Mavrides80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/MunroS80, author = {J. Ian Munro and Hendra Suwanda}, title = {Implicit Data Structures for Fast Search and Update}, journal = {J. Comput. Syst. Sci.}, volume = {21}, number = {2}, pages = {236--250}, year = {1980}, url = {https://doi.org/10.1016/0022-0000(80)90037-9}, doi = {10.1016/0022-0000(80)90037-9}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/MunroS80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/Naude80, author = {G. Naud{\'{e}}}, title = {A Duality Theory for Decomposable Systems in a Category}, journal = {J. Comput. Syst. Sci.}, volume = {21}, number = {3}, pages = {281--291}, year = {1980}, url = {https://doi.org/10.1016/0022-0000(80)90025-2}, doi = {10.1016/0022-0000(80)90025-2}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/Naude80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/Ruzzo80, author = {Walter L. Ruzzo}, title = {Tree-Size Bounded Alternation}, journal = {J. Comput. Syst. Sci.}, volume = {21}, number = {2}, pages = {218--235}, year = {1980}, url = {https://doi.org/10.1016/0022-0000(80)90036-7}, doi = {10.1016/0022-0000(80)90036-7}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/Ruzzo80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/SekiK80, author = {Shigeko Seki and Youichi Kobuchi}, title = {On {DIL} Schemes Simulated by {D0L} Schemes}, journal = {J. Comput. Syst. Sci.}, volume = {21}, number = {1}, pages = {30--45}, year = {1980}, url = {https://doi.org/10.1016/0022-0000(80)90040-9}, doi = {10.1016/0022-0000(80)90040-9}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/SekiK80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/Sipser80, author = {Michael Sipser}, title = {Lower Bounds on the Size of Sweeping Automata}, journal = {J. Comput. Syst. Sci.}, volume = {21}, number = {2}, pages = {195--202}, year = {1980}, url = {https://doi.org/10.1016/0022-0000(80)90034-3}, doi = {10.1016/0022-0000(80)90034-3}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/Sipser80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.