No photo of Michael Saks

View Scopus Profile

Michael Saks

 https://orcid.org/0000-0003-1659-7190
  • 3995 Citations
  • 36 h-Index
1979 …2020

Research output per year

If you made any changes in Pure these will be visible here soon.

Fingerprint Dive into the research topics where Michael Saks is active. These topic labels come from the works of this person. Together they form a unique fingerprint.

  • 2 Similar Profiles

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Projects

AF: SMALL: EFFICIENT APPROXIMATIONS FOR DYNAMIC PROGRAMS AND OTHER TOPICS IN ALGORITHMS

Saks, M.

National Science Foundation (National Science Foundation (NSF))

9/1/12 → 8/31/15

Project: Research project

    • Research Output

    An Asymptotically Tight Bound on the Number of Relevant Variables in a Bounded Degree Boolean function

    Chiarelli, J., Hatami, P. & Saks, M., Apr 1 2020, In : Combinatorica. 40, 2, p. 237-244 8 p.

    Research output: Contribution to journal › Article

    • On the discrepancy of random matrices with many columns

    Franks, C. & Saks, M., Jan 1 2020, (Accepted/In press) In : Random Structures and Algorithms. 57, 1, p. 64-96 33 p.

    Research output: Contribution to journal › Article

    • On online labeling with large label Set

    Babka, M., Bulanek, J., Cun, V., Koucky, M. & Saks, M. E., Jan 1 2019, In : SIAM Journal on Discrete Mathematics. 33, 3, p. 1175-1193 19 p.

    Research output: Contribution to journal › Article

    • Approximating edit distance within constant factor in truly sub-quadratic time

    Chakraborty, D., Das, D., Goldenberg, E., Koucký, M. & Saks, M., Nov 30 2018, Proceedings - 59th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2018. Thorup, M. (ed.). IEEE Computer Society, p. 979-990 12 p. 8555174. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2018-October).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    • 17 Scopus citations

    Lower bounds for combinatorial algorithms for Boolean Matrix Multiplication

    Das, D., Koucký, M. & Saks, M., Feb 2 2018, 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018. Vallee, B. & Niedermeier, R. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 23. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 96).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution