14 citations · 17 across the 8 of their papers we have counts for
10 papers
Partial Derandomization for Leakage-Resilient Shamir's Secret Sharing over Composite Order Fields
S. Venkitesh
We make progress on the question of constructing explicit evaluation places for leakage-resilient Shamir's secret sharing, over composite order fields. Previously, Maji et al. (EUR…
On higher multiplicity hyperplane and polynomial covers for symmetry preserving subsets of the hypercube
Arijit Ghosh, Chandrima Kayal, Soumi Nandi +1
Alon and Füredi (European J. Combin. 1993) gave a tight bound for the following hyperplane covering problem: find the minimum number of hyperplanes required to cover all points of…
On Vanishing Properties of Polynomials on Symmetric Sets of the Boolean Cube, in Positive Characteristic
Srikanth Srinivasan, S. Venkitesh
The finite-degree Zariski (Z-) closure is a classical algebraic object, that has found a key place in several applications of the polynomial method in combinatorics. In this work,…
The Young matroid: A multiset extension of the Catalan matroid to arbitrary Young diagrams
Hiranya Kishore Dey, Brahadeesh Sankarnarayanan, S. Venkitesh
Introduced by Ardila (J. Combin. Theory Ser. A, 2003), the Catalan matroid is obtained by defining the bases of the matroid using Dyck paths from to . Further resear…
Covering Weight-Determined Sets of Uniform Grids by Polynomials
S. Venkitesh
We determine the minimum degree of a nonzero polynomial covering "weight-determined" subsets of a uniform grid over a field of characteristic zero. Since such subsets are completel…
On the Probabilistic Degree of an -variate Boolean Function
Srikanth Srinivasan, S. Venkitesh
Nisan and Szegedy (CC 1994) showed that any Boolean function that depends on all its input variables, when represented as a real-valued multivariat…
Covering Symmetric Sets of the Boolean Cube by Affine Hyperplanes
S. Venkitesh
Alon and Füredi (European J. Combin., 1993) proved that any family of hyperplanes that covers every point of the Boolean cube except one must contain at least hyper…
On the Probabilistic Degrees of Symmetric Boolean functions
Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh
The probabilistic degree of a Boolean function is defined to be the smallest such that there is a random polynomial of degree at m…
Decoding Downset codes over a finite grid
Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh
In a recent paper, Kim and Kopparty (Theory of Computing, 2017) gave a deterministic algorithm for the unique decoding problem for polynomials of bounded total degree over a genera…
A Fixed-Depth Size-Hierarchy Theorem for AC via the Coin Problem
Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan +2
We prove the first Fixed-depth Size-hierarchy Theorem for uniform AC circuits; in particular, for fixed , the class of uniform AC for…