Piyush Srivastava
Orcid: 0000-0003-0953-2890Affiliations:
- Tata Institute of Fundamental Research, Mumbai, India
According to our database1,
Piyush Srivastava
authored at least 26 papers
between 2012 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on tifr.res.in
-
on orcid.org
-
on dl.acm.org
On csauthors.net:
Bibliography
2024
2023
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023
2022
Almost Optimal Universal Lower Bound for Learning Causal DAGs with Atomic Interventions.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022
2021
Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence, 2021
2020
City-Scale Agent-Based Simulators for the Study of Non-Pharmaceutical Interventions in the Context of the COVID-19 Epidemic.
CoRR, 2020
2019
Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019
2018
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018
2017
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017
2016
Proceedings of the Thirty-Second Conference on Uncertainty in Artificial Intelligence, 2016
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016
2015
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015
2014
2013
Proceedings of the Symposium on Theory of Computing Conference, 2013
Spatial Mixing and Approximation Algorithms for Graphs with Bounded Connective Constant.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013
2012
J. Comput. Biol., 2012
Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012