Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Ker-I Ko
2010 – today
- 2013
[j58]Fuxiang Yu, Ker-I Ko: On logarithmic-space computable real numbers. Theor. Comput. Sci. 469: 127-133 (2013)- [j57]Fuxiang Yu, Ker-I Ko: On parallel complexity of analytic functions. Theor. Comput. Sci. 489-490: 48-57 (2013)
- 2010
- [j56]Andrej Bauer, Peter Hertling, Ker-I Ko: Computability and Complexity in Analysis. J. UCS 16(18): 2495 (2010)
2000 – 2009
- 2009
- [j55]Yongxi Cheng, Ding-Zhu Du, Ker-I Ko, Guohui Lin: On the Parameterized Complexity of Pooling Design. Journal of Computational Biology 16(11): 1529-1537 (2009)
- [c20]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
- [c19]Andrej Bauer, Peter Hertling, Ker-I Ko: CCA 2009 Preface - Proceedings of the Sixth International Conference on Computability and Complexity in Analysis. CCA 2009
- [e1]Andrej Bauer, Peter Hertling, Ker-I Ko (Eds.): Sixth International Conference on Computability and Complexity in Analysis, CCA 2009, August 18-22, 2009, Ljubljana, Slovenia. OASICS 11, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany 2009
- 2008
- [j54]Ker-I Ko, Fuxiang Yu: On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane. Electr. Notes Theor. Comput. Sci. 202: 121-135 (2008)
- [j53]Yongxi Cheng, Ker-I Ko, Weili Wu: On the complexity of non-unique probe selection. Theor. Comput. Sci. 390(1): 120-125 (2008)
- 2007
- [j52]Ker-I Ko, Fuxiang Yu: Jordan Curves with Polynomial Inverse Moduli of Continuity. Electr. Notes Theor. Comput. Sci. 167: 425-447 (2007)
- [j51]Ker-I Ko, Fuxiang Yu: On the complexity of computing the logarithm and square root functions on a complex domain. J. Complexity 23(1): 2-24 (2007)
- [j50]Ker-I Ko, Klaus Weihrauch, Xizhong Zheng: Editorial: Math. Log. Quart. 4-5/2007. Math. Log. Q. 53(4-5): 325 (2007)
- [j49]Ker-I Ko, Fuxiang Yu: Jordan curves with polynomial inverse moduli of continuity. Theor. Comput. Sci. 381(1-3): 148-161 (2007)
- 2006
- [j48]Vasco Brattka, Peter Hertling, Ker-I Ko, Hideki Tsuiki: Computability and complexity in analysis. J. Complexity 22(6): 728 (2006)
- [j47]Fuxiang Yu, Arthur W. Chou, Ker-I Ko: On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain. J. Complexity 22(6): 803-817 (2006)
- 2005
- [j46]Arthur W. Chou, Ker-I Ko: On the Complexity of Finding Paths in a Two-Dimensional Domain II: Piecewise Straight-Line Paths. Electr. Notes Theor. Comput. Sci. 120: 45-57 (2005)
- [j45]Arthur W. Chou, Ker-I Ko: The computational complexity of distance functions of two-dimensional domains. Theor. Comput. Sci. 337(1-3): 360-369 (2005)
- [c18]Fuxiang Yu, Arthur W. Chou, Ker-I Ko: On the Complexity of Finding Circumscribed Rectangles for a Two-Dimensional Domain. CCA 2005: 341-355
- [c17]Ker-I Ko, Fuxiang Yu: On the Complexity of Computing the Logarithm and Square Root Functions on a Complex Domain. COCOON 2005: 349-358
- 2004
- [j44]Vasco Brattka, Peter Hertling, Ker-I Ko, Ning Zhong: Preface: MLQ - Math. Log. Quart. 4-5/2004. Math. Log. Q. 50(4-5): 327-328 (2004)
- [j43]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): 551-572 (2004)
- [j42]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): 325-330 (2004)
- 2002
- [j41]
1990 – 1999
- 1998
- [j40]Ker-I Ko: On the Computability of Fractal Dimensions and Hausdorff Measure. Ann. Pure Appl. Logic 93(1-3): 195-216 (1998)
- [j39]
- 1996
- [c16]
- [c15]Ker-I Ko, Klaus Weihrauch: On the Measure of Two-Dimensional Regions with Polynomial-Time computables Boundaries. IEEE Conference on Computational Complexity 1996: 150-159
- 1995
- [j38]Ker-I Ko: Computational Complexity of Fixed Points and Intersection Points. J. Complexity 11(2): 265-292 (1995)
- [j37]Arthur W. Chou, Ker-I Ko: Computational Complexity of Two-Dimensional Regions. SIAM J. Comput. 24(5): 923-947 (1995)
- [j36]Ker-I Ko: A Polynomial-Time Computable Curve whose Interior has a Nonrecursive Measure. Theor. Comput. Sci. 145(1&2): 241-270 (1995)
- 1994
- [j35]Pekka Orponen, Ker-I Ko, Uwe Schöning, Osamu Watanabe: Instance Complexity. J. ACM 41(1): 96-121 (1994)
- 1993
- [c14]Arthur W. Chou, Ker-I Ko: Some complexity issues on the simply connected regions of the two-dimensional plane. STOC 1993: 1-10
- 1992
- [j34]Ker-I Ko: On the Computational Complexity of Integral Equations. Ann. Pure Appl. Logic 58(3): 201-228 (1992)
- [j33]Ding-Zhu Du, Ker-I Ko: A note on best fractions of a computable real number. J. Complexity 8(3): 216-229 (1992)
- [c13]Ker-I Ko: A Note on the Instance Complexity of Pseudorandom Sets. Structure in Complexity Theory Conference 1992: 327-337
- 1991
- [j32]Ker-I Ko, Wen-Guey Tzeng: Three Sigma^p_2-Complete Problems in Computational Learning Theory. Computational Complexity 1: 269-310 (1991)
- [j31]
- [j30]Ker-I Ko: On the Complexity of Learning Minimum Time-Bounded Turing Machines. SIAM J. Comput. 20(5): 962-986 (1991)
- [j29]Ker-I Ko: On Adaptive Versus Nonadaptive Bounded Query Machines. Theor. Comput. Sci. 82(1): 51-69 (1991)
- [c12]Ker-I Ko: Integral Equations, Systems of Quadratic Equations, and Exponential-Time Completeness (Extended Abstract). STOC 1991: 10-20
- 1990
- [j28]Ker-I Ko: A note on separating the relativized polynomial time hierarchy by immune sets. ITA 24: 229-240 (1990)
- [j27]Ker-I Ko: Separating and Collapsing Results on the Relativized Probabilistic Polynomial-Time Hierarchy. J. ACM 37(2): 415-438 (1990)
- [c11]
- [c10]Ker-I Ko, Assaf Marron, Wen-Guey Tzeng: Learning String Patterns and Tree Patterns from Examples. ML 1990: 384-391
1980 – 1989
- 1989
- [j26]Ker-I Ko: Distinguishing Conjunctive and Disjunctive Reducibilities by Sparse Sets. Inf. Comput. 81(1): 62-87 (1989)
- [j25]Ker-I Ko: Relativized Polynomial Time Hierarchies Having Exactly K Levels. SIAM J. Comput. 18(2): 392-408 (1989)
- [c9]Ker-I Ko: Computational Complexity of Roots of Real Functions (Extended Abstract). FOCS 1989: 204-209
- 1988
- [j24]Ronald V. Book, Ker-I Ko: On Sets Truth-Table Reducible to Sparse Sets. SIAM J. Comput. 17(5): 903-919 (1988)
- [j23]Ker-I Ko: Searching for Two Objects by Underweight Feedback. SIAM J. Discrete Math. 1(1): 65-70 (1988)
- [c8]Ker-I Ko: Relativized polynomial time hierarchies having exactly K levels. Structure in Complexity Theory Conference 1988
- [c7]Ker-I Ko: Distinguishing bounded reducibilities by sparse sets. Structure in Complexity Theory Conference 1988: 181-191
- [c6]
- 1987
- [j22]Assaf Marron, Ker-I Ko: Identification of Pattern Languages from Examples and Queries. Inf. Comput. 74(2): 91-112 (1987)
- [j21]Ker-I Ko, Chin-Ming Hua: A Note on the Two-Variable Pattern-Finding Problem. J. Comput. Syst. Sci. 34(1): 75-86 (1987)
- [j20]
- [j19]Ker-I Ko: Corrigenda: On the Continued Fraction Representation of Computable Real Numbers. Theor. Comput. Sci. 54: 341-343 (1987)
- [c5]Ronald V. Book, Ker-I Ko: On sets reducible to sparse sets. Structure in Complexity Theory Conference 1987
- [c4]
- 1986
- [j18]Ker-I Ko, Shia-Chung Teng: On the Number of Queries Necessary to Identify a Permutation. J. Algorithms 7(4): 449-462 (1986)
- [j17]Ker-I Ko: On the computational complexity of best Chebyshev approximations. J. Complexity 2(2): 95-120 (1986)
- [j16]Ker-I Ko, Timothy J. Long, Ding-Zhu Du: On One-Way Functions and Polynomial-Time Isomorphisms. Theor. Comput. Sci. 47(3): 263-276 (1986)
- [j15]Ker-I Ko: On the Continued Fraction Representation of Computable Real Numbers. Theor. Comput. Sci. 47(3): 299-313 (1986)
- [j14]
- [c3]Ker-I Ko, Timothy J. Long, Ding-Zhu Du: A Note on One- Way Functions and Polynomial Time Isomorphisms. Structure in Complexity Theory Conference 1986: 196-196
- [c2]Ker-I Ko, Pekka Orponen, Uwe Schöning, Osamu Watanabe: What Is a Hard Instance of a Computational Problem?. Structure in Complexity Theory Conference 1986: 197-217
- [c1]Ker-I Ko, Timothy J. Long, Ding-Zhu Du: A Note on One-Way Functions and Polynomial-Time Isomorphisms (Extended Abstract). STOC 1986: 295-303
- 1985
- [j13]Ker-I Ko: Continuous optimization problems and a polynomial hierarchy of real functions. J. Complexity 1(2): 210-231 (1985)
- [j12]Ker-I Ko: Nonlevelable Sets and Immune Sets in the Accepting Density Hierarchy in NP. Mathematical Systems Theory 18(3): 189-205 (1985)
- [j11]Ker-I Ko, Uwe Schöning: On Circuit-Size Complexity and the Low Hierarchy in NP. SIAM J. Comput. 14(1): 41-51 (1985)
- [j10]
- 1984
- [j9]
- 1983
- [j8]Ker-I Ko: On the Computational Complexity of Ordinary Differential Equations. Information and Control 58(1-3): 157-194 (1983)
- [j7]
- [j6]Ker-I Ko: On the Definitions of some Complexity Classes of Real Numbers. Mathematical Systems Theory 16(2): 95-109 (1983)
- 1982
- [j5]Ker-I Ko: Some Negative Results on the Computational Complexity of Total Variation and Differentiation. Information and Control 53(1/2): 21-31 (1982)
- [j4]Ker-I Ko: Some Observations on the Probabilistic Algorithms and NP-hard Problems. Inf. Process. Lett. 14(1): 39-43 (1982)
- [j3]
- [j2]Ker-I Ko, Harvey Friedman: Computational Complexity of Real Functions. Theor. Comput. Sci. 20: 323-352 (1982)
- 1981
- [j1]Ker-I Ko, Daniel J. Moore: Completeness, Approximation and Density. SIAM J. Comput. 10(4): 787-796 (1981)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18 22:44 CEST by the dblp team