Dmitry Paramonov

According to our database, Dmitry Paramonov authored at least 12 papers between 2020 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Handling Data Too Large To Handle: On Multi-pass Streaming and Interactive Coding

Dmitry Paramonov

PhD thesis, 2024

The Rate of Interactive Codes is Bounded Away from 1.

Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena

Electron. Colloquium Comput. Complex., 2024

Information Dissemination via Broadcasts in the Presence of Adversarial Noise.

Klim Efremenko, Gillat Kol, Dmitry Paramonov, Ran Raz, Raghuvansh R. Saxena

Proceedings of the 39th Computational Complexity Conference, 2024

2023

Protecting Single-Hop Radio Networks from Message Drops.

Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena

Electron. Colloquium Comput. Complex., 2023

2022

Characterizing the Multi-Pass Streaming Complexity for Solving Boolean CSPs Exactly.

Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena, Huacheng Yu

Electron. Colloquium Comput. Complex., 2022

Noisy Radio Network Lower Bounds Via Noiseless Beeping Lower Bounds.

Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena

Electron. Colloquium Comput. Complex., 2022

Towards Multi-Pass Streaming Lower Bounds for Optimal Approximation of Max-Cut.

Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena, Zhao Song, Huacheng Yu

Electron. Colloquium Comput. Complex., 2022

2021

Tight Bounds for General Computation in Noisy Broadcast Networks.

Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena

Electron. Colloquium Comput. Complex., 2021

Computation Over the Noisy Broadcast Channel with Malicious Parties.

Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena

Electron. Colloquium Comput. Complex., 2021

Almost Optimal Super-Constant-Pass Streaming Lower Bounds for Reachability.

Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena, Zhao Song, Huacheng Yu

Electron. Colloquium Comput. Complex., 2021

Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs.

Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, Huacheng Yu

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Preconditioning for the Geometric Transportation Problem.

Andrey Boris Khesin, Aleksandar Nikolov, Dmitry Paramonov

J. Comput. Geom., 2020