{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:35:29Z","timestamp":1725564929624},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540340799"},{"type":"electronic","value":"9783540340805"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11751649_2","type":"book-chapter","created":{"date-parts":[[2006,5,11]],"date-time":"2006-05-11T14:07:52Z","timestamp":1147356472000},"page":"10-21","source":"Crossref","is-referenced-by-count":6,"title":["A CGM Algorithm Solving the Longest Increasing Subsequence Problem"],"prefix":"10.1007","author":[{"given":"David","family":"Sem\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1090\/S0273-0979-99-00796-X","volume":"36","author":"A. Aldous","year":"1999","unstructured":"Aldous, A., Diaconis, P.: Longest Increasing Subsequences: From Patience Sorting to the Baik-Deift-Johansson Theorem. BAMS: Bulletin of the American Mathematical Society\u00a036, 413\u2013432 (1999)","journal-title":"BAMS: Bulletin of the American Mathematical Society"},{"issue":"1\u20132","key":"2_CR2","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/S0020-0190(00)00124-1","volume":"71","author":"S. Bespamyatnikh","year":"2000","unstructured":"Bespamyatnikh, S., Segal, M.: Enumerating Longest Increasing Subsequences and Patience Sorting. Information Processing Letters\u00a071(1\u20132), 7\u201311 (2000)","journal-title":"Information Processing Letters"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Bose, P., Chan, A., Dehne, F., Latzel, M.: Coarse grained parallel maximum matching in convex bipartite graph. In: Proc. 13th International Parallel Processing Symposium (IPPS 1999), pp. 125\u2013129 (1999)","DOI":"10.1109\/IPPS.1999.760446"},{"key":"2_CR4","first-page":"200","volume-title":"Fith International Conference on Computing and Information (ICCI 1993)","author":"C. C\u00e9rin","year":"1993","unstructured":"C\u00e9rin, C., Dufourd, C., Myoupo, J.F.: An Efficient Parallel Solution for the Longest Increasing Subsequence Problem. In: Fith International Conference on Computing and Information (ICCI 1993), Sudbury, Ontario, pp. 200\u2013224. IEEE Press, Los Alamitos (1993)"},{"issue":"4","key":"2_CR5","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1142\/S0129626499000499","volume":"9","author":"A. Chan","year":"1999","unstructured":"Chan, A., Dehne, F.: A note on coarse grained parallel integer sorting. Parallel Processing Letters\u00a09(4), 533\u2013538 (1999)","journal-title":"Parallel Processing Letters"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Culler, D., Karp, R., Patterson, D., Sahay, A., Schauser, K., Santos, E., Subramonian, R., Von Eicken, T.: Log\u201dp\u201d:towards a realistic model of parallel computation. In: 4-th ACM SIGPLAN Symp. on Principles and Practices of Parallel Programming, pp. 1\u201312 (1996)","DOI":"10.1145\/173284.155333"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Dehne, F., Deng, X., Dymond, P., Fabri, A., Khokhar, A.: A randomized parallel 3d convex hull algorithm for coarse grained multicomputers. In: Proc. 7th ACM Symp. on Parallel Algorithms and Architectures, pp. 27\u201333 (1995)","DOI":"10.1145\/215399.215410"},{"issue":"3","key":"2_CR8","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1142\/S0218195996000241","volume":"6","author":"F. Dehne","year":"1996","unstructured":"Dehne, F., Fabri, A., Rau-Chaplin, A.: Scalable parallel computational geometry for coarse grained multicomputers. International Journal on Computational Geometry\u00a06(3), 379\u2013400 (1996)","journal-title":"International Journal on Computational Geometry"},{"issue":"1","key":"2_CR9","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1006\/jpdc.1998.1503","volume":"56","author":"M. Diallo","year":"1999","unstructured":"Diallo, M., Ferreira, A., Rau-Chaplin, A., Ubeda, S.: Scalable 2d convex hull and triangulation algorithms for coarse grained multicomputers. Journal of Parallel and Distributed Computing\u00a056(1), 47\u201370 (1999)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"2_CR10","first-page":"463","volume":"2","author":"P. Erdos","year":"1935","unstructured":"Erdos, P., Szekers, A.: A combinatorial problem in geometry. Compositio Mathematica\u00a02, 463\u2013470 (1935)","journal-title":"Compositio Mathematica"},{"issue":"3","key":"2_CR11","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1142\/S0129626499000384","volume":"9","author":"A. Ferreira","year":"1999","unstructured":"Ferreira, A., Schabanel, N.: A randomized bsp\/cgm algorithm for the maximal independant set problem. Parallel Processing Letters\u00a09(3), 411\u2013422 (1999)","journal-title":"Parallel Processing Letters"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Fredman, M.L.: On Computing the Length of Longest Increasing Subsequences. Discrete Mathematics, 29\u201335 (1975)","DOI":"10.1016\/0012-365X(75)90103-X"},{"key":"2_CR13","unstructured":"Garcia, T., Myoupo, J.F., Sem\u00e9, D.: A work-optimal cgm algorithm for the longest increasing subsequence problem. In: International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2001 (2001)"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Garcia, T., Myoupo, J.F., Sem\u00e9, D.: A coarse-grained multicomputer algorithm for the longest common subsequence problem. In: 11-th Euromicro Conference on Parallel Distributed and Network based Processing, PDP 2003 (2003)","DOI":"10.1109\/EMPDP.2003.1183610"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Garcia, T., Sem\u00e9, D.: A coarse-grained multicomputer algorithm for the longest repeated suffix ending at each point in a word. In: International Conference on Computational Science and its Applications, ICCSA 2003 (2003)","DOI":"10.1007\/3-540-44843-8_26"},{"key":"2_CR16","unstructured":"Garcia, T., Sem\u00e9, D.: A load balancing technique for some coarse-grained multicomputer algorithms. In: 21th International Conference on Computers and Their Applications (CATA-2006), (2006) (to appear)"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Goudreau, M., Rao, S., Lang, K., Suel, T., Tsantilas, T.: Towards efficiency and portability: Programming with the bsp model. In: 8th Annual ACM Symp. on Parallel Algorithms and Architectures (SPAA 1996), pp. 1\u201312 (1996)","DOI":"10.1145\/237502.237503"},{"key":"2_CR18","unstructured":"Gram, A.: Raisonner pour programmer. Dunod, Paris (1988)"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Gries, D.: The Science of Programming. Springer, Heidelberg (1981) (fifth printing 1989)","DOI":"10.1007\/978-1-4612-5983-1"},{"key":"2_CR20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences : Computer Science and Computational Biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)"},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/3-540-56024-6_5","volume-title":"Combinatorial Pattern Matching","author":"G. Jacobson","year":"1992","unstructured":"Jacobson, G., Vo, K.P.: Heaviest Increasing\/Common Subsequence Problems. In: Apostolico, A., Galil, Z., Manber, U., Crochemore, M. (eds.) CPM 1992. LNCS, vol.\u00a0644, pp. 52\u201366. Springer, Heidelberg (1992)"},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"1531","DOI":"10.1006\/jpdc.2000.1659","volume":"60","author":"S.R. Kim","year":"2000","unstructured":"Kim, S.R., Park, K.: Fully scalable fault-tolerant simulations for bsp and cgm. Journal of Parallel and Distributed Computing\u00a060, 1531\u20131560 (2000)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"2_CR23","unstructured":"Manber, U.: Introduction to Algorithms, a creative approach. Adisson-Wesley (1989)"},{"issue":"1","key":"2_CR24","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1109\/TSE.1978.231467","volume":"SE-4","author":"J. Misra","year":"1978","unstructured":"Misra, J.: A Technique of Algorithm Construction on Sequence. IEEE Trans. Software Engineering\u00a0SE-4(1), 65\u201369 (1978)","journal-title":"IEEE Trans. Software Engineering"},{"key":"2_CR25","unstructured":"Szymanski, T.G.: A Special Case of the Max Common Subsequences Problem. Technical report, Dep. Elec. Eng. Princeton University, Princeton N.J. Tech. Rep (1975)"},{"issue":"8","key":"2_CR26","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"L.G. Valiant","year":"1990","unstructured":"Valiant, L.G.: A bridging model for parallel computation. Communications of the ACM\u00a033(8), 103\u2013111 (1990)","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications - ICCSA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11751649_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:01:33Z","timestamp":1619506893000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11751649_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540340799","9783540340805"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/11751649_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}