The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Ker-I Ko: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  66. CCA 2009 Front Matter - Proceedings of the Sixth International Conference on Computability and Complexity in Analysis. [Citation Graph (, )][DBLP]


  67. CCA 2009 Preface - Proceedings of the Sixth International Conference on Computability and Complexity in Analysis. [Citation Graph (, )][DBLP]


  68. On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.453secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002