Projects per year
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.
- 1 Similar Profiles
Collaborations and top research areas from the last five years
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
Projects
- 10 Finished
-
AF: Small: Efficient Approximations for Dynamic Programs and Other Topics in Algorithms
Saks, M. (PI)
9/1/12 → 8/31/16
Project: Research project
-
Collaborative Research: Understanding, Coping with, and Benefiting from, Intractability
Szegedy, M. (PI), Saks, M. (CoPI) & Allender, E. (CoPI)
8/15/08 → 7/31/14
Project: Research project
-
Investigations in Concrete Complexity and Truthful Mechanism Design
Saks, M. (PI)
7/1/05 → 6/30/09
Project: Research project
-
-
ITR: Project on Strengths and Limitations of Quantum Information Processing
Saks, M. (PI)
8/15/00 → 7/31/02
Project: Research project
-
Local Enumeration: The Not-All-Equal Case
Gurumukhani, M., Paturi, R., Saks, M. & Talebanfard, N., Feb 24 2025, 42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025. Beyersdorff, O., Pilipczuk, M., Pimentel, E. & Thang, N. K. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 42. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 327).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
-
Randomized Greedy Online Edge Coloring Succeeds for Dense and Randomly-Ordered Graphs
Dudeja, A., Goswami, R. & Saks, M., 2025, Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2025. Association for Computing Machinery, p. 4948-4982 35 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 8).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
-
Almost Linear Size Edit Distance Sketch
Koucký, M. & Saks, M. E., Jun 10 2024, STOC 2024 - Proceedings of the 56th Annual ACM Symposium on Theory of Computing. Mohar, B., Shinkar, I. & O�Donnell, R. (eds.). Association for Computing Machinery, p. 956-967 12 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open Access -
Local Enumeration and Majority Lower Bounds
Gurumukhani, M., Paturi, R., Pudlák, P., Saks, M. & Talebanfard, N., Jul 2024, 39th Computational Complexity Conference, CCC 2024. Santhanam, R. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 17. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 300).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
-
Nearly Optimal List Labeling
Bender, M. A., Conway, A., Farach-Colton, M., Komlos, H., Koucky, M., Kuszmaul, W. & Saks, M., 2024, Proceedings - 2024 IEEE 65th Annual Symposium on Foundations of Computer Science, FOCS 2024. IEEE Computer Society, p. 2253-2274 22 p. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open Access