Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/tcs/ChitturiS12,
  author       = {Bhadrachalam Chitturi and
                  Ivan Hal Sudborough},
  title        = {Bounding prefix transposition distance for strings and permutations},
  journal      = {Theor. Comput. Sci.},
  volume       = {421},
  pages        = {15--24},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2011.11.018},
  doi          = {10.1016/J.TCS.2011.11.018},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ChitturiS12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CivrilM12,
  author       = {Ali {\c{C}}ivril and
                  Malik Magdon{-}Ismail},
  title        = {Column subset selection via sparse approximation of {SVD}},
  journal      = {Theor. Comput. Sci.},
  volume       = {421},
  pages        = {1--14},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2011.11.019},
  doi          = {10.1016/J.TCS.2011.11.019},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/CivrilM12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Connamacher12,
  author       = {Harold S. Connamacher},
  title        = {Exact thresholds for {DPLL} on random {XOR-SAT} and NP-complete extensions
                  of {XOR-SAT}},
  journal      = {Theor. Comput. Sci.},
  volume       = {421},
  pages        = {25--55},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2011.11.014},
  doi          = {10.1016/J.TCS.2011.11.014},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Connamacher12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ElbassioniT12,
  author       = {Khaled M. Elbassioni and
                  Hans Raj Tiwary},
  title        = {Complexity of approximating the vertex centroid of a polyhedron},
  journal      = {Theor. Comput. Sci.},
  volume       = {421},
  pages        = {56--61},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2011.11.017},
  doi          = {10.1016/J.TCS.2011.11.017},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/ElbassioniT12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Guo12,
  author       = {Alan Guo},
  title        = {Winning strategies for aperiodic subtraction games},
  journal      = {Theor. Comput. Sci.},
  volume       = {421},
  pages        = {70--73},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2011.11.025},
  doi          = {10.1016/J.TCS.2011.11.025},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Guo12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/WangY12,
  author       = {Shiying Wang and
                  Yuxing Yang},
  title        = {Fault tolerance in bubble-sort graph networks},
  journal      = {Theor. Comput. Sci.},
  volume       = {421},
  pages        = {62--69},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2011.11.016},
  doi          = {10.1016/J.TCS.2011.11.016},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/WangY12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics