AP
Anton Paramonov
cs.DCcs.DScs.NI
On Valency
published · living versionsW_3hy3wurc·v1 · currentpublished
Expander Routing under Adversarial Deletions via Temporal Aggregation
with Bernhard Haeupler
1 version
W_cgjs588z·v1published
Preprints & journals
9 papers in the corpus · 2021–2026Maintaining Random Assignments under Adversarial Dynamics2604.05606v1 · Bernhard Haeupler, Anton Paramonov2026 · 0 citationsarXiv
General Convex Agreement with Near-Optimal Communication2602.21411v2 · Marc Dufay, Diana Ghinea, Anton Paramonov2026 · 0 citationsarXiv
Mangrove: Fast and Parallelizable State Replication for Blockchains2509.06616v1 · Anton Paramonov, Yann Vonlanthen, Quentin Kniep et al.2025 · 0 citationsarXiv
From Few to Many Faults: Optimal Adaptive Byzantine Agreement2505.19989v3 · Andrei Constantinescu, Marc Dufay, Anton Paramonov et al.2025 · 0 citationsarXiv
Broadcast in Almost Mixing Time2502.02165v3 · Anton Paramonov, Roger Wattenhofer2025 · 0 citationsarXiv
All Byzantine Agreement Problems are Expensive2311.08060v2 · Pierre Civit, Seth Gilbert, Rachid Guerraoui et al.2023 · 4 citationsarXiv
Toward Self-Adjusting k-ary Search Tree Networks2302.13113v3 · Evgenii Feder, Anton Paramonov, Pavel Mavrin et al.2023 · 2 citationsarXiv
Self-Adjusting Linear Networks with Ladder Demand Graph2207.03948v2 · Anton Paramonov, Iosif Salem, Stefan Schmid et al.2022 · 1 citationarXiv
Memory Bounds for Concurrent Bounded Queues2104.15003v5 · Vitaly Aksenov, Nikita Koval, Petr Kuznetsov et al.2021 · 2 citationsarXiv
Career total: 19 works. 9 are in this corpus.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.