Dmitry Paramonov (dparamon)

Dmitry Paramonov

Teaching Assistant Professor

Charles V. Schaefer, Jr. School of Engineering and Science

Department of Computer Science

Gateway Center S241

Education

  • PhD (2024) Princeton University (Computer Science)

Selected Publications

Conference Proceeding

  1. Efremenko, K.; Kol, G.; Paramonov, D.; Saxena, R. R. (2023). The Rate of Interactive Codes Is Bounded Away from 1. Proceedings of the 55th Annual ACM Symposium on Theory of Computing (pp. 1424-1437). ACM.
    https://doi.org/10.1145/3564246.3585249.
  2. Efremenko, K.; Kol, G.; Paramonov, D.; Saxena, R. R. (2022). Tight Bounds for General Computation in Noisy Broadcast Networks. 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) (pp. 634-645). IEEE.
    https://doi.org/10.1109/focs52979.2021.00068.
  3. Chen, L.; Kol, G.; Paramonov, D.; Saxena, R. R.; Song, Z.; Yu, H. (2021). Almost optimal super-constant-pass streaming lower bounds for reachability. Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (pp. 570-583). ACM.
    https://doi.org/10.1145/3406325.3451038.

Courses

CS 115, CS 135, CS 284, CS 601