Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/tcs/tcs709.bht:"
@article{DBLP:journals/tcs/BonomiPP18, author = {Silvia Bonomi and Antonella Del Pozzo and Maria Potop{-}Butucaru}, title = {Optimal self-stabilizing synchronous mobile Byzantine-tolerant atomic register}, journal = {Theor. Comput. Sci.}, volume = {709}, pages = {64--79}, year = {2018}, url = {https://doi.org/10.1016/j.tcs.2017.08.020}, doi = {10.1016/J.TCS.2017.08.020}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/BonomiPP18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CastanedaDT18, author = {Armando Casta{\~{n}}eda and Danny Dolev and Amitabh Trehan}, title = {Compact routing messages in self-healing trees}, journal = {Theor. Comput. Sci.}, volume = {709}, pages = {2--19}, year = {2018}, url = {https://doi.org/10.1016/j.tcs.2016.11.022}, doi = {10.1016/J.TCS.2016.11.022}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CastanedaDT18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CzyzowiczDGKM18, author = {Jurek Czyzowicz and Stefan Dobrev and Konstantinos Georgiou and Evangelos Kranakis and Fraser MacQuarrie}, title = {Evacuating two robots from multiple unknown exits in a circle}, journal = {Theor. Comput. Sci.}, volume = {709}, pages = {20--30}, year = {2018}, url = {https://doi.org/10.1016/j.tcs.2016.11.019}, doi = {10.1016/J.TCS.2016.11.019}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CzyzowiczDGKM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/FoersterLSW18, author = {Klaus{-}Tycho Foerster and Thomas Luedi and Jochen Seidel and Roger Wattenhofer}, title = {Local checkability, no strings attached: (A)cyclicity, reachability, loop free updates in SDNs}, journal = {Theor. Comput. Sci.}, volume = {709}, pages = {48--63}, year = {2018}, url = {https://doi.org/10.1016/j.tcs.2016.11.018}, doi = {10.1016/J.TCS.2016.11.018}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/FoersterLSW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/HeGG18, author = {Yuan He and Krishnan Gopalakrishnan and Eli Gafni}, title = {Group mutual exclusion in linear time and space}, journal = {Theor. Comput. Sci.}, volume = {709}, pages = {31--47}, year = {2018}, url = {https://doi.org/10.1016/j.tcs.2017.05.030}, doi = {10.1016/J.TCS.2017.05.030}, timestamp = {Mon, 03 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/HeGG18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/MostefaouiMR18, author = {Achour Most{\'{e}}faoui and Hamouma Moumen and Michel Raynal}, title = {Randomized k-set agreement in crash-prone and Byzantine asynchronous systems}, journal = {Theor. Comput. Sci.}, volume = {709}, pages = {80--97}, year = {2018}, url = {https://doi.org/10.1016/j.tcs.2017.03.018}, doi = {10.1016/J.TCS.2017.03.018}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/MostefaouiMR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/PanduranganR18, author = {Gopal Pandurangan and Peter Robinson}, title = {Special Issue of {ICDCN} 2016 (Distributed Computing Track)}, journal = {Theor. Comput. Sci.}, volume = {709}, pages = {1}, year = {2018}, url = {https://doi.org/10.1016/j.tcs.2017.12.008}, doi = {10.1016/J.TCS.2017.12.008}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/PanduranganR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.