Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/tcs/Ainhirn82,
  author       = {Werner Ainhirn},
  title        = {Marvellous Interpretations Differ Little but Decisively from Ordinary
                  Interpretations of {EOL} Forms},
  journal      = {Theor. Comput. Sci.},
  volume       = {21},
  pages        = {163--178},
  year         = {1982},
  url          = {https://doi.org/10.1016/0304-3975(89)90082-0},
  doi          = {10.1016/0304-3975(89)90082-0},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Ainhirn82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BerenguerDH82,
  author       = {Xavier Berenguer and
                  Josep D{\'{\i}}az and
                  Lawrence H. Harper},
  title        = {A Solution of the Sperner-Erd{\"{o}}s Problem},
  journal      = {Theor. Comput. Sci.},
  volume       = {21},
  pages        = {99--103},
  year         = {1982},
  url          = {https://doi.org/10.1016/0304-3975(82)90091-3},
  doi          = {10.1016/0304-3975(82)90091-3},
  timestamp    = {Thu, 19 May 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/BerenguerDH82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BergstraM82,
  author       = {Jan A. Bergstra and
                  John{-}Jules Ch. Meyer},
  title        = {On the Elimination of Iteration Quantifiers in a Fragment of Algorithmic
                  Logic},
  journal      = {Theor. Comput. Sci.},
  volume       = {21},
  pages        = {269--279},
  year         = {1982},
  url          = {https://doi.org/10.1016/0304-3975(82)90077-9},
  doi          = {10.1016/0304-3975(82)90077-9},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BergstraM82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Chlebus82,
  author       = {Bogdan S. Chlebus},
  title        = {On the Computational Complexity of Satisfiability in Propositional
                  Logics of Programs},
  journal      = {Theor. Comput. Sci.},
  volume       = {21},
  pages        = {179--212},
  year         = {1982},
  url          = {https://doi.org/10.1016/0304-3975(89)90083-2},
  doi          = {10.1016/0304-3975(89)90083-2},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Chlebus82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/CoriM82,
  author       = {Robert Cori and
                  Antonio Machi},
  title        = {Construction of Maps with Prescribed Automorphism Group},
  journal      = {Theor. Comput. Sci.},
  volume       = {21},
  pages        = {91--98},
  year         = {1982},
  url          = {https://doi.org/10.1016/0304-3975(82)90090-1},
  doi          = {10.1016/0304-3975(82)90090-1},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/CoriM82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Csirmaz82,
  author       = {L. Csirmaz},
  title        = {Determinateness of Program Equivalence over Peano Axioms},
  journal      = {Theor. Comput. Sci.},
  volume       = {21},
  pages        = {231--235},
  year         = {1982},
  url          = {https://doi.org/10.1016/0304-3975(89)90086-8},
  doi          = {10.1016/0304-3975(89)90086-8},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/Csirmaz82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/DurisG82,
  author       = {Pavol Duris and
                  Zvi Galil},
  title        = {Fooling a two Way Automaton or one Pushdown Store is better than one
                  Counter for two Way Machines},
  journal      = {Theor. Comput. Sci.},
  volume       = {21},
  pages        = {39--53},
  year         = {1982},
  url          = {https://doi.org/10.1016/0304-3975(82)90087-1},
  doi          = {10.1016/0304-3975(82)90087-1},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/DurisG82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/EhrenfeuchtKR82,
  author       = {Andrzej Ehrenfeucht and
                  Juhani Karhum{\"{a}}ki and
                  Grzegorz Rozenberg},
  title        = {The (Generalized) Post Correspondence Problem with Lists Consisting
                  of two Words is Decidable},
  journal      = {Theor. Comput. Sci.},
  volume       = {21},
  pages        = {119--144},
  year         = {1982},
  url          = {https://doi.org/10.1016/0304-3975(89)90080-7},
  doi          = {10.1016/0304-3975(89)90080-7},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/EhrenfeuchtKR82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/EhrenfeuchtR82,
  author       = {Andrzej Ehrenfeucht and
                  Grzegorz Rozenberg},
  title        = {Representation Theorems Using {DOS} Languages},
  journal      = {Theor. Comput. Sci.},
  volume       = {21},
  pages        = {75--90},
  year         = {1982},
  url          = {https://doi.org/10.1016/0304-3975(82)90089-5},
  doi          = {10.1016/0304-3975(82)90089-5},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/EhrenfeuchtR82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/GoldschlagerSS82,
  author       = {Leslie M. Goldschlager and
                  Ralph A. Shaw and
                  John Staples},
  title        = {The Maximum Flow Problem is Log Space Complete for {P}},
  journal      = {Theor. Comput. Sci.},
  volume       = {21},
  pages        = {105--111},
  year         = {1982},
  url          = {https://doi.org/10.1016/0304-3975(82)90092-5},
  doi          = {10.1016/0304-3975(82)90092-5},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/GoldschlagerSS82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/HeadW82,
  author       = {Tom Head and
                  John Wilkinson},
  title        = {Finite {DOL} Languages and Codes},
  journal      = {Theor. Comput. Sci.},
  volume       = {21},
  pages        = {357--361},
  year         = {1982},
  url          = {https://doi.org/10.1016/0304-3975(82)90082-2},
  doi          = {10.1016/0304-3975(82)90082-2},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/HeadW82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Indermark82,
  author       = {Klaus Indermark},
  title        = {On Rational Definitions in Complete Algebras without Rank},
  journal      = {Theor. Comput. Sci.},
  volume       = {21},
  pages        = {281--313},
  year         = {1982},
  url          = {https://doi.org/10.1016/0304-3975(82)90078-0},
  doi          = {10.1016/0304-3975(82)90078-0},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Indermark82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Istrail82a,
  author       = {Sorin Istrail},
  title        = {Some Remarks on Non-Algebraic Adherences},
  journal      = {Theor. Comput. Sci.},
  volume       = {21},
  pages        = {341--349},
  year         = {1982},
  url          = {https://doi.org/10.1016/0304-3975(82)90080-9},
  doi          = {10.1016/0304-3975(82)90080-9},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Istrail82a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/JanssensR82,
  author       = {Dirk Janssens and
                  Grzegorz Rozenberg},
  title        = {Graph Grammars with Neighbourhood-Controlled Embedding},
  journal      = {Theor. Comput. Sci.},
  volume       = {21},
  pages        = {55--74},
  year         = {1982},
  url          = {https://doi.org/10.1016/0304-3975(82)90088-3},
  doi          = {10.1016/0304-3975(82)90088-3},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/JanssensR82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/KentH82,
  author       = {Clement F. Kent and
                  Bernard R. Hodgson},
  title        = {An Arithmetical Characterization of {NP}},
  journal      = {Theor. Comput. Sci.},
  volume       = {21},
  pages        = {255--267},
  year         = {1982},
  url          = {https://doi.org/10.1016/0304-3975(82)90076-7},
  doi          = {10.1016/0304-3975(82)90076-7},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/KentH82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Kurka82,
  author       = {Petr Kurka},
  title        = {Ergodic Languages},
  journal      = {Theor. Comput. Sci.},
  volume       = {21},
  pages        = {351--355},
  year         = {1982},
  url          = {https://doi.org/10.1016/0304-3975(82)90081-0},
  doi          = {10.1016/0304-3975(82)90081-0},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Kurka82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Long82,
  author       = {Timothy J. Long},
  title        = {Strong Nondeterministic Polynomial-Time Reducibilities},
  journal      = {Theor. Comput. Sci.},
  volume       = {21},
  pages        = {1--25},
  year         = {1982},
  url          = {https://doi.org/10.1016/0304-3975(82)90085-8},
  doi          = {10.1016/0304-3975(82)90085-8},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Long82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Loui82,
  author       = {Michael C. Loui},
  title        = {Simulations Among Multidimensional Turing Machines},
  journal      = {Theor. Comput. Sci.},
  volume       = {21},
  pages        = {145--161},
  year         = {1982},
  url          = {https://doi.org/10.1016/0304-3975(89)90081-9},
  doi          = {10.1016/0304-3975(89)90081-9},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Loui82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Margolis82,
  author       = {Stuart W. Margolis},
  title        = {On the Syntactic Transformation Semigroup of a Language Generated
                  by a Finite Biprefix Code},
  journal      = {Theor. Comput. Sci.},
  volume       = {21},
  pages        = {225--230},
  year         = {1982},
  url          = {https://doi.org/10.1016/0304-3975(89)90085-6},
  doi          = {10.1016/0304-3975(89)90085-6},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Margolis82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Miyano82,
  author       = {Satoru Miyano},
  title        = {Two-Way Deterministic Multi-Weak-Counter Machines},
  journal      = {Theor. Comput. Sci.},
  volume       = {21},
  pages        = {27--37},
  year         = {1982},
  url          = {https://doi.org/10.1016/0304-3975(82)90086-X},
  doi          = {10.1016/0304-3975(82)90086-X},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Miyano82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/MonienS82,
  author       = {Burkhard Monien and
                  Ivan Hal Sudborough},
  title        = {On Eliminating Nondeterminism from Turing Machines which Use less
                  than Logarithm Worktape Space},
  journal      = {Theor. Comput. Sci.},
  volume       = {21},
  pages        = {237--253},
  year         = {1982},
  url          = {https://doi.org/10.1016/0304-3975(82)90075-5},
  doi          = {10.1016/0304-3975(82)90075-5},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/MonienS82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Wegener82,
  author       = {Ingo Wegener},
  title        = {Boolean Functions whose Monotone Complexity is of Size n2/log n},
  journal      = {Theor. Comput. Sci.},
  volume       = {21},
  pages        = {213--224},
  year         = {1982},
  url          = {https://doi.org/10.1016/0304-3975(89)90084-4},
  doi          = {10.1016/0304-3975(89)90084-4},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Wegener82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Winkowski82,
  author       = {J{\'{o}}zef Winkowski},
  title        = {An Algebraic Description of System Behaviours},
  journal      = {Theor. Comput. Sci.},
  volume       = {21},
  pages        = {315--340},
  year         = {1982},
  url          = {https://doi.org/10.1016/0304-3975(82)90079-2},
  doi          = {10.1016/0304-3975(82)90079-2},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Winkowski82.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.