{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:59:11Z","timestamp":1743069551517,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319199283"},{"type":"electronic","value":"9783319199290"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19929-0_22","type":"book-chapter","created":{"date-parts":[[2015,6,15]],"date-time":"2015-06-15T13:09:49Z","timestamp":1434373789000},"page":"261-271","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Partition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley\u2019s Process"],"prefix":"10.1007","author":[{"given":"Gabriel","family":"Istrate","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cosmin","family":"Bonchi\u015f","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,16]]},"reference":[{"issue":"2","key":"22_CR1","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF01204214","volume":"103","author":"D Aldous","year":"1995","unstructured":"Aldous, D., Diaconis, P.: Hammersley\u2019s interacting particle process and longest increasing subsequences. Probab. Theory Relat. Fields 103(2), 199\u2013213 (1995)","journal-title":"Probab. Theory Relat. Fields"},{"issue":"4","key":"22_CR2","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1090\/S0273-0979-99-00796-X","volume":"36","author":"D Aldous","year":"1999","unstructured":"Aldous, D., Diaconis, P.: Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem. Bull. Am. Math. Soci. 36(4), 413\u2013432 (1999)","journal-title":"Bull. Am. Math. Soci."},{"key":"22_CR3","first-page":"63","volume":"01","author":"M Archibald","year":"2009","unstructured":"Archibald, M., Mart\u00ednez, C.: The hiring problem and permutations. DMTCS Proc. 01, 63\u201376 (2009)","journal-title":"DMTCS Proc."},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Byers, J., Heeringa, B., Mitzenmacher, M., Zervas, G.: Heapable sequences and subseqeuences. In: Proceedings of ANALCO, pp. 33\u201344 (2011)","DOI":"10.1137\/1.9781611973013.4"},{"issue":"4","key":"22_CR5","doi-asserted-by":"publisher","first-page":"1233","DOI":"10.1137\/07070629X","volume":"39","author":"A Broder","year":"2009","unstructured":"Broder, A., Kirsch, A., Kumar, R., Mitzenmacher, M., Upfal, E., Vassilvitskii, S.: The hiring problem and Lake Wobegon strategies. SIAM J. Comput. 39(4), 1233\u20131255 (2009)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"22_CR6","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1214\/009117905000000053","volume":"33","author":"E Cator","year":"2005","unstructured":"Cator, E., Groeneboom, P.: Hammersley\u2019s process with sources and sinks. Ann. Probab. 33(3), 879\u2013903 (2005)","journal-title":"Ann. Probab."},{"issue":"316","key":"22_CR7","first-page":"C324","volume":"6","author":"JS Frame","year":"1954","unstructured":"Frame, J.S., Robinson, G., Thrall, R.M.: The hook graphs of the symmetric group. Canad. J. Math. 6(316), C324 (1954)","journal-title":"Canad. J. Math."},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Hammersley, J.M.: A few seedlings of research. In: Proceedings of the Sixth Berkeley Symposium on Mathematical Statistics and Probability. Theory of Statistics, vol. 1 (1972)","DOI":"10.1525\/9780520325883-020"},{"key":"22_CR9","unstructured":"Hivert, F.: An Introduction to Combinatorial Hopf Algebras Physics and Theoretical Computer Science: From Numbers and Languages to (Quantum) Cryptography Security. IOS Press (2007)"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0377-0427(01)00461-7","volume":"142","author":"P Groenenboom","year":"2002","unstructured":"Groenenboom, P.: Hydrodynamical models for analyzing longest increasing sequences. J. Comput. Appl. Math. 142, 83\u2013105 (2002)","journal-title":"J. Comput. Appl. Math."},{"key":"22_CR11","unstructured":"Istrate, G., Bonchi\u015f, C.: Hammersley\u2019s process with multiple lifelines, and a conjecture on decomposing permutations into heapable sequences (manuscript in preparation, 2015)"},{"key":"22_CR12","unstructured":"Istrate, G., Bonchi\u015f, C.: Partition into heapable sequences, heap tableaux and a multiset extension of Hammersley\u2019s process. http:\/\/tcs.ieat.ro\/recent-papers\/"},{"key":"22_CR13","series-title":"Sorting and Searching","volume-title":"The Art of Computer Programming","author":"D Knuth","year":"1998","unstructured":"Knuth, D.: The Art of Computer Programming. Sorting and Searching, vol. 3. Addison Wesley, Redwood City (1998)"},{"issue":"1","key":"22_CR14","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1006\/inco.1994.1050","volume":"112","author":"C Levcopoulos","year":"1994","unstructured":"Levcopoulos, C., Petersson, O.: Sorting shuffled monotone sequences. Inf. Comput. 112(1), 37\u201350 (1994)","journal-title":"Inf. Comput."},{"issue":"2","key":"22_CR15","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1016\/0001-8708(77)90030-5","volume":"26","author":"BF Logan","year":"1977","unstructured":"Logan, B.F., Shepp, L.A.: A variational problem for random Young tableaux. Adv. Math. 26(2), 206\u2013222 (1977)","journal-title":"Adv. Math."},{"issue":"4","key":"22_CR16","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1137\/1005107","volume":"5","author":"CL Mallows","year":"1963","unstructured":"Mallows, C.L.: Patience sorting. SIAM Rev. 5(4), 375\u2013376 (1963)","journal-title":"SIAM Rev."},{"issue":"1","key":"22_CR17","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0304-4149(97)00004-5","volume":"67","author":"L Montoya","year":"1997","unstructured":"Montoya, L.: A rapidly mixing stochastic system of finite interacting particles on the circle. Stoch. Process. Appl. 67(1), 69\u201399 (1997)","journal-title":"Stoch. Process. Appl."},{"key":"22_CR18","volume-title":"The Surprising Mathematics of Longest Increasing Sequences","author":"D Romik","year":"2014","unstructured":"Romik, D.: The Surprising Mathematics of Longest Increasing Sequences. Cambridge University Press, Cambridge (2014)"},{"issue":"2","key":"22_CR19","doi-asserted-by":"publisher","first-page":"179","DOI":"10.4153\/CJM-1961-015-3","volume":"13","author":"C Schensted","year":"1961","unstructured":"Schensted, C.: Longest increasing and decreasing subsequences. Canad. J. Math. 13(2), 179\u2013191 (1961)","journal-title":"Canad. J. Math."},{"key":"22_CR20","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032770","volume-title":"Average Case Analysis of Algorithms on Sequences","author":"W Szpankowski","year":"2001","unstructured":"Szpankowski, W.: Average Case Analysis of Algorithms on Sequences. Wiley, New York (2001)"},{"key":"22_CR21","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970029","volume-title":"Probability Theory and Combinatorial Optimization","author":"JM Steele","year":"1997","unstructured":"Steele, J.M.: Probability Theory and Combinatorial Optimization. SIAM, Philadelphia (1997)"},{"issue":"6","key":"22_CR22","first-page":"1024","volume":"233","author":"A Vershik","year":"1977","unstructured":"Vershik, A., Kerov, S.: Asymptotics of Plancherel measure of symmetric group and limit form of Young tables. Dokl. Akad. Nauk SSSR 233(6), 1024\u20131027 (1977)","journal-title":"Dokl. Akad. Nauk SSSR"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19929-0_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T01:31:04Z","timestamp":1676943064000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19929-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319199283","9783319199290"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19929-0_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}