{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:19:25Z","timestamp":1725664765914},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540614227"},{"type":"electronic","value":"9783540685296"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61422-2_149","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:37:50Z","timestamp":1330292270000},"page":"404-415","source":"Crossref","is-referenced-by-count":2,"title":["The deterministic complexity of parallel multisearch"],"prefix":"10.1007","author":[{"given":"Armin","family":"B\u00e4umker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfgang","family":"Dittrich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Pietracaprina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"M.J. Atallah, F. Dehne, R. Miller, A. Rau-Chaplin, and J.J. Tsay. Multisearch techniques for implementing data structures on a mesh-connected computer. In Proc. of the 3rd ACM Symp. on Parallel Algorithms and Architectures, pages 204\u2013214, 1991.","DOI":"10.1145\/113379.113398"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"M.J. Atallah and A. Fabri. On the multisearch problem for hypercubes. In Proc. of Parallel Architectures and Languages Europe (PARLE 94), 1994.","DOI":"10.1007\/3-540-58184-7_98"},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"A. B\u00e4umker, W. Dittrich, and F. Meyer auf der Heide. Truly efficient parallel algorithms: 1-optimal multisearch for and extension of the BSP model. Technical Report tr-rsfb-96-008, Department of Mathematics and Computer Science, University of Paderborn, 1996. See also Proc. of the 3rd ESA, 1995, pages 17\u201330.","DOI":"10.1007\/3-540-60313-1_131"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"F. Dehne, A. Fabri, and A. Rau-Chaplin. Scalable parallel computational geometry for coarse-grained multicomputers. In Proc. of the ACM Conference on Computational Geometry, 1993.","DOI":"10.1145\/160985.161154"},{"key":"35_CR5","series-title":"Technical Report","first-page":"391","volume-title":"The complexity of deterministic PRAM simulation on Distributed Memory Machines","author":"A. Pietracaprina","year":"1995","unstructured":"A. Pietracaprina and G. Pucci. The complexity of deterministic PRAM simulation on Distributed Memory Machines. Technical Report GEPPCOM-II-23, DEI Universit\u00e0 di Padova, Padova, Italy, 1995. See also Proc. of the 2nd ESA, 1994, pages 391\u2013400."},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"A.G. Ranade. Maintaining dynamic ordered sets on processors networks. In Proc. of 4rd ACM Symp. on Parallel Algorithms and Architectures, pages 127\u2013137, 1992.","DOI":"10.1145\/140901.140915"},{"issue":"3","key":"35_CR7","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1137\/S0097539790184298","volume":"23","author":"J.H. Reif","year":"1994","unstructured":"J.H. Reif and S. Sen. Randomized algorithms for binary search and load balancing on fixed connection networks with geometric applications. SIAM Journal on Computing, 23(3):633\u2013651, June 1994.","journal-title":"SIAM Journal on Computing"},{"issue":"8","key":"35_CR8","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"L.G. Valiant","year":"1990","unstructured":"L.G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103\u2013111, August 1990.","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT'96"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61422-2_149.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:06:06Z","timestamp":1605647166000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61422-2_149"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540614227","9783540685296"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-61422-2_149","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}