Ker‐I Ko

3.6k total citations
82 papers, 1.7k citations indexed

About

Ker‐I Ko is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Statistics and Probability. According to data from OpenAlex, Ker‐I Ko has authored 82 papers receiving a total of 1.7k indexed citations (citations by other indexed papers that have themselves been cited), including 71 papers in Computational Theory and Mathematics, 30 papers in Artificial Intelligence and 7 papers in Statistics and Probability. Recurrent topics in Ker‐I Ko's work include Computability, Logic, AI Algorithms (49 papers), Complexity and Algorithms in Graphs (22 papers) and semigroups and automata theory (20 papers). Ker‐I Ko is often cited by papers focused on Computability, Logic, AI Algorithms (49 papers), Complexity and Algorithms in Graphs (22 papers) and semigroups and automata theory (20 papers). Ker‐I Ko collaborates with scholars based in United States, Taiwan and China. Ker‐I Ko's co-authors include Ding‐Zhu Du, Harvey M. Friedman, Xiao Hu, Uwe Schöning, Ronald V. Book, Hongwei Du, Lu Ruan, Xiaohua Jia, Weili Wu and Yingshu Li and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Ker‐I Ko

77 papers receiving 1.6k citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Ker‐I Ko United States 20 1.3k 687 307 107 105 82 1.7k
Jin‐Yi Cai United States 25 1.5k 1.2× 1.1k 1.6× 447 1.5× 59 0.6× 121 1.2× 174 2.3k
Gregory B. Sorkin United States 19 481 0.4× 345 0.5× 419 1.4× 72 0.7× 137 1.3× 55 1.2k
Ilan Newman Israel 23 1.1k 0.8× 687 1.0× 429 1.4× 24 0.2× 113 1.1× 86 1.4k
Luca Trevisan United States 28 1.8k 1.4× 1.3k 1.9× 677 2.2× 49 0.5× 206 2.0× 117 2.5k
Josep Dı́az Spain 16 721 0.6× 344 0.5× 447 1.5× 37 0.3× 192 1.8× 85 1.3k
Subhash Khot United States 26 2.3k 1.8× 924 1.3× 897 2.9× 43 0.4× 126 1.2× 116 2.9k
Yuri Rabinovich Israel 14 631 0.5× 265 0.4× 325 1.1× 62 0.6× 82 0.8× 38 1.2k
Ravi B. Boppana United States 13 744 0.6× 532 0.8× 216 0.7× 22 0.2× 117 1.1× 26 1.1k
James R. Lee United States 17 668 0.5× 189 0.3× 254 0.8× 123 1.1× 86 0.8× 55 1.1k
J. Spencer United States 16 474 0.4× 227 0.3× 127 0.4× 135 1.3× 106 1.0× 41 928

Countries citing papers authored by Ker‐I Ko

Since Specialization
Citations

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

Fields of papers citing papers by Ker‐I Ko

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Ker‐I Ko

This figure shows the co-authorship network connecting the top 25 collaborators of Ker‐I Ko. A scholar is included among the top collaborators of Ker‐I Ko 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 Ker‐I Ko. Ker‐I Ko 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.
Ko, Ker‐I. (2013). On the complexity of computing the Hausdorff distance. Journal of Complexity. 29(3-4). 248–262. 2 indexed citations
2.
Ko, Ker‐I, et al.. (2012). On logarithmic-space computable real numbers. Theoretical Computer Science. 469. 127–133. 1 indexed citations
3.
Brattka, Vasco, et al.. (2006). Computability and complexity in analysis. Journal of Complexity. 22(6). 728–728. 3 indexed citations
4.
Ko, Ker‐I, et al.. (2005). The computational complexity of distance functions of two-dimensional domains. Theoretical Computer Science. 337(1-3). 360–369. 3 indexed citations
5.
Ruan, Lu, Hongwei Du, Xiaohua Jia, et al.. (2004). A greedy approximation for minimum connected dominating sets. Theoretical Computer Science. 329(1-3). 325–330. 142 indexed citations
6.
Ko, Ker‐I. (1995). A polynomial-time computable curve whose interior has a nonrecursive measure. Theoretical Computer Science. 145(1-2). 241–270. 16 indexed citations
7.
Ko, Ker‐I. (1995). Computational Complexity of Fixed Points and Intersection Points. Journal of Complexity. 11(2). 265–292. 8 indexed citations
8.
Ko, Ker‐I. (1992). On the computational complexity of integral equations. Annals of Pure and Applied Logic. 58(3). 201–228. 9 indexed citations
9.
Du, Ding‐Zhu & Ker‐I Ko. (1992). A note on best fractions of a computable real number. Journal of Complexity. 8(3). 216–229. 1 indexed citations
10.
Ko, Ker‐I. (1991). Integral Equations, Systems of Quadratic Equations, and Exponential-Time Completeness (Extended Abstract). 10–20. 1 indexed citations
11.
Ko, Ker‐I. (1989). Computational Complexity of Roots of Real Functions (Extended Abstract). 204–209.
12.
Du, Ding‐Zhu & Ker‐I Ko. (1989). On the complexity of an optimal routing tree problem. Acta Mathematicae Applicatae Sinica English Series. 5(1). 68–80. 1 indexed citations
13.
Ko, Ker‐I & Harvey M. Friedman. (1988). Computing power series in polynomial time. Advances in Applied Mathematics. 9(1). 40–50. 5 indexed citations
14.
Ko, Ker‐I. (1987). On the continued fraction representation of computable real numbers. Theoretical Computer Science. 54(2-3). 341–343. 2 indexed citations
15.
Ko, Ker‐I. (1987). On helping by robust oracle machines. Theoretical Computer Science. 52(1-2). 15–36. 31 indexed citations
16.
Ko, Ker‐I. (1986). On the continued fraction representation of computable real numbers. Theoretical Computer Science. 47. 299–313. 13 indexed citations
17.
Ko, Ker‐I, Timothy J. Long, & Ding‐Zhu Du. (1986). A Note on One-Way Functions and Polynomial-Time Isomorphisms (Extended Abstract). 295–303. 1 indexed citations
18.
Ko, Ker‐I. (1985). On some natural complete operators. Theoretical Computer Science. 37. 1–30. 40 indexed citations
19.
Ko, Ker‐I. (1982). The maximum value problem and NP real numbers. Journal of Computer and System Sciences. 24(1). 15–35. 19 indexed citations
20.
Ko, Ker‐I. (1979). Computational Complexity of Real Functions and Polynomial Time Approximations. OhioLink ETD Center (Ohio Library and Information Network). 4 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 Jin‐Yi Cai Breakdown of academic impact, for papers by Gregory B. Sorkin Breakdown of academic impact, for papers by Ilan Newman Breakdown of academic impact, for papers by Luca Trevisan Breakdown of academic impact, for papers by Josep Dı́az Breakdown of academic impact, for papers by Subhash Khot Breakdown of academic impact, for papers by Yuri Rabinovich Breakdown of academic impact, for papers by Ravi B. Boppana Breakdown of academic impact, for papers by James R. Lee Breakdown of academic impact, for papers by J. Spencer
Rankless by CCL
2026