Completeness, Approximation and Density. - Ker-I Ko; Daniel J. Moore (SIAM J. Comput., 1981)

Some Negative Results on the Computational Complexity of Total Variation and Differentiation - Ker-I Ko (Inf. Control., 1982)

Some Observations on the Probabilistic Algorithms and NP-hard Problems. - Ker-I Ko (Inf. Process. Lett., 1982)

The Maximum Value Problem and NP Real Numbers. - Ker-I Ko (J. Comput. Syst. Sci., 1982)

Computational Complexity of Real Functions. - Ker-I Ko; Harvey Friedman (Theor. Comput. Sci., 1982)

On the Computational Complexity of Ordinary Differential Equations - Ker-I Ko (Inf. Control., 1983)

On Self-Reducibility and Weak P-Selectivity. - Ker-I Ko (J. Comput. Syst. Sci., 1983)

On the Definitions of some Complexity Classes of Real Numbers. - Ker-I Ko (Math. Syst. Theory, 1983)

Reducibilities on Real Numbers. - Ker-I Ko (Theor. Comput. Sci., 1984)

Continuous optimization problems and a polynomial hierarchy of real functions. - Ker-I Ko (J. Complex., 1985)

Nonlevelable Sets and Immune Sets in the Accepting Density Hierarchy in NP. - Ker-I Ko (Math. Syst. Theory, 1985)

On Circuit-Size Complexity and the Low Hierarchy in NP. - Ker-I Ko; Uwe Schöning (SIAM J. Comput., 1985)

On Some Natural Complete Operators. - Ker-I Ko (Theor. Comput. Sci., 1985)

A Note on One- Way Functions and Polynomial Time Isomorphisms. - Ker-I Ko; Timothy J. Long; Ding-Zhu Du (SCT, 1986)

What Is a Hard Instance of a Computational Problem?. - Ker-I Ko; Pekka Orponen; Uwe Schöning; Osamu Watanabe 001 (SCT, 1986)

A Note on One-Way Functions and Polynomial-Time Isomorphisms (Extended Abstract) - Ker-I Ko; Timothy J. Long; Ding-Zhu Du (STOC, 1986)

Approximation to measurable functions and its relation to probabilistic computation. - Ker-I Ko (Ann. Pure Appl. Log., 1986)

On the Number of Queries Necessary to Identify a Permutation. - Ker-I Ko; Shia-Chung Teng (J. Algorithms, 1986)

On the computational complexity of best Chebyshev approximations. - Ker-I Ko (J. Complex., 1986)

On the Continued Fraction Representation of Computable Real Numbers. - Ker-I Ko (Theor. Comput. Sci., 1986)

On the Notion of Infinite Pseudorandom Sequences. - Ker-I Ko (Theor. Comput. Sci., 1986)

On One-Way Functions and Polynomial-Time Isomorphisms. - Ker-I Ko; Timothy J. Long; Ding-Zhu Du (Theor. Comput. Sci., 1986)

On sets reducible to sparse sets. - Ronald V. Book; Ker-I Ko (SCT, 1987)

A Note on the Two-Variable Pattern-Finding Problem. - Ker-I Ko; Chin-Ming Hua (J. Comput. Syst. Sci., 1987)

On Helping by Robust Oracle Machines. - Ker-I Ko (Theor. Comput. Sci., 1987)

Corrigenda: On the Continued Fraction Representation of Computable Real Numbers. - Ker-I Ko (Theor. Comput. Sci., 1987)

Identification of Pattern Languages from Examples and Queries - Assaf Marron; Ker-I Ko (Inf. Comput., 1987)

Distinguishing bounded reducibilities by sparse sets. - Ker-I Ko (SCT, 1988)

Relativized Polynominal Time Hierarchies Having Exactly K Levels - Ker-I Ko (STOC, 1988)

On Sets Truth-Table Reducible to Sparse Sets. - Ronald V. Book; Ker-I Ko (SIAM J. Comput., 1988)

