Lance Fortnow
- Computational Theory and Mathematics top 0.05%
- Complexity and Algorithms in Graphs 69
- Computability, Logic, AI Algorithms 54
- semigroups and automata theory 29
- Advanced Graph Theory Research 13
- Formal Methods in Verification 13
- Artificial Intelligence top 0.2%
- Cryptography and Data Security 34
- Machine Learning and Algorithms 31
- Algorithms and Data Compression 16
- Co-authors
- László BabaiCarsten LundNoam NisanRahul SanthanamSalil VadhanHoward KarloffMárió SzegedyLeonid A. Levin
- Cited by
- Computational Theory and MathematicsArtificial IntelligenceComputer Graphics and Computer-Aided Design
- Journals
- Journal of Computer and System Sciences (10 papers)Computational Complexity (10 papers)Theoretical Computer Science (8 papers)
- Partner nations
- United StatesNetherlandsUnited Kingdom
In The Last Decade
Lance Fortnow
154 papers receiving 3.8k citations
Peers
Comparison fields: 5 of 129
- Computational Theory and Mathematics 2.9k
- Artificial Intelligence 2.9k
- Computer Graphics and Computer-Aided Design 86
- Computer Networks and Communications 511
- Discrete Mathematics and Combinatorics 64
Countries citing papers authored by Lance Fortnow
This map shows the geographic impact of Lance Fortnow'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 Lance Fortnow with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Lance Fortnow more than expected).
Fields of papers citing papers by Lance Fortnow
This network shows the impact of papers produced by Lance Fortnow. 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 Lance Fortnow. The network helps show where Lance Fortnow may publish in the future.
Co-authorship network
The 25 scholars most cited alongside Lance Fortnow, 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 | 2025 | 0 | |
| 2 | 2017 | 0 | |
| 3 | 2013 | 18 | |
| 4 | Time Hierarchies: A Survey | 2007 | 1 |
| 5 | Inverting Onto Functions and Polynomial Hierarchy | 2007 | 1 |
| 6 | Infeasibility of Instance Compression and Succinct PCPs for NP | 2007 | 2 |
| 7 | 2006 | 10 | |
| 8 | Time-Bounded Universal Distributions | 2005 | 2 |
| 9 | Enumerations of the Kolmogorov Function | 2004 | 1 |
| 10 | Increasing Kolmogorov Complexity | 2004 | 0 |
| 11 | 2003 | 5 | |
| 12 | 2003 | 14 | |
| 13 | 2002 | 117 | |
| 14 | Comparing Notions of Full Derandomization | 2001 | 2 |
| 15 | Beating a finite automaton in the big match | 1998 | 2 |
| 16 | 1997 | 4 | |
| 17 | The Role of Relativization in Complexity Theory. | 1994 | 35 |
| 18 | Errata for On the Power of Multi-Prover Interactive Protocols. | 1990 | 9 |
| 19 | Complexity-Theoretic Aspects of Interactive Proof Systems | 1989 | 17 |
| 20 | The Complexity of Perfect Zero-Knowledge (Extended Abstract) | 1987 | 3 |
About Lance Fortnow
Lance Fortnow is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Management Science and Operations Research, Computer Networks and Communications and Statistics and Probability, having authored 162 papers that have together received 4.2k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (69 papers), Computability, Logic, AI Algorithms (54 papers), Cryptography and Data Security (34 papers), Machine Learning and Algorithms (31 papers), semigroups and automata theory (29 papers), Algorithms and Data Compression (16 papers), Advanced Graph Theory Research (13 papers) and Formal Methods in Verification (13 papers). The work is most often cited by research in Computational Theory and Mathematics (2.9k citations), Artificial Intelligence (2.9k citations), Computer Graphics and Computer-Aided Design (86 citations), Computer Networks and Communications (511 citations) and Discrete Mathematics and Combinatorics (64 citations). Lance Fortnow has collaborated with scholars based in United States, Netherlands and United Kingdom. Frequent co-authors include László Babai, Carsten Lund, Noam Nisan, Rahul Santhanam, Salil Vadhan, Howard Karloff, Márió Szegedy, Leonid A. Levin, Harry Buhrman and Stephen Fenner. Their work appears in journals such as Journal of Computer and System Sciences, Computational Complexity, Theoretical Computer Science, SIAM Journal on Computing and Information and Computation.
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.