Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from VLDB 2026 / reviewers in the wild / expert

Arkady Zamsky

dblp:69/4691 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1996
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Distributed systems › consensus
byzantine agreement		 0.011996
A Randomized Byzantine Agreement Protocol with Constant Expected Time and Guaranteed Termination in Optimal (Deterministic) Time · PODC 1996
Distributed systems
consensus		 0.011996
A Randomized Byzantine Agreement Protocol with Constant Expected Time and Guaranteed Termination in Optimal (Deterministic) Time · PODC 1996
Distributed systems
distributed coordination and fault tolerance		 0.011996
A Randomized Byzantine Agreement Protocol with Constant Expected Time and Guaranteed Termination in Optimal (Deterministic) Time · PODC 1996
Distributed systems › distributed algorithms
randomized protocols		 0.011996
A Randomized Byzantine Agreement Protocol with Constant Expected Time and Guaranteed Termination in Optimal (Deterministic) Time · PODC 1996

Methods — techniques the papers use, named apart from their topics

randomization · 0.0expected-time analysis · 0.0
YearPublicationVenuePosition
1996 A Randomized Byzantine Agreement Protocol with Constant Expected Time and Guaranteed Termination in Optimal (Deterministic) Time
abstract
This paper presents a randomized Byzantine agreement protocol for t = Q(n) that runs in constant expected number of rounds, and uses polynomial messages.In the worst case
Arkady Zamsky
 PODC1
1995 Optimal Time Byzantine Agreement for t<n/8 With Linear-Messages
Arkady Zamsky, Amos Israeli, Shlomit S. Pinter
 Distributed Comput.1