{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:04:37Z","timestamp":1750309477962,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T00:00:00Z","timestamp":1685664000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ERC starting grant","award":["949499"],"award-info":[{"award-number":["949499"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,2]]},"DOI":"10.1145\/3564246.3585133","type":"proceedings-article","created":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T17:34:20Z","timestamp":1684258460000},"page":"971-984","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Random Walks on Rotating Expanders"],"prefix":"10.1145","author":[{"given":"Gil","family":"Cohen","sequence":"first","affiliation":[{"name":"Tel Aviv University, Israel"}]},{"given":"Gal","family":"Maor","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Israel"}]}],"member":"320","published-online":{"date-parts":[[2023,6,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28410"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/080732651"},{"key":"e_1_3_2_1_3_1","volume-title":"49th International Colloquium on Automata, Languages, and Programming (ICALP","author":"Cohen Gil","year":"2022","unstructured":"Gil Cohen , Dor Minzer , Shir Peleg , Aaron Potechin , and Amnon Ta-Shma . 2022 . Expander Random Walks: The General Case and Limitations. In 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022). Gil Cohen, Dor Minzer, Shir Peleg, Aaron Potechin, and Amnon Ta-Shma. 2022. Expander Random Walks: The General Case and Limitations. In 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451049"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.37"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1236457.1236459"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794268765"},{"key":"e_1_3_2_1_8_1","volume-title":"Pseudorandomness of Expander Random Walks for Symmetric Functions and Permutation Branching Programs. In 37th Computational Complexity Conference (CCC","author":"Golowich Louis","year":"2022","unstructured":"Louis Golowich and Salil Vadhan . 2022 . Pseudorandomness of Expander Random Walks for Symmetric Functions and Permutation Branching Programs. In 37th Computational Complexity Conference (CCC 2022). Louis Golowich and Salil Vadhan. 2022. Pseudorandomness of Expander Random Walks for Symmetric Functions and Permutation Branching Programs. In 37th Computational Complexity Conference (CCC 2022)."},{"key":"e_1_3_2_1_9_1","volume-title":"12th Innovations in Theoretical Computer Science Conference (LIPIcs. Leibniz Int. Proc. Inform.","volume":"48","author":"Guruswami Venkatesan","unstructured":"Venkatesan Guruswami and Vinayak M. Kumar . 2021. Pseudobinomiality of the sticky random walk . In 12th Innovations in Theoretical Computer Science Conference (LIPIcs. Leibniz Int. Proc. Inform. , Vol. 185). Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, Art. No. 48 , 19. Venkatesan Guruswami and Vinayak M. Kumar. 2021. Pseudobinomiality of the sticky random walk. In 12th Innovations in Theoretical Computer Science Conference (LIPIcs. Leibniz Int. Proc. Inform., Vol. 185). Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, Art. No. 48, 19."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-007-0238-5"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-06-01126-8"},{"key":"e_1_3_2_1_12_1","volume-title":"41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (LIPIcs. Leibniz Int. Proc. Inform.","volume":"24","author":"Jalan Akhil","year":"2021","unstructured":"Akhil Jalan and Dana Moshkovitz . 2021 . Near-optimal Cayley expanders for abelian groups . In 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (LIPIcs. Leibniz Int. Proc. Inform. , Vol. 213). Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, Art. No. 24 , 23. Akhil Jalan and Dana Moshkovitz. 2021. Near-optimal Cayley expanders for abelian groups. In 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (LIPIcs. Leibniz Int. Proc. Inform., Vol. 213). Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, Art. No. 24, 23."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Fernando Granha Jeronimo Tushant Mittal Sourya Roy and Avi Wigderson. 2022. Almost Ramanujan Expanders from Arbitrary Expanders via Operator Amplification. arXiv preprint arXiv:2209.07024. \t\t\t\t  Fernando Granha Jeronimo Tushant Mittal Sourya Roy and Avi Wigderson. 2022. Almost Ramanujan Expanders from Arbitrary Expanders via Operator Amplification. arXiv preprint arXiv:2209.07024.","DOI":"10.1109\/FOCS54457.2022.00043"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.2307\/2372748"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/210118.210136"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02126799"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.63"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2015.182.1.8"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M106176X"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-021-01105-w"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(81)90150-6"},{"volume-title":"Lectures on the combinatorics of free probability. 13","author":"Nica Alexandru","key":"e_1_3_2_1_22_1","unstructured":"Alexandru Nica and Roland Speicher . 2006. Lectures on the combinatorics of free probability. 13 , Cambridge University Press . Alexandru Nica and Roland Speicher. 2006. Lectures on the combinatorics of free probability. 13, Cambridge University Press."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391289.1391291"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796583"},{"key":"e_1_3_2_1_25_1","unstructured":"Daniel A Spielman. 2019. Spectral and Algebraic Graph Theory.  http:\/\/cs-www.cs.yale.edu\/homes\/spielman\/sagt\/ \t\t\t\t  Daniel A Spielman. 2019. Spectral and Algebraic Graph Theory.  http:\/\/cs-www.cs.yale.edu\/homes\/spielman\/sagt\/"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055408"},{"key":"e_1_3_2_1_27_1","volume-title":"Lecture notes on graph partitioning, expanders and spectral methods","author":"Trevisan Luca","year":"2016","unstructured":"Luca Trevisan . 2017. Lecture notes on graph partitioning, expanders and spectral methods . University of California , Berkeley , https:\/\/people. eecs. berkeley. edu\/luca\/books\/expanders- 2016 . pdf. Luca Trevisan. 2017. Lecture notes on graph partitioning, expanders and spectral methods. University of California, Berkeley, https:\/\/people. eecs. berkeley. edu\/luca\/books\/expanders-2016. pdf."},{"key":"e_1_3_2_1_28_1","volume-title":"Foundations and Trends\u00ae in Theoretical Computer Science, 7, 1\u20133","author":"Vadhan Salil P","year":"2012","unstructured":"Salil P Vadhan . 2012. Pseudorandomness. Foundations and Trends\u00ae in Theoretical Computer Science, 7, 1\u20133 ( 2012 ), 1\u2013336. Salil P Vadhan. 2012. Pseudorandomness. Foundations and Trends\u00ae in Theoretical Computer Science, 7, 1\u20133 (2012), 1\u2013336."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(03)00253-X"}],"event":{"name":"STOC '23: 55th Annual ACM Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Orlando FL USA","acronym":"STOC '23"},"container-title":["Proceedings of the 55th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3564246.3585133","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3564246.3585133","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:17:27Z","timestamp":1750295847000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3564246.3585133"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,2]]},"references-count":29,"alternative-id":["10.1145\/3564246.3585133","10.1145\/3564246"],"URL":"https:\/\/doi.org\/10.1145\/3564246.3585133","relation":{},"subject":[],"published":{"date-parts":[[2023,6,2]]},"assertion":[{"value":"2023-06-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}