Ker-I Ko - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 86 from 86

2021

On continuous one-way functionsKer-I Ko, Lidong Wu. TCS, 852:1-17, 2021. [doi]

2017

Centralized and decentralized rumor blocking problemsXin Chen, Qingqin Nong, Yan Feng, Yongchang Cao, Suning Gong, Qizhi Fang, Ker-I Ko. jco, 34(1):314-329, 2017. [doi]

Competitive profit maximization in social networksWeian Li, Wenjing Liu, Tiantian Chen, Xiaoying Qu, Qizhi Fang, Ker-I Ko. TCS, 694:1-9, 2017. [doi]

2016

An approximation algorithm for maximum weight budgeted connected set coverYingli Ran, Zhao Zhang, Ker-I Ko, Jun Liang. jco, 31(4):1505-1517, 2016. [doi]

2013

On the complexity of computing the Hausdorff distanceKer-I Ko. jc, 29(3-4):248-262, 2013. [doi]

On logarithmic-space computable real numbersFuxiang Yu, Ker-I Ko. TCS, 469:127-133, 2013. [doi]

On parallel complexity of analytic functionsFuxiang Yu, Ker-I Ko. TCS, 489-490:48-57, 2013. [doi]

2010

Computability and Complexity in AnalysisAndrej Bauer, Peter Hertling, Ker-I Ko. jucs, 16(18):2495, 2010. [doi]

2009

CCA 2009 Preface - Proceedings of the Sixth International Conference on Computability and Complexity in AnalysisAndrej Bauer, Peter Hertling, Ker-I Ko. cca 2009: [doi]

CCA 2009 Front Matter - Proceedings of the Sixth International Conference on Computability and Complexity in AnalysisAndrej Bauer, Peter Hertling, Ker-I Ko. cca 2009: [doi]

On the Parameterized Complexity of Pooling DesignYongxi Cheng, Ding-Zhu Du, Ker-I Ko, Guohui Lin. jcb, 16(11):1529-1537, 2009. [doi]

2008

On the complexity of non-unique probe selectionYongxi Cheng, Ker-I Ko, Weili Wu. TCS, 390(1):120-125, 2008. [doi]

On the Complexity of Convex Hulls of Subsets of the Two-Dimensional PlaneKer-I Ko, Fuxiang Yu. ENTCS, 202:121-135, 2008. [doi]

2007

Editorial: Math. Log. Quart. 4-5/2007Ker-I Ko, Klaus Weihrauch, Xizhong Zheng. mlq, 53(4-5):325, 2007. [doi]

Jordan curves with polynomial inverse moduli of continuityKer-I Ko, Fuxiang Yu. TCS, 381(1-3):148-161, 2007. [doi]

On the complexity of computing the logarithm and square root functions on a complex domainKer-I Ko, Fuxiang Yu. jc, 23(1):2-24, 2007. [doi]

Jordan Curves with Polynomial Inverse Moduli of ContinuityKer-I Ko, Fuxiang Yu. ENTCS, 167:425-447, 2007. [doi]

2006

Computability and complexity in analysisVasco Brattka, Peter Hertling, Ker-I Ko, Hideki Tsuiki. jc, 22(6):728, 2006. [doi]

On the complexity of finding circumscribed rectangles and squares for a two-dimensional domainFuxiang Yu, Arthur W. Chou, Ker-I Ko. jc, 22(6):803-817, 2006. [doi]

2005

2004

Preface: MLQ - Math. Log. Quart. 4-5/2004Vasco Brattka, Peter Hertling, Ker-I Ko, Ning Zhong. mlq, 50(4-5):327-328, 2004. [doi]

On the complexity of finding paths in a two-dimensional domain I: Shortest pathsArthur W. Chou, Ker-I Ko. mlq, 50(6):551-572, 2004. [doi]

A greedy approximation for minimum connected dominating setsLu Ruan, Hongwei Du, Xiaohua Jia, Weili Wu, Yingshu Li, Ker-I Ko. TCS, 329(1-3):325-330, 2004. [doi]

2002

