Ketan Mulmuley

3.3k total citations
48 papers, 1.7k citations indexed

About

Ketan Mulmuley is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Ketan Mulmuley has authored 48 papers receiving a total of 1.7k indexed citations (citations by other indexed papers that have themselves been cited), including 20 papers in Computational Theory and Mathematics, 19 papers in Computer Graphics and Computer-Aided Design and 10 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Ketan Mulmuley's work include Computational Geometry and Mesh Generation (18 papers), Advanced Graph Theory Research (9 papers) and Complexity and Algorithms in Graphs (9 papers). Ketan Mulmuley is often cited by papers focused on Computational Geometry and Mesh Generation (18 papers), Advanced Graph Theory Research (9 papers) and Complexity and Algorithms in Graphs (9 papers). Ketan Mulmuley collaborates with scholars based in United States, India and Germany. Ketan Mulmuley's co-authors include Vijay V. Vazirani, Umesh Vazirani, Milind Sohoni, Michael Walter, Christian Ikenmeyer, Hariharan Narayanan, Sandeep Sen, Otfried Schwarzkopf, Peter Bürgisser and Joshua A. Grochow and has published in prestigious journals such as Communications of the ACM, Journal of the ACM and SIAM Journal on Computing.

In The Last Decade

Ketan Mulmuley

46 papers receiving 1.5k citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Ketan Mulmuley United States 19 984 589 407 294 263 48 1.7k
Komei Fukuda Switzerland 17 743 0.8× 402 0.7× 235 0.6× 197 0.7× 158 0.6× 63 1.7k
Robert Krauthgamer Israel 26 1.2k 1.2× 304 0.5× 602 1.5× 697 2.4× 183 0.7× 110 2.0k
Assaf Naor United States 31 1.1k 1.1× 354 0.6× 428 1.1× 352 1.2× 132 0.5× 125 2.6k
Yuri Rabinovich Israel 14 631 0.6× 208 0.4× 265 0.7× 325 1.1× 111 0.4× 38 1.2k
Gábor Tardos Hungary 23 1.1k 1.1× 423 0.7× 498 1.2× 433 1.5× 149 0.6× 117 2.1k
Takao Nishizeki Japan 22 1.3k 1.3× 523 0.9× 597 1.5× 575 2.0× 138 0.5× 142 2.2k
George E. Collins United States 23 1.5k 1.5× 242 0.4× 682 1.7× 212 0.7× 141 0.5× 65 2.4k
Jacob E. Goodman United States 17 651 0.7× 1.4k 2.4× 183 0.4× 154 0.5× 331 1.3× 57 2.3k
S. Rao Kosaraju United States 23 721 0.7× 395 0.7× 624 1.5× 440 1.5× 217 0.8× 78 1.6k
Richard Pollack United States 25 1.5k 1.5× 1.3k 2.2× 346 0.9× 205 0.7× 236 0.9× 76 3.0k

Countries citing papers authored by Ketan Mulmuley

Since Specialization
Citations

This map shows the geographic impact of Ketan Mulmuley'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 Ketan Mulmuley with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ketan Mulmuley more than expected).

Fields of papers citing papers by Ketan Mulmuley

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Ketan Mulmuley. 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 Ketan Mulmuley. The network helps show where Ketan Mulmuley may publish in the future.

Co-authorship network of co-authors of Ketan Mulmuley

This figure shows the co-authorship network connecting the top 25 collaborators of Ketan Mulmuley. A scholar is included among the top collaborators of Ketan Mulmuley 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 Ketan Mulmuley. Ketan Mulmuley is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Mulmuley, Ketan. (2018). A semantic characterization of full abstraction. Figshare.
2.
Mulmuley, Ketan. (2012). The GCT program toward the P vs. NP problem. Communications of the ACM. 55(6). 98–107. 21 indexed citations
3.
Mulmuley, Ketan, et al.. (2007). Geometric Complexity Theory IV: quantum group for the Kronecker problem. 3 indexed citations
4.
Mulmuley, Ketan. (2002). Randomized multidimensional search trees: lazy balancing and dynamic shuffling. 180–196. 11 indexed citations
5.
Mulmuley, Ketan. (2002). Randomized multidimensional search trees: further results in dynamic sampling. 2. 216–227. 5 indexed citations
6.
Mulmuley, Ketan, et al.. (2001). A Lower Bound for the Shortest Path Problem. Journal of Computer and System Sciences. 63(2). 253–267. 19 indexed citations
7.
Mulmuley, Ketan. (1997). Parallel vs. Parametric Complexity (Abstract). 282–283. 1 indexed citations
8.
Mulmuley, Ketan. (1997). Is there an algebraic proof for P ≠ NC? (extended abstract). 210–219. 1 indexed citations
9.
Mulmuley, Ketan & Otfried Schwarzkopf. (1997). Randomized algorithms. 633–652. 6 indexed citations
10.
Mulmuley, Ketan. (1996). Randomized Geometric Algorithms and Pseudorandom Generators. Algorithmica. 16(4-5). 450–463. 1 indexed citations
11.
Mulmuley, Ketan. (1994). Computational geometry : an introduction through randomized algorithms. Prentice Hall eBooks. 328 indexed citations
12.
Mulmuley, Ketan. (1992). Randomized Geometric Algorithms and Pseudo-Random Generators (Extended Abstract). 90–100. 1 indexed citations
13.
Mulmuley, Ketan & Sandeep Sen. (1992). Dynamic point location in arrangements of hyperplanes. Discrete & Computational Geometry. 8(3). 335–360. 1 indexed citations
14.
Mulmuley, Ketan. (1991). Randomized Multidimensional Search Trees: Dynamic Sampling (Extended Abstract).. 34(2). 121–131. 14 indexed citations
15.
Mulmuley, Ketan & Sandeep Sen. (1991). Dynamic point location in arrangements of hyperplanes. 132–141. 9 indexed citations
16.
Mulmuley, Ketan. (1990). A fast planar partition algorithm, I. Journal of Symbolic Computation. 10(3-4). 253–280. 51 indexed citations
17.
Mulmuley, Ketan. (1989). On obstructions in relation to a fixed viewpoint. 592–597. 12 indexed citations
18.
Mulmuley, Ketan. (1989). A fast planar partition algorithm, II. 33–43. 14 indexed citations
19.
Mulmuley, Ketan. (1988). A fast planar partition algorithm: Part I. Molecular Immunology. 48(4). 382–91. 3 indexed citations
20.
Mulmuley, Ketan. (1986). Fully abstract submodels of typed lambda calculi. Journal of Computer and System Sciences. 33(1). 2–46. 3 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

Breakdown of academic impact, for papers by Komei Fukuda Breakdown of academic impact, for papers by Robert Krauthgamer Breakdown of academic impact, for papers by Assaf Naor Breakdown of academic impact, for papers by Yuri Rabinovich Breakdown of academic impact, for papers by Gábor Tardos Breakdown of academic impact, for papers by Takao Nishizeki Breakdown of academic impact, for papers by George E. Collins Breakdown of academic impact, for papers by Jacob E. Goodman Breakdown of academic impact, for papers by S. Rao Kosaraju Breakdown of academic impact, for papers by Richard Pollack
Rankless by CCL
2026