( en | de | ru )

 

Disambiguation of "Saks, Michael E."

Author of the publication

copydeleteadd this publication to your clipboard
Minimizing Disjunctive Normal Form Formulas and AC0 Circuits Given a Truth Table.

, , , , and . SIAM J. Comput., 38 (1): 63-84 (2008)

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)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)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)Tight lower bounds for the online labeling problem., , and . STOC, page 1185-1198. ACM, (2012)Products and Help Bits in Decision Trees, , and . FOCS, page 318-329. IEEE Computer Society, (1994)Lower Bounds on the Randomized Communication Complexity of Read-Once Functions., and . CCC, page 341-350. IEEE Computer Society, (2009)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)