Yu Lin-Kriz

According to our database, Yu Lin-Kriz authored at least 3 papers between 1992 and 1998.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

1998

Planar Integer Linear Programming is NC Equivalent to Euclidean GCD.

David Shallcross, Victor Y. Pan, Yu Lin-Kriz

SIAM J. Comput., 1998

1993

The NC Equivalence of Planar Integer Linear Programming and Euclidean GCD

David Shallcross, Victor Y. Pan, Yu Lin-Kriz

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992

On Parallel Complexity of Integer Linear Programming, GCD and the Iterated mod Function.

Yu Lin-Kriz, Victor Y. Pan

Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992