


default search action
Piyush Srivastava 0001
Person information
- affiliation: Tata Institute of Fundamental Research, Mumbai, India
- unicode name: पीयूष श्रीवास्तव
Other persons with the same name
- Piyush Srivastava 0002 — University of Texas, Dallas, Richardson, USA
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i19]Santanu Das, Jatin Batra, Piyush Srivastava:
A unified law of robustness for Bregman divergence losses. CoRR abs/2405.16639 (2024) - 2023
- [c15]Ferenc Bencs, Péter Csikvári, Piyush Srivastava
, Jan Vondrák:
On complex roots of the independence polynomial. SODA 2023: 675-699 - [c14]Hariharan Narayanan
, Amit Rajaraman
, Piyush Srivastava:
Sampling from Convex Sets with a Cold Start using Multiscale Decompositions. STOC 2023: 117-130 - 2022
- [j3]Hariharan Narayanan
, Piyush Srivastava
:
On the mixing time of coordinate Hit-and-Run. Comb. Probab. Comput. 31(2): 320-332 (2022) - [c13]Vibhor Porwal, Piyush Srivastava
, Gaurav Sinha:
Almost Optimal Universal Lower Bound for Learning Causal DAGs with Atomic Interventions. AISTATS 2022: 5583-5603 - [i18]Ferenc Bencs, Péter Csikvári, Piyush Srivastava, Jan Vondrák:
On complex roots of the independence polynomial. CoRR abs/2204.04868 (2022) - [i17]Hariharan Narayanan
, Amit Rajaraman, Piyush Srivastava:
Sampling from convex sets with a cold start using multiscale decompositions. CoRR abs/2211.04439 (2022) - 2021
- [c12]Spencer L. Gordon, Vinayak M. Kumar
, Leonard J. Schulman
, Piyush Srivastava
:
Condition number bounds for causal inference. UAI 2021: 1948-1957 - [i16]Vibhor Porwal, Piyush Srivastava, Gaurav Sinha:
Almost Optimal Universal Lower Bound for Learning Causal DAGs with Atomic Interventions. CoRR abs/2111.05070 (2021) - 2020
- [i15]Prahladh Harsha, Sandeep Juneja, Preetam Patil, Nihesh Rathod, Ramprasad Saptharishi, A. Y. Sarath, Sharad Shriram
, Piyush Srivastava, Rajesh Sundaresan, Nidhin Koshy Vaidhiyan:
COVID-19 Epidemic Study II: Phased Emergence From the Lockdown in Mumbai. CoRR abs/2006.03375 (2020) - [i14]Vidya Sagar Sharma, Piyush Srivastava:
The PSPACE-hardness of understanding neural circuits. CoRR abs/2006.08266 (2020) - [i13]Shubhada Agrawal, Siddharth Bhandari, Anirban Bhattacharjee, Anand Deo, Narendra M. Dixit, Prahladh Harsha, Sandeep Juneja, Poonam Kesarwani, Aditya Krishna Swamy, Preetam Patil, Nihesh Rathod, Ramprasad Saptharishi, Sharad Shriram
, Piyush Srivastava, Rajesh Sundaresan, Nidhin Koshy Vaidhiyan, Sarath Yasodharan:
City-Scale Agent-Based Simulators for the Study of Non-Pharmaceutical Interventions in the Context of the COVID-19 Epidemic. CoRR abs/2008.04849 (2020) - [i12]Hariharan Narayanan, Piyush Srivastava:
On the mixing time of coordinate Hit-and-Run. CoRR abs/2009.14004 (2020)
2010 – 2019
- 2019
- [j2]Leonard J. Schulman
, Piyush Srivastava
:
Online Codes for Analog Signals. IEEE Trans. Inf. Theory 65(10): 6633-6649 (2019) - [c11]Jingcheng Liu, Alistair Sinclair, Piyush Srivastava:
A Deterministic Algorithm for Counting Colorings with 2-Delta Colors. FOCS 2019: 1380-1404 - [c10]Jingcheng Liu, Alistair Sinclair, Piyush Srivastava:
Fisher Zeros and Correlation Decay in the Ising Model. ITCS 2019: 55:1-55:8 - [i11]Jingcheng Liu, Alistair Sinclair, Piyush Srivastava:
A deterministic algorithm for counting colorings with 2Δ colors. CoRR abs/1906.01228 (2019) - 2018
- [c9]Nicholas J. A. Harvey, Piyush Srivastava, Jan Vondrák:
Computing the Independence Polynomial: from the Tree Threshold down to the Roots. SODA 2018: 1557-1576 - [i10]Jingcheng Liu, Alistair Sinclair, Piyush Srivastava:
Fisher zeros and correlation decay in the Ising model. CoRR abs/1807.06577 (2018) - 2017
- [c8]Jingcheng Liu, Alistair Sinclair, Piyush Srivastava:
The Ising Partition Function: Zeros and Deterministic Approximation. FOCS 2017: 986-997 - [i9]Jingcheng Liu, Alistair Sinclair, Piyush Srivastava:
The Ising Partition Function: Zeros and Deterministic Approximation. CoRR abs/1704.06493 (2017) - [i8]Leonard J. Schulman, Piyush Srivastava:
Online codes for analog signals. CoRR abs/1707.05199 (2017) - 2016
- [c7]Ioannis Panageas, Piyush Srivastava, Nisheeth K. Vishnoi:
Evolutionary Dynamics in Finite Populations Mix Rapidly. SODA 2016: 480-497 - [c6]Leonard J. Schulman, Piyush Srivastava:
Stability of Causal Inference. UAI 2016 - [i7]Nicholas J. A. Harvey, Piyush Srivastava, Jan Vondrák:
Computing the independence polynomial in Shearer's region for the LLL. CoRR abs/1608.02282 (2016) - [i6]Quentin Berthet, Philippe Rigollet, Piyush Srivastava:
Exact recovery in the Ising blockmodel. CoRR abs/1612.03880 (2016) - 2015
- [c5]Leonard J. Schulman
, Alistair Sinclair, Piyush Srivastava:
Symbolic Integration and the Complexity of Computing Averages. FOCS 2015: 1231-1245 - [c4]Alistair Sinclair, Piyush Srivastava, Daniel Stefankovic, Yitong Yin:
Spatial mixing and the connective constant: Optimal bounds. SODA 2015: 1549-1563 - 2014
- [b1]Piyush Srivastava:
Counting and Correlation Decay in Spin Systems. University of California, Berkeley, USA, 2014 - [i5]Alistair Sinclair, Piyush Srivastava, Daniel Stefankovic, Yitong Yin:
Spatial mixing and the connective constant: Optimal bounds. CoRR abs/1410.2595 (2014) - 2013
- [c3]Alistair Sinclair, Piyush Srivastava, Yitong Yin:
Spatial Mixing and Approximation Algorithms for Graphs with Bounded Connective Constant. FOCS 2013: 300-309 - [c2]Alistair Sinclair, Piyush Srivastava:
Lee-Yang theorems and the complexity of computing averages. STOC 2013: 625-634 - [i4]Alistair Sinclair, Piyush Srivastava, Yitong Yin:
Spatial mixing and approximation algorithms for graphs with bounded connective constant. CoRR abs/1308.1762 (2013) - 2012
- [j1]Narendra M. Dixit, Piyush Srivastava, Nisheeth K. Vishnoi:
A Finite Population Model of Molecular Evolution: Theory and Computation. J. Comput. Biol. 19(10): 1176-1202 (2012) - [c1]Alistair Sinclair, Piyush Srivastava, Marc Thurley:
Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs. SODA 2012: 941-953 - [i3]Narendra M. Dixit, Piyush Srivastava, Nisheeth K. Vishnoi:
A Finite Population Model of Molecular Evolution: Theory and Computation. CoRR abs/1203.1287 (2012) - [i2]Alistair Sinclair, Piyush Srivastava:
Lee-Yang theorems and the complexity of computing averages. CoRR abs/1211.2376 (2012) - 2011
- [i1]Alistair Sinclair, Piyush Srivastava, Marc Thurley:
Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs. CoRR abs/1107.2368 (2011)
Coauthor Index

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:59 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint