{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:22:28Z","timestamp":1750220548284,"version":"3.41.0"},"reference-count":61,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2020,12,14]],"date-time":"2020-12-14T00:00:00Z","timestamp":1607904000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGACT News"],"published-print":{"date-parts":[[2020,12,14]]},"abstract":"<jats:p>In this column, we will discuss some papers in online algorithms that appeared in 2020. As usual, we make no claim at complete coverage here, and have instead made a selection. If we have unaccountably missed your favorite paper and you would like to write about it or about any other topic in online algorithms, please don't hesitate to contact us!<\/jats:p>","DOI":"10.1145\/3444815.3444830","type":"journal-article","created":{"date-parts":[[2021,1,14]],"date-time":"2021-01-14T23:20:17Z","timestamp":1610666417000},"page":"89-107","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["SIGACT News Online Algorithms Column 36"],"prefix":"10.1145","volume":"51","author":[{"given":"Felix","family":"H\u00f6hne","sequence":"first","affiliation":[{"name":"University of Siegen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00f6ren","family":"Schmitt","sequence":"additional","affiliation":[{"name":"University of Siegen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rob","family":"van Stee","sequence":"additional","affiliation":[{"name":"University of Siegen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,1,14]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Susanne\n      Albers\n     and \n      Maximilian\n      Janke\n    .\n  Scheduling in the random-order model\n  . In Artur Czumaj Anuj Dawar and Emanuela Merelli editors 47th International Colloquium on Automata Languages and Programming ICALP \n  2020 July 8--11 2020 Saarbrucken Germany (Virtual Conference) volume \n  168\n   of \n  LIPIcs pages 68:1{68:\n  18\n  . Schloss Dagstuhl - Leibniz-Zentrum fur Informatik 2020.  Susanne Albers and Maximilian Janke. Scheduling in the random-order model. In Artur Czumaj Anuj Dawar and Emanuela Merelli editors 47th International Colloquium on Automata Languages and Programming ICALP 2020 July 8--11 2020 Saarbrucken Germany (Virtual Conference) volume 168 of LIPIcs pages 68:1{68:18. Schloss Dagstuhl - Leibniz-Zentrum fur Informatik 2020."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316312"},{"key":"e_1_2_1_3_1","volume-title":"LATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Buenos Aires, Argentina, April 16--19, 2018, Proceedings","volume":"10807","author":"Antoniadis Antonios","year":"2018"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/3381089.3381182"},{"key":"e_1_2_1_5_1","unstructured":"Yossi\n      Azar Ashish\n      Chiplunkar Shay\n      Kutten and \n      Noam\n      Touitou\n    .\n  Set cover with delay - clairvoyance is not required\n  . In Fabrizio Grandoni Grzegorz Herman and Peter Sanders editors 28th Annual European Symposium on Algorithms ESA \n  2020 September 7--9 2020 Pisa Italy (Virtual Conference) volume \n  173\n   of \n  LIPIcs pages 8:1{8:\n  21\n  . Schloss Dagstuhl - Leibniz-Zentrum fur Informatik 2020.  Yossi Azar Ashish Chiplunkar Shay Kutten and Noam Touitou. Set cover with delay - clairvoyance is not required. In Fabrizio Grandoni Grzegorz Herman and Peter Sanders editors 28th Annual European Symposium on Algorithms ESA 2020 September 7--9 2020 Pisa Italy (Virtual Conference) volume 173 of LIPIcs pages 8:1{8:21. Schloss Dagstuhl - Leibniz-Zentrum fur Informatik 2020."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384280"},{"volume-title":"On-line balancing of random inputs. CoRR, abs\/1903.06898","year":"2019","author":"Bansal Nikhil","key":"e_1_2_1_7_1"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/874062.875536"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/3381089.3381184"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219179"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316342"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00094"},{"key":"e_1_2_1_13_1","unstructured":"Marcin\n      Bienkowski Maciej\n      Pacut and \n      Krzysztof\n      Piecuch\n    .\n  An optimal algorithm for online multiple knapsack\n  . In Artur Czumaj Anuj Dawar and Emanuela Merelli editors 47th International Colloquium on Automata Languages and Programming ICALP \n  2020 July 8--11 2020 Saarbrucken Germany (Virtual Conference) volume \n  168\n   of \n  LIPIcs pages 13:1{13:\n  17\n  . Schloss Dagstuhl - Leibniz-Zentrum fur Informatik 2020.  Marcin Bienkowski Maciej Pacut and Krzysztof Piecuch. An optimal algorithm for online multiple knapsack. In Artur Czumaj Anuj Dawar and Emanuela Merelli editors 47th International Colloquium on Automata Languages and Programming ICALP 2020 July 8--11 2020 Saarbrucken Germany (Virtual Conference) volume 168 of LIPIcs pages 13:1{13:17. Schloss Dagstuhl - Leibniz-Zentrum fur Informatik 2020."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-003-1036-3"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/3381089.3381204"},{"volume-title":"61st Annual Symposium on Foundations of Computer Science, FOCS '20","year":"2020","author":"Braverman Vladimir","key":"e_1_2_1_16_1"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/3381089.3381180"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316314"},{"key":"e_1_2_1_19_1","unstructured":"S--ebastien \n      Bubeck\n       and \n      Yuval Rabani\n    .\n  Parametrized metrical task systems\n  . In Jaroslaw Byrka and Raghu Meka editors Approximation Randomization and Combinatorial Optimization. Algorithms and Techniques APPROX\/RANDOM \n  2020 August 17--19 2020 Virtual Conference volume \n  176\n   of \n  LIPIcs pages 54:1{54:\n  14\n  . Schloss Dagstuhl - Leibniz-Zentrum fur Informatik 2020.  S--ebastien Bubeck and Yuval Rabani. Parametrized metrical task systems. In Jaroslaw Byrka and Raghu Meka editors Approximation Randomization and Combinatorial Optimization. Algorithms and Techniques APPROX\/RANDOM 2020 August 17--19 2020 Virtual Conference volume 176 of LIPIcs pages 54:1{54:14. Schloss Dagstuhl - Leibniz-Zentrum fur Informatik 2020."},{"volume-title":"61st Annual IEEE Symposium on Foundations of Computer Science, FOCS 2020, November 16--19, 2020, Virtual Conference. IEEE Computer Society","year":"2020","author":"Bun Mark","key":"e_1_2_1_20_1"},{"key":"e_1_2_1_21_1","volume-title":"LATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Buenos Aires, Argentina, April 16--19, 2018, Proceedings","volume":"10807","author":"Carrasco Rodrigo A.","year":"2018"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3350755.3400281"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398594"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3350755.3400281"},{"key":"e_1_2_1_25_1","unstructured":"Ilan Reuven\n      Cohen Sungjin\n      Im and \n      Debmalya\n      Panigrahi\n    .\n  Online two-dimensional load balancing\n  . In Artur Czumaj Anuj Dawar and Emanuela Merelli editors 47th International Colloquium on Automata Languages and Programming ICALP \n  2020 July 8--11 2020 Saarbrucken Germany (Virtual Conference) volume \n  168\n   of \n  LIPIcs pages 34:1{34:\n  21\n  . Schloss Dagstuhl - Leibniz-Zentrum fur Informatik 2020.  Ilan Reuven Cohen Sungjin Im and Debmalya Panigrahi. Online two-dimensional load balancing. In Artur Czumaj Anuj Dawar and Emanuela Merelli editors 47th International Colloquium on Automata Languages and Programming ICALP 2020 July 8--11 2020 Saarbrucken Germany (Virtual Conference) volume 168 of LIPIcs pages 34:1{34:21. Schloss Dagstuhl - Leibniz-Zentrum fur Informatik 2020."},{"volume-title":"31st International Symposium on Algorithms and Computation (ISAAC 2020), December 14{18, 2020, Virtual Conference, Leibniz International Proceedings in Informatics (LIPIcs)","year":"2020","author":"de Berg Mark","key":"e_1_2_1_26_1"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2892563"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627817.2627824"},{"key":"e_1_2_1_29_1","unstructured":"Shaddin\n      Dughmi\n    .\n  The outer limits of contention resolution on matroids and connections to the secretary problem\n  . In Artur Czumaj Anuj Dawar and Emanuela Merelli editors 47th International Colloquium on Automata Languages and Programming ICALP \n  2020 July 8--11 2020 Saarbrucken Germany (Virtual Conference) volume \n  168\n   of \n  LIPIcs pages 42:1{42:\n  18\n  . Schloss Dagstuhl - Leibniz-Zentrum fur Informatik 2020.  Shaddin Dughmi. The outer limits of contention resolution on matroids and connections to the secretary problem. In Artur Czumaj Anuj Dawar and Emanuela Merelli editors 47th International Colloquium on Automata Languages and Programming ICALP 2020 July 8--11 2020 Saarbrucken Germany (Virtual Conference) volume 168 of LIPIcs pages 42:1{42:18. Schloss Dagstuhl - Leibniz-Zentrum fur Informatik 2020."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_49"},{"volume-title":"Edge-weighted online bipartite matching. CoRR, abs\/2005.01929","year":"2020","author":"Fahrbach Matthew","key":"e_1_2_1_31_1"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.04.011"},{"key":"e_1_2_1_33_1","unstructured":"Dimitris\n      Fotakis Loukas\n      Kavouras Grigorios\n      Koumoutsos Stratis\n      Skoulakis and \n      Manolis\n      Vardas\n    .\n  The online min-sum set cover problem\n  . In Artur Czumaj Anuj Dawar and Emanuela Merelli editors 47th International Colloquium on Automata Languages and Programming ICALP \n  2020 July 8--11 2020 Saarbrucken Germany (Virtual Conference) volume \n  168\n   of \n  LIPIcs pages 51:1{51:\n  16\n  . Schloss Dagstuhl - Leibniz-Zentrum fur Informatik 2020.  Dimitris Fotakis Loukas Kavouras Grigorios Koumoutsos Stratis Skoulakis and Manolis Vardas. The online min-sum set cover problem. In Artur Czumaj Anuj Dawar and Emanuela Merelli editors 47th International Colloquium on Automata Languages and Programming ICALP 2020 July 8--11 2020 Saarbrucken Germany (Virtual Conference) volume 168 of LIPIcs pages 51:1{51:16. Schloss Dagstuhl - Leibniz-Zentrum fur Informatik 2020."},{"key":"e_1_2_1_34_1","unstructured":"Xiangyu\n      Guo Janardhan\n      Kulkarni Shi\n      Li and \n      Jiayi\n      Xian\n    .\n  On the facility location problem in online and dynamic models\n  . In Jaroslaw Byrka and Raghu Meka editors Approximation Randomization and Combinatorial Optimization. Algorithms and Techniques APPROX\/RANDOM \n  2020 August 17--19 2020 Virtual Conference volume \n  176\n   of \n  LIPIcs pages 42:1{42:\n  23\n  . Schloss Dagstuhl - Leibniz-Zentrum fur Informatik 2020.  Xiangyu Guo Janardhan Kulkarni Shi Li and Jiayi Xian. On the facility location problem in online and dynamic models. In Jaroslaw Byrka and Raghu Meka editors Approximation Randomization and Combinatorial Optimization. Algorithms and Techniques APPROX\/RANDOM 2020 August 17--19 2020 Virtual Conference volume 176 of LIPIcs pages 42:1{42:23. Schloss Dagstuhl - Leibniz-Zentrum fur Informatik 2020."},{"key":"e_1_2_1_35_1","unstructured":"Xiangyu\n      Guo Janardhan\n      Kulkarni Shi\n      Li and \n      Jiayi\n      Xian\n    .\n  On the facility location problem in online and dynamic models\n  . In Jaroslaw Byrka and Raghu Meka editors Approximation Randomization and Combinatorial Optimization. Algorithms and Techniques APPROX\/RANDOM \n  2020 August 17--19 2020 Virtual Conference volume \n  176\n   of \n  LIPIcs pages 42:1{42:\n  23\n  . Schloss Dagstuhl - Leibniz-Zentrum fur Informatik 2020.  Xiangyu Guo Janardhan Kulkarni Shi Li and Jiayi Xian. On the facility location problem in online and dynamic models. In Jaroslaw Byrka and Raghu Meka editors Approximation Randomization and Combinatorial Optimization. Algorithms and Techniques APPROX\/RANDOM 2020 August 17--19 2020 Virtual Conference volume 176 of LIPIcs pages 42:1{42:23. Schloss Dagstuhl - Leibniz-Zentrum fur Informatik 2020."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/3381089.3381183"},{"key":"e_1_2_1_37_1","unstructured":"Varun\n      Gupta Ravishankar\n      Krishnaswamy and \n      Sai\n      Sandeep\n    .\n  Permutation strikes back: The power of recourse in online metric matching\n  . In Jaroslaw Byrka and Raghu Meka editors Approximation Randomization and Combinatorial Optimization. Algorithms and Techniques APPROX\/RANDOM \n  2020 August 17--19 2020 Virtual Conference volume \n  176\n   of \n  LIPIcs pages 40:1{40:\n  20\n  . Schloss Dagstuhl - Leibniz-Zentrum fur Informatik 2020.  Varun Gupta Ravishankar Krishnaswamy and Sai Sandeep. Permutation strikes back: The power of recourse in online metric matching. In Jaroslaw Byrka and Raghu Meka editors Approximation Randomization and Combinatorial Optimization. Algorithms and Techniques APPROX\/RANDOM 2020 August 17--19 2020 Virtual Conference volume 176 of LIPIcs pages 40:1{40:20. Schloss Dagstuhl - Leibniz-Zentrum fur Informatik 2020."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/3310435.3310613"},{"key":"e_1_2_1_39_1","volume-title":"ACM SIGACT News 105 December 2020, vol. 51, no. 4 D--aniel Marx, and Donald Sannella, editors, 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9--13","volume":"107","author":"Huang Zhiyi","year":"2018"},{"volume-title":"Xiaowei Wu, and Yuhao Zhang. Fully online matching II: beating ranking and water- lling. CoRR, abs\/2005.06311","year":"2020","author":"Huang Zhiyi","key":"e_1_2_1_40_1"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3350755.3400271"},{"key":"e_1_2_1_42_1","unstructured":"Zhihao\n      Jiang Debmalya\n      Panigrahi and \n      Kevin\n      Sun\n    .\n  Online algorithms for weighted paging with predictions\n  . In Artur Czumaj Anuj Dawar and Emanuela Merelli editors 47th International Colloquium on Automata Languages and Programming ICALP \n  2020 July 8--11 2020 Saarbrucken Germany (Virtual Conference) volume \n  168\n   of \n  LIPIcs pages 69:1{69:\n  18\n  . Schloss Dagstuhl - Leibniz-Zentrum fur Informatik 2020.  Zhihao Jiang Debmalya Panigrahi and Kevin Sun. Online algorithms for weighted paging with predictions. In Artur Czumaj Anuj Dawar and Emanuela Merelli editors 47th International Colloquium on Automata Languages and Programming ICALP 2020 July 8--11 2020 Saarbrucken Germany (Virtual Conference) volume 168 of LIPIcs pages 69:1{69:18. Schloss Dagstuhl - Leibniz-Zentrum fur Informatik 2020."},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.5555\/3381089.3381217"},{"key":"e_1_2_1_44_1","unstructured":"Thomas\n      Kesselheim\n     and \n      Marco\n      Molinaro\n    .\n  Knapsack secretary with bursty adversary\n  . In Artur Czumaj Anuj Dawar and Emanuela Merelli editors 47th International Colloquium on Automata Languages and Programming ICALP \n  2020 July 8--11 2020 Saarbrucken Germany (Virtual Conference) volume \n  168\n   of \n  LIPIcs pages 72:1{72:\n  15\n  . Schloss Dagstuhl - Leibniz-Zentrum fur Informatik 2020.  Thomas Kesselheim and Marco Molinaro. Knapsack secretary with bursty adversary. In Artur Czumaj Anuj Dawar and Emanuela Merelli editors 47th International Colloquium on Automata Languages and Programming ICALP 2020 July 8--11 2020 Saarbrucken Germany (Virtual Conference) volume 168 of LIPIcs pages 72:1{72:15. Schloss Dagstuhl - Leibniz-Zentrum fur Informatik 2020."},{"volume-title":"Twelfth Southeastern Conference on Combinatorics, Graph Theory and Computing","year":"1981","author":"Kierstead Henry A","key":"e_1_2_1_45_1"},{"key":"e_1_2_1_46_1","first-page":"13","volume-title":"31st International Symposium on Algorithms and Computation (ISAAC 2020), December 14{18, 2020, Virtual Conference, Leibniz International Proceedings in Informatics (LIPIcs)","author":"Predrag","year":"2020"},{"key":"e_1_2_1_47_1","first-page":"1858","volume-title":"Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020","author":"Kumar Ravi","year":"2020"},{"key":"e_1_2_1_48_1","first-page":"1577","volume-title":"Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020","author":"Kuszmaul William","year":"2020"},{"key":"e_1_2_1_49_1","first-page":"1877","volume-title":"Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020","author":"Lattanzi Silvio","year":"2020"},{"key":"e_1_2_1_50_1","series-title":"Proceedings of Machine Learning Research","first-page":"3311","volume-title":"Jennifer G. Dy and Andreas Krause","author":"Lykouris Thodoris","year":"2018"},{"key":"e_1_2_1_51_1","unstructured":"Nicole\n      Megow\n     and \n      Lukas\n      Nolke\n    .\n  Online minimum cost matching with recourse on the line\n  . In Jaroslaw Byrka and Raghu Meka editors Approximation Randomization and Combinatorial Optimization. Algorithms and Techniques APPROX\/RANDOM \n  2020 August 17--19 2020 Virtual Conference volume \n  176\n   of \n  LIPIcs pages 37:1{37:\n  16\n  . Schloss Dagstuhl - Leibniz-Zentrum fur Informatik 2020. ACM SIGACT News 106 December 2020 vol. 51 no. 4  Nicole Megow and Lukas Nolke. Online minimum cost matching with recourse on the line. In Jaroslaw Byrka and Raghu Meka editors Approximation Randomization and Combinatorial Optimization. Algorithms and Techniques APPROX\/RANDOM 2020 August 17--19 2020 Virtual Conference volume 176 of LIPIcs pages 37:1{37:16. Schloss Dagstuhl - Leibniz-Zentrum fur Informatik 2020. ACM SIGACT News 106 December 2020 vol. 51 no. 4"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.65"},{"key":"e_1_2_1_53_1","first-page":"1404","volume-title":"Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015","author":"Mehta Aranyak","year":"2015"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.53"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3350755.3400280"},{"volume-title":"Optimal analysis of an online algorithm for the bipartite matching problem on a line. CoRR, abs\/1803.07206","year":"2018","author":"Raghvendra Sharath","key":"e_1_2_1_56_1"},{"key":"e_1_2_1_57_1","first-page":"1845","volume-title":"Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020","author":"Rohatgi Dhruv","year":"2020"},{"key":"e_1_2_1_58_1","first-page":"1518","volume-title":"Proceedings of the 2020 ACMSIAM Symposium on Discrete Algorithms, SODA 2020","author":"Sellke Mark","year":"2020"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/2902945.2902960"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/2951860.2951871"},{"key":"e_1_2_1_61_1","unstructured":"Alexander\n      Wei\n    .\n  Better and simpler learning-augmented online caching\n  . In Jaroslaw Byrka and Raghu Meka editors Approximation Randomization and Combinatorial Optimization. Algorithms and Techniques APPROX\/RANDOM \n  2020 August 17--19 2020 Virtual Conference volume \n  176\n   of \n  LIPIcs pages 60:1{60:\n  17\n  . Schloss Dagstuhl - Leibniz-Zentrum fur Informatik 2020.  Alexander Wei. Better and simpler learning-augmented online caching. In Jaroslaw Byrka and Raghu Meka editors Approximation Randomization and Combinatorial Optimization. Algorithms and Techniques APPROX\/RANDOM 2020 August 17--19 2020 Virtual Conference volume 176 of LIPIcs pages 60:1{60:17. Schloss Dagstuhl - Leibniz-Zentrum fur Informatik 2020."}],"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3444815.3444830","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3444815.3444830","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:28:13Z","timestamp":1750195693000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3444815.3444830"}},"subtitle":["2020 in review"],"short-title":[],"issued":{"date-parts":[[2020,12,14]]},"references-count":61,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,12,14]]}},"alternative-id":["10.1145\/3444815.3444830"],"URL":"https:\/\/doi.org\/10.1145\/3444815.3444830","relation":{},"ISSN":["0163-5700"],"issn-type":[{"type":"print","value":"0163-5700"}],"subject":[],"published":{"date-parts":[[2020,12,14]]},"assertion":[{"value":"2021-01-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}