Searching for Two Objects by Underweight Feedback. - Ker-I Ko (SIAM J. Discret. Math., 1988)

Computational Complexity of Roots of Real Functions (Extended Abstract) - Ker-I Ko (FOCS, 1989)

Relativized Polynomial Time Hierarchies Having Exactly K Levels. - Ker-I Ko (SIAM J. Comput., 1989)

Distinguishing Conjunctive and Disjunctive Reducibilities by Sparse Sets - Ker-I Ko (Inf. Comput., 1989)

Learning String Patterns and Tree Patterns from Examples. - Ker-I Ko; Assaf Marron; Wen-Guey Tzeng (ML, 1990)

A note on separating the relativized polynomial time hierarchy by immune sets. - Ker-I Ko (RAIRO Theor. Informatics Appl., 1990)

Separating and Collapsing Results on the Relativized Probabilistic Polynomial-Time Hierarchy - Ker-I Ko (J. ACM, 1990)

Complexity theory of real functions. - Ker-I Ko (Birkhäuser, 1991)

Complexity Theory of Real Functions. - Ker-I Ko (Birkhäuser / Springer, 1991)

Integral Equations, Systems of Quadratic Equations, and Exponential-Time Completeness (Extended Abstract) - Ker-I Ko (STOC, 1991)

Three Sigma^p_2-Complete Problems in Computational Learning Theory. - Ker-I Ko; Wen-Guey Tzeng (Comput. Complex., 1991)

On the Complexity of Learning Minimum Time-Bounded Turing Machines. - Ker-I Ko (SIAM J. Comput., 1991)

On Adaptive Versus Nonadaptive Bounded Query Machines. - Ker-I Ko (Theor. Comput. Sci., 1991)

Separating the Low and High Hierarchies by Oracles - Ker-I Ko (Inf. Comput., 1991)

A Note on the Instance Complexity of Pseudorandom Sets. - Ker-I Ko (SCT, 1992)

On the Computational Complexity of Integral Equations. - Ker-I Ko (Ann. Pure Appl. Log., 1992)

A note on best fractions of a computable real number. - Ding-Zhu Du; Ker-I Ko (J. Complex., 1992)

Some complexity issues on the simply connected regions of the two-dimensional plane. - Arthur W. Chou; Ker-I Ko (STOC, 1993)

Instance Complexity. - Pekka Orponen; Ker-I Ko; Uwe Schöning; Osamu Watanabe 001 (J. ACM, 1994)

Computational Complexity of Fixed Points and Intersection Points. - Ker-I Ko (J. Complex., 1995)

On the longest circuit in an alterable digraph. - Ker-I Ko; Chih-Long Lin (J. Glob. Optim., 1995)

Computational Complexity of Two-Dimensional Regions. - Arthur W. Chou; Ker-I Ko (SIAM J. Comput., 1995)

A Polynomial-Time Computable Curve whose Interior has a Nonrecursive Measure. - Ker-I Ko (Theor. Comput. Sci., 1995)

Fractals and Complexity. - Ker-I Ko (CCA, 1996)

On the Measure of Two-Dimensional Regions with Polynomial-Time computables Boundaries. - Ker-I Ko; Klaus Weihrauch (CCC, 1996)

On the Computability of Fractal Dimensions and Hausdorff Measure. - Ker-I Ko (Ann. Pure Appl. Log., 1998)

In Memoriam Ronald V. Book. - Ding-Zhu Du; Ker-I Ko (Theor. Comput. Sci., 1998)

Foreword. - Ker-I Ko; Anil Nerode; Klaus Weihrauch (Theor. Comput. Sci., 2002)

On the Complexity of Finding Paths in a Two-Dimensional Domain II: Piecewise Straight-Line Paths. - Arthur W. Chou; Ker-I Ko (CCA, 2004)

