{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:16:19Z","timestamp":1725455779515},"publisher-location":"Berlin\/Heidelberg","reference-count":9,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540552847"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0023827","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T06:17:40Z","timestamp":1132381060000},"page":"165-176","source":"Crossref","is-referenced-by-count":0,"title":["A simple randomized parallel algorithm for maximal f-matchings"],"prefix":"10.1007","author":[{"given":"Oscar","family":"Garrido","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Jarominek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Lingas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Rytter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"S. Cook, The Classification of Problems which have Fast Parallel Algorithms Proceedings of the 1983 International FCT-Conference, Borgholm, Sweden, Lecture Notes in Computer Science (1983) 78\u201393.","key":"16_CR1","DOI":"10.1007\/3-540-12689-9_95"},{"doi-asserted-by":"crossref","unstructured":"K. Diks, O. Garrido and A. Lingas, Parallel algorithms for finding maximal k-dependent sets and maximal f-matchings. To appear in the Proceedings of the Second Annual International Symposium on Algorithms ISA 91, Taipei, Taiwan (1991).","key":"16_CR2","DOI":"10.1007\/3-540-54945-5_82"},{"key":"16_CR3","volume-title":"Efficient Parallel Algorithms","author":"A. Gibbons","year":"1988","unstructured":"A. Gibbons and W. Rytter, Efficient Parallel Algorithms. Cambridge University Press, Cambridge, 1988."},{"key":"16_CR4","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0020-0190(90)90214-I","volume":"33","author":"T. Hagerup","year":"1989\/90","unstructured":"T. Hagerup and C. R\u00fcb, A guided tour of Chernoff bounds. Information Proccessing Letters 33 (1989\/90) 305\u2013308.","journal-title":"Information Proccessing Letters"},{"key":"16_CR5","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0020-0190(86)90144-4","volume":"22","author":"A. Israeli","year":"1986","unstructured":"A. Israeli and A. Itai, A fast and simple randomized parallel algorithm for maximal matching. Information Proccessing Letters 22 (1986) 77\u201380.","journal-title":"Information Proccessing Letters"},{"key":"16_CR6","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0020-0190(86)90141-9","volume":"22","author":"A. Israeli","year":"1986","unstructured":"A. Israeli and Y. Shiloach, An improved parallel algorithm for maximal matching. Information Proccessing Letters 22 (1986) 57\u201360.","journal-title":"Information Proccessing Letters"},{"doi-asserted-by":"crossref","unstructured":"C. Levcopoulos, A. Lingas, O. Peterson and W. Rytter, Optimal parallel algorithms for testing isomorphism of trees and outerplanar graphs. Proceedings to 10th FST-TCS, Bengalore, India, Lecture Notes in Computer Science (1990) 204\u2013214.","key":"16_CR7","DOI":"10.1007\/3-540-53487-3_45"},{"unstructured":"L. Lovsz and M. D. Plummer, Matching Theory, Annals of Discrete Mathematics (29). North-Holland Mathematics Studies 121. Elsevier Science Publishers B.V. ISBN 0444879161.","key":"16_CR8"},{"key":"16_CR9","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1007\/3-540-51859-2_22","volume":"401","author":"C. N. K. Osiakwan","year":"1989","unstructured":"C. N. K. Osiakwan and S. G. Akl, Optimal parallel algorithms for b-mathings in trees. Proceedings to Optimal Algorithms International Symposium Lecture notes in Computer Science 401 (1989) 274\u2013308.","journal-title":"Proceedings to Optimal Algorithms International Symposium Lecture notes in Computer Science"}],"container-title":["Lecture Notes in Computer Science","LATIN '92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0023827","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T01:29:20Z","timestamp":1586568560000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023827"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540552847"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/bfb0023827","relation":{},"subject":[]}}