The group is actively involved in research on various aspects of algorithm design and complexity theory including algorithmic computational social choice, graph theory, computational geometry, randomized algorithms, approximation algorithms, complexity theory, and online algorithms.
Publications
Quantum Polynomial Hierarchies: Karp-Lipton, Error Reduction, and Lower Bounds Proceedings Article
In: Rastislav Královic, Anton'ın Kucera (Ed.): 49th International Symposium on Mathematical Foundations of Computer Science, MFCS 2024, August 26-30, 2024, Bratislava, Slovakia, pp. 7:1–7:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
Reactive Dataflow for Inflight Error Handling in ML Workflows Proceedings Article
In: Proceedings of the Eighth Workshop on Data Management for End-to-End Machine Learning, DEEM 2024, Santiago, AA, Chile, 9 June 2024, pp. 51–61, ACM, 2024.
Fault-Tolerant Bounded Flow Preservers Proceedings Article
In: Julián Mestre, Anthony Wirth (Ed.): 35th International Symposium on Algorithms and Computation, ISAAC 2024, December 8-11, 2024, Sydney, Australia, pp. 9:1–9:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, vol. 317, 2024, ISBN: 978-3-95977-348-5.
Reactive Dataflow for Inflight Error Handling in ML Workflows Proceedings Article
In: Proceedings of the Eighth Workshop on Data Management for End-to-End Machine Learning, DEEM 2024, Santiago, AA, Chile, 9 June 2024, pp. 51–61, ACM, 2024.
Members
Projects
- Towards Securing Network Infrastructure with Post-Quantum CryptographyRajendra Kumar (PI), Vireshwar Kumar (co-PI) Sponsored by: Centre for Railway Information Systems (CRIS) India.