Statistics
Publications
45
Citations
2.1K
H-Index
23
Active since
1981
Ker‐I Ko is an author at Stony Brook University specializing in computer science, mathematics, and theory of computation.
Publications per year
1981–2016
45
45
Computational complexity of real functions
Ker‐I Ko, Harvey M. Friedman · Theoretical Computer Science · 1982 · 271 citations
A greedy approximation for minimum connected dominating sets
Lu Ruan, Hongwei Du, Xiaohua Jia et al. · Theoretical Computer Science · 2004 · 224 citations
On self-reducibility and weak P-selectivity
Ker‐I Ko · Journal of Computer and System Sciences · 1983 · 150 citations
On Circuit-Size Complexity and the Low Hierarchy in NP
Ker‐I Ko, Uwe Schöning · SIAM Journal on Computing · 1985 · 91 citations
Completeness, Approximation and Density
Ker‐I Ko, D. Moore · SIAM Journal on Computing · 1981 · 88 citations
1–5 of 45