Research Interests :
Algorithms, especially Sublinear Algorithms and Computational Complexity TheoryPublications : (Last Five, while at IITM)DBLP | View All
- Byzantine Connectivity Testing in the Congested Clique.
Authors :
John Augustine,
Anisur Rahaman Molla,
Gopal Pandurangan,
Yadu VasudevAppeared in
36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA. (DISC 2022) ,LIPIcs, Vol 246, pp.7:1-7:21, Oct 2022
- Dynamic Complexity of Expansion.
Authors :
Samir Datta,
Anuj Tawari,
Yadu VasudevAppeared in
Computer Science - Theory and Applications - 16th International Computer Science Symposium in Russia, CSR 2021, Sochi, Russia, June 28 - July 2, 2021, Proceedings (CSR 2021) ,Lecture Notes in Computer Science, Vol 12730, pp.56-77, Jul 2021
- Fast distributed algorithms for testing graph properties.
Authors :
Keren Censor-Hillel,
Eldar Fischer,
Gregory Schwartzman,
Yadu VasudevAppeared in
Distributed Computing, Vol 32, pp.41-57, Jan 2019
- Improving and Extending the Testing of Distributions for Shape-Restricted Properties.
Authors :
Eldar Fischer,
Oded Lachish,
Yadu VasudevAppeared in
Algorithmica, Vol 81, pp.3765-3802, Jan 2019
- A Two-Sided Error Distributed Property Tester For Conductance.
Authors :
Hendrik Fichtenberger,
Yadu VasudevAppeared in
43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK (MFCS 2018) ,LIPIcs, Vol 117, pp.19:1-19:15, Aug 2018
| Jan 2023 - May 2023 | : | - Design and Analysis of Algorithms (CS2800) |
| Apr 2022 - May 2022 | : | - Introduction to Programming (CS1100) |
| Jan 2022 - Apr 2022 | : | - Sublinear Algorithms (CS6025) |
| Aug 2021 - Dec 2021 | : | - Randomized Algorithms (CS6170) |
| Aug 2021 - Dec 2021 | : | - Introduction to Programming (CS1100) |
