From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

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

L. Chen, G. Kol, D. Paramonov, R. Saxena, Z. Song, и H. Yu. ICALP, том 198 из LIPIcs, стр. 52:1-52:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Dmitry Sveshnikov

Dmitry Chigrin

Dmitry Suslov

Dmitry Lobaskin

Dmitry Ivanov

Другие публикации лиц с тем же именем

Characterizing the Multi-Pass Streaming Complexity for Solving Boolean CSPs Exactly.G. Kol, D. Paramonov, R. Saxena, и H. Yu. Electron. Colloquium Comput. Complex., (2022)Handling Data Too Large To Handle: On Multi-pass Streaming and Interactive CodingD. Paramonov. Princeton University, USA, (2024)Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs.L. Chen, G. Kol, D. Paramonov, R. Saxena, Z. Song, и H. Yu. ICALP, том 198 из LIPIcs, стр. 52:1-52:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Preconditioning for the Geometric Transportation Problem.A. Khesin, A. Nikolov, и D. Paramonov. SoCG, том 129 из LIPIcs, стр. 15:1-15:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Computation over the Noisy Broadcast Channel with Malicious Parties.K. Efremenko, G. Kol, D. Paramonov, и R. Saxena. ITCS, том 185 из LIPIcs, стр. 82:1-82:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Tight Bounds for General Computation in Noisy Broadcast Networks.K. Efremenko, G. Kol, D. Paramonov, и R. Saxena. FOCS, стр. 634-645. IEEE, (2021)Protecting Single-Hop Radio Networks from Message Drops.K. Efremenko, G. Kol, D. Paramonov, и R. Saxena. ICALP, том 261 из LIPIcs, стр. 53:1-53:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Characterizing the Multi-Pass Streaming Complexity for Solving Boolean CSPs Exactly.G. Kol, D. Paramonov, R. Saxena, и H. Yu. ITCS, том 251 из LIPIcs, стр. 80:1-80:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)The Rate of Interactive Codes Is Bounded Away from 1.K. Efremenko, G. Kol, D. Paramonov, и R. Saxena. STOC, стр. 1424-1437. ACM, (2023)Almost optimal super-constant-pass streaming lower bounds for reachability.L. Chen, G. Kol, D. Paramonov, R. Saxena, Z. Song, и H. Yu. STOC, стр. 570-583. ACM, (2021)

BibSonomy

Disambiguation