Frank R. Libsch, Takatoshi Tsujimura
Active Matrix Liquid Crystal Displays Technology and Applications 1997
A parallel algorithm for the stable matching problem is presented. The algorithm is based on the primal-dual interior path-following method for linear programming. The main result is that a stable matching can be found in O*(√m) time by a polynomial number of processors, where m is the total length of preference lists of individuals. © 2000 Published by Elsevier Science B.V. All rights reserved.
Frank R. Libsch, Takatoshi Tsujimura
Active Matrix Liquid Crystal Displays Technology and Applications 1997
Beomseok Nam, Henrique Andrade, et al.
ACM/IEEE SC 2006
Thomas M. Cheng
IT Professional
B. Wagle
EJOR