Search dblp for Publications

export results for "toc:db/journals/tcs/tcs36.bht:"

 download as .bib file

@article{DBLP:journals/tcs/AllenderK85,
  author       = {Eric Allender and
                  Maria M. Klawe},
  title        = {Improved Lower Bounds for the Cycle Detection Problem},
  journal      = {Theor. Comput. Sci.},
  volume       = {36},
  pages        = {231--237},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90044-1},
  doi          = {10.1016/0304-3975(85)90044-1},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/AllenderK85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Alt85,
  author       = {Helmut Alt},
  title        = {Multiplication is the Easiest Nontrivial Arithmetic Function},
  journal      = {Theor. Comput. Sci.},
  volume       = {36},
  pages        = {333--339},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90051-9},
  doi          = {10.1016/0304-3975(85)90051-9},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Alt85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Blum85,
  author       = {Norbert Blum},
  title        = {An Omega(n-4/3) Lower Bound on the Monotone Network Complexity of
                  the n-th Degree Convolution},
  journal      = {Theor. Comput. Sci.},
  volume       = {36},
  pages        = {59--69},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90030-1},
  doi          = {10.1016/0304-3975(85)90030-1},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Blum85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Broy85,
  author       = {Manfred Broy},
  title        = {On the Herbrand-Kleene Universe for Nondeterministic Computations},
  journal      = {Theor. Comput. Sci.},
  volume       = {36},
  pages        = {1--19},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90027-1},
  doi          = {10.1016/0304-3975(85)90027-1},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Broy85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/CerroO85,
  author       = {Luis Fari{\~{n}}as del Cerro and
                  Ewa Orlowska},
  title        = {{DAL} - {A} Logic for Data Analysis},
  journal      = {Theor. Comput. Sci.},
  volume       = {36},
  pages        = {251--264},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90046-5},
  doi          = {10.1016/0304-3975(85)90046-5},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/CerroO85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/DemelDK85,
  author       = {Jir{\'{\i}} Demel and
                  Marie Demlov{\'{a}} and
                  V{\'{a}}clav Koubek},
  title        = {Fast Algorithms Constructing Minimal Subalgebras, Congruences, and
                  Ideals in a Finite Algebra},
  journal      = {Theor. Comput. Sci.},
  volume       = {36},
  pages        = {203--216},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90042-8},
  doi          = {10.1016/0304-3975(85)90042-8},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/DemelDK85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Diks85,
  author       = {Krzysztof Diks},
  title        = {Embeddings of Binary Trees in Lines},
  journal      = {Theor. Comput. Sci.},
  volume       = {36},
  pages        = {319--331},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90050-7},
  doi          = {10.1016/0304-3975(85)90050-7},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Diks85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Engelfriet85,
  author       = {Joost Engelfriet},
  title        = {Determinacy - (Observation Equivalence = Trace Equivalence)},
  journal      = {Theor. Comput. Sci.},
  volume       = {36},
  pages        = {21--25},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90028-3},
  doi          = {10.1016/0304-3975(85)90028-3},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Engelfriet85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/FaginKPS85,
  author       = {Ronald Fagin and
                  Maria M. Klawe and
                  Nicholas Pippenger and
                  Larry J. Stockmeyer},
  title        = {Bounded-Depth, Polynomial-Size Circuits for Symmetric Functions},
  journal      = {Theor. Comput. Sci.},
  volume       = {36},
  pages        = {239--250},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90045-3},
  doi          = {10.1016/0304-3975(85)90045-3},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/FaginKPS85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/FarrM85,
  author       = {Graham Farr and
                  Colin McDiarmid},
  title        = {The Compexity of Counting Homeomorphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {36},
  pages        = {345--348},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90053-2},
  doi          = {10.1016/0304-3975(85)90053-2},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/FarrM85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Felice85,
  author       = {Clelia de Felice},
  title        = {Construction de Codes Factorisants},
  journal      = {Theor. Comput. Sci.},
  volume       = {36},
  pages        = {99--108},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90033-7},
  doi          = {10.1016/0304-3975(85)90033-7},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Felice85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/FentonWK85,
  author       = {Norman E. Fenton and
                  Robin W. Whitty and
                  A. A. Kaposi},
  title        = {A Generalised Mathematical Theory of Structured Programming},
  journal      = {Theor. Comput. Sci.},
  volume       = {36},
  pages        = {145--171},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90040-4},
  doi          = {10.1016/0304-3975(85)90040-4},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/FentonWK85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/HiroseY85,
  author       = {Sadaki Hirose and
                  Masaaki Yoneda},
  title        = {On the Chomsky and Stanley's Homomorphic Characterization of Context-Free
                  Languages},
  journal      = {Theor. Comput. Sci.},
  volume       = {36},
  pages        = {109--112},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90034-9},
  doi          = {10.1016/0304-3975(85)90034-9},
  timestamp    = {Sat, 21 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/HiroseY85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Igarashi85,
  author       = {Yoshihide Igarashi},
  title        = {A Pumping Lemma for Real-Time Deterministic Context-Free Languages},
  journal      = {Theor. Comput. Sci.},
  volume       = {36},
  pages        = {89--97},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90032-5},
  doi          = {10.1016/0304-3975(85)90032-5},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Igarashi85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Janicki85,
  author       = {Ryszard Janicki},
  title        = {Transforming Sequential Systems into Concurrent Systems},
  journal      = {Theor. Comput. Sci.},
  volume       = {36},
  pages        = {27--58},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90029-5},
  doi          = {10.1016/0304-3975(85)90029-5},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Janicki85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Jerrum85,
  author       = {Mark Jerrum},
  title        = {The Complexity of Finding Minimum-Length Generator Sequences},
  journal      = {Theor. Comput. Sci.},
  volume       = {36},
  pages        = {265--289},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90047-7},
  doi          = {10.1016/0304-3975(85)90047-7},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Jerrum85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Kaminski85,
  author       = {Michael Kaminski},
  title        = {A Classification of omega-Regular Languages},
  journal      = {Theor. Comput. Sci.},
  volume       = {36},
  pages        = {217--229},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90043-X},
  doi          = {10.1016/0304-3975(85)90043-X},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Kaminski85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Keller-Gehrig85,
  author       = {Walter Keller{-}Gehrig},
  title        = {Fast Algorithms for the Characteristic Polynomial},
  journal      = {Theor. Comput. Sci.},
  volume       = {36},
  pages        = {309--317},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90049-0},
  doi          = {10.1016/0304-3975(85)90049-0},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Keller-Gehrig85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/MatsunoITT85,
  author       = {Hiroshi Matsuno and
                  Katsushi Inoue and
                  Hiroshi Taniguchi and
                  Itsuo Takanami},
  title        = {Alternating Simple Multihead Finite Automata},
  journal      = {Theor. Comput. Sci.},
  volume       = {36},
  pages        = {291--308},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90048-9},
  doi          = {10.1016/0304-3975(85)90048-9},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/MatsunoITT85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Ruohonen85,
  author       = {Keijo Ruohonen},
  title        = {On Equality of Multiplicity Sets of Regular Languages},
  journal      = {Theor. Comput. Sci.},
  volume       = {36},
  pages        = {113--117},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90035-0},
  doi          = {10.1016/0304-3975(85)90035-0},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Ruohonen85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/RytterC85,
  author       = {Wojciech Rytter and
                  Marek Chrobak},
  title        = {A Characterization of Reversal-Bounded Multipushdown Machine Languages},
  journal      = {Theor. Comput. Sci.},
  volume       = {36},
  pages        = {341--344},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90052-0},
  doi          = {10.1016/0304-3975(85)90052-0},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/RytterC85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Scarpellini85,
  author       = {Bruno Scarpellini},
  title        = {Complex Boolean Networks Obtained by Diagonalization},
  journal      = {Theor. Comput. Sci.},
  volume       = {36},
  pages        = {119--125},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90036-2},
  doi          = {10.1016/0304-3975(85)90036-2},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Scarpellini85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/SudboroughW85,
  author       = {Ivan Hal Sudborough and
                  Emo Welzl},
  title        = {Complexity and Decidability for Chain Code Picture Languages},
  journal      = {Theor. Comput. Sci.},
  volume       = {36},
  pages        = {173--202},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90041-6},
  doi          = {10.1016/0304-3975(85)90041-6},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/SudboroughW85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/TiomkinM85,
  author       = {Michael L. Tiomkin and
                  Johann A. Makowsky},
  title        = {Propositional Dynamic Logic with Local Assignments},
  journal      = {Theor. Comput. Sci.},
  volume       = {36},
  pages        = {71--87},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90031-3},
  doi          = {10.1016/0304-3975(85)90031-3},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/TiomkinM85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Winskel85,
  author       = {Glynn Winskel},
  title        = {On Powerdomains and Modality},
  journal      = {Theor. Comput. Sci.},
  volume       = {36},
  pages        = {127--137},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90037-4},
  doi          = {10.1016/0304-3975(85)90037-4},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Winskel85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.