Wait-free approximate agreement on graphs
Theoretical Computer Science · 2023-02 · 948 · 113733
DOI: 10.1016/j.tcs.2023.113733 ↗Kurz gefasst
Fachartikel in der Zeitschrift Theoretical Computer Science, 2023-02. Verfasst von Dan Alistarh und 2 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 44 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: European Commission Marie Sklodowska-Curie Actions, Natural Sciences and Engineering Research Council of Canada, European Research Council.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- European Commission Marie Sklodowska-Curie Actions
- Natural Sciences and Engineering Research Council of Canada
- European Research Council
- Horizon 2020
- H2020 Marie Skłodowska-Curie Actions
Zitieren
APA
Alistarh, D., Ellen, F., & Rybicki, J. (2023). Wait-free approximate agreement on graphs. Theoretical Computer Science, 948, 113733. https://doi.org/10.1016/j.tcs.2023.113733
Vancouver
Alistarh D, Ellen F, Rybicki J. Wait-free approximate agreement on graphs. Theoretical Computer Science. 2023;948:113733. doi:10.1016/j.tcs.2023.113733
BibTeX
@article{Alistarh2023,
author = {Alistarh, Dan and Ellen, Faith and Rybicki, Joel},
title = {Wait-free approximate agreement on graphs},
journal = {Theoretical Computer Science},
year = {2023},
volume = {948},
pages = {113733},
doi = {10.1016/j.tcs.2023.113733}
}
EUVIMED