Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/tcs/AlbertW81,
  author       = {J{\"{u}}rgen Albert and
                  Lutz M. Wegner},
  title        = {Languages with Homomorphic Replacements},
  journal      = {Theor. Comput. Sci.},
  volume       = {16},
  pages        = {291--305},
  year         = {1981},
  url          = {https://doi.org/10.1016/0304-3975(81)90100-6},
  doi          = {10.1016/0304-3975(81)90100-6},
  timestamp    = {Tue, 15 Feb 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/AlbertW81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BermanP81,
  author       = {Francine Berman and
                  Mike Paterson},
  title        = {Propositional Dynamic Logic is Weaker without Tests},
  journal      = {Theor. Comput. Sci.},
  volume       = {16},
  pages        = {321--328},
  year         = {1981},
  url          = {https://doi.org/10.1016/0304-3975(81)90102-X},
  doi          = {10.1016/0304-3975(81)90102-X},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BermanP81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BookO81,
  author       = {Ronald V. Book and
                  Colm {\'{O}}'D{\'{u}}nlaing},
  title        = {Testing for the Church-Rosser Property},
  journal      = {Theor. Comput. Sci.},
  volume       = {16},
  pages        = {223--229},
  year         = {1981},
  url          = {https://doi.org/10.1016/0304-3975(81)90078-5},
  doi          = {10.1016/0304-3975(81)90078-5},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BookO81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BurkhardFK81,
  author       = {Walter A. Burkhard and
                  Michael L. Fredman and
                  Daniel J. Kleitman},
  title        = {Inherent Complexity Trade-Offs for Range Query Problems},
  journal      = {Theor. Comput. Sci.},
  volume       = {16},
  pages        = {279--290},
  year         = {1981},
  url          = {https://doi.org/10.1016/0304-3975(81)90099-2},
  doi          = {10.1016/0304-3975(81)90099-2},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BurkhardFK81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/CarterF81,
  author       = {J. Lawrence Carter and
                  Ronald Fagin},
  title        = {A Note on the Existence of Continuous Functionals},
  journal      = {Theor. Comput. Sci.},
  volume       = {16},
  pages        = {231--235},
  year         = {1981},
  url          = {https://doi.org/10.1016/0304-3975(81)90079-7},
  doi          = {10.1016/0304-3975(81)90079-7},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/CarterF81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Csirmaz81,
  author       = {L. Csirmaz},
  title        = {Programs and Program Verifications in a General Setting},
  journal      = {Theor. Comput. Sci.},
  volume       = {16},
  pages        = {199--210},
  year         = {1981},
  url          = {https://doi.org/10.1016/0304-3975(81)90076-1},
  doi          = {10.1016/0304-3975(81)90076-1},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Csirmaz81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/EdelsbrunnerM81,
  author       = {Herbert Edelsbrunner and
                  Hermann A. Maurer},
  title        = {A Space-Optimal Solution of General Region Location},
  journal      = {Theor. Comput. Sci.},
  volume       = {16},
  pages        = {329--336},
  year         = {1981},
  url          = {https://doi.org/10.1016/0304-3975(81)90103-1},
  doi          = {10.1016/0304-3975(81)90103-1},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/EdelsbrunnerM81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/EhrenfeuchtR81,
  author       = {Andrzej Ehrenfeucht and
                  Grzegorz Rozenberg},
  title        = {On the Subword Complexity of Square-Free {D0L} Languages},
  journal      = {Theor. Comput. Sci.},
  volume       = {16},
  pages        = {25--32},
  year         = {1981},
  url          = {https://doi.org/10.1016/0304-3975(81)90028-1},
  doi          = {10.1016/0304-3975(81)90028-1},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/EhrenfeuchtR81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Galbiati81,
  author       = {Giulia Galbiati},
  title        = {M. J. Fischer: On the Complexity of 2-Output Boolean Networks},
  journal      = {Theor. Comput. Sci.},
  volume       = {16},
  pages        = {177--185},
  year         = {1981},
  url          = {https://doi.org/10.1016/0304-3975(81)90074-8},
  doi          = {10.1016/0304-3975(81)90074-8},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Galbiati81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/GuptaLLPW81,
  author       = {Udaiprakash I. Gupta and
                  D. T. Lee and
                  Joseph Y.{-}T. Leung and
                  J. W. Pruitt and
                  C. K. Wong},
  title        = {Record Allocation for Minimizing Seek Delay},
  journal      = {Theor. Comput. Sci.},
  volume       = {16},
  pages        = {307--319},
  year         = {1981},
  url          = {https://doi.org/10.1016/0304-3975(81)90101-8},
  doi          = {10.1016/0304-3975(81)90101-8},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/GuptaLLPW81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Jantzen81a,
  author       = {Matthias Jantzen},
  title        = {On a Special Monoid with a Single Defining Relation},
  journal      = {Theor. Comput. Sci.},
  volume       = {16},
  pages        = {61--73},
  year         = {1981},
  url          = {https://doi.org/10.1016/0304-3975(81)90031-1},
  doi          = {10.1016/0304-3975(81)90031-1},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Jantzen81a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/KleijnR81,
  author       = {H. C. M. Kleijn and
                  Grzegorz Rozenberg},
  title        = {Context-Free Like Restrictions on Selective Rewriting},
  journal      = {Theor. Comput. Sci.},
  volume       = {16},
  pages        = {237--269},
  year         = {1981},
  url          = {https://doi.org/10.1016/0304-3975(81)90097-9},
  doi          = {10.1016/0304-3975(81)90097-9},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/KleijnR81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/LamSY81,
  author       = {K. Lam and
                  M. K. Siu and
                  Clement T. Yu},
  title        = {A Generalized Counter Scheme},
  journal      = {Theor. Comput. Sci.},
  volume       = {16},
  pages        = {271--278},
  year         = {1981},
  url          = {https://doi.org/10.1016/0304-3975(81)90098-0},
  doi          = {10.1016/0304-3975(81)90098-0},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/LamSY81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Lieberherr81,
  author       = {Karl J. Lieberherr},
  title        = {Uniform Complexity and Digital Signatures},
  journal      = {Theor. Comput. Sci.},
  volume       = {16},
  pages        = {99--110},
  year         = {1981},
  url          = {https://doi.org/10.1016/0304-3975(81)90034-7},
  doi          = {10.1016/0304-3975(81)90034-7},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Lieberherr81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/MainB81,
  author       = {Michael G. Main and
                  David B. Benson},
  title        = {Free Upper Regular Bands},
  journal      = {Theor. Comput. Sci.},
  volume       = {16},
  pages        = {93--98},
  year         = {1981},
  url          = {https://doi.org/10.1016/0304-3975(81)90033-5},
  doi          = {10.1016/0304-3975(81)90033-5},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/MainB81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/NguyenL81,
  author       = {V. L. Nguyen and
                  Jean{-}Louis Lassez},
  title        = {A Dual Problem to Least Fixed Points},
  journal      = {Theor. Comput. Sci.},
  volume       = {16},
  pages        = {211--221},
  year         = {1981},
  url          = {https://doi.org/10.1016/0304-3975(81)90077-3},
  doi          = {10.1016/0304-3975(81)90077-3},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/NguyenL81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Pecuchet81,
  author       = {Jean{-}Pierre P{\'{e}}cuchet},
  title        = {Sur la Determination du Rang d'une Equation dans le Monoide Libre},
  journal      = {Theor. Comput. Sci.},
  volume       = {16},
  pages        = {337--340},
  year         = {1981},
  url          = {https://doi.org/10.1016/0304-3975(81)90104-3},
  doi          = {10.1016/0304-3975(81)90104-3},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Pecuchet81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Pittl81,
  author       = {Jan Pittl},
  title        = {On LLP(k) Grammars and Languages},
  journal      = {Theor. Comput. Sci.},
  volume       = {16},
  pages        = {149--175},
  year         = {1981},
  url          = {https://doi.org/10.1016/0304-3975(81)90073-6},
  doi          = {10.1016/0304-3975(81)90073-6},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Pittl81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/RaihaU81,
  author       = {Kari{-}Jouko R{\"{a}}ih{\"{a}} and
                  Esko Ukkonen},
  title        = {The Shortest Common Supersequence Problem over Binary Alphabet is
                  NP-Complete},
  journal      = {Theor. Comput. Sci.},
  volume       = {16},
  pages        = {187--198},
  year         = {1981},
  url          = {https://doi.org/10.1016/0304-3975(81)90075-X},
  doi          = {10.1016/0304-3975(81)90075-X},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/RaihaU81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Shepherdson81,
  author       = {John C. Shepherdson},
  title        = {In Memoriam Calvin C. Elgot},
  journal      = {Theor. Comput. Sci.},
  volume       = {16},
  pages        = {1--4},
  year         = {1981},
  url          = {https://doi.org/10.1016/0304-3975(81)90026-8},
  doi          = {10.1016/0304-3975(81)90026-8},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Shepherdson81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Simon81,
  author       = {Janos Simon},
  title        = {On Tape-Bounded Probabilistic Turing Machine Acceptors},
  journal      = {Theor. Comput. Sci.},
  volume       = {16},
  pages        = {75--91},
  year         = {1981},
  url          = {https://doi.org/10.1016/0304-3975(81)90032-3},
  doi          = {10.1016/0304-3975(81)90032-3},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Simon81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/TakasuK81,
  author       = {Satoru Takasu and
                  Sukemitsu Kawabata},
  title        = {A Logical Basis for Programming Methodology},
  journal      = {Theor. Comput. Sci.},
  volume       = {16},
  pages        = {43--60},
  year         = {1981},
  url          = {https://doi.org/10.1016/0304-3975(81)90030-X},
  doi          = {10.1016/0304-3975(81)90030-X},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/TakasuK81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Tao81,
  author       = {Ren{-}ji Tao},
  title        = {On the Computational Power of Automata with Time or Space Bounded
                  by Ackermann's or Superexponential Functions},
  journal      = {Theor. Comput. Sci.},
  volume       = {16},
  pages        = {115--148},
  year         = {1981},
  url          = {https://doi.org/10.1016/0304-3975(81)90072-4},
  doi          = {10.1016/0304-3975(81)90072-4},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Tao81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Vazenin81,
  author       = {Ju. M. Vazenin},
  title        = {Sur la Liaison Entre Problemes Combinatoires et Algorithmiques},
  journal      = {Theor. Comput. Sci.},
  volume       = {16},
  pages        = {33--41},
  year         = {1981},
  url          = {https://doi.org/10.1016/0304-3975(81)90029-3},
  doi          = {10.1016/0304-3975(81)90029-3},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Vazenin81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/WeihrauchS81,
  author       = {Klaus Weihrauch and
                  Ulrich Schreiber},
  title        = {Embedding Metric Spaces Into CPO's},
  journal      = {Theor. Comput. Sci.},
  volume       = {16},
  pages        = {5--24},
  year         = {1981},
  url          = {https://doi.org/10.1016/0304-3975(81)90027-X},
  doi          = {10.1016/0304-3975(81)90027-X},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/WeihrauchS81.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.