( en | de | ru )

 

Disambiguation of "Etesami, Omid"

Author of the publication

copydeleteadd this publication to your clipboard
Computational Concentration of Measure: Optimal Bounds, Reductions, and More.

, , and . SODA, page 345-363. SIAM, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Mohammad-Reza Omidi

Mohammed-Esmail Omidi

Sirous Omid

Omid Rezania

Omid Shabestari

 

Other publications of authors with the same name

Relations between belief propagation on erasure and symmetric channels.. ISIT, page 209. IEEE, (2004)The Value of Help Bits in Randomized and Average-Case Complexity., , and . Comput. Complex., 26 (1): 119-145 (2017)Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources., , and . ICALP (1), volume 9134 of Lecture Notes in Computer Science, page 143-154. Springer, (2015)Raptor codes on symmetric channels., , and . ISIT, page 38. IEEE, (2004)On NP-hard graph properties characterized by the spectrum., and . Discret. Appl. Math., (2020)Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources., , and . SIAM J. Comput., 46 (1): 1-36 (2017)Optimal Deterministic Extractors for Generalized Santha-Vazirani Sources., , , and . APPROX-RANDOM, volume 116 of LIPIcs, page 30:1-30:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Improved Pseudorandom Generators for Depth 2 Circuits., , , and . APPROX-RANDOM, volume 6302 of Lecture Notes in Computer Science, page 504-517. Springer, (2010)The value of information-theoretic content of help bits for computation., , and . IWCIT, page 1-3. IEEE, (2015)Computational Concentration of Measure: Optimal Bounds, Reductions, and More., , and . CoRR, (2019)