Gal Badishi, Idit Keidar, et al.
IEEE TDSC
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.
Gal Badishi, Idit Keidar, et al.
IEEE TDSC
Erich P. Stuntebeck, John S. Davis II, et al.
HotMobile 2008
Charles H. Bennett, Aram W. Harrow, et al.
IEEE Trans. Inf. Theory
Reena Elangovan, Shubham Jain, et al.
ACM TODAES