Michael Saks
- Computational Theory and Mathematics top 0.1%
- Complexity and Algorithms in Graphs 60
- Advanced Graph Theory Research 25
- semigroups and automata theory 15
-
- Limits and Structures in Graph Theory 13
- Computer Networks and Communications top 0.5%
- Optimization and Search Problems 31
- Artificial Intelligence top 1%
- Machine Learning and Algorithms 22
- Algorithms and Data Compression 19
- Cryptography and Data Security 17
- Co-authors
- Nathan LinialAllan BorodinRamamohan PaturiMichael L. FredmanLászló LovászPaul BeameAvi WigdersonJeff Kahn
- Cited by
- Computational Theory and MathematicsDiscrete Mathematics and CombinatoricsComputer Networks and Communications
- Journals
- SIAM Journal on Computing (11 papers)COMBINATORICA (7 papers)Journal of Computer and System Sciences (6 papers)
- Partner nations
- United StatesIsraelNetherlands
In The Last Decade
Michael Saks
136 papers receiving 3.2k citations
Peers
Comparison fields: 5 of 81
- Computational Theory and Mathematics 1.9k
- Discrete Mathematics and Combinatorics 295
- Computer Networks and Communications 1.4k
- Artificial Intelligence 1.4k
- Computer Graphics and Computer-Aided Design 144
Countries citing papers authored by Michael Saks
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
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
The 25 scholars most cited alongside Michael Saks, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2020 | 6 | |
| 2 | Tight Bound on the Number of Relevant Variables in a Bounded degree Boolean function. | 2018 | 0 |
| 3 | 2014 | 11 | |
| 4 | 2010 | 1 | |
| 5 | Parallel monotonicity reconstruction | 2008 | 7 |
| 6 | Minimizing DNF Formulas and AC0 Circuits Given a Truth Table | 2005 | 7 |
| 7 | 2005 | 1 | |
| 8 | 2004 | 1 | |
| 9 | 2002 | 2 | |
| 10 | 2002 | 12 | |
| 11 | 2002 | 1 | |
| 12 | 2001 | 10 | |
| 13 | 2001 | 32 | |
| 14 | Super-Linear Time-Space Tradeoff Lower Bounds for Randomized Computation | 2000 | 2 |
| 15 | 1996 | 27 | |
| 16 | 1994 | 27 | |
| 17 | 1993 | 30 | |
| 18 | 1991 | 45 | |
| 19 | 1991 | 53 | |
| 20 | 1979 | 32 |
About Michael Saks
Michael Saks is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Artificial Intelligence, having authored 139 papers that have together received 3.5k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (60 papers), Optimization and Search Problems (31 papers), Advanced Graph Theory Research (25 papers), Machine Learning and Algorithms (22 papers), Algorithms and Data Compression (19 papers), Cryptography and Data Security (17 papers), semigroups and automata theory (15 papers) and Limits and Structures in Graph Theory (13 papers). The work is most often cited by research in Computational Theory and Mathematics (1.9k citations), Discrete Mathematics and Combinatorics (295 citations) and Computer Networks and Communications (1.4k citations). Michael Saks has collaborated with scholars based in United States, Israel and Netherlands. Frequent 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. Their work appears in journals such as SIAM Journal on Computing, COMBINATORICA, Journal of Computer and System Sciences, Journal of the ACM and Discrete Mathematics.
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.