Preface: MLQ - Math. Log. Quart. 4-5/2004. - Vasco Brattka; Peter Hertling; Ker-I Ko; Ning Zhong 002 (Math. Log. Q., 2004)

On the complexity of finding paths in a two-dimensional domain I: Shortest paths. - Arthur W. Chou; Ker-I Ko (Math. Log. Q., 2004)

A greedy approximation for minimum connected dominating sets. - Lu Ruan 001; Hongwei Du 001; Xiaohua Jia; Weili Wu 001; Yingshu Li; Ker-I Ko (Theor. Comput. Sci., 2004)

On the Complexity of Finding Circumscribed Rectangles for a Two-Dimensional Domain. - Fuxiang Yu; Arthur W. Chou; Ker-I Ko (CCA, 2005)

The computational complexity of distance functions of two-dimensional domains. - Arthur W. Chou; Ker-I Ko (Theor. Comput. Sci., 2005)

Computability and complexity in analysis. - Vasco Brattka; Peter Hertling; Ker-I Ko; Hideki Tsuiki (J. Complex., 2006)

On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain. - Fuxiang Yu; Arthur W. Chou; Ker-I Ko (J. Complex., 2006)

On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane. - Ker-I Ko; Fuxiang Yu (CCA, 2007)

On the complexity of computing the logarithm and square root functions on a complex domain. - Ker-I Ko; Fuxiang Yu (J. Complex., 2007)

Editorial: Math. Log. Quart. 4-5/2007. - Ker-I Ko; Klaus Weihrauch; Xizhong Zheng (Math. Log. Q., 2007)

Jordan curves with polynomial inverse moduli of continuity. - Ker-I Ko; Fuxiang Yu (Theor. Comput. Sci., 2007)

On the complexity of non-unique probe selection. - Yongxi Cheng; Ker-I Ko; Weili Wu 001 (Theor. Comput. Sci., 2008)

CCA 2009 Front Matter - Proceedings of the Sixth International Conference on Computability and Complexity in Analysis. - Andrej Bauer; Peter Hertling; Ker-I Ko (CCA, 2009)

CCA 2009 Preface - Proceedings of the Sixth International Conference on Computability and Complexity in Analysis. - Andrej Bauer; Peter Hertling; Ker-I Ko (CCA, 2009)

On the Parameterized Complexity of Pooling Design. - Yongxi Cheng; Ding-Zhu Du; Ker-I Ko; Guohui Lin (J. Comput. Biol., 2009)

Computability and Complexity in Analysis. - Andrej Bauer; Peter Hertling; Ker-I Ko (J. Univers. Comput. Sci., 2010)

On the complexity of computing the Hausdorff distance. - Ker-I Ko (J. Complex., 2013)

On logarithmic-space computable real numbers. - Fuxiang Yu; Ker-I Ko (Theor. Comput. Sci., 2013)

On parallel complexity of analytic functions. - Fuxiang Yu; Ker-I Ko (Theor. Comput. Sci., 2013)

Approximation Algorithm for Minimum Weight Connected m-Fold Dominating Set. - Zhao Zhang 002; Jiao Zhou; Ker-I Ko; Ding-Zhu Du (CoRR, 2015)

An approximation algorithm for maximum weight budgeted connected set cover. - Yingli Ran; Zhao Zhang 002; Ker-I Ko; Jun Liang (J. Comb. Optim., 2016)

Centralized and decentralized rumor blocking problems. - Xin Chen; Qingqin Nong; Yan Feng; Yongchang Cao; Suning Gong; Qizhi Fang; Ker-I Ko (J. Comb. Optim., 2017)

Competitive profit maximization in social networks. - Weian Li; Wenjing Liu; Tiantian Chen; Xiaoying Qu; Qizhi Fang; Ker-I Ko (Theor. Comput. Sci., 2017)

On continuous one-way functions. - Ker-I Ko; Lidong Wu (Theor. Comput. Sci., 2021)