Myong-Hi Kim

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

? Tutorial for this page

Demo Data from EDBT 2026 / reviewers in the wild / expert

dblp:82/2809 · DBLP profile ↗

← Back

4ranked-venue papers

2as first author

0since 2021 · last 2002

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 4 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science

1 paper

Algorithms and data structures · 46% Computational complexity · 46% Computational geometry · 7%

Topics — the 4 heaviest of 5, each with the papers that count most for it

Topic	Papers	Last	Evidence papers
Computational complexity algebraic complexity	1	1994	Polynomial Root-Finding Algorithms and Branched Covers · SIAM J. Comput. 1994
Computational complexity lower bounds	1	1994	Polynomial Root-Finding Algorithms and Branched Covers · SIAM J. Comput. 1994
Algorithms and data structures numerical algorithms	1	1994	Polynomial Root-Finding Algorithms and Branched Covers · SIAM J. Comput. 1994
Algorithms and data structures › symbolic computation › computational algebra › polynomial evaluation polynomial root finding	1	1994	Polynomial Root-Finding Algorithms and Branched Covers · SIAM J. Comput. 1994

Methods — techniques the papers use, named apart from their topics

path-lifting · 0.0branched covering · 0.0

Year	Publication	Venue	Position
2002	Newton's Method for Analytic Systems of Equations with Constant Rank Derivatives Jean-Pierre Dedieu, Myong-Hi Kim	J. Complex.	2
1996	On Isolation of Real and Nearly Real Zeros of a Univariate Polynomial and Its Splitting into Factors Victor Y. Pan, Myong-Hi Kim, Akimou Sadikou, Xiaohan Huang 0001, Ailong Zheng	J. Complex.	2
1994	Polynomial Root-Finding Algorithms and Branched Covers abstract A family of root-finding algorithms is constructed that combines knowledge of the branched covering structure of a polynomial with a path-lifting algorithm for finding individual roots. In particular, the family includes an algorithm that computes an $ \epsilon $-factorization of a polynomial of degree d that has an arithmetic complexity of $\mathcal{O}(d(\log d)^2 \|\log \epsilon \| + d^2 (\log d)^2 )$. At the present time, this complexity is the best known in terms of the degree. Myong-Hi Kim, Scott Sutherland	SIAM J. Comput.	1
1989	Topological complexity of a root finding algorithm Myong-Hi Kim	J. Complex.	1