default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 421 matches
- 2025
- Baohan Huang, Haibin Zhang, Chao Liu, Shengli Liu, Yong Yu, Fangguo Zhang, Liehuang Zhu:
How to reduce the number of steps for (multi-valued validated) Byzantine agreement? J. Parallel Distributed Comput. 204: 105132 (2025) - Xiaohai Dai
, Zhengxuan Guo
, Jiang Xiao
, Guanxiong Wang
, Yifei Liang
, Chen Yu
, Hai Jin
:
Pako: Multi-Valued Byzantine Agreement Comparable to Partially-Synchronous BFT. IEEE Trans. Computers 74(3): 887-900 (2025) - Haochen Wang
, Qidi You, Sisi Duan
:
Synchronous Byzantine Agreement With O(n) Messages and O(1) Expected Time. IEEE Trans. Inf. Forensics Secur. 20: 338-349 (2025) - Hanwen Feng, Zhenliang Lu, Tiancheng Mai, Qiang Tang:
Faster Hash-based Multi-valued Validated Asynchronous Byzantine Agreement. DSN 2025: 303-316 - Roy Shadmon, Owen Arden:
Enhancing Accuracy in Approximate Byzantine Agreement with Bayesian Inference. DSN-S 2025: 191-195 - Daniel Collins, Yuval Efron, Jovan Komatovic:
Juggernaut: Efficient Crypto-Agnostic Byzantine Agreement. EUROCRYPT (5) 2025: 65-95 - Nasit S. Sony
, Xianzhong Ding
:
A Committee Based Optimal Asynchronous Byzantine Agreement Protocol W.P. 1. ICDCN 2025: 282-283 - Naama Ben-David
, Muhammad Ayaz Dzulfikar
, Faith Ellen
, Seth Gilbert
:
Byzantine Agreement with Predictions. PODC 2025: 3-14 - Pierre Civit
, Muhammad Ayaz Dzulfikar
, Seth Gilbert
, Rachid Guerraoui
, Jovan Komatovic
, Manuel Vidigueira
:
Repeated Agreement is Cheap! On Weak Accountability and Multishot Byzantine Agreement. PODC 2025: 15-27 - Fabien Dufoulon
, Gopal Pandurangan
:
Improved Byzantine Agreement under an Adaptive Adversary. PODC 2025: 173-180 - Mose Mizrahi Erbes
, Roger Wattenhofer
:
Brief Announcement: Extending Asynchronous Byzantine Agreement with Crusader Agreement. PODC 2025: 50-53 - John Augustine, Fabien Dufoulon, Gopal Pandurangan:
Fully-Distributed Byzantine Agreement in Sparse Networks. SODA 2025: 4172-4197 - Pierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Manuel Vidigueira, Igor Zablotchi:
Partial Synchrony for Free: New Upper Bounds for Byzantine Agreement. SODA 2025: 4227-4291 - Mélanie Cambus, Darya Melnyk, Tijana Milentijevic, Stefan Schmid:
Approximate Agreement Algorithms for Byzantine Collaborative Learning. SPAA 2025: 89-100 - Nasit S. Sony:
An efficient validated asynchronous byzantine agreement protocol using committee. CoRR abs/2501.00717 (2025) - Jinyuan Chen:
OciorABA: Improved Error-Free Asynchronous Byzantine Agreement via Partial Vector Agreement. CoRR abs/2501.11788 (2025) - Mose Mizrahi Erbes, Roger Wattenhofer:
Efficient Extensions for Asynchronous Byzantine Agreement via Weak Agreement. CoRR abs/2502.02320 (2025) - Mélanie Cambus, Darya Melnyk, Tijana Milentijevic, Stefan Schmid:
Approximate Agreement Algorithms for Byzantine Collaborative Learning. CoRR abs/2504.01504 (2025) - Naama Ben-David, Muhammad Ayaz Dzulfikar, Faith Ellen, Seth Gilbert:
Byzantine Agreement with Predictions. CoRR abs/2505.01793 (2025) - Andrei Constantinescu, Marc Dufay, Anton Paramonov, Roger Wattenhofer:
From Few to Many Faults: Adaptive Byzantine Agreement with Optimal Communication. CoRR abs/2505.19989 (2025) - Fabien Dufoulon, Gopal Pandurangan:
Improved Byzantine Agreement under an Adaptive Adversary. CoRR abs/2506.04919 (2025) - Pierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Manuel Vidigueira:
Repeated Agreement is Cheap! On Weak Accountability and Multishot Byzantine Agreement. IACR Cryptol. ePrint Arch. 2025: 826 (2025) - Simon Holmgaard Kamp:
A New Way to Achieve Round-Efficient Asynchronous Byzantine Agreement. IACR Cryptol. ePrint Arch. 2025: 143 (2025) - Bo Pan, Maria Potop-Butucaru:
Mobile Byzantine Agreement in a Trusted World. IACR Cryptol. ePrint Arch. 2025: 603 (2025) - 2024
- Andrea Flamini, Riccardo Longo, Alessio Meneghetti:
Multidimensional Byzantine agreement in a synchronous setting. Appl. Algebra Eng. Commun. Comput. 35(2): 233-251 (2024) - Andrea Flamini
, Riccardo Longo
, Alessio Meneghetti
:
Cob: a leaderless protocol for parallel Byzantine agreement in incomplete networks. Distributed Parallel Databases 42(2): 179-216 (2024) - Shang-En Huang
, Seth Pettie
, Leqi Zhu
:
Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection. J. ACM 71(2): 12:1-12:37 (2024) - Elette Boyle, Ran Cohen
, Aarushi Goel:
Breaking the $O(\sqrt{n})$-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party. J. Cryptol. 37(1): 2 (2024) - Zoltán Guba
, István Finta, Ákos Budai, Lóránt Farkas, Zoltán Zimborás, András Pályi:
Resource analysis for quantum-aided Byzantine agreement with the four-qubit singlet state. Quantum 8: 1324 (2024) - Ashish Choudhury
:
Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience. Theor. Comput. Sci. 995: 114492 (2024)
skipping 391 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2025-07-24 11:24 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint