default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSiddharth Bhandari
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j7]Siddharth Bhandari, Abhishek Khetan:
Improved Upper Bound for the Size of a Trifferent Code. Comb. 45(1): 2 (2025)- 2024
- [j6]Siddharth Bhandari
, Prahladh Harsha, Mrinal Kumar, Madhu Sudan:
Decoding Multivariate Multiplicity Codes on Product Sets. IEEE Trans. Inf. Theory 70(1): 154-169 (2024) - [j5]Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan:
Ideal-Theoretic Explanation of Capacity-Achieving Decoding. IEEE Trans. Inf. Theory 70(2): 1107-1123 (2024) - [c10]Raghavendra Addanki, Siddharth Bhandari:
Limits of Approximating the Median Treatment Effect. COLT 2024: 1-21 - [c9]Siddharth Bhandari, Abhishek Khetan:
Improved Upper Bound for the Size of a Trifferent Code. ISIT 2024: 1758-1763 - [i20]Siddharth Bhandari, Abhishek Khetan:
Improved Upper Bound for the Size of a Trifferent Code. CoRR abs/2402.02390 (2024) - [i19]Raghavendra Addanki, Siddharth Bhandari:
Limits of Approximating the Median Treatment Effect. CoRR abs/2403.10618 (2024) - [i18]Saba Ahmadi, Siddharth Bhandari, Avrim Blum, Chen Dan, Prabhav Jain:
Distributional Adversarial Loss. CoRR abs/2406.03458 (2024) - [i17]Saba Ahmadi, Siddharth Bhandari, Avrim Blum:
Replicable Online Learning. CoRR abs/2411.13730 (2024) - 2023
- [c8]Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar:
Algorithmizing the Multiplicity Schwartz-Zippel Lemma. SODA 2023: 2816-2835 - 2022
- [j4]Siddharth Bhandari, Sayantan Chakraborty:
Improved Bounds for Perfect Sampling of $k$-Colorings in Graphs. SIAM J. Comput. 51(3): 20-54 (2022) - [j3]Siddharth Bhandari, Jaikumar Radhakrishnan:
Bounds on the Zero-Error List-Decoding Capacity of the q/(q - 1) Channel. IEEE Trans. Inf. Theory 68(1): 238-247 (2022) - [c7]Naman Srivastava, Omkar Gowda, Shreyas Bulbule, Siddharth Bhandari, Animesh Chaturvedi:
Bitcoin Evolution Analytics: Twitter Sentiments to Predict Price Change as Bearish or Bullish. IEEE Big Data 2022: 3547-3556 - [c6]Siddharth Bhandari, Prahladh Harsha, Ramprasad Saptharishi, Srikanth Srinivasan:
Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes. CCC 2022: 31:1-31:14 - [i16]Siddharth Bhandari, Prahladh Harsha, Ramprasad Saptharishi, Srikanth Srinivasan:
Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes. CoRR abs/2205.10749 (2022) - [i15]Siddharth Bhandari, Prahladh Harsha, Ramprasad Saptharishi, Srikanth Srinivasan:
Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j2]Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli, Srikanth Srinivasan:
On the probabilistic degree of OR over the reals. Random Struct. Algorithms 59(1): 53-67 (2021) - [c5]Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan:
Ideal-Theoretic Explanation of Capacity-Achieving Decoding. APPROX-RANDOM 2021: 56:1-56:21 - [c4]Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan:
Decoding multivariate multiplicity codes on product sets. STOC 2021: 1489-1501 - [i14]Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan:
Ideal-theoretic Explanation of Capacity-achieving Decoding. CoRR abs/2103.07930 (2021) - [i13]Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar:
Algorithmizing the Multiplicity Schwartz-Zippel Lemma. CoRR abs/2111.11072 (2021) - [i12]Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan:
Ideal-theoretic Explanation of Capacity-achieving Decoding. Electron. Colloquium Comput. Complex. TR21 (2021) - [i11]Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar:
Algorithmizing the Multiplicity Schwartz-Zippel Lemma. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [c3]Siddharth Bhandari, Sayantan Chakraborty:
Improved bounds for perfect sampling of k-colorings in graphs. STOC 2020: 631-642 - [i10]Siddharth Bhandari, Prahladh Harsha:
A note on the explicit constructions of tree codes over polylogarithmic-sized alphabet. CoRR abs/2002.08231 (2020) - [i9]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) - [i8]Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan:
Decoding Multivariate Multiplicity Codes on Product Sets. CoRR abs/2012.01530 (2020) - [i7]Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan:
Decoding Multivariate Multiplicity Codes on Product Sets. Electron. Colloquium Comput. Complex. TR20 (2020) - [i6]Siddharth Bhandari, Prahladh Harsha:
A note on the explicit constructions of tree codes over polylogarithmic-sized alphabet. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [i5]Siddharth Bhandari, Sayantan Chakraborty:
Perfect Sampling of graph k-colorings for k>3Δ. CoRR abs/1909.10323 (2019) - [i4]Siddharth Bhandari, Sayantan Chakraborty:
Improved bounds for perfect sampling of $k$-colorings in graphs. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c2]Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli, Srikanth Srinivasan:
On the Probabilistic Degree of OR over the Reals. FSTTCS 2018: 5:1-5:12 - [c1]Siddharth Bhandari, Jaikumar Radhakrishnan:
Bounds on the Zero-Error List-Decoding Capacity of the q/(q-1) Channel. ISIT 2018: 906-910 - [i3]Siddharth Bhandari, Jaikumar Radhakrishnan:
Bounds on the Zero-Error List-Decoding Capacity of the q/(q-1) Channel. CoRR abs/1802.08396 (2018) - [i2]Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli, Srikanth Srinivasan:
On the Probabilistic Degree of OR over the Reals. CoRR abs/1812.01982 (2018) - [i1]Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli, Srikanth Srinivasan:
On the Probabilistic Degree of OR over the Reals. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j1]Shumiao Wang, Siddharth Bhandari, Siva Chaitanya Chaduvula, Mikhail J. Atallah, Jitesh H. Panchal, Karthik Ramani:
Secure Collaboration in Engineering Systems Design. J. Comput. Inf. Sci. Eng. 17(4) (2017)
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-08 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
