Share:

Nitin Saurabh

ScholarGPS® ID: 49588715187273

Field

Engineering and Computer Science

Discipline

Computer Science

Metrics Summary

Publication Count

11

Predicted Citations

72

Predicted h-index

5

Ranking

Publications and Citation History

Publications based on Top Specialties

Types of Publication

Publications
Books
Patents
NIH/NSF

Add Delete
Improved Bounds on Fourier Entropy and Min-entropy (journal article) Arunachalam, Srinivasan \| Chakraborty, Sourav \| Koucký, Michal \| Saurabh, Nitin \| de Wolf, Ronald ACM Transactions on Computation Theory, volume 13, issue 4, pages 1-40 (2021). 10.1145/3470860 Cited by (2) \| Cite \| Source
On the complexity of detecting hazards (journal article) Komarath, Balagopal \| Saurabh, Nitin Information Processing Letters, volume 162 (2020). 10.1016/j.ipl.2020.105980 Cited by (1) \| Cite \| Source
Some Complete and Intermediate Polynomials in Algebraic Complexity Theory (journal article) Mahajan, Meena \| Saurabh, Nitin Theory of Computing Systems, volume 62, issue 3, pages 622-652 (2018). 10.1007/s00224-016-9740-y Cited by (8) \| Cite \| Source \| Open Access
Fourier Entropy-Influence Conjecture for Random Linear Threshold Functions (book chapter) In LATIN 2018: Theoretical Informatics Chakraborty, Sourav \| Karmalkar, Sushrut \| Kundu, Srijita \| Lokam, Satyanarayana V. \| Saurabh, Nitin Springer International Publishing (2018) 10.1007/978-3-319-77404-6_21 Cited by (2) \| Cite \| Source
Upper bounds on Fourier entropy (journal article) Chakraborty, Sourav \| Kulkarni, Raghav \| Lokam, Satyanarayana V. \| Saurabh, Nitin Theoretical Computer Science, volume 654 (2016). 10.1016/j.tcs.2016.05.006 Cited by (9) \| Cite \| Source
An Improved Deterministic #SAT Algorithm for Small de Morgan Formulas (journal article) Chen, Ruiwen \| Kabanets, Valentine \| Saurabh, Nitin Algorithmica, volume 76, issue 1, pages 68-87 (2016). 10.1007/s00453-015-0020-z Cited by (3) \| Cite \| Source \| Open Access
in the multilinear world (journal article) Mahajan, Meena \| Saurabh, Nitin \| Tavenas, Sébastien Information Processing Letters, volume 116, issue 2, pages 179-182 (2016). 10.1016/j.ipl.2015.08.004 Cite \| Source
Some Complete and Intermediate Polynomials in Algebraic Complexity Theory (book chapter) In Computer Science – Theory and Applications Mahajan, Meena \| Saurabh, Nitin Springer International Publishing (2016) 10.1007/978-3-319-34171-2_18 Cited by (3) \| Cite \| Source \| Open Access
Upper Bounds on Fourier Entropy (book chapter) In Computing and Combinatorics Chakraborty, Sourav \| Kulkarni, Raghav \| Lokam, Satyanarayana V. \| Saurabh, Nitin Springer International Publishing (2015) 10.1007/978-3-319-21398-9_60 Cite \| Source
An Improved Deterministic #SAT Algorithm for Small De Morgan Formulas (book chapter) In Mathematical Foundations of Computer Science 2014 Chen, Ruiwen \| Kabanets, Valentine \| Saurabh, Nitin Springer Berlin Heidelberg (2014) 10.1007/978-3-662-44465-8_15 Cited by (15) \| Cite \| Source \| Open Access
Homomorphism Polynomials Complete for VP (conference) Durand, Arnaud \| Mahajan, Meena \| Malod, Guillaume \| Rugy-Altherre, Nicolas de \| Saurabh, Nitin Foundations of Software Technology and Theoretical Computer Science (2014) New Delhi, India 10.4230/LIPIcs.FSTTCS.2014.493 Cited by (7) \| Cite \| Source