{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:26:09Z","timestamp":1750220769459,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":78,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T00:00:00Z","timestamp":1592784000000},"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":[],"published-print":{"date-parts":[[2020,6,22]]},"DOI":"10.1145\/3357713.3384310","type":"proceedings-article","created":{"date-parts":[[2020,6,7]],"date-time":"2020-06-07T01:45:25Z","timestamp":1591494325000},"page":"996-1009","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["New hardness results for planar graph problems in p and an algorithm for sparsest cut"],"prefix":"10.1145","author":[{"given":"Amir","family":"Abboud","sequence":"first","affiliation":[{"name":"IBM, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Cohen-Addad","sequence":"additional","affiliation":[{"name":"CNRS, France \/ UPMC, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philip N.","family":"Klein","sequence":"additional","affiliation":[{"name":"Brown University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.26"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch88"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188938"},{"key":"e_1_3_2_1_4_1","volume-title":"Even in Sparse Networks. In Distributed Computing-30th International Symposium, DISC 2016, Paris, France, September 27-29, 2016. Proceedings. 29-42","author":"Abboud Amir","year":"2016","unstructured":"Amir Abboud , Keren Censor-Hillel , and Seri Khoury . 2016 . Near-Linear Lower Bounds for Distributed Distance Computations , Even in Sparse Networks. In Distributed Computing-30th International Symposium, DISC 2016, Paris, France, September 27-29, 2016. Proceedings. 29-42 . Amir Abboud, Keren Censor-Hillel, and Seri Khoury. 2016. Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks. In Distributed Computing-30th International Symposium, DISC 2016, Paris, France, September 27-29, 2016. Proceedings. 29-42."},{"key":"e_1_3_2_1_5_1","volume-title":"Vincent Cohen Addad, and Hussein Houdrouge","author":"Abboud Amir","year":"2019","unstructured":"Amir Abboud , Vincent Cohen Addad, and Hussein Houdrouge . 2019 . Subquadratic High-Dimensional Hierarchical Clustering. NeurIPS ( 2019 ). Amir Abboud, Vincent Cohen Addad, and Hussein Houdrouge. 2019. Subquadratic High-Dimensional Hierarchical Clustering. NeurIPS ( 2019 )."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.58"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.53"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch28"},{"key":"e_1_3_2_1_9_1","volume-title":"ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I. 39-51","author":"Abboud Amir","year":"2014","unstructured":"Amir Abboud , Virginia Vassilevska Williams , and Oren Weimann . 2014 . Consequences of Faster Alignment of Sequences. In Automata, Languages, and Programming-41st International Colloquium , ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I. 39-51 . Amir Abboud, Virginia Vassilevska Williams, and Oren Weimann. 2014. Consequences of Faster Alignment of Sequences. In Automata, Languages, and Programming-41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I. 39-51."},{"volume-title":"Handbook of massive data sets","author":"Abello James","key":"e_1_3_2_1_10_1","unstructured":"James Abello , Panos M Pardalos , and Mauricio GC Resende . 2013. Handbook of massive data sets . Vol. 4 . Springer . James Abello, Panos M Pardalos, and Mauricio GC Resende. 2013. Handbook of massive data sets. Vol. 4. Springer."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.18"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1502793.1502794"},{"key":"e_1_3_2_1_13_1","volume-title":"43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016","author":"Backurs Arturs","year":"2016","unstructured":"Arturs Backurs , Nishanth Dikkala , and Christos Tzamos . 2016 . Tight Hardness Results for Maximum Weight Rectangles. In 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016 , July 11-15, 2016, Rome, Italy. 81 : 1-81 : 13. Arturs Backurs, Nishanth Dikkala, and Christos Tzamos. 2016. Tight Hardness Results for Maximum Weight Rectangles. In 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy. 81 : 1-81 : 13."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746612"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.145"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195901000596"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188876"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90071-0"},{"key":"e_1_3_2_1_19_1","first-page":"661","volume-title":"Why Walking the Dog Takes Time: Frechet Distance Has No Strongly Subquadratic Algorithms Unless SETH Fails. In 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014","author":"Bringmann Karl","year":"2014","unstructured":"Karl Bringmann . 2014 . Why Walking the Dog Takes Time: Frechet Distance Has No Strongly Subquadratic Algorithms Unless SETH Fails. In 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014 , Philadelphia, PA, USA , October 18-21, 2014. 661 - 670 . Karl Bringmann. 2014. Why Walking the Dog Takes Time: Frechet Distance Has No Strongly Subquadratic Algorithms Unless SETH Fails. In 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014. 661-670."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.77"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2017.12.010"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/3039686.3039825"},{"key":"e_1_3_2_1_23_1","article-title":"Characterization, stability and convergence of hierarchical clustering methods","author":"Carlsson Gunnar","year":"2010","unstructured":"Gunnar Carlsson and Facundo M\u00e9moli . 2010 . Characterization, stability and convergence of hierarchical clustering methods . Journal of machine learning research 11 , Apr ( 2010 ), 1425-1470. Gunnar Carlsson and Facundo M\u00e9moli. 2010. Characterization, stability and convergence of hierarchical clustering methods. Journal of machine learning research 11, Apr ( 2010 ), 1425-1470.","journal-title":"Journal of machine learning research 11"},{"key":"e_1_3_2_1_24_1","volume-title":"Quadratic and NearQuadratic Lower Bounds for the CONGEST Model. In 31st International Symposium on Distributed Computing, DISC 2017","author":"Censor-Hillel Keren","year":"2017","unstructured":"Keren Censor-Hillel , Seri Khoury , and Ami Paz . 2017 . Quadratic and NearQuadratic Lower Bounds for the CONGEST Model. In 31st International Symposium on Distributed Computing, DISC 2017 , October 16-20, 2017, Vienna, Austria. 10 : 1-10 : 16. Keren Censor-Hillel, Seri Khoury, and Ami Paz. 2017. Quadratic and NearQuadratic Lower Bounds for the CONGEST Model. In 31st International Symposium on Distributed Computing, DISC 2017, October 16-20, 2017, Vienna, Austria. 10 : 1-10 : 16."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Panagiotis Charalampopoulos Pawe? Gawrychowski Shay Mozes and Oren Weimann. 2019. Almost Optimal Distance Oracles for Planar Graphs. In STOC to appear.  Panagiotis Charalampopoulos Pawe? Gawrychowski Shay Mozes and Oren Weimann. 2019. Almost Optimal Distance Oracles for Planar Graphs. In STOC to appear.","DOI":"10.1145\/3313276.3316316"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2751521"},{"key":"e_1_3_2_1_27_1","first-page":"962","volume-title":"Fast and Compact Exact Distance Oracle for Planar Graphs. In 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017","author":"Cohen-Addad Vincent","year":"2017","unstructured":"Vincent Cohen-Addad , S\u00f8ren Dahlgaard , and Christian Wulf-Nilsen . 2017 . Fast and Compact Exact Distance Oracle for Planar Graphs. In 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017 , Berkeley, CA, USA , October 15-17, 2017. 962 - 973 . Vincent Cohen-Addad, S\u00f8ren Dahlgaard, and Christian Wulf-Nilsen. 2017. Fast and Compact Exact Distance Oracle for Planar Graphs. In 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017. 962-973."},{"key":"e_1_3_2_1_28_1","article-title":"On problems equivalent to (min,+)-convolution","volume":"15","author":"Cygan Marek","year":"2019","unstructured":"Marek Cygan , Marcin Mucha , Karol Wegrzycki , and Micha\u0142 W\u0142odarczyk . 2019 . On problems equivalent to (min,+)-convolution . ACM Transactions on Algorithms (TALG) 15 , 1 ( 2019 ), 14. Marek Cygan, Marcin Mucha, Karol Wegrzycki, and Micha\u0142 W\u0142odarczyk. 2019. On problems equivalent to (min,+)-convolution. ACM Transactions on Algorithms (TALG) 15, 1 ( 2019 ), 14.","journal-title":"ACM Transactions on Algorithms (TALG)"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/11085178X"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897527"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Laxman Dhulipala Igor Kabiljo Brian Karrer Giuseppe Ottaviano Sergey Pupyrev and Alon Shalita. 2016. Compressing graphs and indexes with recursive graph bisection. arXiv preprint arXiv:1602.08820 ( 2016 ).  Laxman Dhulipala Igor Kabiljo Brian Karrer Giuseppe Ottaviano Sergey Pupyrev and Alon Shalita. 2016. Compressing graphs and indexes with recursive graph bisection. arXiv preprint arXiv:1602.08820 ( 2016 ).","DOI":"10.1145\/2939672.2939862"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704441058"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746564"},{"volume-title":"The elements of statistical learning","author":"Friedman Jerome","key":"e_1_3_2_1_34_1","unstructured":"Jerome Friedman , Trevor Hastie , and Robert Tibshirani . 2001. The elements of statistical learning . Vol. 1 . Springer series in statistics New York, NY, USA:. Jerome Friedman, Trevor Hastie, and Robert Tibshirani. 2001. The elements of statistical learning. Vol. 1. Springer series in statistics New York, NY, USA:."},{"key":"e_1_3_2_1_35_1","volume-title":"Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, 2012","author":"Frischknecht Silvio","year":"2095","unstructured":"Silvio Frischknecht , Stephan Holzer , and Roger Wattenhofer . [n.d.]. Networks cannot compute their diameter in sublinear time . In Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, 2012 . http:\/\/portal. acm.org\/citation.cfm? id= 2095 207&CFID=63838676&CFTOKEN=79617016 Silvio Frischknecht, Stephan Holzer, and Roger Wattenhofer. [n.d.]. Networks cannot compute their diameter in sublinear time. In Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, 2012. http:\/\/portal. acm.org\/citation.cfm? id=2095207&CFID=63838676&CFTOKEN=79617016"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2011.11.006"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794271692"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.33"},{"key":"e_1_3_2_1_39_1","first-page":"515","volume-title":"Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018","author":"Gawrychowski Pawel","year":"2018","unstructured":"Pawel Gawrychowski , Shay Mozes , Oren Weimann , and Christian Wulf-Nilsen . 2018 . Better Tradeofs for Exact Distance Oracles in Planar Graphs . In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018 , New Orleans, LA, USA , January 7-10, 2018. 515 - 529 . Pawel Gawrychowski, Shay Mozes, Oren Weimann, and Christian Wulf-Nilsen. 2018. Better Tradeofs for Exact Distance Oracles in Planar Graphs. In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018. 515-529."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch16"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933109"},{"key":"e_1_3_2_1_42_1","volume-title":"Near-Optimal Distributed DFS in Planar Graphs. In 31st International Symposium on Distributed Computing, DISC 2017","author":"Ghafari Mohsen","year":"2017","unstructured":"Mohsen Ghafari and Merav Parter . 2017 . Near-Optimal Distributed DFS in Planar Graphs. In 31st International Symposium on Distributed Computing, DISC 2017 , October 16-20, 2017, Vienna, Austria. 21 : 1-21 : 16. Mohsen Ghafari and Merav Parter. 2017. Near-Optimal Distributed DFS in Planar Graphs. In 31st International Symposium on Distributed Computing, DISC 2017, October 16-20, 2017, Vienna, Austria. 21 : 1-21 : 16."},{"key":"e_1_3_2_1_43_1","article-title":"Minimum spanning trees and single linkage cluster analysis","volume":"18","author":"Gower John C","year":"1969","unstructured":"John C Gower and Gavin JS Ross . 1969 . Minimum spanning trees and single linkage cluster analysis . Journal of the Royal Statistical Society : Series C (Applied Statistics) 18 , 1 ( 1969 ), 54-64. John C Gower and Gavin JS Ross. 1969. Minimum spanning trees and single linkage cluster analysis. Journal of the Royal Statistical Society : Series C (Applied Statistics) 18, 1 ( 1969 ), 54-64.","journal-title":"Journal of the Royal Statistical Society : Series C (Applied Statistics)"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212737"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933112"},{"key":"e_1_3_2_1_46_1","volume-title":"Near-Optimal LowCongestion Shortcuts on Bounded Parameter Graphs. In Distributed Computing-30th International Symposium, DISC 2016, Paris, France, September 27-29, 2016. Proceedings. 158-172","author":"Haeupler Bernhard","year":"2016","unstructured":"Bernhard Haeupler , Taisuke Izumi , and Goran Zuzic . 2016 . Near-Optimal LowCongestion Shortcuts on Bounded Parameter Graphs. In Distributed Computing-30th International Symposium, DISC 2016, Paris, France, September 27-29, 2016. Proceedings. 158-172 . Bernhard Haeupler, Taisuke Izumi, and Goran Zuzic. 2016. Near-Optimal LowCongestion Shortcuts on Bounded Parameter Graphs. In Distributed Computing-30th International Symposium, DISC 2016, Paris, France, September 27-29, 2016. Proceedings. 158-172."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212776"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746609"},{"key":"e_1_3_2_1_49_1","volume-title":"10th Innovations in Theoretical Computer Science Conference, ITCS 2019","author":"Karthik C.","year":"2019","unstructured":"Karthik C. S. and Pasin Manurangsi. 2019. On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic . In 10th Innovations in Theoretical Computer Science Conference, ITCS 2019 , January 10-12, 2019 , San Diego, California, USA. 17 : 1-17 : 16. Karthik C. S. and Pasin Manurangsi. 2019. On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic. In 10th Innovations in Theoretical Computer Science Conference, ITCS 2019, January 10-12, 2019, San Diego, California, USA. 17 : 1-17 : 16."},{"key":"e_1_3_2_1_50_1","unstructured":"Philip N. Klein and Shay Mozes. [n.d.]. Optimization Algorithms for Planar Graphs. Draft chapters available at http:\/\/planarity.org.  Philip N. Klein and Shay Mozes. [n.d.]. Optimization Algorithms for Planar Graphs. Draft chapters available at http:\/\/planarity.org."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/1721837.1721846"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2017.21"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875145"},{"volume-title":"Combinatorial optimization: networks and matroids","author":"Lawler Eugene L","key":"e_1_3_2_1_54_1","unstructured":"Eugene L Lawler . 2001. Combinatorial optimization: networks and matroids . Courier Corporation . Eugene L Lawler. 2001. Combinatorial optimization: networks and matroids. Courier Corporation."},{"key":"e_1_3_2_1_55_1","volume-title":"21st Annual Symposium on Foundations of Computer Science (sfcs 1980 ). IEEE, 270-281","author":"Leiserson Charles E","year":"1980","unstructured":"Charles E Leiserson . 1980 . Area-eficient graph layouts . In 21st Annual Symposium on Foundations of Computer Science (sfcs 1980 ). IEEE, 270-281 . Charles E Leiserson. 1980. Area-eficient graph layouts. In 21st Annual Symposium on Foundations of Computer Science (sfcs 1980 ). IEEE, 270-281."},{"volume-title":"Mining of massive datasets","author":"Leskovec Jure","key":"e_1_3_2_1_56_1","unstructured":"Jure Leskovec , Anand Rajaraman , and Jefrey David Ullman . 2014. Mining of massive datasets . Cambridge university press . Jure Leskovec, Anand Rajaraman, and Jefrey David Ullman. 2014. Mining of massive datasets. Cambridge university press."},{"key":"e_1_3_2_1_57_1","volume-title":"Distributed Treewidth Computation. CoRR abs\/","author":"Jason Li.","year":"1805","unstructured":"Jason Li. 2018. Distributed Treewidth Computation. CoRR abs\/ 1805 .10708 ( 2018 ). arXiv: 1805.10708 http:\/\/arxiv.org\/abs\/ 1805.10708 Jason Li. 2018. Distributed Treewidth Computation. CoRR abs\/ 1805.10708 ( 2018 ). arXiv: 1805.10708 http:\/\/arxiv.org\/abs\/ 1805.10708"},{"key":"e_1_3_2_1_58_1","unstructured":"Jason Li and Merav Parter. 2019. Planar Diameter via Metric Compression. In STOC to appear.  Jason Li and Merav Parter. 2019. Planar Diameter via Metric Compression. In STOC to appear."},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.6"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1137\/0136016"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835882"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.4.4.414"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/26.4.354"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.159908"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993806.1993853"},{"key":"e_1_3_2_1_66_1","first-page":"766","article-title":"Finding minimum-quotient cuts in planar graphs","author":"Park J. K.","year":"1993","unstructured":"J. K. Park and C. A. Phillips . 1993 . Finding minimum-quotient cuts in planar graphs . In STOC. 766 - 775 . J. K. Park and C. A. Phillips. 1993. Finding minimum-quotient cuts in planar graphs. In STOC. 766-775.","journal-title":"STOC."},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15775-2_48"},{"key":"e_1_3_2_1_68_1","volume-title":"Scikit-learn: Machine Learning in Python. Journal of Machine Learning Research 12 ( 2011 ), 2825-2830.","author":"Pedregosa F.","year":"2011","unstructured":"F. Pedregosa , G. Varoquaux , A. Gramfort , V. Michel , B. Thirion , O. Grisel , M. Blondel , P. Prettenhofer , R. Weiss , V. Dubourg , J. Vanderplas , A. Passos , D. Cournapeau , M. Brucher , M. Perrot , and E. Duchesnay . 2011 . Scikit-learn: Machine Learning in Python. Journal of Machine Learning Research 12 ( 2011 ), 2825-2830. F. Pedregosa, G. Varoquaux, A. Gramfort, V. Michel, B. Thirion, O. Grisel, M. Blondel, P. Prettenhofer, R. Weiss, V. Dubourg, J. Vanderplas, A. Passos, D. Cournapeau, M. Brucher, M. Perrot, and E. Duchesnay. 2011. Scikit-learn: Machine Learning in Python. Journal of Machine Learning Research 12 ( 2011 ), 2825-2830."},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814597"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1987.26"},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129735"},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90260-M"},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488673"},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-20086-6_22"},{"volume-title":"Introduction to information retrieval","author":"Sch\u00fctze Hinrich","key":"e_1_3_2_1_75_1","unstructured":"Hinrich Sch\u00fctze , Christopher D Manning , and Prabhakar Raghavan . 2008. Introduction to information retrieval . Vol. 39 . Cambridge University Press . Hinrich Sch\u00fctze, Christopher D Manning, and Prabhakar Raghavan. 2008. Introduction to information retrieval. Vol. 39. Cambridge University Press."},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.09.023"},{"key":"e_1_3_2_1_77_1","volume-title":"Proceedings of the ICM.","author":"Williams Virginia Vassilevska","year":"2018","unstructured":"Virginia Vassilevska Williams . 2018 . On some fine-grained questions in algorithms and complexity . In Proceedings of the ICM. Virginia Vassilevska Williams. 2018. On some fine-grained questions in algorithms and complexity. In Proceedings of the ICM."},{"key":"e_1_3_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1145\/3186893"}],"event":{"name":"STOC '20: 52nd Annual ACM SIGACT Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Chicago IL USA","acronym":"STOC '20"},"container-title":["Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384310","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357713.3384310","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:13Z","timestamp":1750200073000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384310"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,22]]},"references-count":78,"alternative-id":["10.1145\/3357713.3384310","10.1145\/3357713"],"URL":"https:\/\/doi.org\/10.1145\/3357713.3384310","relation":{},"subject":[],"published":{"date-parts":[[2020,6,22]]},"assertion":[{"value":"2020-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}