{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:45:56Z","timestamp":1725489956638},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540401612"},{"type":"electronic","value":"9783540448433"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44843-8_26","type":"book-chapter","created":{"date-parts":[[2007,8,15]],"date-time":"2007-08-15T07:42:01Z","timestamp":1187163721000},"page":"239-248","source":"Crossref","is-referenced-by-count":4,"title":["A Coarse-Grained Multicomputer Algorithm for the Longest Repeated Suffix Ending at Each Point in a Word"],"prefix":"10.1007","author":[{"given":"Thierry","family":"Garcia","sequence":"first","affiliation":[]},{"given":"David","family":"Sem\u00e9","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"P. Bose, A. Chan, F. Dehne, and M. Latzel. Coarse grained parallel maximum matching in convex bipartite graph. Proc. 13th International Parallel Processing Symposium (IPPS\u201999), pages 125\u2013129, 1999.","key":"26_CR1","DOI":"10.1109\/IPPS.1999.760446"},{"issue":"4","key":"26_CR2","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1142\/S0129626499000499","volume":"9","author":"A. Chan","year":"1999","unstructured":"A. Chan and F. Dehne. A note on coarse grained parallel integer sorting. Parallel Processing Letters, 9(4):533\u2013538, 1999.","journal-title":"Parallel Processing Letters"},{"doi-asserted-by":"crossref","unstructured":"D. Culler, R. Karp, D. Patterson, A. Sahay, K. Schauser, E. Santos, R. Subramonian, and T. Von Eicken. LogP:towards a realistic model of parallel computation. 4-th ACM SIGPLAN Symp. on Principles and Practices of Parallel Programming, pages 1\u201312, 1996.","key":"26_CR3","DOI":"10.1145\/173284.155333"},{"doi-asserted-by":"crossref","unstructured":"F. Dehne, X. Deng, P. Dymond, A. Fabri, and A. Khokhar. A randomized parallel 3d convex hull algorithm for coarse grained multicomputers. Proc. 7th ACM Symp. on Parallel Algorithms and Architectures, pages 27\u201333, 1995.","key":"26_CR4","DOI":"10.1145\/215399.215410"},{"issue":"3","key":"26_CR5","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1142\/S0218195996000241","volume":"6","author":"F. Dehne","year":"1996","unstructured":"F. Dehne, A. Fabri, and A. Rau-Chaplin. Scalable parallel computational geometry for coarse grained multicomputers. International Journal on Computational Geometry, 6(3):379\u2013400, 1996.","journal-title":"International Journal on Computational Geometry"},{"issue":"1","key":"26_CR6","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1006\/jpdc.1998.1503","volume":"56","author":"M. Diallo","year":"1999","unstructured":"M. Diallo, A. Ferreira, A. Rau-Chaplin, and S. Ubeda. Scalable 2d convex hull and triangulation algorithms for coarse grained multicomputers. Journal of Parallel and Distributed Computing, 56(1):47\u201370, 1999.","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"3","key":"26_CR7","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1142\/S0129626499000384","volume":"9","author":"A. Ferreira","year":"1999","unstructured":"A. Ferreira and N. Schabanel. A randomized bsp\/cgm algorithm for the maximal independant set problem. Parallel Processing Letters, 9(3):411\u2013422, 1999.","journal-title":"Parallel Processing Letters"},{"unstructured":"T. Garcia, J.F. Myoupo, and D. Sem\u00e9. A work-optimal cgm algorithm for the longest increasing subsequence problem. International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA\u2019 01), 2001.","key":"26_CR8"},{"doi-asserted-by":"crossref","unstructured":"T. Garcia, J.F. Myoupo, and D. Sem\u00e9. A coarse-grained multicomputer algorithm for the longest common subsequence problem. 11-th Euromicro Conference on Parallel Distributed and Network based Processing (PDP\u2019 03), 2003.","key":"26_CR9","DOI":"10.1109\/EMPDP.2003.1183610"},{"doi-asserted-by":"crossref","unstructured":"M. Goudreau, S. Rao K. Lang, T. Suel, and T. Tsantilas. Towards efficiency and portability: Programming with the bsp model. 8th Annual ACM Symp. on Parallel Algorithms and Architectures (SPAA\u201996), pages 1\u201312, 1996.","key":"26_CR10","DOI":"10.1145\/237502.237503"},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"1531","DOI":"10.1006\/jpdc.2000.1659","volume":"60","author":"S.R. Kim","year":"2000","unstructured":"S.R. Kim and K. Park. Fully scalable fault-tolerant simulations for bsp and cgm. Journal of Parallel and Distributed Computing, 60:1531\u20131560, 2000.","journal-title":"Journal of Parallel and Distributed Computing"},{"unstructured":"T. Lecroq, J.-F. Myoupo, and D. Sem\u00e9. Exact computations of the longest repeated suffix ending at each point in a word. In R. Gantenbein and S. Shin, editors, Proceedings of the 17th International Conference on Computers and Their Applications, pages 18\u201321, 2002.","key":"26_CR12"},{"unstructured":"A. Lefebvre and T. Lecroq. Computing repeated factors with a factor oracle. In L. Brankovic and J. Ryan, editors, Proceedings of the 11th Australasian Workshop On Combinatorial Algorithms, pages 145\u2013158, 2000.","key":"26_CR13"},{"issue":"5","key":"26_CR14","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/S0304-3975(00)00067-0","volume":"249","author":"W. F. Smyth","year":"2000","unstructured":"W. F. Smyth. Repetitive perhaps, but not boring. Theor. Comput. Sci., 249(5):343\u2013355, 2000.","journal-title":"Theor. Comput. Sci."},{"issue":"8","key":"26_CR15","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, 1990.","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2014 ICCSA 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44843-8_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T02:14:42Z","timestamp":1556763282000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44843-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540401612","9783540448433"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-44843-8_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}