Search dblp for Publications

• > Home > Search

@article{DBLP:journals/tcs/CournierDDPV16,
  author       = {Alain Cournier and
                  Ajoy Kumar Datta and
                  St{\'{e}}phane Devismes and
                  Franck Petit and
                  Vincent Villain},
  title        = {The expressive power of snap-stabilization},
  journal      = {Theor. Comput. Sci.},
  volume       = {626},
  pages        = {40--66},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2016.01.036},
  doi          = {10.1016/J.TCS.2016.01.036},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/CournierDDPV16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/DattaDHLR16,
  author       = {Ajoy Kumar Datta and
                  St{\'{e}}phane Devismes and
                  Karel Heurtefeux and
                  Lawrence L. Larmore and
                  Yvan Rivierre},
  title        = {Competitive self-stabilizing k-clustering},
  journal      = {Theor. Comput. Sci.},
  volume       = {626},
  pages        = {110--133},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2016.02.010},
  doi          = {10.1016/J.TCS.2016.02.010},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/DattaDHLR16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/HudryL16,
  author       = {Olivier Hudry and
                  Antoine Lobstein},
  title        = {More results on the complexity of identifying problems in graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {626},
  pages        = {1--12},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2016.01.021},
  doi          = {10.1016/J.TCS.2016.01.021},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/HudryL16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/JainKSS16,
  author       = {Sanjay Jain and
                  Bakhadyr Khoussainov and
                  Philipp Schlicht and
                  Frank Stephan},
  title        = {Tree-automatic scattered linear orders},
  journal      = {Theor. Comput. Sci.},
  volume       = {626},
  pages        = {83--96},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2016.02.008},
  doi          = {10.1016/J.TCS.2016.02.008},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/JainKSS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/PoulyG16,
  author       = {Amaury Pouly and
                  Daniel Silva Gra{\c{c}}a},
  title        = {Computational complexity of solving polynomial differential equations
                  over unbounded domains},
  journal      = {Theor. Comput. Sci.},
  volume       = {626},
  pages        = {67--82},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2016.02.002},
  doi          = {10.1016/J.TCS.2016.02.002},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/PoulyG16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Radons16,
  author       = {Manuel Radons},
  title        = {Direct solution of piecewise linear systems},
  journal      = {Theor. Comput. Sci.},
  volume       = {626},
  pages        = {97--109},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2016.02.009},
  doi          = {10.1016/J.TCS.2016.02.009},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Radons16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Reich16,
  author       = {Alexander Reich},
  title        = {Complexity of the maximum leaf spanning tree problem on planar and
                  regular graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {626},
  pages        = {134--143},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2016.02.011},
  doi          = {10.1016/J.TCS.2016.02.011},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Reich16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/RougemontV16,
  author       = {Michel de Rougemont and
                  Adrien Vieilleribi{\`{e}}re},
  title        = {Approximate consistency for transformations on words and trees},
  journal      = {Theor. Comput. Sci.},
  volume       = {626},
  pages        = {13--39},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2016.01.032},
  doi          = {10.1016/J.TCS.2016.01.032},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/RougemontV16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/YuanLQZL16,
  author       = {Jun Yuan and
                  Aixia Liu and
                  Xiao Qin and
                  Jifu Zhang and
                  Jing Li},
  title        = {g-Good-neighbor conditional diagnosability measures for 3-ary n-cube
                  networks},
  journal      = {Theor. Comput. Sci.},
  volume       = {626},
  pages        = {144--162},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2016.01.046},
  doi          = {10.1016/J.TCS.2016.01.046},
  timestamp    = {Fri, 30 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/YuanLQZL16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}