{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:42:24Z","timestamp":1742913744615,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319328584"},{"type":"electronic","value":"9783319328591"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-32859-1_27","type":"book-chapter","created":{"date-parts":[[2016,4,15]],"date-time":"2016-04-15T11:12:06Z","timestamp":1460718726000},"page":"320-334","source":"Crossref","is-referenced-by-count":2,"title":["Subquadratic-Time Algorithms for Abelian Stringology Problems"],"prefix":"10.1007","author":[{"given":"Tomasz","family":"Kociumaka","sequence":"first","affiliation":[]},{"given":"Jakub","family":"Radoszewski","sequence":"additional","affiliation":[]},{"given":"Bart\u0142omiej","family":"Wi\u015bniewski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,16]]},"reference":[{"key":"27_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/978-3-662-43948-7_10","volume-title":"Automata, Languages, and Programming","author":"A Amir","year":"2014","unstructured":"Amir, A., Chan, T.M., Lewenstein, M., Lewenstein, N.: On hardness of jumbled indexing. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 114\u2013125. Springer, Heidelberg (2014)"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-642-13122-6_11","volume-title":"Fun with Algorithms","author":"P Burcsi","year":"2010","unstructured":"Burcsi, P., Cicalese, F., Fici, G., Lipt\u00e1k, Z.: On table arrangements, scrabble freaks, and jumbled pattern matching. In: Boldi, P., Gargano, L. (eds.) FUN 2010. LNCS, vol. 6099, pp. 89\u2013101. Springer, Heidelberg (2010)"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Chan, T.M., Lewenstein, M.: Clustered integer 3SUM via additive combinatorics. In: Servedio, R.A., Rubinfeld, R. (eds.) Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, 14\u201317 June 2015, pp. 31\u201340. ACM (2015)","DOI":"10.1145\/2746539.2746568"},{"key":"27_CR4","unstructured":"Cicalese, F., Fici, G., Lipt\u00e1k, Z.: Searching for jumbled patterns in strings. In: Holub, J., Zd\u00e1rek, J. (eds.) Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, 31 August - 2 September 2009, pp. 105\u2013117. Prague Stringology Club, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague (2009)"},{"key":"27_CR5","first-page":"167","volume":"89","author":"S Constantinescu","year":"2006","unstructured":"Constantinescu, S., Ilie, L.: Fine and Wilf\u2019s theorem for abelian periods. Bull. EATCS 89, 167\u2013170 (2006)","journal-title":"Bull. EATCS"},{"issue":"3","key":"27_CR6","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.ipl.2012.11.001","volume":"113","author":"M Crochemore","year":"2013","unstructured":"Crochemore, M., Iliopoulos, C.S., Kociumaka, T., Kubica, M., Pachocki, J., Radoszewski, J., Rytter, W., Tyczy\u0144ski, W., Wale\u0144, T.: A note on efficient computation of all abelian periods in a string. Inf. Process. Lett. 113(3), 74\u201377 (2013)","journal-title":"Inf. Process. Lett."},{"key":"27_CR7","first-page":"33","volume":"24","author":"LJ Cummings","year":"1997","unstructured":"Cummings, L.J., Smyth, W.F.: Weak repetitions in strings. J. Comb. Math. Comb. Comput. 24, 33\u201348 (1997)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"27_CR8","first-page":"221","volume":"6","author":"P Erd\u00f6s","year":"1961","unstructured":"Erd\u00f6s, P.: Some unsolved problems. Hung. Acad. Sci. Mat. Kutat\u00f3 Int\u00e9zet K\u00f6zl 6, 221\u2013254 (1961)","journal-title":"Hung. Acad. Sci. Mat. Kutat\u00f3 Int\u00e9zet K\u00f6zl"},{"key":"27_CR9","unstructured":"Fici, G., Lecroq, T., Lefebvre, A., Prieur-Gaston, \u00c9.: Computing abelian periods in words. In: Holub, J., \u017dd\u2019\u00e1rek, J. (eds.) Proceedings of the Prague Stringology Conference 2011, pp. 184\u2013196. Czech Technical University in Prague, Czech Republic (2011)"},{"key":"27_CR10","unstructured":"Fici, G., Lecroq, T., Lefebvre, A., Prieur-Gaston, \u00c9., Smyth, W.: Quasi-linear time computation of the abelian periods of a word. In: Holub, J., \u017dd\u2019\u00e1rek, J. (eds.) Proceedings of the Prague Stringology Conference 2012, pp. 103\u2013110. Czech Technical University in Prague, Czech Republic (2012)"},{"key":"27_CR11","unstructured":"Hermelin, D., Landau, G.M., Rabinovich, Y., Weimann, O.: Binary jumbled pattern matching via all-pairs shortest paths. CoRR, abs\/1401.2065 (2014)"},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/978-3-642-40450-4_53","volume-title":"Algorithms \u2013 ESA 2013","author":"T Kociumaka","year":"2013","unstructured":"Kociumaka, T., Radoszewski, J., Rytter, W.: Efficient indexes for jumbled pattern matching with constant-sized alphabet. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 625\u2013636. Springer, Heidelberg (2013)"},{"key":"27_CR13","unstructured":"Kociumaka, T., Radoszewski, J., Rytter, W.: Fast algorithms for abelian periods in words and greatest common divisor queries. In: Portier, N., Wilke, T. (eds.) 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, 27 February - 2 March 2013, Kiel, Germany, vol. 20 of LIPIcs, pp. 245\u2013256. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2013)"},{"key":"27_CR14","unstructured":"Matsuda, S., Inenaga, S., Bannai, H., Takeda, M.: Computing abelian covers and abelian runs. In: Holub, J., Zd\u00e1rek, J. (eds.) Proceedings of the Prague Stringology Conference 2014. Prague, Czech Republic, 1\u20133 September 2014, pp. 43\u201351. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague (2014)"},{"issue":"18\u201319","key":"27_CR15","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1016\/j.ipl.2010.06.012","volume":"110","author":"TM Moosa","year":"2010","unstructured":"Moosa, T.M., Rahman, M.S.: Indexing permutations for binary strings. Inf. Process. Lett. 110(18\u201319), 795\u2013798 (2010)","journal-title":"Inf. Process. Lett."},{"key":"27_CR16","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.jda.2011.08.003","volume":"10","author":"TM Moosa","year":"2012","unstructured":"Moosa, T.M., Rahman, M.S.: Sub-quadratic time and linear space data structures for permutation matching in binary strings. J. Discrete Algorithms 10, 5\u20139 (2012)","journal-title":"J. Discrete Algorithms"}],"container-title":["Lecture Notes in Computer Science","Mathematical Aspects of Computer and Information Sciences"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-32859-1_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T20:37:53Z","timestamp":1559421473000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-32859-1_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319328584","9783319328591"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-32859-1_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}