Calculated based on number of publications stored in Pure and citations from Scopus
20082022

Research activity per year

If you made any changes in Pure these will be visible here soon.

Fingerprint

Dive into the research topics where Gillat Kol is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
  • 1 Similar Profiles

Network

Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
  • Circuits resilient to short-circuit errors

    Efremenko, K., Haeupler, B., Kalai, Y. T., Kamath, P., Kol, G., Resch, N. & Saxena, R. R., Sep 6 2022, STOC 2022 - Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. Leonardi, S. & Gupta, A. (eds.). Association for Computing Machinery, p. 582-594 13 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Distributed Zero-Knowledge Proofs Over Networks

    Bick, A., Kol, G. & Oshman, R., 2022, ACM-SIAM Symposium on Discrete Algorithms, SODA 2022. Association for Computing Machinery, p. 2426-2458 33 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2022-January).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    2 Scopus citations
  • Statistically Near-Optimal Hypothesis Selection

    Bousquet, O., Braverman, M., Kol, G., Efremenko, K. & Moran, S., 2022, Proceedings - 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science, FOCS 2021. IEEE Computer Society, p. 909-919 11 p. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2022-February).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Tight Bounds for General Computation in Noisy Broadcast Networks

    Efremenko, K., Kol, G., Paramonov, D. & Saxena, R. R., 2022, Proceedings - 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science, FOCS 2021. IEEE Computer Society, p. 634-645 12 p. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2022-February).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Almost optimal super-constant-pass streaming lower bounds for reachability

    Chen, L., Kol, G., Paramonov, D., Saxena, R. R., Song, Z. & Yu, H., Jun 15 2021, STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. Khuller, S. & Williams, V. V. (eds.). Association for Computing Machinery, p. 570-583 14 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    2 Scopus citations