Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/tcs/AlonEFT12,
  author       = {Noga Alon and
                  Yuval Emek and
                  Michal Feldman and
                  Moshe Tennenholtz},
  title        = {Bayesian ignorance},
  journal      = {Theor. Comput. Sci.},
  volume       = {452},
  pages        = {1--11},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.05.017},
  doi          = {10.1016/J.TCS.2012.05.017},
  timestamp    = {Fri, 02 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/AlonEFT12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Castel-TalebMP12,
  author       = {Hind Castel{-}Taleb and
                  Lynda Mokdad and
                  Nihal Pekergin},
  title        = {An algorithm approach to bounding aggregations of multidimensional
                  Markov chains},
  journal      = {Theor. Comput. Sci.},
  volume       = {452},
  pages        = {12--20},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.05.030},
  doi          = {10.1016/J.TCS.2012.05.030},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Castel-TalebMP12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/DamaschkeM12,
  author       = {Peter Damaschke and
                  Leonid Molokov},
  title        = {Parameterized reductions and algorithms for a graph editing problem
                  that generalizes vertex cover},
  journal      = {Theor. Comput. Sci.},
  volume       = {452},
  pages        = {39--46},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.05.031},
  doi          = {10.1016/J.TCS.2012.05.031},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/DamaschkeM12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Day12,
  author       = {Adam R. Day},
  title        = {Process and truth-table characterisations of randomness},
  journal      = {Theor. Comput. Sci.},
  volume       = {452},
  pages        = {47--55},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.05.028},
  doi          = {10.1016/J.TCS.2012.05.028},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Day12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/EmekF12,
  author       = {Yuval Emek and
                  Michal Feldman},
  title        = {Computing optimal contracts in combinatorial agencies},
  journal      = {Theor. Comput. Sci.},
  volume       = {452},
  pages        = {56--74},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.05.018},
  doi          = {10.1016/J.TCS.2012.05.018},
  timestamp    = {Fri, 02 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/EmekF12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/FleischerW12,
  author       = {Rudolf Fleischer and
                  Gerhard J. Woeginger},
  title        = {An algorithmic analysis of the Honey-Bee game},
  journal      = {Theor. Comput. Sci.},
  volume       = {452},
  pages        = {75--87},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.05.032},
  doi          = {10.1016/J.TCS.2012.05.032},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/FleischerW12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/FlorencioF12,
  author       = {Christophe Costa Flor{\^{e}}ncio and
                  Henning Fernau},
  title        = {On families of categorial grammars of bounded value, their learnability
                  and related complexity questions},
  journal      = {Theor. Comput. Sci.},
  volume       = {452},
  pages        = {21--38},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.05.016},
  doi          = {10.1016/J.TCS.2012.05.016},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/FlorencioF12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/HajiaghayiKKM12,
  author       = {MohammadTaghi Hajiaghayi and
                  Rohit Khandekar and
                  Guy Kortsarz and
                  Juli{\'{a}}n Mestre},
  title        = {The checkpoint problem},
  journal      = {Theor. Comput. Sci.},
  volume       = {452},
  pages        = {88--99},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.05.021},
  doi          = {10.1016/J.TCS.2012.05.021},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/HajiaghayiKKM12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/IlicKR12,
  author       = {Aleksandar Ilic and
                  Sandi Klavzar and
                  Yoomi Rho},
  title        = {The index of a binary word},
  journal      = {Theor. Comput. Sci.},
  volume       = {452},
  pages        = {100--106},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.05.025},
  doi          = {10.1016/J.TCS.2012.05.025},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/IlicKR12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/KesselmanL12,
  author       = {Alexander Kesselman and
                  Stefano Leonardi},
  title        = {Game-theoretic analysis of Internet switching with selfish users},
  journal      = {Theor. Comput. Sci.},
  volume       = {452},
  pages        = {107--116},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.05.029},
  doi          = {10.1016/J.TCS.2012.05.029},
  timestamp    = {Tue, 27 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/KesselmanL12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/NikolopoulosP12,
  author       = {Stavros D. Nikolopoulos and
                  Leonidas Palios},
  title        = {An O(nm)-time certifying algorithm for recognizing HHD-free graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {452},
  pages        = {117--131},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.06.006},
  doi          = {10.1016/J.TCS.2012.06.006},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/NikolopoulosP12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Stewart12,
  author       = {Iain A. Stewart},
  title        = {A general technique to establish the asymptotic conditional diagnosability
                  of interconnection networks},
  journal      = {Theor. Comput. Sci.},
  volume       = {452},
  pages        = {132--147},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.05.015},
  doi          = {10.1016/J.TCS.2012.05.015},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Stewart12.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.