Profiles
Research Units
Publications
Sign Up
Faculty Login
X
19 Publications
8 Journals
Nitin Saurabh
Assistant Professor Grade 1
Department of Computer Science and Engineering
nitin@cse.iith.ac.in (Work)
Follow
Publications - 19
Overview
Publications (19)
Network (1)
Publications (19)
Sort by Year (most recent)
Sort by Year (most recent)
Sort by Year (oldest first)
Sort by Most Cited
Sort by Recently Added
Sort (A-Z)
Sort (Z-A)
Conferences
Karchmer-Wigderson Games for Hazard-Free Computation
C. Ikenmeyer
,
B. Komarath
and
Nitin Saurabh
2023 | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Conferences
Tight Lower Bounds for Approximate & Exact k-Center in Rd
R. Chitnis
and
Nitin Saurabh
2022 | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Conferences
Approximate polymorphisms
G. Chase
,
Y. Filmus
,
...
,
Nitin Saurabh
(5 authors)
2022 | Association for Computing Machinery
Conferences
Rabbits Approximate, Cows Compute Exactly!
B. Komarath
,
A. Pandey
and
Nitin Saurabh
2022 | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Articles
Improved Bounds on Fourier Entropy and Min-entropy
S. Arunachalam
,
S. Chakraborty
,
...
,
Nitin Saurabh
and
R. De Wolf
(5 authors)
2021 | Association for Computing Machinery
Download
PDF
Publisher Copy
Articles
On the complexity of detecting hazards
B. Komarath
and
Nitin Saurabh
2020 | Elsevier B.V.
Download
PDF
Postprint
Conferences
Algebraic branching programs, border complexity, and tangent spaces
M. Bläser
,
C. Ikenmeyer
,
...
,
Nitin Saurabh
(5 authors)
2020 | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Conferences
Improved bounds on Fourier entropy and min-entropy
S. Arunachalam
,
S. Chakraborty
,
...
,
Nitin Saurabh
and
R. de Wolf
(5 authors)
2020 | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Articles
Some Complete and Intermediate Polynomials in Algebraic Complexity Theory
M. Mahajan
and
Nitin Saurabh
2018 | Springer New York LLC
Download
PDF
Postprint
Conferences
Space-optimal quasi-Gray codes with logarithmic read complexity
D. Chakraborty
,
D. Das
,
...
,
Nitin Saurabh
(4 authors)
2018 | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Conferences
Fourier entropy-influence conjecture for random linear threshold functions
S. Chakraborty
,
S. Karmalkar
,
...
,
Nitin Saurabh
(5 authors)
2018 | Springer Verlag
Articles
An Improved Deterministic #SAT Algorithm for Small de Morgan Formulas
R. Chen
,
V. Kabanets
and
Nitin Saurabh
2016 | Springer New York LLC
Download
PDF
Postprint
Articles
VNP=VP in the multilinear world
M. Mahajan
,
Nitin Saurabh
and
S. Tavenas
2016 | Elsevier
Articles
Upper bounds on Fourier entropy
S. Chakraborty
,
R. Kulkarni
,
...
,
Nitin Saurabh
(4 authors)
2016 | Elsevier B.V.
Conferences
Some complete and intermediate polynomials in algebraic complexity theory
M. Mahajan
and
Nitin Saurabh
2016 | Springer Verlag
Conferences
Upper bounds on fourier entropy
S. Chakraborty
,
R. Kulkarni
,
...
,
Nitin Saurabh
(4 authors)
2015 | Springer Verlag
Conferences
Homomorphism polynomials complete for VP
A. Durand
,
M. Mahajan
,
...
,
Nitin Saurabh
(5 authors)
2014 | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Conferences
An improved deterministic #SAT algorithm for small de Morgan formulas
R. Chen
,
V. Kabanets
and
Nitin Saurabh
2014 | Springer Verlag
Conferences
Counting paths in planar width 2 branching programs
M. Mahajan
,
Nitin Saurabh
and
Karteek Sreenivasaiah
2012
Get all the updates from Nitin Saurabh
Follow