{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T22:58:36Z","timestamp":1781218716825,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":59,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T00:00:00Z","timestamp":1780963200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"NSF","award":["CCF2008733"],"award-info":[{"award-number":["CCF2008733"]}]},{"name":"ONR","award":["N00014-22-1-2713"],"award-info":[{"award-number":["N00014-22-1-2713"]}]},{"name":"ERC Starting Grant","award":["101039914"],"award-info":[{"award-number":["101039914"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6,9]]},"DOI":"10.1145\/3798129.3800856","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"1477-1488","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximate Orthogonal Vectors and Diameter via Regularity Lemma"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-8042-0976","authenticated-orcid":false,"given":"Alexandr","family":"Andoni","sequence":"first","affiliation":[{"name":"Columbia University, New York, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2226-7980","authenticated-orcid":false,"given":"Shunhua","family":"Jiang","sequence":"additional","affiliation":[{"name":"ETH Z\u00fcrich, Z\u00fcrich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-6814-3918","authenticated-orcid":false,"given":"Stepan","family":"Zharkov","sequence":"additional","affiliation":[{"name":"Columbia University, New York, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.12"},{"key":"e_1_3_2_1_2_1","first-page":"218","volume-title":"Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms (SODA","author":"Abboud Amir","year":"2014","unstructured":"Amir Abboud, Ryan Williams, and Huacheng Yu. 2014. More applications of the polynomial method to algorithm design. In Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms (SODA 2014). SIAM, 218-230."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2024.114976"},{"key":"e_1_3_2_1_4_1","volume-title":"Computational Geometry: Theory and Applications 1(4)","author":"Agarwal P.K.","year":"1992","unstructured":"P.K. Agarwal, J. Matou\u0161ek, and S. Suri. 1992. Farthest Neighbors, Maximum Spanning Trees and Related Problems in Higher Dimensions. Computational Geometry: Theory and Applications 1(4) (1992), 189-201."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-013-9846-4"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00073"},{"key":"e_1_3_2_1_7_1","volume-title":"Faster Algorithms for Average-Case Orthogonal Vectors and Closest Pair Problems. In SIAM Symposium on Simplicity in Algorithms (SOSA). SIAM.","author":"Alman Josh","year":"2025","unstructured":"Josh Alman, Alexandr Andoni, and Hengjie Zhang. 2025. Faster Algorithms for Average-Case Orthogonal Vectors and Closest Pair Problems. In SIAM Symposium on Simplicity in Algorithms (SOSA). SIAM."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.57"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.39"},{"key":"e_1_3_2_1_10_1","volume-title":"International Conference on Learning Representations. https:\/\/openreview.net\/forum?id=T2d0geb6y0","author":"Alman Josh","year":"2025","unstructured":"Josh Alman and Hantao Yu. 2025. Fundamental Limitations on Subquadratic Alternatives to Transformers. In International Conference on Learning Representations. https:\/\/openreview.net\/forum?id=T2d0geb6y0"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.76"},{"key":"e_1_3_2_1_12_1","volume-title":"Proceedings of the International Congress of Mathematicians (ICM) 2018. World Scientific, 3287-3318. This survey accompanied the ICM 2018 talk of Piotr Indyk. arXiv preprint arXiv:1806","author":"Andoni Alexandr","year":"2018","unstructured":"Alexandr Andoni, Piotr Indyk, and Ilya Razenshteyn. 2018. Approximate nearest neighbor search in high dimensions. In Proceedings of the International Congress of Mathematicians (ICM) 2018. World Scientific, 3287-3318. This survey accompanied the ICM 2018 talk of Piotr Indyk. arXiv preprint arXiv:1806.09823."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3717823.3718300"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.4"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188846"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00024"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.72"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746553"},{"key":"e_1_3_2_1_19_1","volume-title":"Proceedings of the ACM Symposium on Computational Geometry (SoCG).","author":"Andoni Alexandr","year":"2016","unstructured":"Alexandr Andoni and Ilya Razenshteyn. 2016. Tight Lower Bounds for Data- Dependent Locality-Sensitive Hashing. In Proceedings of the ACM Symposium on Computational Geometry (SoCG). Available at http:\/\/arxiv.org\/abs\/1507.04299."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.5"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746612"},{"key":"e_1_3_2_1_22_1","unstructured":"Marshall Ball Juan Garay Peter Hall Aggelos Kiayias and Giorgos Panagiotakos. 2024. Towards Permissionless Consensus in the Standard Model via Fine-Grained Complexity. Cryptology ePrint Archive Paper 2024\/637. https:\/\/eprint.iacr.org\/ 2024\/637"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055466"},{"key":"e_1_3_2_1_24_1","volume-title":"Average-Distortion Sketching. In Proceedings of the Symposium on Foundations of Computer Science (FOCS).","author":"Bao Yiqiao","year":"2025","unstructured":"Yiqiao Bao, Anubhav Baweja, Nicolas Menand, Erik Waingarten, Nathan White, and Tian Zhang. 2025. Average-Distortion Sketching. In Proceedings of the Symposium on Foundations of Computer Science (FOCS)."},{"key":"e_1_3_2_1_25_1","first-page":"136","article-title":"An efficient algorithm for the three-dimensional diameter problem. In 9th ACM-SIAM Sympos","author":"Bespamyatnikh S.N.","year":"1998","unstructured":"S.N. Bespamyatnikh. 1998. An efficient algorithm for the three-dimensional diameter problem. In 9th ACM-SIAM Sympos. Discrete Algorithms. 136-147.","journal-title":"Discrete Algorithms."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301367"},{"key":"e_1_3_2_1_27_1","volume-title":"36th International Symposium on Theoretical Aspects of Computer Science (STACS","author":"Bringmann Karl","year":"2019","unstructured":"Karl Bringmann. 2019. Fine-grained complexity theory (tutorial). In 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019). Schloss-Dagstuhl-Leibniz Zentrum f\u00fcr Informatik."},{"key":"e_1_3_2_1_28_1","volume-title":"Proceedings of FUN","author":"Broder Andei","year":"1998","unstructured":"Andei Broder. 1998. Filtering near-duplicate documents. Proceedings of FUN (1998)."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/283554.283370"},{"key":"e_1_3_2_1_30_1","volume-title":"Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"B\u0103doiu M.","year":"2003","unstructured":"M. B\u0103doiu and K. Clarkson. 2003. Smaller core-sets for balls. Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA) (2003)."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-019-00062-5"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch87"},{"key":"e_1_3_2_1_33_1","volume-title":"Proceedings of the Symposium on Theory of Computing (STOC). 380-388","author":"Charikar Moses","year":"2002","unstructured":"Moses Charikar. 2002. Similarity estimation techniques from rounding. In Proceedings of the Symposium on Theory of Computing (STOC). 380-388."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45465-9_39"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2020.v016a004"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/3310435.3310437"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.3"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055443"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03427-9"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004930050052"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978971.201"},{"key":"e_1_3_2_1_42_1","first-page":"769","volume-title":"SODA","volume":"1","author":"Goel Ashish","year":"2001","unstructured":"Ashish Goel, Piotr Indyk, and Kasturi R Varadarajan. 2001. Reductions among high dimensional proximity problems. In SODA, Vol. 1. 769-778."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ESA.2025.58"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743438"},{"key":"e_1_3_2_1_45_1","volume-title":"Proceedings of the Ninth ACM-SIAM Symposium on Discrete Algorithms","author":"Indyk Piotr","year":"2000","unstructured":"Piotr Indyk. 2000. Dimensionality Reduction Techniques for Proximity Problems. Proceedings of the Ninth ACM-SIAM Symposium on Discrete Algorithms (2000)."},{"key":"e_1_3_2_1_46_1","volume-title":"High-dimensional computational geometry. Department of Computer Science","author":"Indyk Piotr","unstructured":"Piotr Indyk. 2001. High-dimensional computational geometry. Department of Computer Science, Stanford University."},{"key":"e_1_3_2_1_47_1","volume-title":"Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Indyk Piotr","year":"2003","unstructured":"Piotr Indyk. 2003. Better algorithms for high-dimensional proximity problems via Asymmetric Embeddings. Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA) (2003)."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649666"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS63196.2025.00011"},{"key":"e_1_3_2_1_50_1","volume-title":"37th International Symposium on Computational Geometry.","author":"Kush Deepanshu","year":"2021","unstructured":"Deepanshu Kush, Aleksandar Nikolov, and Haohua Tang. 2021. Near Neighbor Search via Efficient Average Distortion Embeddings. In 37th International Symposium on Computational Geometry."},{"key":"e_1_3_2_1_51_1","volume-title":"International Workshop on Approximation Algorithms for Combinatorial Optimization. Springer, 303-316","author":"Gharan Shayan Oveis","year":"2013","unstructured":"Shayan Oveis Gharan and Luca Trevisan. 2013. A new regularity lemma and faster approximation algorithms for low threshold rank graphs. In International Workshop on Approximation Algorithms for Combinatorial Optimization. Springer, 303-316."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2016.07.006"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188916"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2441776.2441933"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/800116.803772"},{"key":"e_1_3_2_1_56_1","volume-title":"Regular partitions of graphs","author":"Szemer\u00e9di Endre","unstructured":"Endre Szemer\u00e9di. 1975. Regular partitions of graphs. Stanford University."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2009.41"},{"key":"e_1_3_2_1_58_1","volume-title":"Proceedings of ICM","author":"Williams Virginia Vassilevska","year":"2018","unstructured":"Virginia Vassilevska Williams. 2018. On some fine-grained questions in algorithms and complexity. In Proceedings of ICM 2018."},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634209"}],"event":{"name":"STOC '26: 58th Annual ACM Symposium on Theory of Computing","location":"Salt Lake City UT USA","acronym":"STOC '26","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 58th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800856","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800856","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T22:37:47Z","timestamp":1781217467000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800856"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":59,"alternative-id":["10.1145\/3798129.3800856","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800856","relation":{},"subject":[],"published":{"date-parts":[[2026,6,9]]},"assertion":[{"value":"2026-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}