Conference paper
Strong and flexible domain typing for dynamic E-business
Yigal Hoffner, Simon Field, et al.
EDOC 2004
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.
Yigal Hoffner, Simon Field, et al.
EDOC 2004
Indranil R. Bardhan, Sugato Bagchi, et al.
JMIS
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003
Bowen Zhou, Bing Xiang, et al.
SSST 2008