Christopher Umans

1.7k total citations
36 papers, 829 citations indexed

About

Christopher Umans is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Christopher Umans has authored 36 papers receiving a total of 829 indexed citations (citations by other indexed papers that have themselves been cited), including 31 papers in Computational Theory and Mathematics, 23 papers in Artificial Intelligence and 3 papers in Computer Networks and Communications. Recurrent topics in Christopher Umans's work include Complexity and Algorithms in Graphs (26 papers), Cryptography and Data Security (11 papers) and Coding theory and cryptography (10 papers). Christopher Umans is often cited by papers focused on Complexity and Algorithms in Graphs (26 papers), Cryptography and Data Security (11 papers) and Coding theory and cryptography (10 papers). Christopher Umans collaborates with scholars based in United States and Israel. Christopher Umans's 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 and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Christopher Umans

35 papers receiving 747 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Christopher Umans United States	14	597	536	147	107	46	36	829
Adam R. Klivans United States	19	831 1.4×	618 1.2×	108 0.7×	78 0.7×	36 0.8×	56	1.0k
Nader H. Bshouty Israel	18	872 1.5×	536 1.0×	166 1.1×	100 0.9×	42 0.9×	123	1.1k
Jacobo Torán Germany	15	516 0.9×	721 1.3×	153 1.0×	60 0.6×	82 1.8×	56	989
Ravi B. Boppana United States	13	532 0.9×	744 1.4×	216 1.5×	117 1.1×	48 1.0×	26	1.1k
Yury Makarychev United States	15	222 0.4×	502 0.9×	212 1.4×	84 0.8×	87 1.9×	51	769
Guy Kindler Israel	18	478 0.8×	721 1.3×	358 2.4×	119 1.1×	26 0.6×	50	1.1k
Prasad Raghavendra United States	19	358 0.6×	689 1.3×	256 1.7×	70 0.7×	15 0.3×	57	950
François Le Gall Japan	8	317 0.5×	296 0.6×	105 0.7×	62 0.6×	55 1.2×	35	573
Amir Yehudayoff Israel	15	410 0.7×	514 1.0×	90 0.6×	74 0.7×	22 0.5×	88	755
Andrzej Trybulec Poland	17	362 0.6×	734 1.4×	73 0.5×	109 1.0×	45 1.0×	55	1.4k

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-authorship network of co-authors of Christopher Umans

This figure shows the co-authorship network connecting the top 25 collaborators of Christopher Umans. A scholar is included among the top collaborators of Christopher Umans 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 Christopher Umans. Christopher Umans 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

Fefferman, Bill & Christopher Umans. (2016). The Power of Quantum Fourier Sampling. 19. 4 indexed citations

Fefferman, Bill, Ronen Shaltiel, Christopher Umans, & Emanuele Viola. (2013). . Theory of Computing. 9(1). 809–843. 11 indexed citations

Alon, Noga, Amir Shpilka, & Christopher Umans. (2012). On Sunflowers and Matrix Multiplication. Computational Complexity. 22(2). 219–243. 4 indexed citations

Umans, Christopher, et al.. (2010). The complexity of Boolean formula minimization. Journal of Computer and System Sciences. 77(1). 142–153. 36 indexed citations

Umans, Christopher, et al.. (2009). Limits on the Social Welfare of Maximal-In-Range Auction Mechanisms.. CaltechAUTHORS (California Institute of Technology). 16. 68. 2 indexed citations

Guruswami, Venkatesan, Christopher Umans, & Salil Vadhan. (2009). Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes. Journal of the ACM. 56(4). 1–34. 126 indexed citations

Umans, Christopher, et al.. (2009). The Complexity of Rationalizing Network Formation. 14. 485–494. 3 indexed citations

Shaltiel, Ronen & Christopher Umans. (2009). Low-End Uniform Hardness versus Randomness Tradeoffs for AM. SIAM Journal on Computing. 39(3). 1006–1037. 6 indexed citations

Umans, Christopher, et al.. (2008). The Complexity of Rationalizing Matchings.. CaltechAUTHORS (California Institute of Technology). 15. 5 indexed citations

10.

Umans, Christopher. (2008). Reconstructive Dispersers and Hitting Set Generators. Algorithmica. 55(1). 134–156. 2 indexed citations

11.

Guruswami, Venkatesan, Christopher Umans, & Salil Vadhan. (2007). Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes. 96–108. 43 indexed citations

12.

Ta‐Shma, Amnon, Christopher Umans, & David Zuckerman. (2007). Lossless Condensers, Unbalanced Expanders, And Extractors. COMBINATORICA. 27(2). 213–240. 30 indexed citations

13.

Shaltiel, Ronen & Christopher Umans. (2005). Pseudorandomness for Approximate Counting and Sampling. Computational Complexity. 15(4). 212–226. 2 indexed citations

14.

Umans, Christopher. (2003). Pseudo-random generators for all hardnesses. Journal of Computer and System Sciences. 67(2). 419–440. 47 indexed citations

15.

Mossel, Elchanan & Christopher Umans. (2002). On the complexity of approximating the VC dimension. Journal of Computer and System Sciences. 65(4). 660–671. 28 indexed citations

16.

Umans, Christopher. (2002). Pseudo-random generators for all hardnesses. 627–634. 72 indexed citations

17.

Umans, Christopher. (2001). The Minimum Equivalent DNF Problem and Shortest Implicants. Journal of Computer and System Sciences. 63(4). 597–611. 62 indexed citations

18.

Umans, Christopher & Christos H. Papadimitriou. (2000). Approximability and completeness in the polynomial hierarchy. Biomedizinische Technik/Biomedical Engineering. 42 Suppl. 153–4. 13 indexed citations

19.

Umans, Christopher. (1999). Hardness of Approximating Sigma 2 p Minimization Problems.. 465–474. 5 indexed citations

20.

Umans, Christopher. (1999). Hardness of Approximating Minimization Problems. 465. 26 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