ForewordKer-I Ko, Anil Nerode, Klaus Weihrauch. TCS, 284(2):197, 2002. [doi]

1998

In Memoriam Ronald V. BookDing-Zhu Du, Ker-I Ko. TCS, 207(1):1-3, 1998.

On the Computability of Fractal Dimensions and Hausdorff MeasureKer-I Ko. APAL, 93(1-3):195-216, 1998.

1996

On the Measure of Two-Dimensional Regions with Polynomial-Time computables BoundariesKer-I Ko, Klaus Weihrauch. cocoon 1996: 150-159 [doi]

Fractals and ComplexityKer-I Ko. cca 1996: [doi]

1995

Computational Complexity of Two-Dimensional RegionsArthur W. Chou, Ker-I Ko. SICOMP, 24(5):923-947, 1995.

A Polynomial-Time Computable Curve whose Interior has a Nonrecursive MeasureKer-I Ko. TCS, 145(1&2):241-270, 1995. [doi]

Computational Complexity of Fixed Points and Intersection PointsKer-I Ko. jc, 11(2):265-292, 1995. [doi]

1994

Instance ComplexityPekka Orponen, Ker-I Ko, Uwe Schöning, Osamu Watanabe. JACM, 41(1):96-121, 1994. [doi]

1993

Some complexity issues on the simply connected regions of the two-dimensional planeArthur W. Chou, Ker-I Ko. stoc 1993: 1-10 [doi]

1992

A note on best fractions of a computable real numberDing-Zhu Du, Ker-I Ko. jc, 8(3):216-229, 1992. [doi]

A Note on the Instance Complexity of Pseudorandom SetsKer-I Ko. coco 1992: 327-337

On the Computational Complexity of Integral EquationsKer-I Ko. APAL, 58(3):201-228, 1992.

1991

Three Sigma^p_2-Complete Problems in Computational Learning TheoryKer-I Ko, Wen-Guey Tzeng. cc, 1:269-310, 1991.

On Adaptive Versus Nonadaptive Bounded Query MachinesKer-I Ko. TCS, 82(1):51-69, 1991.

On the Complexity of Learning Minimum Time-Bounded Turing MachinesKer-I Ko. SICOMP, 20(5):962-986, 1991.

Integral Equations, Systems of Quadratic Equations, and Exponential-Time Completeness (Extended Abstract)Ker-I Ko. stoc 1991: 10-20

Separating the Low and High Hierarchies by OraclesKer-I Ko. iandc, 90(2):156-177, February 1991.

Complexity theory of real functionsKer-I Ko. Volume 3 of Progress in theoretical computer science, Birkhäuser, 1991.

Complexity Theory of Real FunctionsKer-I Ko. Birkhäuser / Springer, 1991. [doi]

1990

On the Complexity of Learning Minimum Time-Bounded Turing MachinesKer-I Ko. colt 1990: 82-96 [doi]

Separating and Collapsing Results on the Relativized Probabilistic Polynomial-Time HierarchyKer-I Ko. JACM, 37(2):415-438, April 1990. [doi]

A note on separating the relativized polynomial time hierarchy by immune setsKer-I Ko. ita, 24:229-240, 1990.

Learning String Patterns and Tree Patterns from ExamplesKer-I Ko, Assaf Marron, Wen-Guey Tzeng. icml 1990: 384-391

1989

Distinguishing Conjunctive and Disjunctive Reducibilities by Sparse SetsKer-I Ko. iandc, 81(1):62-87, April 1989.

Computational Complexity of Roots of Real Functions (Extended Abstract)Ker-I Ko. focs 1989: 204-209

Relativized Polynomial Time Hierarchies Having Exactly K LevelsKer-I Ko. SICOMP, 18(2):392-408, 1989.

1988

On Sets Truth-Table Reducible to Sparse SetsRonald V. Book, Ker-I Ko. SICOMP, 17(5):903-919, 1988.

Relativized Polynominal Time Hierarchies Having Exactly K LevelsKer-I Ko. stoc 1988: 245-253

Searching for Two Objects by Underweight FeedbackKer-I Ko. siamdm, 1(1):65-70, 1988.

