Ker-I Ko

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