Dmitry Paramonov

26 papers A* 8A 4Journal 13
YearRankTypeTitle / Venue / Authors
2025 A* conf
Constant Rate Codes for Adaptive Broadcasts Do Not Exist.
FOCS
Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena
2025 J jnl
Constant Rate Codes for Adaptive Broadcasts Do Not Exist.
Electron. Colloquium Comput. Complex.
Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena
2025 J jnl
Information Dissemination via Broadcasts in the Presence of Adversarial Noise.
Electron. Colloquium Comput. Complex.
Klim Efremenko, Gillat Kol, Dmitry Paramonov, Ran Raz, Raghuvansh Saxena
2024 — —
Handling Data Too Large To Handle: On Multi-pass Streaming and Interactive Coding
Dmitry Paramonov
2024 A conf
Information Dissemination via Broadcasts in the Presence of Adversarial Noise.
CCC
Klim Efremenko, Gillat Kol, Dmitry Paramonov, Ran Raz, Raghuvansh R. Saxena
2024 J jnl
The Rate of Interactive Codes is Bounded Away from 1.
Electron. Colloquium Comput. Complex.
Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena
2023 A conf
Characterizing the Multi-Pass Streaming Complexity for Solving Boolean CSPs Exactly.
ITCS
Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Huacheng Yu
2023 A conf
Noisy Radio Network Lower Bounds via Noiseless Beeping Lower Bounds.
ITCS
Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena
2023 A* conf
Protecting Single-Hop Radio Networks from Message Drops.
ICALP
Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena
2023 J jnl
Protecting Single-Hop Radio Networks from Message Drops.
Electron. Colloquium Comput. Complex.
Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena
2023 A* conf
The Rate of Interactive Codes Is Bounded Away from 1.
STOC
Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena
2023 A* conf
Towards Multi-Pass Streaming Lower Bounds for Optimal Approximation of Max-Cut.
SODA
Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, Huacheng Yu
2022 J jnl
Characterizing the Multi-Pass Streaming Complexity for Solving Boolean CSPs Exactly.
Electron. Colloquium Comput. Complex.
Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena, Huacheng Yu
2022 J jnl
Noisy Radio Network Lower Bounds Via Noiseless Beeping Lower Bounds.
Electron. Colloquium Comput. Complex.
Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena
2022 J jnl
Towards Multi-Pass Streaming Lower Bounds for Optimal Approximation of Max-Cut.
Electron. Colloquium Comput. Complex.
Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena, Zhao Song, Huacheng Yu
2021 J jnl
Almost Optimal Super-Constant-Pass Streaming Lower Bounds for Reachability.
Electron. Colloquium Comput. Complex.
Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena, Zhao Song, Huacheng Yu
2021 A* conf
Almost optimal super-constant-pass streaming lower bounds for reachability.
STOC
Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, Huacheng Yu
2021 J jnl
Computation Over the Noisy Broadcast Channel with Malicious Parties.
Electron. Colloquium Comput. Complex.
Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena
2021 A conf
Computation over the Noisy Broadcast Channel with Malicious Parties.
ITCS
Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena
2021 A* conf
Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs.
ICALP
Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, Huacheng Yu
2021 J jnl
Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs.
CoRR
Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena, Zhao Song, Huacheng Yu
2021 A* conf
Tight Bounds for General Computation in Noisy Broadcast Networks.
FOCS
Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena
2021 J jnl
Tight Bounds for General Computation in Noisy Broadcast Networks.
Electron. Colloquium Comput. Complex.
Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena
2020 J jnl
Preconditioning for the Geometric Transportation Problem.
J. Comput. Geom.
Andrey Boris Khesin, Aleksandar Nikolov, Dmitry Paramonov
2019 A* conf
Preconditioning for the Geometric Transportation Problem.
SoCG
Andrey Boris Khesin, Aleksandar Nikolov, Dmitry Paramonov
2019 J jnl
Preconditioning for the Geometric Transportation Problem.
CoRR
Andrey Boris Khesin, Aleksandar Nikolov, Dmitry Paramonov