Christopher Umans

2.1k citations
44 papers · 1.5k · h-index 19

Impact in

Papers in

Christopher Umans

43 papers receiving 1.4k citations

Peers

Christopher Umans
Comparison fields: 5 of 37
  • Computational Theory and Mathematics 921
  • Discrete Mathematics and Combinatorics 183
  • Artificial Intelligence 588
  • Computational Mathematics 9
  • Computer Networks and Communications 107
Replace Peter Bro Miltersen with:
Peter Bro Miltersen Denmark
Shachar Lovett United States
Krzysztof Onak United States
Desh Ranjan United States
Thorsten Theobald Germany
Andreas Björklund Sweden
Madhur Tulsiani United States
Alan C. H. Ling United States
Ronen Shaltiel Israel
Gyula O. H. Katona Hungary
Christopher Umans relative to Peter Bro Miltersen Denmark Peter Bro Miltersen's profile →
Citations per field
00.5×2×2.9×
Peter Bro Miltersen · 1×
Citations per year

Countries citing papers authored by Christopher Umans

Since Specialization
Citations

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

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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 21 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.

Border = papers with Christopher Umans Line = papers co-authored together Christopher Umans links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown

Showing the 20 most-cited of 44 papers — load more, or switch the sort, to bring in the rest.

#Work
1 2009204
2 2011145
3 2005110
4 200197
5 200285
6 200177
7 200768
8
Completeness in the Polynomial-Time Hierarchy A Compendium ∗
200867
9 200361
10 200853
11 200552
12 200748
13 201044
14 201242
15
Hardness of Approximating Minimization Problems
199932
16 200232
17 200530
18 200822
19
Fast matrix multiplication using coherent configurations
201319
20
201319

About Christopher Umans

Christopher Umans is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Artificial Intelligence, Management Science and Operations Research and Economics and Econometrics, having authored 44 papers that have together received 1.5k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (34 papers), Computability, Logic, AI Algorithms (10 papers), Limits and Structures in Graph Theory (9 papers), Cryptography and Data Security (6 papers), Coding theory and cryptography (6 papers), Polynomial and algebraic computation (4 papers), Advanced Graph Theory Research (2 papers) and Advanced Combinatorial Mathematics (1 paper). The work is most often cited by research in Computational Theory and Mathematics (921 citations), Discrete Mathematics and Combinatorics (183 citations), Artificial Intelligence (588 citations), Computational Mathematics (9 citations) and Computer Networks and Communications (107 citations). Christopher Umans has collaborated with scholars based in United States, Israel and Canada. Frequent co-authors include Ronen Shaltiel, Kiran S. Kedlaya, Salil Vadhan, Venkatesan Guruswami, Amnon Ta‐Shma, David Zuckerman, Marcus Schaefer, Henry Cohn, Elchanan Mossel and Noga Alon. Their work appears in journals such as Journal of Computer and System Sciences, Computational Complexity, SIAM Journal on Computing, Journal of the ACM 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.

Explore authors with similar magnitude of impact