On Parallel Complexity of Integer Linear Programming, GCD and the Iterated mod Function. - Yu Lin-Kriz; Victor Y. Pan (SODA, 1992)

The NC Equivalence of Planar Integer Linear Programming and Euclidean GCD - David Shallcross; Victor Y. Pan; Yu Lin-Kriz (FOCS, 1993)

Planar Integer Linear Programming is NC Equivalent to Euclidean GCD. - David Shallcross; Victor Y. Pan; Yu Lin-Kriz (SIAM J. Comput., 1998)