{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:20:45Z","timestamp":1750220445024,"version":"3.41.0"},"reference-count":39,"publisher":"Association for Computing Machinery (ACM)","issue":"11","license":[{"start":{"date-parts":[[2020,10,22]],"date-time":"2020-10-22T00:00:00Z","timestamp":1603324800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100005739","name":"Universidad Nacional Aut\u00f3noma de M\u00e9xico","doi-asserted-by":"crossref","award":["PAPIIT IN106520"],"award-info":[{"award-number":["PAPIIT IN106520"]}],"id":[{"id":"10.13039\/501100005739","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"crossref","award":["2018\/04876-1"],"award-info":[{"award-number":["2018\/04876-1"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"crossref","award":["Finance Code 001"],"award-info":[{"award-number":["Finance Code 001"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"crossref","award":["311412\/2018-1, 423833\/2018-9"],"award-info":[{"award-number":["311412\/2018-1, 423833\/2018-9"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Consejo Nacional de Ciencia y Tecnolog\u00eda, Mexico","award":["313572"],"award-info":[{"award-number":["313572"]}]},{"DOI":"10.13039\/501100020884","name":"Agencia Nacional de Investigaci\u00f3n y Desarrollo","doi-asserted-by":"crossref","award":["PIA\/AFB170001"],"award-info":[{"award-number":["PIA\/AFB170001"]}],"id":[{"id":"10.13039\/501100020884","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Comisi\u00f3n Sectorial de Investigaci\u00f3n Cient\u00edfica de la UdelaR","award":["2019-2020 An\u00e1lisis probabil\u00edstico de problemas relacionados con criptograf\u00eda y comunicaciones"],"award-info":[{"award-number":["2019-2020 An\u00e1lisis probabil\u00edstico de problemas relacionados con criptograf\u00eda y comunicaciones"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[2020,10,22]]},"DOI":"10.1145\/3419975","type":"journal-article","created":{"date-parts":[[2020,10,22]],"date-time":"2020-10-22T18:17:26Z","timestamp":1603390646000},"page":"102-107","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A perspective on theoretical computer science in Latin America"],"prefix":"10.1145","volume":"63","author":[{"given":"Marcos","family":"Kiwi","sequence":"first","affiliation":[{"name":"Universidad de Chile, Santiago, Chile"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshiharu","family":"Kohayakawa","sequence":"additional","affiliation":[{"name":"Universidade de S\u00e3o Paulo, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergio","family":"Rajsbaum","sequence":"additional","affiliation":[{"name":"Universidad Aut\u00f3noma de M\u00e9xico, Mexico City, Mexico"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francisco","family":"Rodr\u00edguez-Henr\u00edquez","sequence":"additional","affiliation":[{"name":"CINVESTAV, Mexico City, Mexico"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jayme Luiz","family":"Szwarcfiter","sequence":"additional","affiliation":[{"name":"Universidade Federal do Rio de Janeiro and Universidade do Estado do Rio de Janeir, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfredo","family":"Viola","sequence":"additional","affiliation":[{"name":"Universidad de la Rep\u00fablica, Montevideo, Uruguay"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,10,22]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00233-019-09999-8"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.01.018"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-017-3553-8"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190040406"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/0211056"},{"key":"e_1_2_1_6_1","first-page":"17","article-title":"A minimax theorem for directed graphs","volume":"2","author":"Lucchesi C.L.","year":"1978","unstructured":"Lucchesi, C.L. and Younger, D. A minimax theorem for directed graphs. J. Lond. Math. Soc. 2, 17 (1978), 369--374.","journal-title":"J. Lond. Math. Soc."},{"key":"e_1_2_1_7_1","volume-title":"Modern Information Retrieval: The Concepts and Technology Behind Search","author":"Baeza-Yates R.","year":"2011","unstructured":"Baeza-Yates, R., and Ribeiro-Neto, B. Modern Information Retrieval: The Concepts and Technology Behind Search. ACM Press (2nd ed), 2011."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316588284"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316135228"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.881693"},{"key":"e_1_2_1_11_1","first-page":"29","article-title":"Approximation schemes for independent set and sparse subsets of polygons","volume":"66","author":"Adamszek A.","year":"2019","unstructured":"Adamszek, A., Har-Peled, S., and Wiese, A. Approximation schemes for independent set and sparse subsets of polygons. J. ACM 66, 4 article 29 (2019).","journal-title":"J. ACM"},{"key":"e_1_2_1_12_1","volume-title":"Proceedings of 2019 SODA","author":"Buchbinder N.","year":"2019","unstructured":"Buchbinder, N. et al. k-Servers with a smile: Online algorithms via projections. In Proceedings of 2019 SODA (2019), 98--116."},{"key":"e_1_2_1_13_1","volume-title":"Proceedings of 2017 EC","author":"Correa J.","year":"2017","unstructured":"Correa, J. et al. Posted price mechanisms for a random stream of customers. In Proceedings of 2017 EC (2017), 169--186."},{"volume-title":"Proceedings of 2019 ICML, 1242--1251","author":"Cicalese F.","key":"e_1_2_1_14_1","unstructured":"Cicalese, F., Laber, E. S., and Murtinho, L. New results on information theoretic clustering. In Proceedings of 2019 ICML, 1242--1251."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0821-x"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979631391X"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.47"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-018-0345-3"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/18M1233534"},{"key":"e_1_2_1_20_1","volume-title":"Proceedings of 2019 SIROCCO","author":"Casta\u00f1eda A.","year":"2019","unstructured":"Casta\u00f1eda, A. et al. A topological perspective on distributed network algorithms. In Proceedings of 2019 SIROCCO (2019), 3--18."},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of 2018 GandALF","author":"Goubault E.","year":"2018","unstructured":"Goubault, E., Ledent, J., and Rajsbaum, S. To appear in Inf. Comput. 2020, A preliminary version of A simplicial complex model for dynamic epistemic logic to study distributed task computability. In Proceedings of 2018 GandALF (2018), 73--87."},{"key":"e_1_2_1_22_1","volume-title":"Morgan Kaufmann","author":"Herlihy M.","year":"2013","unstructured":"Herlihy, M., Kozlov, D.N., and Rajsbaum, S. Distributed Computing Through Combinatorial Topology. Morgan Kaufmann, 2013."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2012.11.016"},{"key":"e_1_2_1_24_1","first-page":"3","article-title":"Independent sets in hypergraphs","volume":"28","author":"Balogh J.","year":"2015","unstructured":"Balogh, J., Morris, R., and Samotij, W. Independent sets in hypergraphs. J. Amer. Math. Soc. 28, 3 (2015), 669--709.","journal-title":"J. Amer. Math. Soc."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/140982842"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-015-0111-x"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1214\/17-AAP1323"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-009-9180-4"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3046673"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2014.09.004"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/282918.282923"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-044482537-7\/50023-1"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2014.02.005"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnt.2012.08.027"},{"key":"e_1_2_1_35_1","volume-title":"Proceedings of 2005 SAC","author":"Barreto P.S.L.M.","year":"2005","unstructured":"Barreto, P.S.L.M., and Naehrig, M. Pairing-friendly elliptic curves of prime order. In Proceedings of 2005 SAC (2005), 319--331."},{"volume-title":"Proceedings of 1999 CHES, 316--327","author":"Hern\u00e1ndez J.","key":"e_1_2_1_36_1","unstructured":"Hern\u00e1ndez, J. and Dahab, R. Fast multiplication on elliptic curves over GF(2m) without precomputation. In Proceedings of 1999 CHES, 316--327."},{"key":"e_1_2_1_37_1","unstructured":"The Random UChile Project; https:\/\/random.uchile.cl\/"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2010.05.013"},{"key":"e_1_2_1_39_1","unstructured":"Wikipedia. Discrete logarithm records; https:\/\/en.wikipedia.org\/wiki\/Discrete_logarithm_records"}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3419975","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3419975","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:47:39Z","timestamp":1750193259000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3419975"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,22]]},"references-count":39,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2020,10,22]]}},"alternative-id":["10.1145\/3419975"],"URL":"https:\/\/doi.org\/10.1145\/3419975","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"type":"print","value":"0001-0782"},{"type":"electronic","value":"1557-7317"}],"subject":[],"published":{"date-parts":[[2020,10,22]]},"assertion":[{"value":"2020-10-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}