default search action
Jovan Komatovic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j2]Pierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert
, Vincent Gramoli, Rachid Guerraoui, Jovan Komatovic, Manuel Vidigueira:
Byzantine consensus is Θ (n2): the Dolev-Reischuk bound is tight even in partial synchrony! Distributed Comput. 37(2): 89-119 (2024) - [c11]Pierre Civit
DARE to Agree: Byzantine Agreement With Optimal Resilience and Adaptive Communication. PODC 2024: 145-156 - [c10]Pierre Civit
All Byzantine Agreement Problems Are Expensive. PODC 2024: 157-169 - [c9]Pierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Manuel Vidigueira, Igor Zablotchi:
Efficient Signature-Free Validated Agreement. DISC 2024: 14:1-14:23 - [i17]Pierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Manuel Vidigueira, Igor Zablotchi:
Partial synchrony for free? New bounds for Byzantine agreement via a generic transformation across network models. CoRR abs/2402.10059 (2024) - [i16]Pierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Manuel Vidigueira, Igor Zablotchi:
Error-Free Near-Optimal Validated Agreement. CoRR abs/2403.08374 (2024) - [i15]Daniel Collins, Yuval Efron, Jovan Komatovic:
Juggernaut: Efficient Crypto-Agnostic Byzantine Agreement. CoRR abs/2410.12121 (2024) - [i14]Jovan Komatovic, Joachim Neu, Tim Roughgarden:
Toward Optimal-Complexity Hash-Based Asynchronous MVBA with Optimal Resilience. CoRR abs/2410.12755 (2024) - [i13]Pierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Manuel Vidigueira:
DARE to agree: Byzantine Agreement with Optimal Resilience and Adaptive Communication. IACR Cryptol. ePrint Arch. 2024: 403 (2024) - [i12]Daniel Collins, Yuval Efron, Jovan Komatovic:
Juggernaut: Efficient Crypto-Agnostic Byzantine Agreement. IACR Cryptol. ePrint Arch. 2024: 1601 (2024) - [i11]Jovan Komatovic, Joachim Neu, Tim Roughgarden:
Toward Optimal-Complexity Hash-Based Asynchronous MVBA with Optimal Resilience. IACR Cryptol. ePrint Arch. 2024: 1682 (2024) - 2023
- [j1]Pierre Civit
As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy! J. Parallel Distributed Comput. 181: 104743 (2023) - [c8]Pierre Civit
On the Validity of Consensus. PODC 2023: 332-343 - [c7]Pierre Civit
Every Bit Counts in Consensus. DISC 2023: 13:1-13:26 - [i10]Pierre Civit, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Manuel Vidigueira:
On the Validity of Consensus. CoRR abs/2301.04920 (2023) - [i9]Pierre Civit, Seth Gilbert
Every Bit Counts in Consensus. CoRR abs/2306.00431 (2023) - [i8]Pierre Civit, Seth Gilbert
Strong Byzantine Agreement with Adaptive Word Complexity. CoRR abs/2308.03524 (2023) - [i7]Pierre Civit, Seth Gilbert
All Byzantine Agreement Problems are Expensive. CoRR abs/2311.08060 (2023) - 2022
- [c6]Ethan Buchman, Rachid Guerraoui
Revisiting Tendermint: Design Tradeoffs, Accountability, and Practical Use. DSN (Supplements) 2022: 11-14 - [c5]Pierre Civit
Crime and Punishment in Distributed Byzantine Decision Tasks. ICDCS 2022: 34-44 - [c4]Pierre Civit
As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy! IPDPS 2022: 560-570 - [c3]Pierre Civit
Byzantine Consensus Is Θ(n²): The Dolev-Reischuk Bound Is Tight Even in Partial Synchrony! DISC 2022: 14:1-14:21 - [i6]Pierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert
Byzantine Consensus is Θ(n^2): The Dolev-Reischuk Bound is Tight even in Partial Synchrony! [Extended Version]. CoRR abs/2208.09262 (2022) - [i5]Martina Camaioni, Rachid Guerraoui, Jovan Komatovic, Matteo Monti, Manuel Vidigueira:
Carbon: An Asynchronous Voting-Based Payment System for a Client-Server Architecture. CoRR abs/2209.09580 (2022) - [i4]Pierre Civit, Seth Gilbert, Vincent Gramoli, Rachid Guerraoui
Crime and Punishment in Distributed Byzantine Decision Tasks. IACR Cryptol. ePrint Arch. 2022: 121 (2022) - 2021
- [i3]Pierre Civit, Seth Gilbert, Vincent Gramoli, Rachid Guerraoui
As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy! IACR Cryptol. ePrint Arch. 2021: 1169 (2021) - 2020
- [c2]Daniel Collins, Rachid Guerraoui
Online Payments by Merely Broadcasting Messages. DSN 2020: 26-38 - [c1]Rachid Guerraoui
Dynamic Byzantine Reliable Broadcast. OPODIS 2020: 23:1-23:18 - [i2]Rachid Guerraoui, Jovan Komatovic, Dragos-Adrian Seredinschi:
Dynamic Byzantine Reliable Broadcast [Technical Report]. CoRR abs/2001.06271 (2020) - [i1]Daniel Collins, Rachid Guerraoui, Jovan Komatovic, Matteo Monti, Athanasios Xygkis, Matej Pavlovic, Petr Kuznetsov, Yvonne-Anne Pignolet, Dragos-Adrian Seredinschi, Andrei Tonkikh:
Online Payments by Merely Broadcasting Messages (Extended Version). CoRR abs/2004.13184 (2020)
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-11-25 22:42 CET 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: