| Publication | Date of Publication | Type |
|---|
Weight distribution of random linear codes and Krawtchouk polynomials
Random Structures & Algorithms | 2024-09-02 | Paper |
Optimal discrimination between two pure states and Dolinar-type coherent-state detection
IEEE Transactions on Information Theory | 2024-07-22 | Paper |
On codes decoding a constant fraction of errors on the BSC
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
One more proof of the first linear programming bound for binary codes and two conjectures
Israel Journal of Mathematics | 2023-10-12 | Paper |
On the round complexity of randomized Byzantine agreement
| 2023-02-03 | Paper |
On some properties of random and pseudorandom codes
| 2022-06-10 | Paper |
Weight distribution of random linear codes and Krawchouk polynomials
| 2022-05-04 | Paper |
On the round complexity of randomized Byzantine agreement
Journal of Cryptology | 2022-04-04 | Paper |
A Moment Ratio Bound for Polynomials and Some Extremal Properties of Krawchouk Polynomials and Hamming Spheres
IEEE Transactions on Information Theory | 2021-07-23 | Paper |
On coset leader graphs of structured linear codes
Discrete & Computational Geometry | 2020-04-07 | Paper |
On the \(\ell_4:\ell_2\) ratio of functions with restricted Fourier support
Journal of Combinatorial Theory. Series A | 2020-02-21 | Paper |
An Upper Bound on $\ell_q$ Norms of Noisy Functions
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
Improved log-Sobolev inequalities, hypercontractivity and uncertainty principle on the hypercube
Journal of Functional Analysis | 2019-10-07 | Paper |
Kolmogorov width of discrete linear spaces: an approach to matrix rigidity
| 2018-01-24 | Paper |
An inequality for functions on the Hamming cube
Combinatorics, Probability and Computing | 2017-10-10 | Paper |
The Zero-Undetected-Error Capacity Approaches the Sperner Capacity
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
On the Entropy of a Noisy Function
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
On Coset Leader Graphs of LDPC Codes
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Hafnians, perfect matchings and Gaussian matrices
The Annals of Probability | 2016-09-30 | Paper |
Kolmogorov width of discrete linear spaces: an approach to matrix rigidity
Computational Complexity | 2016-06-30 | Paper |
The "Most informative boolean function" conjecture holds for high noise
| 2015-10-29 | Paper |
Approximating the influence of monotone Boolean functions in \(O(\sqrt{n})\) query complexity
ACM Transactions on Computation Theory | 2015-09-24 | Paper |
Approximating entropy from sublinear samples
| 2014-12-18 | Paper |
Gowers uniformity, influence of variables, and PCPs
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
A PCP characterization of NP with optimal amortized query complexity
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
Bounds on the permanent and some applications
| 2014-08-05 | Paper |
Learning and Smoothed Analysis
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
Inverse conjecture for the Gowers norm is false
Theory of Computing | 2012-09-27 | Paper |
A note on the Newton radius
Discrete Mathematics | 2012-08-10 | Paper |
Computing the partition function for perfect matchings in a hypergraph
Combinatorics, Probability and Computing | 2011-12-08 | Paper |
A new perspective on implementation by voting trees
Random Structures & Algorithms | 2011-08-09 | Paper |
An approximation algorithm for counting contingency tables
Random Structures & Algorithms | 2010-11-24 | Paper |
Monotonicity testing over general poset domains
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Lower bounds for designs in symmetric spaces
| 2010-07-20 | Paper |
Gowers Uniformity, Influence of Variables, and PCPs
SIAM Journal on Computing | 2010-03-17 | Paper |
Linear programming bounds for codes via a covering argument
Discrete & Computational Geometry | 2009-05-13 | Paper |
Low-degree tests at large distances
| 2009-01-05 | Paper |
Inverse conjecture for the Gowers norm is false
| 2009-01-05 | Paper |
A modified logarithmic Sobolev inequality for the Hamming cube and some applications
| 2008-07-10 | Paper |
An upper bound for permanents of nonnegative matrices
Journal of Combinatorial Theory. Series A | 2008-03-06 | Paper |
Edge-Isoperimetric Inequalities and Influences
Combinatorics, Probability and Computing | 2008-02-22 | Paper |
Random weighting, asymptotic counting, and inverse isoperimetry
Israel Journal of Mathematics | 2007-09-03 | Paper |
Counting magic squares in quasi-polynomial time
| 2007-03-08 | Paper |
A lower bound on the integrality gap for minimum multicut in directed networks
Combinatorica | 2005-02-14 | Paper |
On linear programming bounds for spherical codes and designs
Discrete & Computational Geometry | 2004-12-16 | Paper |
Testing juntas
Journal of Computer and System Sciences | 2004-08-06 | Paper |
Linear codes and character sums
Combinatorica | 2003-10-14 | Paper |
Testing Basic Boolean Formulae
SIAM Journal on Discrete Mathematics | 2003-01-05 | Paper |
scientific article; zbMATH DE number 1833420 (Why is no real title available?)
| 2002-11-21 | Paper |
scientific article; zbMATH DE number 1775454 (Why is no real title available?)
| 2002-09-17 | Paper |
On the optimum of Delsarte's linear program
Journal of Combinatorial Theory. Series A | 2002-08-24 | Paper |
A deterministic algorithm for approximating the mixed discriminant and mixed volume, and a combinatorial corollary
Discrete & Computational Geometry | 2002-08-20 | Paper |
The distance approach to approximate combinatorial counting
Geometric and Functional Analysis. GAFA | 2002-02-28 | Paper |
A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
Combinatorica | 2001-06-13 | Paper |
Testing monotonicity
Combinatorica | 2001-06-12 | Paper |
scientific article; zbMATH DE number 1418269 (Why is no real title available?)
| 2000-03-19 | Paper |
Inclusion-exclusion: exact and approximate
Combinatorica | 1998-01-11 | Paper |
