dblp.uni-trier.dewww.uni-trier.de

Ker-I Ko

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
68EEKer-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)
67EEYongxi Cheng, Ker-I Ko, Weili Wu: On the complexity of non-unique probe selection. Theor. Comput. Sci. 390(1): 120-125 (2008)
2007
66EEKer-I Ko, Fuxiang Yu: Jordan Curves with Polynomial Inverse Moduli of Continuity. Electr. Notes Theor. Comput. Sci. 167: 425-447 (2007)
65EEKer-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)
64EEKer-I Ko, Klaus Weihrauch, Xizhong Zheng: Editorial: Math. Log. Quart. 4-5/2007. Math. Log. Q. 53(4-5): 325 (2007)
63EEKer-I Ko, Fuxiang Yu: Jordan curves with polynomial inverse moduli of continuity. Theor. Comput. Sci. 381(1-3): 148-161 (2007)
2006
62EEVasco Brattka, Peter Hertling, Ker-I Ko, Hideki Tsuiki: Computability and complexity in analysis. J. Complexity 22(6): 728 (2006)
61EEFuxiang 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
60 Fuxiang Yu, Arthur W. Chou, Ker-I Ko: On the Complexity of Finding Circumscribed Rectangles for a Two-Dimensional Domain. CCA 2005: 341-355
59EEKer-I Ko, Fuxiang Yu: On the Complexity of Computing the Logarithm and Square Root Functions on a Complex Domain. COCOON 2005: 349-358
58EEArthur 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)
57EEArthur W. Chou, Ker-I Ko: The computational complexity of distance functions of two-dimensional domains. Theor. Comput. Sci. 337(1-3): 360-369 (2005)
2004
56EEVasco 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)
55EEArthur 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)
54EELu 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
53EEKer-I Ko, Anil Nerode, Klaus Weihrauch: Foreword. Theor. Comput. Sci. 284(2): 197 (2002)
1998
52 Ker-I Ko: On the Computability of Fractal Dimensions and Hausdorff Measure. Ann. Pure Appl. Logic 93(1-3): 195-216 (1998)
51 Ding-Zhu Du, Ker-I Ko: In Memoriam Ronald V. Book. Theor. Comput. Sci. 207(1): 1-3 (1998)
1996
50EEKer-I Ko: Fractals and Complexity. CCA 1996
49EEKer-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
48EEKer-I Ko: Computational Complexity of Fixed Points and Intersection Points. J. Complexity 11(2): 265-292 (1995)
47 Arthur W. Chou, Ker-I Ko: Computational Complexity of Two-Dimensional Regions. SIAM J. Comput. 24(5): 923-947 (1995)
46EEKer-I Ko: A Polynomial-Time Computable Curve whose Interior has a Nonrecursive Measure. Theor. Comput. Sci. 145(1&2): 241-270 (1995)
1994
45EEPekka Orponen, Ker-I Ko, Uwe Schöning, Osamu Watanabe: Instance Complexity. J. ACM 41(1): 96-121 (1994)
1993
44EEArthur W. Chou, Ker-I Ko: Some complexity issues on the simply connected regions of the two-dimensional plane. STOC 1993: 1-10
1992
43 Ker-I Ko: A Note on the Instance Complexity of Pseudorandom Sets. Structure in Complexity Theory Conference 1992: 327-337
42 Ker-I Ko: On the Computational Complexity of Integral Equations. Ann. Pure Appl. Logic 58(3): 201-228 (1992)
41EEDing-Zhu Du, Ker-I Ko: A note on best fractions of a computable real number. J. Complexity 8(3): 216-229 (1992)
1991
40 Ker-I Ko: Integral Equations, Systems of Quadratic Equations, and Exponential-Time Completeness (Extended Abstract) STOC 1991: 10-20
39 Ker-I Ko, Wen-Guey Tzeng: Three Sigma^p_2-Complete Problems in Computational Learning Theory. Computational Complexity 1: 269-310 (1991)
38 Ker-I Ko: Separating the Low and High Hierarchies by Oracles Inf. Comput. 90(2): 156-177 (1991)
37 Ker-I Ko: On the Complexity of Learning Minimum Time-Bounded Turing Machines. SIAM J. Comput. 20(5): 962-986 (1991)
36 Ker-I Ko: On Adaptive Versus Nonadaptive Bounded Query Machines. Theor. Comput. Sci. 82(1): 51-69 (1991)
1990
35EEKer-I Ko: On the Complexity of Learning Minimum Time-Bounded Turing Machines. COLT 1990: 82-96
34 Ker-I Ko, Assaf Marron, Wen-Guey Tzeng: Learning String Patterns and Tree Patterns from Examples. ML 1990: 384-391
33 Ker-I Ko: A note on separating the relativized polynomial time hierarchy by immune sets. ITA 24: 229-240 (1990)
32EEKer-I Ko: Separating and Collapsing Results on the Relativized Probabilistic Polynomial-Time Hierarchy J. ACM 37(2): 415-438 (1990)
1989
31 Ker-I Ko: Computational Complexity of Roots of Real Functions (Extended Abstract) FOCS 1989: 204-209
30 Ker-I Ko: Distinguishing Conjunctive and Disjunctive Reducibilities by Sparse Sets Inf. Comput. 81(1): 62-87 (1989)
29 Ker-I Ko: Relativized Polynomial Time Hierarchies Having Exactly K Levels. SIAM J. Comput. 18(2): 392-408 (1989)
1988
28 Ker-I Ko: Relativized Polynominal Time Hierarchies Having Exactly K Levels STOC 1988: 245-253
27 Ronald V. Book, Ker-I Ko: On Sets Truth-Table Reducible to Sparse Sets. SIAM J. Comput. 17(5): 903-919 (1988)
26 Ker-I Ko: Searching for Two Objects by Underweight Feedback. SIAM J. Discrete Math. 1(1): 65-70 (1988)
1987
25 Assaf Marron, Ker-I Ko: Identification of Pattern Languages from Examples and Queries Inf. Comput. 74(2): 91-112 (1987)
24 Ker-I Ko, Chin-Ming Hua: A Note on the Two-Variable Pattern-Finding Problem. J. Comput. Syst. Sci. 34(1): 75-86 (1987)
23 Ker-I Ko: On Helping by Robust Oracle Machines. Theor. Comput. Sci. 52: 15-36 (1987)
22 Ker-I Ko: Corrigenda: On the Continued Fraction Representation of Computable Real Numbers. Theor. Comput. Sci. 54: 341-343 (1987)
1986
21 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
20 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
19 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
18 Ker-I Ko, Shia-Chung Teng: On the Number of Queries Necessary to Identify a Permutation. J. Algorithms 7(4): 449-462 (1986)
17EEKer-I Ko: On the computational complexity of best Chebyshev approximations. J. Complexity 2(2): 95-120 (1986)
16 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)
15 Ker-I Ko: On the Continued Fraction Representation of Computable Real Numbers. Theor. Comput. Sci. 47(3): 299-313 (1986)
14 Ker-I Ko: On the Notion of Infinite Pseudorandom Sequences. Theor. Comput. Sci. 48(3): 9-33 (1986)
1985
13EEKer-I Ko: Continuous optimization problems and a polynomial hierarchy of real functions. J. Complexity 1(2): 210-231 (1985)
12 Ker-I Ko: Nonlevelable Sets and Immune Sets in the Accepting Density Hierarchy in NP. Mathematical Systems Theory 18(3): 189-205 (1985)
11 Ker-I Ko, Uwe Schöning: On Circuit-Size Complexity and the Low Hierarchy in NP. SIAM J. Comput. 14(1): 41-51 (1985)
10 Ker-I Ko: On Some Natural Complete Operators. Theor. Comput. Sci. 37: 1-30 (1985)
1984
9 Ker-I Ko: Reducibilities on Real Numbers. Theor. Comput. Sci. 31: 101-123 (1984)
1983
8 Ker-I Ko: On the Computational Complexity of Ordinary Differential Equations Information and Control 58(1-3): 157-194 (1983)
7 Ker-I Ko: On Self-Reducibility and Weak P-Selectivity. J. Comput. Syst. Sci. 26(2): 209-221 (1983)
6 Ker-I Ko: On the Definitions of some Complexity Classes of Real Numbers. Mathematical Systems Theory 16(2): 95-109 (1983)
1982
5 Ker-I Ko: Some Observations on the Probabilistic Algorithms and NP-hard Problems. Inf. Process. Lett. 14(1): 39-43 (1982)
4 Ker-I Ko: Some Negative Results on the Computational Complexity of Total Variation and Differentiation Information and Control 53(1/2): 21-31 (1982)
3 Ker-I Ko: The Maximum Value Problem and NP Real Numbers. J. Comput. Syst. Sci. 24(1): 15-35 (1982)
2 Ker-I Ko, Harvey Friedman: Computational Complexity of Real Functions. Theor. Comput. Sci. 20: 323-352 (1982)
1981
1 Ker-I Ko, Daniel J. Moore: Completeness, Approximation and Density. SIAM J. Comput. 10(4): 787-796 (1981)

Coauthor Index

1Ronald V. Book [27]
2Vasco Brattka [56] [62]
3Yongxi Cheng [67]
4Arthur W. Chou [44] [47] [55] [57] [58] [60] [61]
5Ding-Zhu Du [16] [20] [21] [41] [51]
6Hongwei Du (David Hongwei Du) [54]
7Harvey M. Friedman (Harvey Friedman) [2]
8Peter Hertling [56] [62]
9Chin-Ming Hua [24]
10Xiaohua Jia [54]
11Yingshu Li [54]
12Timothy J. Long [16] [20] [21]
13Assaf Marron [25] [34]
14Daniel J. Moore [1]
15Anil Nerode [53]
16Pekka Orponen [19] [45]
17Lu Ruan [54]
18Uwe Schöning [11] [19] [45]
19Shia-Chung Teng [18]
20Hideki Tsuiki [62]
21Wen-Guey Tzeng [34] [39]
22Osamu Watanabe [19] [45]
23Klaus Weihrauch [49] [53] [64]
24Weili Wu [54] [67]
25Fuxiang Yu [59] [60] [61] [63] [65] [66] [68]
26Xizhong Zheng [64]
27Ning Zhong [56]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)