{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:21:44Z","timestamp":1743045704759,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030617912"},{"type":"electronic","value":"9783030617929"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-61792-9_39","type":"book-chapter","created":{"date-parts":[[2020,12,2]],"date-time":"2020-12-02T21:15:48Z","timestamp":1606943748000},"page":"491-503","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Quasi-Random Words and Limits of Word Sequences"],"prefix":"10.1007","author":[{"given":"Hi\u1ec7p","family":"H\u00e0n","sequence":"first","affiliation":[]},{"given":"Marcos","family":"Kiwi","sequence":"additional","affiliation":[]},{"given":"Mat\u00edas","family":"Pavez-Sign\u00e9","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,3]]},"reference":[{"issue":"3","key":"39_CR1","first-page":"3","volume":"25","author":"E Aigner-Horev","year":"2018","unstructured":"Aigner-Horev, E., Conlon, D., H\u00e0n, H., Person, Y., Schacht, M.: Quasirandomness in hypergraphs. Electron. J. Comb. 25(3), 3\u201334 (2018)","journal-title":"Electron. J. Comb."},{"issue":"1","key":"39_CR2","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1137\/060667177","volume":"39","author":"N Alon","year":"2009","unstructured":"Alon, N., Fischer, E., Newman, I., Shapira, A.: A combinatorial characterization of the testable graph properties: it\u2019s all about regularity. SIAM J. Comput. 39(1), 143\u2013167 (2009)","journal-title":"SIAM J. Comput."},{"key":"39_CR3","doi-asserted-by":"crossref","unstructured":"Alon, N., Shapira, A.: Every monotone graph property is testable. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, STOC 2005, pp. 128\u2013137. ACM (2005)","DOI":"10.1145\/1060590.1060611"},{"issue":"6","key":"39_CR4","doi-asserted-by":"publisher","first-page":"1703","DOI":"10.1137\/06064888X","volume":"37","author":"N Alon","year":"2008","unstructured":"Alon, N., Shapira, A.: A characterization of the (natural) graph properties testable with one-sided error. SIAM J. Comput. 37(6), 1703\u20131727 (2008)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"39_CR5","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1016\/j.jcta.2013.01.001","volume":"120","author":"M Axenovich","year":"2013","unstructured":"Axenovich, M., Person, Y., Puzynina, S.: A regularity lemma and twins in words. J. Combin. Theory Ser. A 120(4), 733\u2013743 (2013)","journal-title":"J. Combin. Theory Ser. A"},{"key":"39_CR6","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1145\/200836.200880","volume":"42","author":"M Blum","year":"1995","unstructured":"Blum, M., Kannan, S.: Designing programs that check their work. J. ACM 42, 269\u2013291 (1995)","journal-title":"J. ACM"},{"key":"39_CR7","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1016\/0022-0000(93)90044-W","volume":"47","author":"M Blum","year":"1993","unstructured":"Blum, M., Luby, M., Rubinfeld, R.: Self-testing\/correcting with applications to numerical problems. J. Comput. Syst. Sci. 47, 549\u2013595 (1993)","journal-title":"J. Comput. Syst. Sci."},{"issue":"6","key":"39_CR8","doi-asserted-by":"publisher","first-page":"1801","DOI":"10.1016\/j.aim.2008.07.008","volume":"219","author":"C Borgs","year":"2008","unstructured":"Borgs, C., Chayes, J., Lov\u00e1sz, L., S\u00f3s, V., Vesztergombi, K.: Convergent sequences of dense graphs I: subgraph frequencies, metric properties and testing. Adv. Math. 219(6), 1801\u20131851 (2008)","journal-title":"Adv. Math."},{"issue":"4","key":"39_CR9","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF02125347","volume":"9","author":"FRK Chung","year":"1989","unstructured":"Chung, F.R.K., Graham, R.L., Wilson, R.M.: Quasi-random graphs. Combinatorica 9(4), 345\u2013362 (1989)","journal-title":"Combinatorica"},{"issue":"21","key":"39_CR10","doi-asserted-by":"publisher","first-page":"8175","DOI":"10.1073\/pnas.86.21.8175","volume":"86","author":"F Chung","year":"1989","unstructured":"Chung, F., Graham, R.: Quasi-random hypergraphs. Proc. Natl. Acad. Sci. 86(21), 8175\u20138177 (1989)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"1","key":"39_CR11","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/0097-3165(92)90053-W","volume":"61","author":"F Chung","year":"1992","unstructured":"Chung, F., Graham, R.: Quasi-random subsets of $$\\mathbb{Z}_n$$. J. Comb. Theory Ser. A 61(1), 64\u201386 (1992)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"2","key":"39_CR12","doi-asserted-by":"publisher","first-page":"306","DOI":"10.2307\/3212444","volume":"12","author":"V Chv\u00e1tal","year":"1975","unstructured":"Chv\u00e1tal, V., Sankoff, D.: Longest common subsequences of two random sequences. J. Appl. Probab. 12(2), 306\u2013315 (1975)","journal-title":"J. Appl. Probab."},{"issue":"1","key":"39_CR13","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.jcta.2004.01.006","volume":"106","author":"JN Cooper","year":"2004","unstructured":"Cooper, J.N.: Quasirandom permutations. J. Combin. Theory Ser. A 106(1), 123\u2013143 (2004)","journal-title":"J. Combin. Theory Ser. A"},{"issue":"4","key":"39_CR14","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1145\/285055.285060","volume":"45","author":"O Goldreich","year":"1998","unstructured":"Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. J. ACM 45(4), 653\u2013750 (1998)","journal-title":"J. ACM"},{"key":"39_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/9781108135252","volume-title":"Introduction to Property Testing","author":"O Goldreich","year":"2017","unstructured":"Goldreich, O.: Introduction to Property Testing. Cambridge University Press, Cambridge (2017)"},{"issue":"3","key":"39_CR16","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/s00039-001-0332-9","volume":"11","author":"W Gowers","year":"2001","unstructured":"Gowers, W.: A new proof of Szemer\u00e9di\u2019s theorem. Geom. Funct. Anal. 11(3), 465\u2013588 (2001)","journal-title":"Geom. Funct. Anal."},{"issue":"1\u20132","key":"39_CR17","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1017\/S0963548305007236","volume":"15","author":"W Gowers","year":"2006","unstructured":"Gowers, W.: Quasirandomness, counting and regularity for 3-uniform hypergraphs. Comb. Probab. Comput. 15(1\u20132), 143\u2013184 (2006)","journal-title":"Comb. Probab. Comput."},{"issue":"3","key":"39_CR18","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1017\/S0963548307008826","volume":"17","author":"W Gowers","year":"2008","unstructured":"Gowers, W.: Quasirandom groups. Comb. Probab. Comput. 17(3), 363\u2013387 (2008)","journal-title":"Comb. Probab. Comput."},{"key":"39_CR19","doi-asserted-by":"crossref","unstructured":"H\u00e0n, H., Kiwi, M., Pavez-Sign\u00e9, M.: Quasi-random words and limits of word sequences. arXiv e-prints, arXiv:2003.03664, March 2020","DOI":"10.1007\/978-3-030-61792-9_39"},{"issue":"29","key":"39_CR20","doi-asserted-by":"publisher","first-page":"3555","DOI":"10.1016\/j.tcs.2011.03.002","volume":"412","author":"C Hoppen","year":"2011","unstructured":"Hoppen, C., Kohayakawa, Y., Moreira, C.G., Sampaio, R.M.: Testing permutation properties through subpermutations. Theoret. Comput. Sci. 412(29), 3555\u20133567 (2011)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"39_CR21","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.jctb.2012.09.003","volume":"103","author":"C Hoppen","year":"2013","unstructured":"Hoppen, C., Kohayakawa, Y., Moreira, C.G., R\u00e1th, B., Sampaio, R.M.: Limits of permutation sequences. J. Combin. Theory Ser. B 103(1), 93\u2013113 (2013)","journal-title":"J. Combin. Theory Ser. B"},{"key":"39_CR22","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-540-32439-3_10","volume-title":"More Sets, Graphs and Numbers: A Salute to Vera S\u00f3s and Andr\u00e1s Hajnal","author":"M Krivelevich","year":"2006","unstructured":"Krivelevich, M., Sudakov, B.: Pseudo-random graphs. In: Gy\u0151ri, E., Katona, G.O.H., Lov\u00e1sz, L., Fleiner, T. (eds.) More Sets, Graphs and Numbers: A Salute to Vera S\u00f3s and Andr\u00e1s Hajnal, pp. 199\u2013262. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/978-3-540-32439-3_10"},{"issue":"5","key":"39_CR23","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/j.jctb.2011.03.005","volume":"101","author":"L Lov\u00e1sz","year":"2011","unstructured":"Lov\u00e1sz, L., Szegedy, B.: Finitely forcible graphons. J. Comb. Theory Ser. B 101(5), 269\u2013301 (2011)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"39_CR24","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s11856-010-0060-7","volume":"178","author":"L Lov\u00e1sz","year":"2010","unstructured":"Lov\u00e1sz, L., Szegedy, B.: Testing properties of graphs and functions. Israel J. Math. 178(1), 113\u2013156 (2010)","journal-title":"Israel J. Math."},{"issue":"6","key":"39_CR25","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1016\/j.jctb.2006.05.002","volume":"96","author":"L Lov\u00e1sz","year":"2006","unstructured":"Lov\u00e1sz, L., Szegedy, B.: Limits of dense graph sequences. J. Comb. Theory Ser. B 96(6), 933\u2013957 (2006)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"39_CR26","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.jctb.2007.06.005","volume":"98","author":"L Lov\u00e1sz","year":"2008","unstructured":"Lov\u00e1sz, L., S\u00f3s, V.T.: Generalized quasirandom graphs. J. Comb. Theory Ser. B 98(1), 146\u2013163 (2008)","journal-title":"J. Comb. Theory Ser. B"},{"key":"39_CR27","doi-asserted-by":"crossref","unstructured":"Lueker, G.S.: Improved bounds on the average length of longest common subsequences. J. ACM 56(3), 17:1\u201317:38 (2009)","DOI":"10.1145\/1516512.1516519"},{"issue":"1\u20132","key":"39_CR28","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0012-365X(86)90076-2","volume":"59","author":"V R\u00f6dl","year":"1986","unstructured":"R\u00f6dl, V.: On universality of graphs with uniformly distributed edges. Discret. Math. 59(1\u20132), 125\u2013134 (1986)","journal-title":"Discret. Math."},{"key":"39_CR29","unstructured":"Szegedy, B.: From graph limits to higher order Fourier analysis. In: Proceedings of the International Congress of Mathematicians, vol. 3, pp. 3197\u20133218. World Scientific (2018)"},{"key":"39_CR30","doi-asserted-by":"crossref","unstructured":"Szpankowski, W.: Average Case Analysis of Algorithms on Sequences. Series in Discrete Mathematics and Optimization. Wiley-Interscience (2001)","DOI":"10.1002\/9781118032770"},{"key":"39_CR31","doi-asserted-by":"crossref","unstructured":"Thomason, A.: Pseudo-random graphs. In: Barlotti, A., Biliotti, M., Cossu, A., Korchmaros, G., Tallini, G. (eds.) Annals of Discrete Mathematics (33). North-Holland Mathematics Studies, vol. 144, pp. 307\u2013331. North-Holland (1987)","DOI":"10.1016\/S0304-0208(08)73063-9"},{"key":"39_CR32","unstructured":"Towsner, H.: -algebras for quasirandom hypergraphs. Random Struct. Algorithms 50(1), 114\u2013139 (2017)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2020: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-61792-9_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,16]],"date-time":"2021-04-16T06:55:42Z","timestamp":1618556142000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-61792-9_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030617912","9783030617929"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-61792-9_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"3 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sao Paulo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazil","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 January 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 January 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/latin2020.ime.usp.br\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"136","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,16","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the Corona pandemic the symposium was moved from May 2020 to January 2021.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}