Trehan, Chhaya

Number of items: 5.
Public
  • Batu, Tugkan, Trehan, Amitabh, Trehan, Chhaya (2024). All you need are random walks: fast and simple distributed conductance testing. In Emek, Y. (Ed.), Structural Information and Communication Complexity: 31st International Colloquium, SIROCCO 2024, Vietri sul Mare, Italy, May 27–29, 2024, Proceedings (pp. 64 - 82). Springer. https://doi.org/10.1007/978-3-031-60603-8_4 picture_as_pdf
  • Trehan, Chhaya (2023). Processing massive graphs under limited visibility [Doctoral thesis]. London School of Economics and Political Science. https://doi.org/10.21953/lse.00004519
  • Lachish, Oded, Reidl, Felix, Trehan, Chhaya (2022). When you come at the king you best not miss. In Dawar, A. & Guruswami, V. (Eds.), 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022 (pp. 1 - 12). https://doi.org/10.4230/LIPIcs.FSTTCS.2022.25 picture_as_pdf
  • Elkin, Michael, Trehan, Chhaya (2022). (1 + ϵ)-Approximate shortest paths in dynamic streams. In Chakrabarti, A. & Swamy, C. (Eds.), Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022) (pp. 51:1 – 51:23). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.51 picture_as_pdf
  • Elkin, Michael, Trehan, Chhaya (2022). Brief announcement: (1+)-approximate shortest paths in dynamic streams. In PODC 2022 - Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing (pp. 57-59). Association for Computing Machinery. https://doi.org/10.1145/3519270.3538469 picture_as_pdf