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 VLDB 2026 / reviewers in the wild / expert

Yu Lin-Kriz

dblp:30/4933 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 1998
—ORCID · none

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

Theory of computation · 3 · 1 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
3 papers
Algorithms and data structures · 40% Computational complexity · 30% Mathematical optimization · 30%

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

TopicWeightPapersLastEvidence papers
Mathematical optimization
integer programming		 0.031998
Planar Integer Linear Programming is NC Equivalent to Euclidean GCD · SIAM J. Comput. 1998
The NC Equivalence of Planar Integer Linear Programming and Euclidean GCD · FOCS 1993
On Parallel Complexity of Integer Linear Programming, GCD and the Iterated mod Function · SODA 1992
Computational complexity
parallel complexity		 0.031998
Planar Integer Linear Programming is NC Equivalent to Euclidean GCD · SIAM J. Comput. 1998
The NC Equivalence of Planar Integer Linear Programming and Euclidean GCD · FOCS 1993
On Parallel Complexity of Integer Linear Programming, GCD and the Iterated mod Function · SODA 1992
Algorithms and data structures › number-theoretic algorithms
euclidean algorithm		 0.021998
Planar Integer Linear Programming is NC Equivalent to Euclidean GCD · SIAM J. Comput. 1998
The NC Equivalence of Planar Integer Linear Programming and Euclidean GCD · FOCS 1993
Algorithms and data structures
number-theoretic algorithms		 0.011998
Planar Integer Linear Programming is NC Equivalent to Euclidean GCD · SIAM J. Comput. 1998
Algorithms and data structures › number-theoretic algorithms
greatest common divisor		 0.011992
On Parallel Complexity of Integer Linear Programming, GCD and the Iterated mod Function · SODA 1992

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

NC reductions · 0.0remainder sequence · 0.0parallel complexity theory · 0.0
YearPublicationVenuePosition
1998 Planar Integer Linear Programming is NC Equivalent to Euclidean GCD
abstract
It is not known if planar integer linear programming is P-complete or if it is in NC, and the same can be said about the computation of the remainder sequence of the Euclidean algorithm applied to two integers. However, both computations are NC equivalent. The latter computational problem was reduced in NC to the former one by Deng [Mathematical Programming: Complexity and Application, Ph.D. dissertation, Stanford University, Stanford, CA, 1989; Proc. ACM Symp. on Parallel Algorithms and Architectures, 1989,pp. 110--116]. We now prove the converse NC-reduction.
David Shallcross, Victor Y. Pan, Yu Lin-Kriz
 SIAM J. Comput.3
1993 The NC Equivalence of Planar Integer Linear Programming and Euclidean GCD
abstract
We show NC-reduction of integer linear programming with two variables to the evaluation of the remainder sequence arising in the application of the Euclidean algorithm to two positive integers. Due to the previous result of X. Deng (1989), this implies NC-equivalence of both of these problems, whose membership in NC, as well as P-completeness, remain unresolved open problems.>
David Shallcross, Victor Y. Pan, Yu Lin-Kriz
 FOCS3
1992 On Parallel Complexity of Integer Linear Programming, GCD and the Iterated mod Function
Yu Lin-Kriz, Victor Y. Pan
 SODA1