Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Tidjani Négadi
Luke Schaeffer
Daniel P. Kennedy
Barbara Aquilani
Sergi Risueno
Maximilian Dürr
Jhonathan Pinzon
Liangliang Shang
Manuel Murbach
Chen Ma
Home
/
Author
/
NITIN SAURABH
Author Info
Open Visualization
Name
Affiliation
Papers
NITIN SAURABH
Inst Math Sci, Madras, Tamil Nadu, India
11
Collaborators
Citations
PageRank
20
5
3.81
Referers
Referees
References
13
201
118
Search Limit
100
201
Publications (11 rows)
Collaborators (20 rows)
Referers (13 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
Algebraic Branching Programs, Border Complexity, and Tangent Spaces
0
0.34
2020
Lower Bounds for Linear Decision Lists.
0
0.34
2019
Improved Bounds on Fourier Entropy and Min-entropy
0
0.34
2018
Fourier Entropy-Influence Conjecture for Random Linear Threshold Functions.
0
0.34
2018
Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity.
0
0.34
2018
Optimal Quasi-Gray Codes: Does the Alphabet Matter?
0
0.34
2017
VNP=VP in the multilinear world
0
0.34
2016
Some Complete and Intermediate Polynomials in Algebraic Complexity Theory.
1
0.37
2016
Upper Bounds on Fourier Entropy.
0
0.34
2015
An Improved Deterministic #SAT Algorithm for Small De Morgan Formulas.
2
0.36
2013
Counting paths in planar width 2 branching programs
2
0.37
2012
1