{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:55:26Z","timestamp":1742939726091,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030287955"},{"type":"electronic","value":"9783030287962"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-28796-2_15","type":"book-chapter","created":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T23:02:43Z","timestamp":1567378963000},"page":"193-206","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Localisation-Resistant Random Words with Small Alphabets"],"prefix":"10.1007","author":[{"given":"Cyril","family":"Gavoille","sequence":"first","affiliation":[]},{"given":"Ghazal","family":"Kachigar","sequence":"additional","affiliation":[]},{"given":"Gilles","family":"Z\u00e9mor","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,9]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","unstructured":"Almeida, M.L., Bancal, J.-D., Brunner, N., Ac\u00edn, A., Gisin, N., Pironio, S.: Guess your neighbor\u2019s input: a multipartite nonlocal game with no quantum advantage. Phys. Rev. Lett. 104 (2010). https:\/\/doi.org\/10.1103\/PhysRevLett.104.230404","DOI":"10.1103\/PhysRevLett.104.230404"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-31104-8_12","volume-title":"Structural Information and Communication Complexity","author":"H Arfaoui","year":"2012","unstructured":"Arfaoui, H., Fraigniaud, P.: What can be computed without communications? In: Even, G., Halld\u00f3rsson, M.M. (eds.) SIROCCO 2012. LNCS, vol. 7355, pp. 135\u2013146. Springer, Berlin (2012). https:\/\/doi.org\/10.1007\/978-3-642-31104-8_12"},{"issue":"1","key":"15_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2200\/S00520ED1V01Y201307DCT011","volume":"4","author":"Leonid Barenboim","year":"2013","unstructured":"Barenboim, L., Elkin, M.: Distributed graph coloring: fundamentals and recent developments. Synth. Lect. Distrib. Comput. Theory 4(1) (2013). https:\/\/doi.org\/10.2200\/S00520ED1V01Y201307DCT011","journal-title":"Synthesis Lectures on Distributed Computing Theory"},{"key":"15_CR4","doi-asserted-by":"publisher","unstructured":"Barenboim, L., Elkin, M., Pettie, S., Schneider, J.: The locality of distributed symmetry breaking. In: 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 321\u2013330. IEEE Computer Society Press, October 2012. https:\/\/doi.org\/10.1109\/FOCS.2012.60","DOI":"10.1109\/FOCS.2012.60"},{"key":"15_CR5","doi-asserted-by":"publisher","unstructured":"Brand\u00e3o, F.G.S.L., Harrow, A.W.: Quantum de Finetti theorems under local measurements with applications. In: 45th Annual ACM Symposium on Theory of Computing (STOC), pp. 861\u2013870. ACM Press, June (2013). https:\/\/doi.org\/10.1145\/2488608.2488718","DOI":"10.1145\/2488608.2488718"},{"key":"15_CR6","doi-asserted-by":"publisher","unstructured":"Brandt, S., et al.: LCL problems on grids. In: 35th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 101\u2013110. ACM Press, July 2016. https:\/\/doi.org\/10.1145\/3087801.3087833","DOI":"10.1145\/3087801.3087833"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.tcs.2012.12.017","volume":"486","author":"G Brassard","year":"2013","unstructured":"Brassard, G., Broadbent, A., H\u00e4nggi, E., M\u00e9thot, A.A., Wolf, S.: Classical, quantum and nonsignalling resources in bipartite games. Theor. Comput. Sci. 486, 61\u201372 (2013). https:\/\/doi.org\/10.1016\/j.tcs.2012.12.017","journal-title":"Theor. Comput. Sci."},{"key":"15_CR8","doi-asserted-by":"crossref","first-page":"R81","DOI":"10.37236\/999","volume":"14","author":"PJ Cameron","year":"2007","unstructured":"Cameron, P.J., Montanaro, A., Newman, M.W., Severin, S., Winter, A.: On the quantum chromatic number of a graph. Electron. J. Comb. 14, R81 (2007)","journal-title":"Electron. J. Comb."},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"4537","DOI":"10.1063\/1.1494475","volume":"43","author":"CM Caves","year":"2001","unstructured":"Caves, C.M., Fuchs, C.A., Schack, R.: Unknown quantum states: the quantum de Finetti representation. J. Math. Phys. 43, 4537 (2001). https:\/\/doi.org\/10.1063\/1.1494475","journal-title":"J. Math. Phys."},{"key":"15_CR10","doi-asserted-by":"publisher","unstructured":"Chang, Y.-J., Li, W., Pettie, S.: An optimal distributed $$(\\delta +1)$$-coloring algorithm? In: 50th Annual ACM Symposium on Theory of Computing (STOC), pp. 445\u2013456. ACM Press, June 2018. https:\/\/doi.org\/10.1145\/3188745.3188964","DOI":"10.1145\/3188745.3188964"},{"key":"15_CR11","volume-title":"Linear Programming","author":"V Chv\u00e1tal","year":"1983","unstructured":"Chv\u00e1tal, V.: Linear Programming. W. H. Freeman, New York (1983)"},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"032122","DOI":"10.1103\/PhysRevA.92.032122","volume":"92","author":"\u0141 Czekaj","year":"2015","unstructured":"Czekaj, \u0141., Paw\u0142owski, M., V\u00e9rtesi, T., Grudka, A., Horodecki, M., Horodecki, R.: Quantum advantage for distributed computing without communication. Phys. Rev. A 92, 032122 (2015). https:\/\/doi.org\/10.1103\/PhysRevA.92.032122","journal-title":"Phys. Rev. A"},{"key":"15_CR13","doi-asserted-by":"publisher","unstructured":"Fraigniaud, P., Heinrich, M., Kosowski, A.: Local conflict coloring. In: 57th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 625\u2013634. IEEE Computer Society Press, October 2016. https:\/\/doi.org\/10.1109\/FOCS.2016.73","DOI":"10.1109\/FOCS.2016.73"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-642-04355-0_26","volume-title":"Distributed Computing","author":"C Gavoille","year":"2009","unstructured":"Gavoille, C., Kosowski, A., Markiewicz, M.: What can be observed locally? In: Keidar, I. (ed.) DISC 2009. LNCS, vol. 5805, pp. 243\u2013257. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04355-0_26"},{"key":"15_CR15","doi-asserted-by":"publisher","unstructured":"Ghaffari, M., Kuhn, F., Maus, Y.: On the complexity of local distributed graph problems. In: 49th Annual ACM Symposium on Theory of Computing (STOC), pp. 784\u2013797. ACM Press, June 2017. https:\/\/doi.org\/10.1145\/3055399.3055471","DOI":"10.1145\/3055399.3055471"},{"key":"15_CR16","doi-asserted-by":"publisher","unstructured":"Harris, D.G., Schneider, J., Su, H.-H.: Distributed $${(\\Delta +1)}$$-coloring in sublogarithmic rounds. In: 48th Annual ACM Symposium on Theory of Computing (STOC), pp. 465\u2013478. ACM Press, June 2016. https:\/\/doi.org\/10.1145\/2897518.2897533","DOI":"10.1145\/2897518.2897533"},{"key":"15_CR17","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1215\/S0012-7094-48-01568-3","volume":"15","author":"W Hoeffding","year":"1948","unstructured":"Hoeffding, W., Robbins, H.: The central limit theorem for dependent variables. Duke Math. J. 15, 773\u2013780 (1948). https:\/\/doi.org\/10.1215\/S0012-7094-48-01568-3","journal-title":"Duke Math. J."},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1214\/18-ECP118","volume":"23","author":"AE Holroyd","year":"2018","unstructured":"Holroyd, A.E., Hutchcroft, T., Levy, A.: Finitely dependent cycle coloring. Electron. Commun. Probab. 23, 1\u20138 (2018). https:\/\/doi.org\/10.1214\/18-ECP118","journal-title":"Electron. Commun. Probab."},{"key":"15_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1214\/ECP.v20-4070","volume":"20","author":"AE Holroyd","year":"2015","unstructured":"Holroyd, A.E., Liggett, T.M.: Symmetric 1-dependent colorings of the integers. Electron. Commun. Probab. 20, 1\u20138 (2015). https:\/\/doi.org\/10.1214\/ECP.v20-4070","journal-title":"Electron. Commun. Probab."},{"key":"15_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/fmp.2016.7","volume":"4","author":"AE Holroyd","year":"2016","unstructured":"Holroyd, A.E., Liggett, T.M.: Finitely dependent coloring. Forum Math., Pi 4, 1\u201343 (2016). https:\/\/doi.org\/10.1017\/fmp.2016.7","journal-title":"Forum Math., Pi"},{"key":"15_CR21","doi-asserted-by":"publisher","first-page":"2867","DOI":"10.1214\/16-AOP1127","volume":"45","author":"AE Holroyd","year":"2017","unstructured":"Holroyd, A.E., Schramm, O., Wilson, D.B.: Finitary coloring. Ann. Probab. 45, 2867\u20132898 (2017). https:\/\/doi.org\/10.1214\/16-AOP1127","journal-title":"Ann. Probab."},{"key":"15_CR22","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.spl.2015.10.015","volume":"109","author":"U I\u015flak","year":"2016","unstructured":"I\u015flak, U.: Asymptotic normality of random sums of $$m$$-dependent random variables. Stat. Probab. Lett. 109, 22\u201329 (2016). https:\/\/doi.org\/10.1016\/j.spl.2015.10.015","journal-title":"Stat. Probab. Lett."},{"key":"15_CR23","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/j.disc.2006.11.059","volume":"308","author":"F Kramer","year":"2008","unstructured":"Kramer, F., Kramer, H.: A survey on the distance-colouring of graphs. Discrete Math. 308, 422\u2013426 (2008). https:\/\/doi.org\/10.1016\/j.disc.2006.11.059","journal-title":"Discrete Math."},{"key":"15_CR24","doi-asserted-by":"publisher","unstructured":"Le Gall, F., Magniez, F.: Sublinear-time quantum computation of the diameter in CONGEST networks. In: 37th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 337\u2013347. ACM Press, July 2018. https:\/\/doi.org\/10.1145\/3212734.3212744","DOI":"10.1145\/3212734.3212744"},{"key":"15_CR25","unstructured":"Le Gall, F., Nishimura, H., Rosmanis, A.: Quantum advantage for the LOCAL model in distributed computing. Technical report, October 2018. arXiv:1810.10838v1 [quant-ph]"},{"key":"15_CR26","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0221015","volume":"21","author":"N Linial","year":"1992","unstructured":"Linial, N.: Locality in distributed graphs algorithms. SIAM J. Comput. 21, 193\u2013201 (1992). https:\/\/doi.org\/10.1137\/0221015","journal-title":"SIAM J. Comput."},{"key":"15_CR27","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1137\/0404036","volume":"4","author":"M Naor","year":"1991","unstructured":"Naor, M.: A lower bound on probabilistic algorithms for distributive ring coloring. SIAM J. Discrete Math. 4, 409\u2013412 (1991). https:\/\/doi.org\/10.1137\/0404036","journal-title":"SIAM J. Discrete Math."},{"key":"15_CR28","doi-asserted-by":"publisher","first-page":"1259","DOI":"10.1137\/S0097539793254571","volume":"24","author":"M Naor","year":"1995","unstructured":"Naor, M., Stockmeyer, L.: What can be computed locally. SIAM J. Comput. 24, 1259\u20131277 (1995). https:\/\/doi.org\/10.1137\/S0097539793254571","journal-title":"SIAM J. Comput."},{"issue":"2","key":"15_CR29","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/j.akcej.2017.11.007","volume":"16","author":"Niranjan P.K.","year":"2019","unstructured":"Niranjan, P.K., Kola, S.R.: The $$k$$-distance chromatic number of trees and cycles. AKCE Int. J. Graphs Comb. (2017, in press). https:\/\/doi.org\/10.1016\/j.akcej.2017.11.007","journal-title":"AKCE International Journal of Graphs and Combinatorics"}],"container-title":["Lecture Notes in Computer Science","Combinatorics on Words"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-28796-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:47:26Z","timestamp":1710251246000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-28796-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030287955","9783030287962"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-28796-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"9 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WORDS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorics on Words","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Loughborough","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cwords2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/words2019.lboro.ac.uk\/","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":"34","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":"21","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":"62% - 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","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":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","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)"}}]}}