1 citations · 1 across the 7 of their papers we have counts for
10 papers
Optimal Adaptive Multi-Valued Byzantine Agreement
Marc Dufay, Anton Paramonov, Roger Wattenhofer
In Byzantine Agreement (BA), parties, out of which can be Byzantine, run a distributed protocol to agree on a common valid input. Traditionally, these protocols have a line…
Maintaining Random Assignments under Adversarial Dynamics
Bernhard Haeupler, Anton Paramonov
We study and further develop powerful general-purpose schemes to maintain random assignments under adversarial dynamic changes. The goal is to maintain assignments that are (approx…
General Convex Agreement with Near-Optimal Communication
Marc Dufay, Diana Ghinea, Anton Paramonov
Byzantine Agreement (BA) considers a setting of parties out of which up to can be byzantine (malicious), and requires the honest parties to agree on an input subject to a c…
Mangrove: Fast and Parallelizable State Replication for Blockchains
Anton Paramonov, Yann Vonlanthen, Quentin Kniep +2
Mangrove is a novel scaling approach to building blockchains with parallel smart contract support. Unlike in monolithic blockchains, where a single consensus mechanism determines a…
From Few to Many Faults: Optimal Adaptive Byzantine Agreement
Andrei Constantinescu, Marc Dufay, Anton Paramonov +1
Achieving agreement among distributed parties is a fundamental task in modern systems, underpinning applications such as consensus in blockchains, coordination in cloud infrastruct…
Broadcast in Almost Mixing Time
Anton Paramonov, Roger Wattenhofer
We study the problem of broadcasting multiple messages in the CONGEST model. In this problem, a dedicated source node possesses a set of messages with every message of size…
All Byzantine Agreement Problems are Expensive
Pierre Civit, Seth Gilbert, Rachid Guerraoui +3
Byzantine agreement, arguably the most fundamental problem in distributed computing, operates among n processes, out of which t < n can exhibit arbitrary failures. The problem stat…
Toward Self-Adjusting k-ary Search Tree Networks
Evgenii Feder, Anton Paramonov, Pavel Mavrin +3
Datacenter networks are becoming increasingly flexible with the incorporation of new networking technologies, such as optical circuit switches. These technologies allow for program…
Self-Adjusting Linear Networks with Ladder Demand Graph
Anton Paramonov, Iosif Salem, Stefan Schmid +1
Self-adjusting networks (SANs) have the ability to adapt to communication demand by dynamically adjusting the workload (or demand) embedding, i.e., the mapping of communication req…
Memory Bounds for Concurrent Bounded Queues
Vitaly Aksenov, Nikita Koval, Petr Kuznetsov +1
Concurrent data structures often require additional memory for handling synchronization issues in addition to memory for storing elements. Depending on the amount of this additiona…