Dmitry Paramonov

Publication Activity (10 Years)

Years Active: 2019-2024
Publications (10 Years): 23

Top Topics

Backtracking Algorithm

Transportation Problem

Information Dissemination

Top Venues

Electron. Colloquium Comput. Complex.

Publications

Klim Efremenko, Gillat Kol, Dmitry Paramonov, Ran Raz, Raghuvansh R. Saxena
Information Dissemination via Broadcasts in the Presence of Adversarial Noise. CCC (2024)
Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena
The Rate of Interactive Codes is Bounded Away from 1. Electron. Colloquium Comput. Complex. (2024)
Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena
Protecting Single-Hop Radio Networks from Message Drops. Electron. Colloquium Comput. Complex. (2023)
Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena
Protecting Single-Hop Radio Networks from Message Drops. ICALP (2023)
Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena
Noisy Radio Network Lower Bounds via Noiseless Beeping Lower Bounds. ITCS (2023)
Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Huacheng Yu
Characterizing the Multi-Pass Streaming Complexity for Solving Boolean CSPs Exactly. ITCS (2023)
Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, Huacheng Yu
Towards Multi-Pass Streaming Lower Bounds for Optimal Approximation of Max-Cut. SODA (2023)
Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena
The Rate of Interactive Codes Is Bounded Away from 1. STOC (2023)
Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena, Zhao Song, Huacheng Yu
Towards Multi-Pass Streaming Lower Bounds for Optimal Approximation of Max-Cut. Electron. Colloquium Comput. Complex. (2022)
Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena
Noisy Radio Network Lower Bounds Via Noiseless Beeping Lower Bounds. Electron. Colloquium Comput. Complex. (2022)
Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena, Huacheng Yu
Characterizing the Multi-Pass Streaming Complexity for Solving Boolean CSPs Exactly. Electron. Colloquium Comput. Complex. (2022)
Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena
Tight Bounds for General Computation in Noisy Broadcast Networks. FOCS (2022)
Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, Huacheng Yu
Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs. ICALP (2021)
Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena
Tight Bounds for General Computation in Noisy Broadcast Networks. FOCS (2021)
Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena, Zhao Song, Huacheng Yu
Almost Optimal Super-Constant-Pass Streaming Lower Bounds for Reachability. Electron. Colloquium Comput. Complex. 28 (2021)
Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena
Computation over the Noisy Broadcast Channel with Malicious Parties. ITCS (2021)
Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena
Tight Bounds for General Computation in Noisy Broadcast Networks. Electron. Colloquium Comput. Complex. 28 (2021)
Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena, Zhao Song, Huacheng Yu
Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs. CoRR (2021)
Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena
Computation Over the Noisy Broadcast Channel with Malicious Parties. Electron. Colloquium Comput. Complex. 28 (2021)
Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, Huacheng Yu
Almost optimal super-constant-pass streaming lower bounds for reachability. STOC (2021)
Andrey Boris Khesin, Aleksandar Nikolov, Dmitry Paramonov
Preconditioning for the Geometric Transportation Problem. J. Comput. Geom. 11 (2) (2020)
Andrey Boris Khesin, Aleksandar Nikolov, Dmitry Paramonov
Preconditioning for the Geometric Transportation Problem. CoRR (2019)
Andrey Boris Khesin, Aleksandar Nikolov, Dmitry Paramonov
Preconditioning for the Geometric Transportation Problem. SoCG (2019)