Piyush Srivastava

Orcid: 0000-0003-0953-2890

Affiliations:
  • Tata Institute of Fundamental Research, Mumbai, India


According to our database1, Piyush Srivastava authored at least 26 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A unified law of robustness for Bregman divergence losses.
CoRR, 2024

2023
Sampling from Convex Sets with a Cold Start using Multiscale Decompositions.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

On complex roots of the independence polynomial.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022
On the mixing time of coordinate Hit-and-Run.
Comb. Probab. Comput., 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
Condition number bounds for causal inference.
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

The PSPACE-hardness of understanding neural circuits.
CoRR, 2020

COVID-19 Epidemic Study II: Phased Emergence From the Lockdown in Mumbai.
CoRR, 2020

2019
Online Codes for Analog Signals.
IEEE Trans. Inf. Theory, 2019

A deterministic algorithm for counting colorings with 2Δ colors.
CoRR, 2019

Fisher Zeros and Correlation Decay in the Ising Model.
Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

A Deterministic Algorithm for Counting Colorings with 2-Delta Colors.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018
Computing the Independence Polynomial: from the Tree Threshold down to the Roots.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017
The Ising Partition Function: Zeros and Deterministic Approximation.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016
Computing the independence polynomial in Shearer's region for the LLL.
CoRR, 2016

Exact recovery in the Ising blockmodel.
CoRR, 2016

Stability of Causal Inference.
Proceedings of the Thirty-Second Conference on Uncertainty in Artificial Intelligence, 2016

Evolutionary Dynamics in Finite Populations Mix Rapidly.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015
Spatial mixing and the connective constant: Optimal bounds.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Symbolic Integration and the Complexity of Computing Averages.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014
Counting and Correlation Decay in Spin Systems.
PhD thesis, 2014

2013
Lee-Yang theorems and the complexity of computing averages.
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
A Finite Population Model of Molecular Evolution: Theory and Computation.
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


  Loading...