Christopher Umans
Impact in
-
- Complexity and Algorithms in Graphs
- Computability, Logic, AI Algorithms
- semigroups and automata theory
- Advanced Graph Theory Research
- Artificial Intelligence top 2%
- Cryptography and Data Security
- Coding theory and cryptography
- Algorithms and Data Compression
- Machine Learning and Algorithms
Papers in ⓘ
-
- Complexity and Algorithms in Graphs 26
- Computability, Logic, AI Algorithms 7
- Formal Methods in Verification 4
- semigroups and automata theory 4
-
- Cryptography and Data Security 11
- Coding theory and cryptography 10
- Cryptographic Implementations and Security 4
- Co-authors
- Salil Vadhan (3 shared papers)Venkatesan Guruswami (3 shared papers)Ronen Shaltiel (6 shared papers)Amnon Ta‐Shma (4 shared papers)David Zuckerman (2 shared papers)Kiran S. Kedlaya (2 shared papers)Marcus Schaefer (1 shared paper)Elchanan Mossel (1 shared paper)
- Journals
- Journal of Computer and System Sciences (4 papers)SIAM Journal on Computing (2 papers)Journal of the ACM (2 papers)Computational Complexity (2 papers)Theoretical Computer Science (1 paper)
- Partner nations
- United StatesIsrael
In The Last Decade
Christopher Umans
35 papers receiving 747 citations
Peers
Comparison fields: 5 of 65
- Computational Theory and Mathematics 536
- Artificial Intelligence 597
- Discrete Mathematics and Combinatorics 35
- Computational Mathematics 4
- Computer Networks and Communications 147
Countries citing papers authored by Christopher Umans
This map shows the geographic impact of Christopher Umans'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 Christopher Umans with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Christopher Umans more than expected).
Fields of papers citing papers by Christopher Umans
This network shows the impact of papers produced by Christopher Umans. 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 Christopher Umans. The network helps show where Christopher Umans may publish in the future.
Co-authors
The 18 scholars most cited alongside Christopher Umans, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 36 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2009 | 126 | |
| 2 | 2005 | 82 | |
| 3 | 2001 | 76 | |
| 4 | 2002 | 72 | |
| 5 | 2001 | 62 | |
| 6 | Completeness in the Polynomial-Time Hierarchy A Compendium ∗ | 2008 | 52 |
| 7 | 2003 | 47 | |
| 8 | 2007 | 43 | |
| 9 | 2008 | 37 | |
| 10 | 2010 | 36 | |
| 11 | 2007 | 30 | |
| 12 | 2002 | 28 | |
| 13 | Hardness of Approximating Minimization Problems | 1999 | 26 |
| 14 | 2008 | 15 | |
| 15 | Approximability and completeness in the polynomial hierarchy | 2000 | 13 |
| 16 | 2013 | 11 | |
| 17 | 2006 | 11 | |
| 18 | 2006 | 7 | |
| 19 | 2009 | 6 | |
| 20 | Hardness of Approximating Sigma 2 p Minimization Problems. | 1999 | 5 |
About Christopher Umans
Christopher Umans is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Computer Networks and Communications, Information Systems and Computer Vision and Pattern Recognition, having authored 36 papers that have together received 829 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (26 papers), Cryptography and Data Security (11 papers), Coding theory and cryptography (10 papers), Computability, Logic, AI Algorithms (7 papers), Formal Methods in Verification (4 papers), Cryptographic Implementations and Security (4 papers), semigroups and automata theory (4 papers) and Auction Theory and Applications (3 papers). The work is most often cited by research in Computational Theory and Mathematics (536 citations), Artificial Intelligence (597 citations), Discrete Mathematics and Combinatorics (35 citations), Computational Mathematics (4 citations) and Computer Networks and Communications (147 citations). Christopher Umans has collaborated with scholars based in United States and Israel. Frequent co-authors include Salil Vadhan, Venkatesan Guruswami, Ronen Shaltiel, Amnon Ta‐Shma, David Zuckerman, Kiran S. Kedlaya, Marcus Schaefer, Elchanan Mossel, Christos H. Papadimitriou and Bill Fefferman. Their work appears in journals such as Journal of Computer and System Sciences, SIAM Journal on Computing, Journal of the ACM, Computational Complexity and Theoretical Computer Science.
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.