default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKer-I Ko
Person information
- affiliation: National Chiao Tung University, Hsinchu, Taiwan
- affiliation: State University of New York at Stony Brook, NY, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j62]Ker-I Ko, Lidong Wu:
On continuous one-way functions. Theor. Comput. Sci. 852: 1-17 (2021)
2010 – 2019
- 2017
- [j61]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): 314-329 (2017) - [j60]Weian Li, Wenjing Liu, Tiantian Chen, Xiaoying Qu, Qizhi Fang, Ker-I Ko:
Competitive profit maximization in social networks. Theor. Comput. Sci. 694: 1-9 (2017) - 2016
- [j59]Yingli Ran, Zhao Zhang, Ker-I Ko, Jun Liang:
An approximation algorithm for maximum weight budgeted connected set cover. J. Comb. Optim. 31(4): 1505-1517 (2016) - 2015
- [i1]Zhao Zhang, Jiao Zhou, Ker-I Ko, Ding-Zhu Du:
Approximation Algorithm for Minimum Weight Connected m-Fold Dominating Set. CoRR abs/1510.05886 (2015) - 2013
- [j58]Ker-I Ko:
On the complexity of computing the Hausdorff distance. J. Complex. 29(3-4): 248-262 (2013) - [j57]Fuxiang Yu, Ker-I Ko:
On logarithmic-space computable real numbers. Theor. Comput. Sci. 469: 127-133 (2013) - [j56]Fuxiang Yu, Ker-I Ko:
On parallel complexity of analytic functions. Theor. Comput. Sci. 489-490: 48-57 (2013) - 2010
- [j55]Andrej Bauer, Peter Hertling, Ker-I Ko:
Computability and Complexity in Analysis. J. Univers. Comput. Sci. 16(18): 2495 (2010)
2000 – 2009
- 2009
- [j54]Yongxi Cheng, Ding-Zhu Du, Ker-I Ko, Guohui Lin:
On the Parameterized Complexity of Pooling Design. J. Comput. Biol. 16(11): 1529-1537 (2009) - [c23]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 - [c22]Andrej Bauer, Peter Hertling, Ker-I Ko:
CCA 2009 Preface - Proceedings of the Sixth International Conference on Computability and Complexity in Analysis. CCA 2009 - [e3]Andrej Bauer, Peter Hertling, Ker-I Ko:
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 [contents] - 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:
On the complexity of computing the logarithm and square root functions on a complex domain. J. Complex. 23(1): 2-24 (2007) - [j51]Ker-I Ko, Klaus Weihrauch, Xizhong Zheng:
Editorial: Math. Log. Quart. 4-5/2007. Math. Log. Q. 53(4-5): 325 (2007) - [j50]Ker-I Ko, Fuxiang Yu:
Jordan curves with polynomial inverse moduli of continuity. Theor. Comput. Sci. 381(1-3): 148-161 (2007) - [c21]Ker-I Ko, Fuxiang Yu:
On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane. CCA 2007: 121-135 - 2006
- [j49]Vasco Brattka, Peter Hertling, Ker-I Ko, Hideki Tsuiki:
Computability and complexity in analysis. J. Complex. 22(6): 728 (2006) - [j48]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): 803-817 (2006) - [c20]Ker-I Ko, Fuxiang Yu:
Jordan Curves with Polynomial Inverse Moduli of Continuity. CCA 2006: 425-447 - 2005
- [j47]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) - [c19]Fuxiang Yu, Arthur W. Chou, Ker-I Ko:
On the Complexity of Finding Circumscribed Rectangles for a Two-Dimensional Domain. CCA 2005: 341-355 - [c18]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
- [j46]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) - [j45]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) - [j44]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) - [c17]Arthur W. Chou, Ker-I Ko:
On the Complexity of Finding Paths in a Two-Dimensional Domain II: Piecewise Straight-Line Paths. CCA 2004: 45-57 - 2002
- [j43]Ker-I Ko, Anil Nerode, Klaus Weihrauch:
Foreword. Theor. Comput. Sci. 284(2): 197 (2002)
1990 – 1999
- 1998
- [j42]Ker-I Ko:
On the Computability of Fractal Dimensions and Hausdorff Measure. Ann. Pure Appl. Log. 93(1-3): 195-216 (1998) - [j41]Ding-Zhu Du, Ker-I Ko:
In Memoriam Ronald V. Book. Theor. Comput. Sci. 207(1): 1-3 (1998) - 1997
- [e2]Ding-Zhu Du, Ker-I Ko:
Advances in Algorithms, Languages, and Complexity - In Honor of Ronald V. Book. Kluwer 1997, ISBN 0-7923-4396-4 [contents] - 1996
- [c16]Ker-I Ko:
Fractals and Complexity. CCA 1996 - [c15]Ker-I Ko, Klaus Weihrauch:
On the Measure of Two-Dimensional Regions with Polynomial-Time computables Boundaries. CCC 1996: 150-159 - [e1]Ker-I Ko, Norbert Th. Müller, Klaus Weihrauch:
Second Workshop on Computability and Complexity in Analysis, CCA 1996, August 22-23, 1996, Trier, Germany. Technical Report TR 96-44, Unjiversity of Trier 1996 [contents] - 1995
- [j40]Ker-I Ko:
Computational Complexity of Fixed Points and Intersection Points. J. Complex. 11(2): 265-292 (1995) - [j39]Ker-I Ko, Chih-Long Lin:
On the longest circuit in an alterable digraph. J. Glob. Optim. 7(3): 279-295 (1995) - [j38]Arthur W. Chou, Ker-I Ko:
Computational Complexity of Two-Dimensional Regions. SIAM J. Comput. 24(5): 923-947 (1995) - [j37]Ker-I Ko:
A Polynomial-Time Computable Curve whose Interior has a Nonrecursive Measure. Theor. Comput. Sci. 145(1&2): 241-270 (1995) - 1994
- [j36]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
- [j35]Ker-I Ko:
On the Computational Complexity of Integral Equations. Ann. Pure Appl. Log. 58(3): 201-228 (1992) - [j34]Ding-Zhu Du, Ker-I Ko:
A note on best fractions of a computable real number. J. Complex. 8(3): 216-229 (1992) - [c13]Ker-I Ko:
A Note on the Instance Complexity of Pseudorandom Sets. SCT 1992: 327-337 - 1991
- [b2]Ker-I Ko:
Complexity theory of real functions. Progress in theoretical computer science 3, Birkhäuser 1991, ISBN 978-0-8176-3586-2, pp. I-VIII, 1-309 - [b1]Ker-I Ko:
Complexity Theory of Real Functions. Birkhäuser / Springer 1991, ISBN 978-1-4684-6802-1 - [j33]Ker-I Ko, Wen-Guey Tzeng:
Three Sigma^p_2-Complete Problems in Computational Learning Theory. Comput. Complex. 1: 269-310 (1991) - [j32]Ker-I Ko:
Separating the Low and High Hierarchies by Oracles. Inf. Comput. 90(2): 156-177 (1991) - [j31]Ker-I Ko:
On the Complexity of Learning Minimum Time-Bounded Turing Machines. SIAM J. Comput. 20(5): 962-986 (1991) - [j30]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
- [j29]Ker-I Ko:
A note on separating the relativized polynomial time hierarchy by immune sets. RAIRO Theor. Informatics Appl. 24: 229-240 (1990) - [j28]Ker-I Ko:
Separating and Collapsing Results on the Relativized Probabilistic Polynomial-Time Hierarchy. J. ACM 37(2): 415-438 (1990) - [c11]Ker-I Ko:
On the Complexity of Learning Minimum Time-Bounded Turing Machines. COLT 1990: 82-96 - [c10]Ker-I Ko, Assaf Marron, Wen-Guey Tzeng:
Learning String Patterns and Tree Patterns from Examples. ML 1990: 384-391
1980 – 1989
- 1989
- [j27]Ker-I Ko:
Distinguishing Conjunctive and Disjunctive Reducibilities by Sparse Sets. Inf. Comput. 81(1): 62-87 (1989) - [j26]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
- [j25]Ronald V. Book, Ker-I Ko:
On Sets Truth-Table Reducible to Sparse Sets. SIAM J. Comput. 17(5): 903-919 (1988) - [j24]Ker-I Ko:
Searching for Two Objects by Underweight Feedback. SIAM J. Discret. Math. 1(1): 65-70 (1988) - [c8]Ker-I Ko:
Relativized polynomial time hierarchies having exactly K levels. SCT 1988 - [c7]Ker-I Ko:
Distinguishing bounded reducibilities by sparse sets. SCT 1988: 181-191 - [c6]Ker-I Ko:
Relativized Polynominal Time Hierarchies Having Exactly K Levels. STOC 1988: 245-253 - 1987
- [j23]Assaf Marron, Ker-I Ko:
Identification of Pattern Languages from Examples and Queries. Inf. Comput. 74(2): 91-112 (1987) - [j22]Ker-I Ko, Chin-Ming Hua:
A Note on the Two-Variable Pattern-Finding Problem. J. Comput. Syst. Sci. 34(1): 75-86 (1987) - [j21]Ker-I Ko:
On Helping by Robust Oracle Machines. Theor. Comput. Sci. 52: 15-36 (1987) - [j20]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. SCT 1987: 147-154 - [c4]Ker-I Ko:
On helping by robust oracle machines. SCT 1987: 182-190 - 1986
- [j19]Ker-I Ko:
Approximation to measurable functions and its relation to probabilistic computation. Ann. Pure Appl. Log. 30(2): 173-200 (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. Complex. 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]Ker-I Ko:
On the Notion of Infinite Pseudorandom Sequences. Theor. Comput. Sci. 48(3): 9-33 (1986) - [c3]Ker-I Ko, Timothy J. Long, Ding-Zhu Du:
A Note on One- Way Functions and Polynomial Time Isomorphisms. SCT 1986: 196-196 - [c2]Ker-I Ko, Pekka Orponen, Uwe Schöning, Osamu Watanabe:
What Is a Hard Instance of a Computational Problem?. SCT 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. Complex. 1(2): 210-231 (1985) - [j12]Ker-I Ko:
Nonlevelable Sets and Immune Sets in the Accepting Density Hierarchy in NP. Math. Syst. 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]Ker-I Ko:
On Some Natural Complete Operators. Theor. Comput. Sci. 37: 1-30 (1985) - 1984
- [j9]Ker-I Ko:
Reducibilities on Real Numbers. Theor. Comput. Sci. 31: 101-123 (1984) - 1983
- [j8]Ker-I Ko:
On the Computational Complexity of Ordinary Differential Equations. Inf. Control. 58(1-3): 157-194 (1983) - [j7]Ker-I Ko:
On Self-Reducibility and Weak P-Selectivity. J. Comput. Syst. Sci. 26(2): 209-221 (1983) - [j6]Ker-I Ko:
On the Definitions of some Complexity Classes of Real Numbers. Math. Syst. Theory 16(2): 95-109 (1983) - 1982
- [j5]Ker-I Ko:
Some Negative Results on the Computational Complexity of Total Variation and Differentiation. Inf. 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]Ker-I Ko:
The Maximum Value Problem and NP Real Numbers. J. Comput. Syst. Sci. 24(1): 15-35 (1982) - [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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-22 20:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
