{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T11:28:49Z","timestamp":1791286129409,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540649526","type":"print"},{"value":"9783540499206","type":"electronic"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0057942","type":"book-chapter","created":{"date-parts":[[2006,8,1]],"date-time":"2006-08-01T15:01:27Z","timestamp":1154444487000},"page":"865-874","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["BSP, LogP, and oblivious programs"],"prefix":"10.1007","author":[{"given":"J\u00f6rn","family":"Eisenbiegler","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Welf","family":"L\u00f6we","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wolf","family":"Zimmermann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2006,6,30]]},"reference":[{"key":"108_CR1","doi-asserted-by":"crossref","unstructured":"Albert Alexandrov, Mihai F. Ionescu, Klaus E. Schauser, and Chris Scheiman. LogGP: Incorporating long messages into the LogP model. In 7th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 95\u2013105, 1995.","DOI":"10.1145\/215399.215427"},{"key":"108_CR2","doi-asserted-by":"crossref","unstructured":"Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci, and Paul Spirakis. Bsp vs logp. In SPAA \u201996: 8th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 25\u201332. ACM, acm press, June 1996.","DOI":"10.1145\/237502.237504"},{"issue":"3","key":"108_CR3","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1137\/0211043","volume":"11","author":"R. Cole","year":"1982","unstructured":"R. Cole and J. Hopcroft. On edge coloring bipartite graphs. SIAM Journal on Computing, 11(3):540\u2013546, 1982.","journal-title":"SIAM Journal on Computing"},{"key":"108_CR4","doi-asserted-by":"crossref","unstructured":"D. Culler, R. Karp, D. Patterson, A. Sahay, K. E. Schauser, E. Santos, R. Subramonian, and T. von Eicken. LogP: Towards a realistic model of parallel computation. In 4th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPOPP 93), pages 235\u2013261, 1993.","DOI":"10.1145\/155332.155333"},{"key":"108_CR5","doi-asserted-by":"crossref","unstructured":"J\u00f6rn Eisenbiegler, Welf L\u00f6we, and Andreas Wehrenpfennig. On the optimization by redundancy using an extended LogP model. In International Conference on Advances in Parallel and Distributed Computing (APDC\u201997), pages 149\u2013155. IEEE Computer Society Press, March 1997.","DOI":"10.1109\/APDC.1997.574026"},{"key":"108_CR6","doi-asserted-by":"crossref","unstructured":"Jonathan M. D. Hill, Paul I. Crumpton, and David A. Burgess. Theory, practice, and a tool for BSP performance prediction. In Luc Boug\u00e9, Pierre Fraigniaud, Anne Mignotte, and Yves Robert, editors, Euro-Par\u201996 Parallel Processing, number 1123 in Lecture Notes in Computer Science, pages 697\u2013705. Springer, August 1996.","DOI":"10.1007\/BFb0024766"},{"key":"108_CR7","doi-asserted-by":"crossref","unstructured":"R.M. Karp, A. Sahay, E.E. Santos, and K.E. Schauser. Optimal broadcast and summation in the logp model. ACM-Symposium on Parallel Algorithms and Architectures, 1993.","DOI":"10.1145\/165231.165250"},{"key":"108_CR8","doi-asserted-by":"crossref","unstructured":"W. F. McColl. Scalable computing. In Jan van Leeuwen, editor, Computer Science Today, number 1000 in Lecture Notes in Computer Science, pages 46\u201361. Springer, 1995.","DOI":"10.1007\/BFb0015236"},{"key":"108_CR9","doi-asserted-by":"crossref","unstructured":"Leslie G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8), August 1990.","DOI":"10.1145\/79173.79181"}],"container-title":["Lecture Notes in Computer Science","Euro-Par\u201998 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0057942","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T08:11:46Z","timestamp":1736496706000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0057942"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540649526","9783540499206"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/bfb0057942","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"30 June 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}