Relativized polynomial time hierarchies having exactly K levelsKer-I Ko. coco 1988: [doi]

Distinguishing bounded reducibilities by sparse setsKer-I Ko. coco 1988: 181-191 [doi]

1987

On sets reducible to sparse setsRonald V. Book, Ker-I Ko. coco 1987: 147-154

Corrigenda: On the Continued Fraction Representation of Computable Real NumbersKer-I Ko. TCS, 54:341-343, 1987.

On Helping by Robust Oracle MachinesKer-I Ko. TCS, 52:15-36, 1987.

A Note on the Two-Variable Pattern-Finding ProblemKer-I Ko, Chin-Ming Hua. jcss, 34(1):75-86, 1987.

On helping by robust oracle machinesKer-I Ko. coco 1987: 182-190

Identification of Pattern Languages from Examples and QueriesAssaf Marron, Ker-I Ko. iandc, 74(2):91-112, August 1987.

1986

What Is a Hard Instance of a Computational Problem?Ker-I Ko, Pekka Orponen, Uwe Schöning, Osamu Watanabe. cocoon 1986: 197-217

On the Continued Fraction Representation of Computable Real NumbersKer-I Ko. TCS, 47(3):299-313, 1986.

On the Notion of Infinite Pseudorandom SequencesKer-I Ko. TCS, 48(3):9-33, 1986.

On the Number of Queries Necessary to Identify a PermutationKer-I Ko, Shia-Chung Teng. jal, 7(4):449-462, 1986.

On the computational complexity of best Chebyshev approximationsKer-I Ko. jc, 2(2):95-120, 1986. [doi]

Approximation to measurable functions and its relation to probabilistic computationKer-I Ko. APAL, 30(2):173-200, 1986. [doi]

On One-Way Functions and Polynomial-Time IsomorphismsKer-I Ko, Timothy J. Long, Ding-Zhu Du. TCS, 47(3):263-276, 1986.

A Note on One-Way Functions and Polynomial-Time Isomorphisms (Extended Abstract)Ker-I Ko, Timothy J. Long, Ding-Zhu Du. stoc 1986: 295-303

A Note on One- Way Functions and Polynomial Time IsomorphismsKer-I Ko, Timothy J. Long, Ding-Zhu Du. cocoon 1986: 196-196

1985

Continuous optimization problems and a polynomial hierarchy of real functionsKer-I Ko. jc, 1(2):210-231, 1985. [doi]

On Circuit-Size Complexity and the Low Hierarchy in NPKer-I Ko, Uwe Schöning. SICOMP, 14(1):41-51, 1985.

On Some Natural Complete OperatorsKer-I Ko. TCS, 37:1-30, 1985.

Nonlevelable Sets and Immune Sets in the Accepting Density Hierarchy in NPKer-I Ko. mst, 18(3):189-205, 1985.

1984

Reducibilities on Real NumbersKer-I Ko. TCS, 31:101-123, 1984.

1983

On the Computational Complexity of Ordinary Differential EquationsKer-I Ko. iandc, 58(1-3):157-194, July/August/September 1983.

On the Definitions of some Complexity Classes of Real NumbersKer-I Ko. mst, 16(2):95-109, 1983.

On Self-Reducibility and Weak P-SelectivityKer-I Ko. jcss, 26(2):209-221, 1983.

1982

Computational Complexity of Real FunctionsKer-I Ko, Harvey Friedman. TCS, 20:323-352, 1982.

The Maximum Value Problem and NP Real NumbersKer-I Ko. jcss, 24(1):15-35, 1982.

Some Observations on the Probabilistic Algorithms and NP-hard ProblemsKer-I Ko. ipl, 14(1):39-43, 1982.

Some Negative Results on the Computational Complexity of Total Variation and DifferentiationKer-I Ko. iandc, 53(1/2):21-31, April/May 1982.

1981

Completeness, Approximation and DensityKer-I Ko, Daniel J. Moore. SICOMP, 10(4):787-796, 1981.

Sign in or sign up to see more results.

runs on WebDSL