Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/tcs/AtenieseBSS01,
  author       = {Giuseppe Ateniese and
                  Carlo Blundo and
                  Alfredo De Santis and
                  Douglas R. Stinson},
  title        = {Extended capabilities for visual cryptography},
  journal      = {Theor. Comput. Sci.},
  volume       = {250},
  number       = {1-2},
  pages        = {143--161},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(99)00127-9},
  doi          = {10.1016/S0304-3975(99)00127-9},
  timestamp    = {Sun, 06 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/AtenieseBSS01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AusielloSM01,
  author       = {Giorgio Ausiello and
                  Donald Sannella and
                  Michael W. Mislove},
  title        = {25 Years},
  journal      = {Theor. Comput. Sci.},
  volume       = {250},
  number       = {1-2},
  year         = {2001},
  timestamp    = {Wed, 19 Nov 2003 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/AusielloSM01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Bar-IlanKP01,
  author       = {Judit Bar{-}Ilan and
                  Guy Kortsarz and
                  David Peleg},
  title        = {Generalized submodular cover problems and applications},
  journal      = {Theor. Comput. Sci.},
  volume       = {250},
  number       = {1-2},
  pages        = {179--200},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(99)00130-9},
  doi          = {10.1016/S0304-3975(99)00130-9},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Bar-IlanKP01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BlairHT01,
  author       = {Jean R. S. Blair and
                  Pinar Heggernes and
                  Jan Arne Telle},
  title        = {A practical algorithm for making filled graphs minimal},
  journal      = {Theor. Comput. Sci.},
  volume       = {250},
  number       = {1-2},
  pages        = {125--141},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(99)00126-7},
  doi          = {10.1016/S0304-3975(99)00126-7},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BlairHT01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BrodalP01,
  author       = {Gerth St{\o}lting Brodal and
                  Maria Cristina Pinotti},
  title        = {Comparator networks for binary heap construction},
  journal      = {Theor. Comput. Sci.},
  volume       = {250},
  number       = {1-2},
  pages        = {235--245},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(99)00137-1},
  doi          = {10.1016/S0304-3975(99)00137-1},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BrodalP01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CampbellRRT01,
  author       = {Colin M. Campbell and
                  Edmund F. Robertson and
                  Nikola Ruskuc and
                  Richard M. Thomas},
  title        = {Automatic semigroups},
  journal      = {Theor. Comput. Sci.},
  volume       = {250},
  number       = {1-2},
  pages        = {365--391},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(99)00151-6},
  doi          = {10.1016/S0304-3975(99)00151-6},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/CampbellRRT01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CaporasoZG01,
  author       = {Salvatore Caporaso and
                  Michele Zito and
                  Nicola Galesi},
  title        = {A predicative and decidable characterization of the polynomial classes
                  of languages},
  journal      = {Theor. Comput. Sci.},
  volume       = {250},
  number       = {1-2},
  pages        = {83--99},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(99)00116-4},
  doi          = {10.1016/S0304-3975(99)00116-4},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/CaporasoZG01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FranciosaFG01,
  author       = {Paolo Giulio Franciosa and
                  Daniele Frigioni and
                  Roberto Giaccio},
  title        = {Semi-dynamic breadth-first search in digraphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {250},
  number       = {1-2},
  pages        = {201--217},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(99)00132-2},
  doi          = {10.1016/S0304-3975(99)00132-2},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/FranciosaFG01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FulopV01,
  author       = {Zolt{\'{a}}n F{\"{u}}l{\"{o}}p and
                  S{\'{a}}ndor V{\'{a}}gv{\"{o}}lgyi},
  title        = {Restricted ground tree transducers},
  journal      = {Theor. Comput. Sci.},
  volume       = {250},
  number       = {1-2},
  pages        = {219--233},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(99)00135-8},
  doi          = {10.1016/S0304-3975(99)00135-8},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/FulopV01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JedrzejowiczS01,
  author       = {Joanna Jedrzejowicz and
                  Andrzej Szepietowski},
  title        = {Shuffle languages are in {P}},
  journal      = {Theor. Comput. Sci.},
  volume       = {250},
  number       = {1-2},
  pages        = {31--53},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(99)00109-7},
  doi          = {10.1016/S0304-3975(99)00109-7},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/JedrzejowiczS01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Kim01,
  author       = {Changwook Kim},
  title        = {Double Greibach operator grammars},
  journal      = {Theor. Comput. Sci.},
  volume       = {250},
  number       = {1-2},
  pages        = {247--264},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(99)00138-3},
  doi          = {10.1016/S0304-3975(99)00138-3},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Kim01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Knuutila01,
  author       = {Timo Knuutila},
  title        = {Re-describing an algorithm by Hopcroft},
  journal      = {Theor. Comput. Sci.},
  volume       = {250},
  number       = {1-2},
  pages        = {333--363},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(99)00150-4},
  doi          = {10.1016/S0304-3975(99)00150-4},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Knuutila01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Koch01,
  author       = {Ina Koch},
  title        = {Enumerating all connected maximal common subgraphs in two graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {250},
  number       = {1-2},
  pages        = {1--30},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00286-3},
  doi          = {10.1016/S0304-3975(00)00286-3},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Koch01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LabhallaLM01,
  author       = {Salah Labhalla and
                  Henri Lombardi and
                  E. Moutai},
  title        = {Espaces m{\'{e}}triques rationnellement pr{\'{e}}sent{\'{e}}s
                  et complexit{\'{e}}, le cas de l'espace des fonctions r{\'{e}}elles
                  uniform{\'{e}}ment continues sur un intervalle compact},
  journal      = {Theor. Comput. Sci.},
  volume       = {250},
  number       = {1-2},
  pages        = {265--332},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(99)00139-5},
  doi          = {10.1016/S0304-3975(99)00139-5},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/LabhallaLM01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Merkle01,
  author       = {Wolfgang Merkle},
  title        = {Structural properties of bounded relations with an application to
                  {NP} optimization problems},
  journal      = {Theor. Comput. Sci.},
  volume       = {250},
  number       = {1-2},
  pages        = {101--124},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(99)00121-8},
  doi          = {10.1016/S0304-3975(99)00121-8},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Merkle01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MihalacheS01,
  author       = {Valeria Mihalache and
                  Arto Salomaa},
  title        = {Language-theoretic aspects of {DNA} complematarity},
  journal      = {Theor. Comput. Sci.},
  volume       = {250},
  number       = {1-2},
  pages        = {163--178},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(99)00129-2},
  doi          = {10.1016/S0304-3975(99)00129-2},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/MihalacheS01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Nivat01,
  author       = {Maurice Nivat},
  title        = {25 Years},
  journal      = {Theor. Comput. Sci.},
  volume       = {250},
  number       = {1-2},
  year         = {2001},
  timestamp    = {Wed, 19 Nov 2003 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Nivat01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/OkawaH01,
  author       = {Satoshi Okawa and
                  Sadaki Hirose},
  title        = {Homomorphic characterizations of recursively enumerable languages
                  with very small language classes},
  journal      = {Theor. Comput. Sci.},
  volume       = {250},
  number       = {1-2},
  pages        = {55--69},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(99)00110-3},
  doi          = {10.1016/S0304-3975(99)00110-3},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/OkawaH01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Prieur01,
  author       = {Christophe Prieur},
  title        = {How to decide continuity of rational functions on infinite words},
  journal      = {Theor. Comput. Sci.},
  volume       = {250},
  number       = {1-2},
  pages        = {71--82},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(99)00115-2},
  doi          = {10.1016/S0304-3975(99)00115-2},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Prieur01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}