|
 | Up a level |
Batu, Tugkan 
ORCID: 0000-0003-3914-4645, Trehan, Amitabh and Trehan, Chhaya ORCID: 0000-0002-3249-3212
(2024)
All you need are random walks: fast and simple distributed conductance testing.
In: Emek, Yuval, (ed.)
Structural Information and Communication Complexity: 31st International Colloquium, SIROCCO 2024, Vietri sul Mare, Italy, May 27–29, 2024, Proceedings.
Lecture Notes in Computer Science.
Springer, Cham, CH, 64 - 82.
ISBN 9783031606021
Lachish, Oded, Reidl, Felix and Trehan, Chhaya ORCID: 0000-0002-3249-3212
(2022)
When you come at the king you best not miss.
In: Dawar, Anuj and Guruswami, Venkatesan, (eds.)
42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022.
Leibniz International Proceedings in Informatics, LIPIcs.
UNSPECIFIED, 1 - 12.
ISBN 9783959772617
Elkin, Michael and Trehan, Chhaya ORCID: 0000-0002-3249-3212
(2022)
(1 + ϵ)-Approximate shortest paths in dynamic streams.
In: Chakrabarti, Amit and Swamy, Chaitanya, (eds.)
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022).
Leibniz International Proceedings in Informatics, LIPIcs,51.
Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Germany, 51:1 – 51:23.
ISBN 9783959772495
Elkin, Michael and Trehan, Chhaya ORCID: 0000-0002-3249-3212
(2022)
Brief announcement: (1+)-approximate shortest paths in dynamic streams.
In:
PODC 2022 - Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing.
Proceedings of the Annual ACM Symposium on Principles of Distributed Computing.
Association for Computing Machinery, pp. 57-59.
ISBN 9781450392624
