E-LIB Suche - Ergebnisse für: Siddharth Bhandari

1

The Relationship between Work-Related Stressors and Constru..:

Bandar Moshabab Alqahtani ; Wael Alruqi ; Siddharth Bhandari..
https://dx.doi.org/10.3390/civileng3040062. , 2022

Link: https://doi.org/10.3390/..

2

The Relationship between Work-Related Stressors and Constru..:

Bandar Moshabab Alqahtani ; Wael Alruqi ; Siddharth Bhandari..
https://www.mdpi.com/2673-4109/3/4/62. , 2022

Link: https://doi.org/10.3390/..

3

Vanishing Spaces of Random Sets and Applications to Reed-Mu..:

Bhandari, Siddharth ; Harsha, Prahladh ; Saptharishi, Ramprasad.
Bhandari , S , Harsha , P , Saptharishi , R & Srinivasan , S 2022 , Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes . in S Lovett (ed.) , 37th Computational Complexity Conference, CCC 2022 . , 31 , Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing , Leibniz International Proceedings in Informatics, LIPIcs , vol. 234 , 37th Computational Complexity Conference, CCC 2022 , Philadelphia , United States , 20/07/2022 . https://doi.org/10.4230/LIPIcs.CCC.2022.31. , 2022

Link: https://pure.au.dk/porta..

4

Vanishing Spaces of Random Sets and Applications to Reed-Mu..:

Bhandari, Siddharth ; Harsha, Prahladh ; Saptharishi, Ramprasad.
http://arxiv.org/abs/2205.10749. , 2022

Link: http://arxiv.org/abs/220..

5

Vanishing Spaces of Random Sets and Applications to Reed-Mu..:

Bhandari, Siddharth ; Harsha, Prahladh ; Saptharishi, Ramprasad.
doi:10.4230/LIPIcs.CCC.2022.31. , 2022

Link: https://doi.org/10.4230/..

6

Ideal-theoretic Explanation of Capacity-achieving Decoding:

Bhandari, Siddharth ; Harsha, Prahladh ; Kumar, Mrinal.
http://arxiv.org/abs/2103.07930. , 2021

Link: http://arxiv.org/abs/210..

7

Ideal-Theoretic Explanation of Capacity-Achieving Decoding:

Bhandari, Siddharth ; Harsha, Prahladh ; Kumar, Mrinal.
doi:10.4230/LIPIcs.APPROX/RANDOM.2021.56. , 2021

Link: https://doi.org/10.4230/..

8

Algorithmizing the Multiplicity Schwartz-Zippel Lemma:

Bhandari, Siddharth ; Harsha, Prahladh ; Kumar, Mrinal.
http://arxiv.org/abs/2111.11072. , 2021

Link: http://arxiv.org/abs/211..

9

A note on the explicit constructions of tree codes over pol..:

Bhandari, Siddharth ; Harsha, Prahladh
http://arxiv.org/abs/2002.08231. , 2020

Link: http://arxiv.org/abs/200..

10

Decoding Multivariate Multiplicity Codes on Product Sets:

Bhandari, Siddharth ; Harsha, Prahladh ; Kumar, Mrinal.
http://arxiv.org/abs/2012.01530. , 2020

Link: http://arxiv.org/abs/201..

11

City-Scale Agent-Based Simulators for the Study of Non-Phar..:

Agrawal, Shubhada ; Bhandari, Siddharth ; Bhattacharjee, Anirban...
http://arxiv.org/abs/2008.04849. , 2020

Link: http://arxiv.org/abs/200..

12

Improved Bounds for Perfect Sampling of $k$-Colorings in Gr..:

Bhandari, Siddharth ; Chakraborty, Sayantan
http://arxiv.org/abs/1909.10323. , 2019

Link: http://arxiv.org/abs/190..

13

On the Probabilistic Degree of OR over the Reals:

Bhandari, Siddharth ; Harsha, Prahladh ; Molli, Tulasimohan.
http://arxiv.org/abs/1812.01982. , 2018

Link: http://arxiv.org/abs/181..

14

On the Probabilistic Degree of OR over the Reals:

Bhandari, Siddharth ; Harsha, Prahladh ; Molli, Tulasimohan.
doi:10.4230/LIPIcs.FSTTCS.2018.5. , 2018

Link: https://doi.org/10.4230/..

15

Bounds on the Zero-Error List-Decoding Capacity of the $q/(..:

Bhandari, Siddharth ; Radhakrishnan, Jaikumar
http://arxiv.org/abs/1802.08396. , 2018

Link: http://arxiv.org/abs/180..