PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Saks, Michael E."

Author of the publication

copydeleteadd this publication to your clipboard
A Communication Game Related to the Sensitivity Conjecture.

, , and . Theory of Computing, 13 (1): 1-18 (2017)

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.

E. Garrelts

E. Zafeiriou

P. E. Bl\"ochl

Andr{\'{e}} Buchau

Umm-E Habiba University of Stuttgart

 

Other publications of authors with the same name

On a Search Problem Related to Branch-and-Bound Procedures, , and . FOCS, page 19-28. IEEE Computer Society, (1986)A Decomposition Theorem and Bounds for Randomized Server Problems, , , and . FOCS, page 197-207. IEEE Computer Society, (1992)Decomposing Graphs into Regions of Small Diameter., and . SODA, page 320-330. ACM/SIAM, (1991)A polylogarithmic space deterministic streaming algorithm for approximating distance to monotonicity., and . SODA, page 1252-1262. SIAM, (2015)Randomized Robot Navigation Algorithms., , , , , and . SODA, page 75-84. ACM/SIAM, (1996)Local Management of a Global Resource in a Communication Network, , , and . FOCS, page 347-357. IEEE Computer Society, (1987)Low discrepancy sets yield approximate min-wise independent permutation families., , , and . Inf. Process. Lett., 73 (1-2): 29-32 (2000)Lower Bounds for Combinatorial Algorithms for Boolean Matrix Multiplication., , and . STACS, volume 96 of LIPIcs, page 23:1-23:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)Optimal Space Distributed Move-to-Front Lists., and . PODC, page 65-73. ACM, (1991)Super-Linear Time-Space Tradeoff Lower Bounds for Randomized Computation, , , and . Electronic Colloquium on Computational Complexity (ECCC), (2000)