( en | de | ru )

 

Disambiguation of "Saks, Michael E."

Author of the publication

copydeleteadd this publication to your clipboard
Information Bounds Are Good for Search Problems on Ordered Data Structures

, and . FOCS, page 473-475. IEEE Computer Society, (1983)

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

A parallel search game., and . Random Struct. Algorithms, 27 (2): 227-234 (2005)The unlabelled speed of a hereditary graph property., , , and . J. Comb. Theory, Ser. B, 99 (1): 9-19 (2009)On the practically interesting instances of MAXCUT., , , and . STACS, volume 20 of LIPIcs, page 526-537. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)The Euclidean Distortion of Complete Binary Trees., and . Discret. Comput. Geom., 29 (1): 19-21 (2003)An Asymptotically Tight Bound on the Number of Relevant Variables in a Bounded Degree Boolean function., , and . Combinatorica, 40 (1): 237-244 (2020)Every decision tree has an influential variable, , , and . CoRR, (2005)On Randomized Online Labeling with Polynomially Many Labels., , and . ICALP (1), volume 7965 of Lecture Notes in Computer Science, page 291-302. Springer, (2013)Time-space trade-off lower bounds for randomized computation of decision problems., , , and . J. ACM, 50 (2): 154-195 (2003)Explicit dispersers with polylog degree., , and . STOC, page 479-488. ACM, (1995)Sharpening the LYM inequality., , , , and . Combinatorica, 12 (3): 287-293 (1992)