Ker-I Ko - Citegraph

Author Info

Name	Affiliation	Papers
KER-I KO	Department of Computer Science, Stony Brook University, Stony Brook, NY 11794, USA	18
Collaborators	Citations	PageRank
10	196	28.54
Referers	Referees	References
199	147	133

Search Limit

100199

Publications (18 rows)

Collaborators (10 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
On parallel complexity of analytic functions.	0	0.34	2013
On the complexity of computing the Hausdorff distance.	0	0.34	2013
On logarithmic-space computable real numbers	1	0.40	2013
On the parameterized complexity of pooling design.	0	0.34	2009
On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane	3	0.45	2008
On the complexity of non-unique probe selection	1	0.36	2008
On the complexity of computing the logarithm and square root functions on a complex domain	5	0.48	2007
Jordan curves with polynomial inverse moduli of continuity	1	0.37	2007
On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain	0	0.34	2006
On the Complexity of Finding Circumscribed Rectangles for a Two-Dimensional Domain	1	0.37	2005
On the Complexity of Finding Paths in a Two-Dimensional Domain II: Piecewise Straight-Line Paths	5	0.49	2005
The computational complexity of distance functions of two-dimensional domains	2	0.42	2005
On the complexity of finding paths in a two-dimensional domain I: Shortest paths	8	0.64	2004
Computational complexity of fixed points and intersection points	7	0.78	1995
Computational Complexity of Two-Dimensional Regions	22	2.94	1995
On the longest circuit in an alterable digraph	5	0.56	1995
Three Sigma^p_2-Complete Problems in Computational Learning Theory	6	0.45	1991
Computational-Complexity Of Real Functions	129	18.50	1982

1