{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T00:03:57Z","timestamp":1780704237081,"version":"3.54.1"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032284037","type":"print"},{"value":"9783032284044","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-28404-4_22","type":"book-chapter","created":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T23:19:58Z","timestamp":1780701598000},"page":"293-306","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Four Corners Problem Over Larger Alphabets"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Pr\u016f\u0161a","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Wehar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chen","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,6]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Aldridge, I.: High-frequency trading: a practical guide to algorithmic strategies and trading systems, vol. 604. John Wiley & Sons (2013)","DOI":"10.1002\/9781119203803"},{"issue":"3","key":"22_CR2","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF02523189","volume":"17","author":"N Alon","year":"1997","unstructured":"Alon, N., Yuster, R., Zwick, U.: Finding and counting given length cycles. Algorithmica 17(3), 209\u2013223 (1997)","journal-title":"Algorithmica"},{"key":"22_CR3","unstructured":"Arlazarov, V.L., Dinic, E., Kronrod, M., Faradzev, I.: On economical construction of the transitive closure of a directed graph. In: Dokl. Akad. Nauk SSSR, vol.\u00a0194, pp. 1209\u20131210 (1970)"},{"issue":"4","key":"22_CR4","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1137\/0207043","volume":"7","author":"TP Baker","year":"1978","unstructured":"Baker, T.P.: A technique for extending rapid exact-match string matching to arrays of more than one dimension. SIAM J. Comput. 7(4), 533\u2013541 (1978). https:\/\/doi.org\/10.1137\/0207043","journal-title":"SIAM J. Comput."},{"issue":"5","key":"22_CR5","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/0020-0190(77)90017-5","volume":"6","author":"RS Bird","year":"1977","unstructured":"Bird, R.S.: Two dimensional pattern matching. Inf. Process. Lett. 6(5), 168\u2013170 (1977). https:\/\/doi.org\/10.1016\/0020-0190(77)90017-5","journal-title":"Inf. Process. Lett."},{"key":"22_CR6","unstructured":"Bringmann, K.: Fine-grained complexity theory (tutorial). In: 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019). Schloss-Dagstuhl-Leibniz Zentrum f\u00fcr Informatik (2019)"},{"issue":"1\u20133","key":"22_CR7","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.tcs.2004.05.009","volume":"326","author":"F Eisenbrand","year":"2004","unstructured":"Eisenbrand, F., Grandoni, F.: On the complexity of fixed parameter clique and dominating set. Theoret. Comput. Sci. 326(1\u20133), 57\u201367 (2004)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"22_CR8","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s11856-011-0061-1","volume":"184","author":"M Elkin","year":"2011","unstructured":"Elkin, M.: An improved construction of progression-free sets. Israel J. Math. 184(1), 93\u2013128 (2011)","journal-title":"Israel J. Math."},{"key":"22_CR9","doi-asserted-by":"publisher","unstructured":"Giammarresi, D., Restivo, A.: Two-dimensional languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 215\u2013267. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-3-642-59126-6_4","DOI":"10.1007\/978-3-642-59126-6_4"},{"issue":"2","key":"22_CR10","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1137\/S0097539794275872","volume":"29","author":"J K\u00e4rkk\u00e4inen","year":"1999","unstructured":"K\u00e4rkk\u00e4inen, J., Ukkonen, E.: Two- and higher-dimensional pattern matching in optimal expected time. SIAM J. Comput. 29(2), 571\u2013589 (1999). https:\/\/doi.org\/10.1137\/S0097539794275872","journal-title":"SIAM J. Comput."},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.tcs.2020.12.026","volume":"870","author":"F Mr\u00e1z","year":"2021","unstructured":"Mr\u00e1z, F., Pr\u016f\u0161a, D., Wehar, M.: Two-dimensional pattern matching against local and regular-like picture languages. Theoret. Comput. Sci. 870, 137\u2013152 (2021)","journal-title":"Theoret. Comput. Sci."},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1016\/j.neucom.2013.03.018","volume":"119","author":"S Murala","year":"2013","unstructured":"Murala, S., Wu, Q.J.: Local ternary co-occurrence patterns: a new feature descriptor for MRI and CT image retrieval. Neurocomputing 119, 399\u2013412 (2013)","journal-title":"Neurocomputing"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Pr\u016f\u0161a, D., Wehar, M.: Complexity of searching for 2 by 2 submatrices in boolean matrices. In: International Conference on Developments in Language Theory, pp. 266\u2013279. Springer (2020)","DOI":"10.1007\/978-3-030-48516-0_20"},{"key":"22_CR14","unstructured":"Sun, X., Nobel, A.: On the size and recovery of submatrices of ones in a random binary matrix. J. Mach. Learn. Res.-JMLR 9, 2431\u20132453 (2008)"},{"issue":"17\u201318","key":"22_CR15","doi-asserted-by":"publisher","first-page":"8017","DOI":"10.1016\/j.apm.2016.04.027","volume":"40","author":"S Uguz","year":"2016","unstructured":"Uguz, S., Akin, H., Siap, I., Sahin, U.: On the irreversibility of moore cellular automata over the ternary field and image application. Appl. Math. Model. 40(17\u201318), 8017\u20138032 (2016)","journal-title":"Appl. Math. Model."},{"issue":"2","key":"22_CR16","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/BF01931281","volume":"31","author":"MJ Van Kreveld","year":"1991","unstructured":"Van Kreveld, M.J., De Berg, M.T.: Finding squares and rectangles in sets of points. BIT Numer. Math. 31(2), 202\u2013219 (1991)","journal-title":"BIT Numer. Math."},{"key":"22_CR17","unstructured":"Vassilevska\u00a0Williams, V.: Hardness of easy problems: Basing hardness on popular conjectures such as the strong exponential time hypothesis (invited talk). In: 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Schloss-Dagstuhl-Leibniz Zentrum f\u00fcr Informatik (2015)"},{"key":"22_CR18","unstructured":"Wehar, M.: In an $$m$$ by $$n$$ boolean matrix, can you find a square block whose four corners are ones in $${O}(m \\cdot n)$$ time? Theoretical Computer Science Stack Exchange. https:\/\/cstheory.stackexchange.com\/q\/47588"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Williams, V.V., Wang, J.R., Williams, R., Yu, H.: Finding four-node subgraphs in triangle time. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1671\u20131680. SIAM (2014)","DOI":"10.1137\/1.9781611973730.111"},{"key":"22_CR20","unstructured":"Williams, V.V., Williams, R.: Triangle detection versus matrix multiplication: A study of truly subcubic reducibility (2009)"},{"key":"22_CR21","unstructured":"Xu, C.: Rectangles in point set (2015). https:\/\/chaoxu.prof\/posts\/2015-02-02-rectangle-in-point-set.html"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-28404-4_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T23:20:03Z","timestamp":1780701603000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-28404-4_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032284037","9783032284044"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-28404-4_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"6 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that\u00a0are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"DLT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Developments in Language Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rouen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dlt-ncma-2026.sciencesconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}