{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T13:47:29Z","timestamp":1766065649764},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1989,9,1]],"date-time":"1989-09-01T00:00:00Z","timestamp":620611200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BIT"],"published-print":{"date-parts":[[1989,9]]},"DOI":"10.1007\/bf02219230","type":"journal-article","created":{"date-parts":[[2005,10,6]],"date-time":"2005-10-06T19:34:21Z","timestamp":1128627261000},"page":"448-456","source":"Crossref","is-referenced-by-count":4,"title":["The average performance of a parallel stable marriage algorithm"],"prefix":"10.1007","volume":"29","author":[{"given":"S. S.","family":"Tseng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"BF02219230_CR1","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1016\/0020-0190(83)90025-X","volume":"16","author":"L. Allison","year":"1983","unstructured":"Allison, L.,Stable marriages by coroutines, Information Processing Letters, Vol. 16, No. 2, Feb. 1983, pp. 611\u201365.","journal-title":"Information Processing Letters"},{"key":"BF02219230_CR2","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"D. Gale","year":"1962","unstructured":"Gale, D. and Shapley, L. S.,College admissions and the stability of marriage, Am. Math. Monthly 69, 1962, pp. 9\u201315.","journal-title":"Am. Math. Monthly"},{"issue":"1","key":"BF02219230_CR3","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0020-0190(84)90025-5","volume":"18","author":"M. E. C. Hull","year":"1984","unstructured":"Hull, M. E. C.,A parallel view of stable marriages, Information Processing Letters, Vol. 18, No. 1, Feb. 1984, pp. 63\u201366.","journal-title":"Information Processing Letters"},{"key":"BF02219230_CR4","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0020-0190(85)90104-8","volume":"21","author":"D. Kapur","year":"1985","unstructured":"Kapur, D. and Krishnamoorthy, M. S.,Worst-case choice for the stable marriage problem, Information Processing Letters, Vol. 21, July 1985, pp. 27\u201330.","journal-title":"Information Processing Letters"},{"key":"BF02219230_CR5","volume-title":"The Art of Computer Programming, Vol. 1\/Fundamental Algorithms","author":"D. E. Knuth","year":"1973","unstructured":"Knuth, D. E.,The Art of Computer Programming, Vol. 1\/Fundamental Algorithms, 2nd Edition, Addison-Wesley, Reading, Mass., 1973.","edition":"2nd Edition"},{"key":"BF02219230_CR6","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01934199","volume":"10","author":"D. G. McVitie","year":"1970","unstructured":"McVitie, D. G. and Wilson, L. B.,Stable marriage assignment for unequal sets, BIT 10, 1970, pp. 295\u2013309.","journal-title":"BIT"},{"issue":"7","key":"BF02219230_CR7","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1145\/362619.362631","volume":"14","author":"D. G. McVitie","year":"1971","unstructured":"McVitie, D. G. and Wilson, L. B.,The stable marriage problem, Communication of the ACM, Vol. 14, No. 7, July 1971, pp. 486\u2013490.","journal-title":"Communication of the ACM"},{"issue":"7","key":"BF02219230_CR8","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1145\/362619.362632","volume":"14","author":"D. G. McVitie","year":"1971","unstructured":"McVitie, D. G. and Wilson, L. B.,Algorithm 411, Pts. 1\u20133. Three procedures for the stable marriage problem, Communication of the ACM, Vol. 14, No. 7, July 1971, pp. 491\u2013492.","journal-title":"Communication of the ACM"},{"key":"BF02219230_CR9","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/BF01935367","volume":"25","author":"M. J. Quinn","year":"1985","unstructured":"Quinn, M. J.,A note on two parallel algorithms to solve the stable marriage problem, BIT 25, 1985, pp. 473\u2013476.","journal-title":"BIT"},{"key":"BF02219230_CR10","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0196-6774(81)90010-9","volume":"2","author":"Y. Shiloach","year":"1981","unstructured":"Shiloach, Y. and Vishkin, U.,Finding the maximum, merging, and sorting in a parallel computation model, Journal of Algorithms, Vol. 2, 1981, pp. 88\u2013102.","journal-title":"Journal of Algorithms"},{"key":"BF02219230_CR11","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1007\/BF02136029","volume":"24","author":"S. S. Tseng","year":"1984","unstructured":"Tseng, S. S. and Lee, R. C. T.,A parallel algorithm to solve the stable marriage problem. BIT 24, 1984, 308\u2013316.","journal-title":"BIT"},{"issue":"3","key":"BF02219230_CR12","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1137\/0204030","volume":"4","author":"L. G. Valiant","year":"1975","unstructured":"Valiant, L. G.,Parallelism in comparison problems, SIAM Journal of Computing, Vol. 4, No. 3, Sep. 1975, pp. 348\u2013455.","journal-title":"SIAM Journal of Computing"},{"key":"BF02219230_CR13","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1007\/BF01932966","volume":"12","author":"L. B. Wilson","year":"1972","unstructured":"Wilson, L. B.,An analysis of the stable marriage assignment algorithm. BIT 12, 1972, pp. 569\u2013575.","journal-title":"BIT"}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02219230.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02219230\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02219230","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T22:04:19Z","timestamp":1557871459000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02219230"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,9]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,9]]}},"alternative-id":["BF02219230"],"URL":"https:\/\/doi.org\/10.1007\/bf02219230","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,9]]}}}