Ker-I Ko

Publication Activity (10 Years)

Years Active: 1981-2021
Publications (10 Years): 5

Top Topics

Interval Arithmetic

Hausdorff Distance

Top Venues

Theor. Comput. Sci.

J. Comb. Optim.

Publications

Ker-I Ko, Lidong Wu
On continuous one-way functions. Theor. Comput. Sci. 852 (2021)
Xin Chen, Qingqin Nong, Yan Feng, Yongchang Cao, Suning Gong, Qizhi Fang, Ker-I Ko
Centralized and decentralized rumor blocking problems. J. Comb. Optim. 34 (1) (2017)
Weian Li, Wenjing Liu, Tiantian Chen, Xiaoying Qu, Qizhi Fang, Ker-I Ko
Competitive profit maximization in social networks. Theor. Comput. Sci. 694 (2017)
Yingli Ran, Zhao Zhang, Ker-I Ko, Jun Liang
An approximation algorithm for maximum weight budgeted connected set cover. J. Comb. Optim. 31 (4) (2016)
Zhao Zhang, Jiao Zhou, Ker-I Ko, Ding-Zhu Du
Approximation Algorithm for Minimum Weight Connected m-Fold Dominating Set. CoRR (2015)
Fuxiang Yu, Ker-I Ko
On logarithmic-space computable real numbers. Theor. Comput. Sci. 469 (2013)
Fuxiang Yu, Ker-I Ko
On parallel complexity of analytic functions. Theor. Comput. Sci. (2013)
Ker-I Ko
On the complexity of computing the Hausdorff distance. J. Complex. 29 (3-4) (2013)
Andrej Bauer, Peter Hertling, Ker-I Ko
Computability and Complexity in Analysis. J. Univers. Comput. Sci. 16 (18) (2010)
Andrej Bauer, Peter Hertling, Ker-I Ko
CCA 2009 Front Matter - Proceedings of the Sixth International Conference on Computability and Complexity in Analysis. CCA (2009)
Andrej Bauer, Peter Hertling, Ker-I Ko
CCA 2009 Preface - Proceedings of the Sixth International Conference on Computability and Complexity in Analysis. CCA (2009)
Yongxi Cheng, Ding-Zhu Du, Ker-I Ko, Guohui Lin
On the Parameterized Complexity of Pooling Design. J. Comput. Biol. 16 (11) (2009)
Ker-I Ko, Fuxiang Yu
On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane. Electron. Notes Theor. Comput. Sci. 202 (2008)
Yongxi Cheng, Ker-I Ko, Weili Wu
On the complexity of non-unique probe selection. Theor. Comput. Sci. 390 (1) (2008)
Ker-I Ko, Fuxiang Yu
On the complexity of computing the logarithm and square root functions on a complex domain. J. Complex. 23 (1) (2007)
Ker-I Ko, Klaus Weihrauch, Xizhong Zheng
Editorial: Math. Log. Quart. 4-5/2007. Math. Log. Q. 53 (4-5) (2007)
Ker-I Ko, Fuxiang Yu
Jordan Curves with Polynomial Inverse Moduli of Continuity. Electron. Notes Theor. Comput. Sci. 167 (2007)
Ker-I Ko, Fuxiang Yu
Jordan curves with polynomial inverse moduli of continuity. Theor. Comput. Sci. 381 (1-3) (2007)
Vasco Brattka, Peter Hertling, Ker-I Ko, Hideki Tsuiki
Computability and complexity in analysis. J. Complex. 22 (6) (2006)
Fuxiang Yu, Arthur W. Chou, Ker-I Ko
On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain. J. Complex. 22 (6) (2006)
Ker-I Ko, Fuxiang Yu
On the Complexity of Computing the Logarithm and Square Root Functions on a Complex Domain. COCOON (2005)
Fuxiang Yu, Arthur W. Chou, Ker-I Ko
On the Complexity of Finding Circumscribed Rectangles for a Two-Dimensional Domain. CCA (2005)
Arthur W. Chou, Ker-I Ko
The computational complexity of distance functions of two-dimensional domains. Theor. Comput. Sci. 337 (1-3) (2005)
Arthur W. Chou, Ker-I Ko
On the Complexity of Finding Paths in a Two-Dimensional Domain II: Piecewise Straight-Line Paths. Electron. Notes Theor. Comput. Sci. 120 (2005)
Lu Ruan, Hongwei Du, Xiaohua Jia, Weili Wu, Yingshu Li, Ker-I Ko
A greedy approximation for minimum connected dominating sets. Theor. Comput. Sci. 329 (1-3) (2004)
Vasco Brattka, Peter Hertling, Ker-I Ko, Ning Zhong
Preface: MLQ - Math. Log. Quart. 4-5/2004. Math. Log. Q. 50 (4-5) (2004)
Arthur W. Chou, Ker-I Ko
On the complexity of finding paths in a two-dimensional domain I: Shortest paths. Math. Log. Q. 50 (6) (2004)
Ker-I Ko, Anil Nerode, Klaus Weihrauch
Foreword. Theor. Comput. Sci. 284 (2) (2002)
Ker-I Ko
On the Computability of Fractal Dimensions and Hausdorff Measure. Ann. Pure Appl. Log. 93 (1-3) (1998)
Ding-Zhu Du, Ker-I Ko
In Memoriam Ronald V. Book. Theor. Comput. Sci. 207 (1) (1998)
Ker-I Ko
Fractals and Complexity. CCA (1996)
Ker-I Ko, Klaus Weihrauch
On the Measure of Two-Dimensional Regions with Polynomial-Time computables Boundaries. Computational Complexity Conference (1996)
Ker-I Ko
A Polynomial-Time Computable Curve whose Interior has a Nonrecursive Measure. Theor. Comput. Sci. 145 (1&2) (1995)
Arthur W. Chou, Ker-I Ko
Computational Complexity of Two-Dimensional Regions. SIAM J. Comput. 24 (5) (1995)
Ker-I Ko
Computational Complexity of Fixed Points and Intersection Points. J. Complex. 11 (2) (1995)
Ker-I Ko, Chih-Long Lin
On the longest circuit in an alterable digraph. J. Glob. Optim. 7 (3) (1995)
Pekka Orponen, Ker-I Ko, Uwe Schöning, Osamu Watanabe
Instance Complexity. J. ACM 41 (1) (1994)
Arthur W. Chou, Ker-I Ko
Some complexity issues on the simply connected regions of the two-dimensional plane. STOC (1993)
Ker-I Ko
A Note on the Instance Complexity of Pseudorandom Sets. Computational Complexity Conference (1992)
Ding-Zhu Du, Ker-I Ko
A note on best fractions of a computable real number. J. Complex. 8 (3) (1992)
Ker-I Ko
On the Computational Complexity of Integral Equations. Ann. Pure Appl. Log. 58 (3) (1992)
Ker-I Ko
Separating the Low and High Hierarchies by Oracles Inf. Comput. 90 (2) (1991)
Ker-I Ko
On the Complexity of Learning Minimum Time-Bounded Turing Machines. SIAM J. Comput. 20 (5) (1991)
Ker-I Ko
On Adaptive Versus Nonadaptive Bounded Query Machines. Theor. Comput. Sci. 82 (1) (1991)
Ker-I Ko, Wen-Guey Tzeng
Three Sigma^p_2-Complete Problems in Computational Learning Theory. Comput. Complex. 1 (1991)
Ker-I Ko
Integral Equations, Systems of Quadratic Equations, and Exponential-Time Completeness (Extended Abstract) STOC (1991)
Ker-I Ko
Separating and Collapsing Results on the Relativized Probabilistic Polynomial-Time Hierarchy J. ACM 37 (2) (1990)
Ker-I Ko
On the Complexity of Learning Minimum Time-Bounded Turing Machines. COLT (1990)
Ker-I Ko, Assaf Marron, Wen-Guey Tzeng
Learning String Patterns and Tree Patterns from Examples. ML (1990)
Ker-I Ko
A note on separating the relativized polynomial time hierarchy by immune sets. RAIRO Theor. Informatics Appl. 24 (1990)
Ker-I Ko
Computational Complexity of Roots of Real Functions (Extended Abstract) FOCS (1989)
Ker-I Ko
Distinguishing Conjunctive and Disjunctive Reducibilities by Sparse Sets Inf. Comput. 81 (1) (1989)
Ker-I Ko
Relativized Polynomial Time Hierarchies Having Exactly K Levels. SIAM J. Comput. 18 (2) (1989)
Ker-I Ko
Relativized Polynominal Time Hierarchies Having Exactly K Levels STOC (1988)
Ronald V. Book, Ker-I Ko
On Sets Truth-Table Reducible to Sparse Sets. SIAM J. Comput. 17 (5) (1988)
Ker-I Ko
Relativized polynomial time hierarchies having exactly K levels. Computational Complexity Conference (1988)
Ker-I Ko
Distinguishing bounded reducibilities by sparse sets. Computational Complexity Conference (1988)
Ker-I Ko
Searching for Two Objects by Underweight Feedback. SIAM J. Discret. Math. 1 (1) (1988)
Ker-I Ko, Chin-Ming Hua
A Note on the Two-Variable Pattern-Finding Problem. J. Comput. Syst. Sci. 34 (1) (1987)
Ronald V. Book, Ker-I Ko
On sets reducible to sparse sets. Computational Complexity Conference (1987)
Ker-I Ko
On helping by robust oracle machines. Computational Complexity Conference (1987)
Assaf Marron, Ker-I Ko
Identification of Pattern Languages from Examples and Queries Inf. Comput. 74 (2) (1987)
Ker-I Ko
On Helping by Robust Oracle Machines. Theor. Comput. Sci. 52 (1987)
Ker-I Ko
Corrigenda: On the Continued Fraction Representation of Computable Real Numbers. Theor. Comput. Sci. 54 (1987)
Ker-I Ko, Pekka Orponen, Uwe Schöning, Osamu Watanabe
What Is a Hard Instance of a Computational Problem?. Computational Complexity Conference (1986)
Ker-I Ko, Timothy J. Long, Ding-Zhu Du
A Note on One- Way Functions and Polynomial Time Isomorphisms. Computational Complexity Conference (1986)
Ker-I Ko
On the Continued Fraction Representation of Computable Real Numbers. Theor. Comput. Sci. 47 (3) (1986)
Ker-I Ko, Timothy J. Long, Ding-Zhu Du
A Note on One-Way Functions and Polynomial-Time Isomorphisms (Extended Abstract) STOC (1986)
Ker-I Ko
On the computational complexity of best Chebyshev approximations. J. Complex. 2 (2) (1986)
Ker-I Ko
On the Notion of Infinite Pseudorandom Sequences. Theor. Comput. Sci. 48 (3) (1986)
Ker-I Ko, Timothy J. Long, Ding-Zhu Du
On One-Way Functions and Polynomial-Time Isomorphisms. Theor. Comput. Sci. 47 (3) (1986)
Ker-I Ko, Shia-Chung Teng
On the Number of Queries Necessary to Identify a Permutation. J. Algorithms 7 (4) (1986)
Ker-I Ko
Approximation to measurable functions and its relation to probabilistic computation. Ann. Pure Appl. Log. 30 (2) (1986)
Ker-I Ko, Uwe Schöning
On Circuit-Size Complexity and the Low Hierarchy in NP. SIAM J. Comput. 14 (1) (1985)
Ker-I Ko
Continuous optimization problems and a polynomial hierarchy of real functions. J. Complex. 1 (2) (1985)
Ker-I Ko
On Some Natural Complete Operators. Theor. Comput. Sci. 37 (1985)
Ker-I Ko
Nonlevelable Sets and Immune Sets in the Accepting Density Hierarchy in NP. Math. Syst. Theory 18 (3) (1985)
Ker-I Ko
Reducibilities on Real Numbers. Theor. Comput. Sci. 31 (1984)
Ker-I Ko
On Self-Reducibility and Weak P-Selectivity. J. Comput. Syst. Sci. 26 (2) (1983)
Ker-I Ko
On the Computational Complexity of Ordinary Differential Equations Inf. Control. 58 (1-3) (1983)
Ker-I Ko
On the Definitions of some Complexity Classes of Real Numbers. Math. Syst. Theory 16 (2) (1983)
Ker-I Ko
The Maximum Value Problem and NP Real Numbers. J. Comput. Syst. Sci. 24 (1) (1982)
Ker-I Ko
Some Observations on the Probabilistic Algorithms and NP-hard Problems. Inf. Process. Lett. 14 (1) (1982)
Ker-I Ko, Harvey Friedman
Computational Complexity of Real Functions. Theor. Comput. Sci. 20 (1982)
Ker-I Ko
Some Negative Results on the Computational Complexity of Total Variation and Differentiation Inf. Control. 53 (1/2) (1982)
Ker-I Ko, Daniel J. Moore
Completeness, Approximation and Density. SIAM J. Comput. 10 (4) (1981)