( en | de | ru )

 

Disambiguation of "Saks, Michael E."

Author of the publication

copydeleteadd this publication to your clipboard
Low Discrepancy Sets Yield Approximate Min-Wise Independent Permutation Families.

, , , and . RANDOM-APPROX, volume 1671 of Lecture Notes in Computer Science, page 11-15. Springer, (1999)

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.

Manno Saks

Weerasak Saksirirat

Ram Saksena

E Michael

Jolanda Saks-Surowicz

 

Other publications of authors with the same name

Explicit dispersers with polylog degree., , and . STOC, page 479-488. ACM, (1995)On the practically interesting instances of MAXCUT., , , and . STACS, volume 20 of LIPIcs, page 526-537. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)An on-line graph coloring algorithm with sublinear performance ratio., , and . Discret. Math., 75 (1-3): 319-325 (1989)On Randomized Online Labeling with Polynomially Many Labels., , and . ICALP (1), volume 7965 of Lecture Notes in Computer Science, page 291-302. Springer, (2013)A lower bound on the quantum query complexity of read-once functions., and . J. Comput. Syst. Sci., 69 (2): 244-258 (2004)Minimizing DNF Formulas and AC0 Circuits Given a Truth Table, , , , and . Electron. Colloquium Comput. Complex., (2005)Lower Bounds on the Randomized Communication Complexity of Read-Once Functions., and . CCC, page 341-350. IEEE Computer Society, (2009)Circuit Lower Bounds from NP-Hardness of MCSP Under Turing Reductions., and . CCC, volume 169 of LIPIcs, page 26:1-26:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Randomization and Derandomization in Space_Bounded Computation.. CCC, page 128-149. IEEE Computer Society, (1996)Optimal Separation of EROW and CROWPRAMs., , and . CCC, page 93-. IEEE Computer Society, (2003)