Michael Saks

7.0k total citations
139 papers, 3.5k citations indexed

About

Michael Saks is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Michael Saks has authored 139 papers receiving a total of 3.5k indexed citations (citations by other indexed papers that have themselves been cited), including 97 papers in Computational Theory and Mathematics, 68 papers in Artificial Intelligence and 38 papers in Computer Networks and Communications. Recurrent topics in Michael Saks's work include Complexity and Algorithms in Graphs (60 papers), Optimization and Search Problems (31 papers) and Advanced Graph Theory Research (25 papers). Michael Saks is often cited by papers focused on Complexity and Algorithms in Graphs (60 papers), Optimization and Search Problems (31 papers) and Advanced Graph Theory Research (25 papers). Michael Saks collaborates with scholars based in United States, Israel and Netherlands. Michael Saks's co-authors include Nathan Linial, Allan Borodin, Ramamohan Paturi, Michael L. Fredman, László Lovász, Paul Beame, Avi Wigderson, Jeff Kahn, Lan Yu and Francis Zane and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Computing and Advances in Mathematics.

In The Last Decade

Michael Saks

136 papers receiving 3.2k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Michael Saks United States	34	1.9k	1.4k	1.4k	498	327	139	3.5k
Johan Håstad Sweden	30	2.7k 1.4×	1.2k 0.9×	2.4k 1.8×	139 0.3×	519 1.6×	111	4.6k
Márió Szegedy United States	28	3.2k 1.7×	1.5k 1.1×	3.2k 2.4×	169 0.3×	355 1.1×	83	5.2k
Muli Safra Israel	26	2.4k 1.3×	859 0.6×	1.6k 1.2×	207 0.4×	186 0.6×	76	3.3k
Rolf Niedermeier Germany	31	2.5k 1.3×	1.1k 0.8×	863 0.6×	404 0.8×	209 0.6×	200	3.7k
Alistair Sinclair United States	24	1.1k 0.6×	744 0.5×	1.1k 0.8×	236 0.5×	132 0.4×	92	3.6k
David Zuckerman United States	31	1.7k 0.9×	1.2k 0.8×	1.8k 1.3×	137 0.3×	384 1.2×	96	3.5k
Zvi Galil United States	40	2.8k 1.5×	1.6k 1.1×	2.7k 2.0×	497 1.0×	523 1.6×	191	5.6k
Marek Karpiński Germany	26	1.6k 0.8×	917 0.6×	1.2k 0.9×	100 0.2×	349 1.1×	190	2.8k
Martin Grohe Germany	32	3.2k 1.6×	1.3k 0.9×	1.2k 0.9×	130 0.3×	193 0.6×	158	4.3k
Hans L. Bodlaender Netherlands	38	4.5k 2.4×	1.8k 1.3×	964 0.7×	167 0.3×	417 1.3×	225	5.5k

Countries citing papers authored by Michael Saks

Since Specialization

Citations

This map shows the geographic impact of Michael Saks's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Michael Saks with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Michael Saks more than expected).

Fields of papers citing papers by Michael Saks

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Michael Saks. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Michael Saks. The network helps show where Michael Saks may publish in the future.

Co-authorship network of co-authors of Michael Saks

This figure shows the co-authorship network connecting the top 25 collaborators of Michael Saks. A scholar is included among the top collaborators of Michael Saks based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Michael Saks. Michael Saks is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Saks, Michael & Rahul Santhanam. (2020). Circuit Lower Bounds from NP-Hardness of MCSP Under Turing Reductions. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 6 indexed citations

Saks, Michael, et al.. (2018). Tight Bound on the Number of Relevant Variables in a Bounded degree Boolean function.. arXiv (Cornell University).

Gavinsky, Dmitry, Shachar Lovett, Michael Saks, & Srikanth Srinivasan. (2014). A tail bound for read‐k families of functions. Random Structures and Algorithms. 47(1). 99–108. 11 indexed citations

Moitra, Ankur & Michael Saks. (2013). A Polynomial Time Algorithm for Lossy Population Recovery. 110–116. 9 indexed citations

Gilmer, Justin, Michael Saks, & Srikanth Srinivasan. (2013). Composition Limits and Separating Examples for Some Boolean Function Complexity Measures. 185–196. 4 indexed citations

Goyal, Navin & Michael Saks. (2010). . Theory of Computing. 6(1). 113–134. 1 indexed citations

Saks, Michael & C. Seshadhri. (2008). Parallel monotonicity reconstruction. Symposium on Discrete Algorithms. 962–971. 7 indexed citations

Goyal, Navin & Michael Saks. (2005). Rounds vs queries trade-off in noisy computation. Symposium on Discrete Algorithms. 632–639. 1 indexed citations

Allender, Eric, et al.. (2005). Minimizing DNF Formulas and AC0 Circuits Given a Truth Table. Electronic colloquium on computational complexity. 7 indexed citations

10.

Barnum, Howard & Michael Saks. (2004). A lower bound on the quantum query complexity of read-once functions. Journal of Computer and System Sciences. 69(2). 244–258. 1 indexed citations

11.

Saks, Michael. (2002). Kleitman and combinatorics. Discrete Mathematics. 257(2-3). 225–247. 2 indexed citations

12.

Allender, Eric, Michael Saks, & Igor E. Shparlinski. (2001). A Lower Bound for Primality. Journal of Computer and System Sciences. 62(2). 356–366. 10 indexed citations

13.

Beame, Paul, T. S. Jayram, & Michael Saks. (2001). Time–Space Tradeoffs for Branching Programs. Journal of Computer and System Sciences. 63(4). 542–572. 32 indexed citations

14.

Beame, Paul, Michael Saks, Xiaodong Sun, & Erik Vee. (2000). Super-Linear Time-Space Tradeoff Lower Bounds for Randomized Computation. Electronic colloquium on computational complexity. 7. 2 indexed citations

15.

Berman, Piotr, Avrim Blum, Amos Fiat, et al.. (1996). Randomized robot navigation algorithms. Symposium on Discrete Algorithms. 75–84. 27 indexed citations

16.

Paturi, Ramamohan & Michael Saks. (1994). Approximating Threshold Circuits by Rational Functions. Information and Computation. 112(2). 257–272. 27 indexed citations

17.

Karchmer, Mauricio, Nathan Linial, Ilan Newman, Michael Saks, & Avi Wigderson. (1993). Combinatorial characterization of read-once formulae. Discrete Mathematics. 114(1-3). 275–282. 30 indexed citations

18.

Linial, Nathan & Michael Saks. (1991). Decomposing graphs into regions of small diameter. Symposium on Discrete Algorithms. 320–330. 45 indexed citations

19.

Saks, Michael, et al.. (1991). Optimal time randomized consensus—making resilient algorithms fast in practice. Symposium on Discrete Algorithms. 351–362. 53 indexed citations

20.

Saks, Michael. (1980). Dilworth Numbers, Incidence Maps and Product Partial Orders. SIAM Journal on Algebraic and Discrete Methods. 1(2). 211–215. 13 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact