default search action
Thibault Rieutord
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c15]Antonella Del Pozzo, Thibault Rieutord:
Fork Accountability in Tenderbake. FAB 2022: 5:1-5:22 - 2021
- [c14]Lacramioara Astefanoaei, Pierre Chambart, Antonella Del Pozzo, Thibault Rieutord, Sara Tucci Piergiovanni, Eugen Zalinescu:
Tenderbake - A Solution to Dynamic Repeated Consensus for Blockchains. FAB 2021: 1:1-1:23 - [c13]Emmanuelle Anceaume, Antonella Del Pozzo, Thibault Rieutord, Sara Tucci Piergiovanni:
On Finality in Blockchains. OPODIS 2021: 6:1-6:19 - [c12]Luciano Freitas de Souza
, Petr Kuznetsov, Thibault Rieutord, Sara Tucci Piergiovanni:
Accountability and Reconfiguration: Self-Healing Lattice Agreement. OPODIS 2021: 25:1-25:23 - [c11]Luciano Freitas de Souza, Petr Kuznetsov, Thibault Rieutord, Sara Tucci Piergiovanni:
Brief Announcement: Accountability and Reconfiguration - Self-Healing Lattice Agreement. DISC 2021: 54:1-54:5 - [i8]Luciano Freitas de Souza, Petr Kuznetsov, Thibault Rieutord, Sara Tucci Piergiovanni:
Accountability and Reconfiguration: Self-Healing Lattice Agreement. CoRR abs/2105.04909 (2021) - 2020
- [j2]Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers, Petr Kuznetsov, Thibault Rieutord:
Perfect failure detection with very few bits. Inf. Comput. 275: 104604 (2020) - [c10]Petr Kuznetsov, Thibault Rieutord:
Affine Tasks for k-Test-and-Set. SSS 2020: 151-166 - [c9]Petr Kuznetsov, Thibault Rieutord:
Brief Announcement: On Decidability of 2-Process Affine Models. DISC 2020: 54:1-54:3 - [i7]Petr Kuznetsov, Thibault Rieutord, Yuan He:
An Asynchronous Computability Theorem for Fair Adversaries. CoRR abs/2004.08348 (2020) - [i6]Petr Kuznetsov, Thibault Rieutord:
On Decidability of 2-process Affine Models. CoRR abs/2008.02099 (2020) - [i5]Emmanuelle Anceaume, Antonella Del Pozzo, Thibault Rieutord, Sara Tucci Piergiovanni:
On Finality in Blockchains. CoRR abs/2012.10172 (2020)
2010 – 2019
- 2019
- [c8]Petr Kuznetsov, Thibault Rieutord, Sara Tucci Piergiovanni:
Reconfigurable Lattice Agreement and Applications. OPODIS 2019: 31:1-31:17 - [i4]Petr Kuznetsov, Thibault Rieutord, Sara Tucci Piergiovanni:
Reconfigurable Lattice Agreement and Applications. CoRR abs/1910.09264 (2019) - 2018
- [b1]Thibault Rieutord:
Combinatorial characterization of asynchronous distributed computability. (Caractérisation combinatoire de la calculabilité distribuée asynchrone). University of Paris-Saclay, France, 2018 - [c7]Petr Kuznetsov, Thibault Rieutord, Yuan He:
An Asynchronous Computability Theorem for Fair Adversaries. PODC 2018: 387-396 - 2017
- [j1]Denis Jeanneau
Solving k-Set Agreement Using Failure Detectors in Unknown Dynamic Networks. IEEE Trans. Parallel Distributed Syst. 28(5): 1484-1499 (2017) - [c6]Petr Kuznetsov, Thibault Rieutord:
Agreement Functions for Distributed Computing Models. NETYS 2017: 175-190 - [c5]Damien Imbs, Petr Kuznetsov, Thibault Rieutord:
Progress-Space Tradeoffs in Single-Writer Memory Implementations. OPODIS 2017: 9:1-9:17 - [c4]Petr Kuznetsov, Thibault Rieutord, Yuan He:
Brief Announcement: Compact Topology of Shared-Memory Adversaries. DISC 2017: 56:1-56:4 - [i3]Petr Kuznetsov, Thibault Rieutord:
Agreement Functions for Distributed Computing Models. CoRR abs/1702.00361 (2017) - [i2]Damien Imbs, Petr Kuznetsov, Thibault Rieutord:
Progress-Space Tradeoffs in Single-Writer Memory Implementations. CoRR abs/1709.01879 (2017) - 2016
- [c3]Eli Gafni, Yuan He, Petr Kuznetsov, Thibault Rieutord:
Read-Write Memory and k-Set Consensus as an Affine Task. OPODIS 2016: 6:1-6:17 - [c2]Pierre Fraigniaud, Sergio Rajsbaum
Perfect Failure Detection with Very Few Bits. SSS 2016: 154-169 - [i1]Eli Gafni, Yuan He, Petr Kuznetsov, Thibault Rieutord:
Read-Write Memory and k-Set Consensus as an Affine Task. CoRR abs/1610.01423 (2016) - 2015
- [c1]Denis Jeanneau
A Failure Detector for k-Set Agreement in Dynamic Systems. NCA 2015: 176-183
Coauthor Index
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: