{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:54:44Z","timestamp":1760061284157,"version":"build-2065373602"},"reference-count":17,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1016\/s0743-7315(03)00109-6","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T13:05:41Z","timestamp":1062594341000},"page":"801-814","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parallel \u2018go with the winners\u2019 algorithms in distributed memory models"],"prefix":"10.1016","volume":"63","author":[{"given":"Marcus","family":"Peinado","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Lengauer","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0743-7315(03)00109-6_BIB1","doi-asserted-by":"crossref","unstructured":"D. Aldous, U. Vazirani, \u2018Go with the winners\u2019 algorithms, in: Proceedings of the 35th IEEE Symposium on the Foundations of Computer Science, IEEE Computer Society Press, Silver Spring, MD, 1994, pp. 492\u2013501.","DOI":"10.1109\/SFCS.1994.365742"},{"key":"10.1016\/S0743-7315(03)00109-6_BIB2","doi-asserted-by":"crossref","unstructured":"A. Alexandrov, M.F. Ionescu, K.E. Schauser, C. Scheiman, LogGP: incorporating long messages into the LogP model, in: Proceedings of the Seventh ACM Symposium on Parallel Algorithms and Architectures, 1995, pp. 95\u2013105.","DOI":"10.1145\/215399.215427"},{"key":"10.1016\/S0743-7315(03)00109-6_BIB3","doi-asserted-by":"crossref","unstructured":"A. Bar-Noy, S. Kipnis, Designing broadcasting algorithms in the postal model for message passing systems, in: Proceedings of the Symposium on Parallel Algorithms and Architectures, 1992, pp. 13\u201322.","DOI":"10.1145\/140901.140903"},{"key":"10.1016\/S0743-7315(03)00109-6_BIB4","doi-asserted-by":"crossref","unstructured":"D. Culler, R. Karp, D. Patterson, A. Sahay, K. Schauser, E. Santos, R. Subramonian, T. von Eicken, LogP: towards a realistic model of parallel computation, in: Proceedings of the Fourth ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming, 1993, pp. 1\u201312.","DOI":"10.1145\/155332.155333"},{"year":"1990","series-title":"Physics of Amorphous Materials","author":"Elliot","key":"10.1016\/S0743-7315(03)00109-6_BIB5"},{"year":"1979","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","key":"10.1016\/S0743-7315(03)00109-6_BIB6"},{"key":"10.1016\/S0743-7315(03)00109-6_BIB7","doi-asserted-by":"crossref","first-page":"1149","DOI":"10.1137\/0218077","article-title":"Approximating the permanent","volume":"18","author":"Jerrum","year":"1989","journal-title":"SIAM J. Comput."},{"issue":"5","key":"10.1016\/S0743-7315(03)00109-6_BIB8","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1137\/0222066","article-title":"Polynomial-time approximation algorithms for the Ising model","volume":"22","author":"Jerrum","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0743-7315(03)00109-6_BIB9","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0304-3975(86)90174-X","article-title":"Random generation of combinatorial structures from a uniform distribution","volume":"43","author":"Jerrum","year":"1986","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/S0743-7315(03)00109-6_BIB10","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1002\/rsa.3240040402","article-title":"Random walks in a convex body and an improved volume algorithm","volume":"4","author":"Lov\u00e1sz","year":"1993","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/S0743-7315(03)00109-6_BIB11","doi-asserted-by":"crossref","unstructured":"M. Luby, D. Randall, A. Sinclair, Markov chain algorithms for planar lattice structures (extended abstract), in: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, IEEE, 23\u201325 October, 1995, pp. 150\u2013159.","DOI":"10.1109\/SFCS.1995.492472"},{"year":"1993","series-title":"The Self-Avoiding Walk","author":"Madras","key":"10.1016\/S0743-7315(03)00109-6_BIB12"},{"key":"10.1016\/S0743-7315(03)00109-6_BIB13","doi-asserted-by":"crossref","unstructured":"B.M. Maggs, L.R. Matheson, R.E. Tarjan, Models of parallel computation: a survey and synthesis, in: Proceedings of the 28th Hawaii International Conference on System Sciences (HICSS), Vol. 2, 1995, pp. 61\u201370.","DOI":"10.1109\/HICSS.1995.375476"},{"key":"10.1016\/S0743-7315(03)00109-6_BIB14","series-title":"Proceedings of the First International Workshop on Randomization and Approximation Techniques in Computer Science","first-page":"135","article-title":"Go with the winners generators with applications to molecular modeling","volume":"Vol. 1269","author":"Peinado","year":"1997"},{"key":"10.1016\/S0743-7315(03)00109-6_BIB15","unstructured":"D. Randall, A. Sinclair, Testable algorithms for self-avoiding walks, in: Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, Pennsylvania, 23\u201325 January 1994, pp. 593\u2013602."},{"year":"1984","series-title":"Probability","author":"Shiryayev","key":"10.1016\/S0743-7315(03)00109-6_BIB16"},{"key":"10.1016\/S0743-7315(03)00109-6_BIB17","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/79173.79181","article-title":"A bridging model for parallel computation","volume":"33","author":"Valiant","year":"1990","journal-title":"Commun. ACM"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731503001096?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731503001096?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T21:54:18Z","timestamp":1760046858000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0743731503001096"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":17,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0743731503001096"],"URL":"https:\/\/doi.org\/10.1016\/s0743-7315(03)00109-6","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[2003,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Parallel \u2018go with the winners\u2019 algorithms in distributed memory models","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0743-7315(03)00109-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2003 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}