NP might not be as easy as detecting unique solutions
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Constructing set systems with prescribed intersection sizes
Journal of Algorithms
On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Upper and Lower Bounds for Some Depth-3 Circuit Classes
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
A Note on Explicit Ramsey Graphs and Modular Sieves
Combinatorics, Probability and Computing
Constructing Large Set Systems with Given Intersection Sizes Modulo Composite Numbers
Combinatorics, Probability and Computing
Query-efficient algorithms for polynomial interpolation over composites
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Designs, Codes and Cryptography
Symmetric polynomials over Zm and simultaneous communication protocols
Journal of Computer and System Sciences - Special issue on FOCS 2003
Pairs of codes with prescribed Hamming distances and coincidences
Designs, Codes and Cryptography
Polynomials that Sign Represent Parity and Descartes' Rule of Signs
Computational Complexity
Nonlinear index coding outperforming the linear optimum
IEEE Transactions on Information Theory
Learning read-constant polynomials of constant degree modulo composites
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
SIAM Journal on Computing
Nearly complete graphs decomposable into large induced matchings and their applications
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
| Hi-index | 0.06 |