Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Alex Samorodnitsky - MaRDI portal

Alex Samorodnitsky

From MaRDI portal
Person:178477

Available identifiers

zbMath Open samorodnitsky.alexWikidataQ102490035 ScholiaQ102490035MaRDI QIDQ178477

List of research outcomes

PublicationDate of PublicationType
On codes decoding a constant fraction of errors on the BSC2023-11-14Paper
One more proof of the first linear programming bound for binary codes and two conjectures2023-10-12Paper
On some properties of random and pseudorandom codes2022-06-10Paper
Weight distribution of random linear codes and Krawchouk polynomials2022-05-04Paper
On the round complexity of randomized Byzantine agreement2022-04-04Paper
A Moment Ratio Bound for Polynomials and Some Extremal Properties of Krawchouk Polynomials and Hamming Spheres2021-07-23Paper
On coset leader graphs of structured linear codes2020-04-07Paper
On the \(\ell_4:\ell_2\) ratio of functions with restricted Fourier support2020-02-21Paper
An Upper Bound on $\ell_q$ Norms of Noisy Functions2020-01-28Paper
Improved log-Sobolev inequalities, hypercontractivity and uncertainty principle on the hypercube2019-10-07Paper
https://portal.mardi4nfdi.de/entity/Q46018362018-01-24Paper
An Inequality for Functions on the Hamming Cube2017-10-10Paper
The Zero-Undetected-Error Capacity Approaches the Sperner Capacity2017-05-16Paper
On the Entropy of a Noisy Function2017-04-28Paper
On Coset Leader Graphs of LDPC Codes2017-04-28Paper
Hafnians, perfect matchings and Gaussian matrices2016-09-30Paper
Kolmogorov width of discrete linear spaces: an approach to matrix rigidity2016-06-30Paper
The "Most informative boolean function" conjecture holds for high noise2015-10-29Paper
Approximating the Influence of Monotone Boolean Functions in O(√n) Query Complexity2015-09-24Paper
https://portal.mardi4nfdi.de/entity/Q29346162014-12-18Paper
Gowers uniformity, influence of variables, and PCPs2014-11-25Paper
A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume2014-09-26Paper
A PCP characterization of NP with optimal amortized query complexity2014-09-26Paper
Bounds on the permanent and some applications2014-08-05Paper
Learning and Smoothed Analysis2014-07-25Paper
Inverse Conjecture for the Gowers norm is false2012-09-27Paper
A note on the Newton radius2012-08-10Paper
Computing the Partition Function for Perfect Matchings in a Hypergraph2011-12-08Paper
A new perspective on implementation by voting trees2011-08-09Paper
An approximation algorithm for counting contingency tables2010-11-24Paper
Monotonicity testing over general poset domains2010-08-05Paper
Lower bounds for designs in symmetric spaces2010-07-20Paper
Gowers Uniformity, Influence of Variables, and PCPs2010-03-17Paper
Linear programming bounds for codes via a covering argument2009-05-13Paper
https://portal.mardi4nfdi.de/entity/Q35496502009-01-05Paper
https://portal.mardi4nfdi.de/entity/Q53020782009-01-05Paper
A modified logarithmic Sobolev inequality for the Hamming cube and some applications2008-07-10Paper
An upper bound for permanents of nonnegative matrices2008-03-06Paper
Edge-Isoperimetric Inequalities and Influences2008-02-22Paper
Random weighting, asymptotic counting, and inverse isoperimetry2007-09-03Paper
Counting magic squares in quasi-polynomial time2007-03-08Paper
A lower bound on the integrality gap for minimum multicut in directed networks2005-02-14Paper
On linear programming bounds for spherical codes and designs2004-12-16Paper
Testing juntas2004-08-06Paper
Linear codes and character sums2003-10-14Paper
Testing Basic Boolean Formulae2003-01-05Paper
https://portal.mardi4nfdi.de/entity/Q47808012002-11-21Paper
https://portal.mardi4nfdi.de/entity/Q45425872002-09-17Paper
On the optimum of Delsarte's linear program2002-08-24Paper
A deterministic algorithm for approximating the mixed discriminant and mixed volume, and a combinatorial corollary2002-08-20Paper
The distance approach to approximate combinatorial counting2002-02-28Paper
A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents2001-06-13Paper
Testing monotonicity2001-06-12Paper
https://portal.mardi4nfdi.de/entity/Q49418292000-03-19Paper
Inclusion-exclusion: exact and approximate1998-01-11Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Alex Samorodnitsky