{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T05:36:43Z","timestamp":1782970603395,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T00:00:00Z","timestamp":1654732800000},"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":[[2022,6,9]]},"DOI":"10.1145\/3519935.3520020","type":"proceedings-article","created":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T15:29:32Z","timestamp":1654874972000},"page":"1339-1352","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Optimal oblivious reconfigurable networks"],"prefix":"10.1145","author":[{"given":"Daniel","family":"Amir","sequence":"first","affiliation":[{"name":"Cornell University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tegan","family":"Wilson","sequence":"additional","affiliation":[{"name":"Cornell University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vishal","family":"Shrivastav","sequence":"additional","affiliation":[{"name":"Purdue University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hakim","family":"Weatherspoon","sequence":"additional","affiliation":[{"name":"Cornell University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert","family":"Kleinberg","sequence":"additional","affiliation":[{"name":"Cornell University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rachit","family":"Agarwal","sequence":"additional","affiliation":[{"name":"Cornell University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,6,10]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Optimal Oblivious Reconfigurable Networks. CoRR, abs\/2111.08780","author":"Amir Daniel","year":"2021","unstructured":"Daniel Amir , Tegan Wilson , Vishal Shrivastav , Hakim Weatherspoon , Robert Kleinberg , and Rachit Agarwal . 2021. Optimal Oblivious Reconfigurable Networks. CoRR, abs\/2111.08780 ( 2021 ), https:\/\/doi.org\/10.48550\/arXiv.2111.08780 10.48550\/arXiv.2111.08780 Daniel Amir, Tegan Wilson, Vishal Shrivastav, Hakim Weatherspoon, Robert Kleinberg, and Rachit Agarwal. 2021. Optimal Oblivious Reconfigurable Networks. CoRR, abs\/2111.08780 (2021), https:\/\/doi.org\/10.48550\/arXiv.2111.08780"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863991"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780599"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3387514.3406221"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/777412.777418"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0140-3664(01)00427-3"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780608"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851275.1851223"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934911"},{"key":"e_1_3_2_1_10_1","volume-title":"Mohammad Taghi Hajiaghayi, and Harald R\u00e4cke","author":"Gupta Anupam","year":"2006","unstructured":"Anupam Gupta , Mohammad Taghi Hajiaghayi, and Harald R\u00e4cke . 2006 . Oblivious network design. SODA \u201906. Anupam Gupta, Mohammad Taghi Hajiaghayi, and Harald R\u00e4cke. 2006. Oblivious network design. SODA \u201906."},{"key":"e_1_3_2_1_11_1","volume-title":"Frank Thomson Leighton, and Harald R\u00e4cke","author":"Hajiaghayi Mohammad Taghi","year":"2006","unstructured":"Mohammad Taghi Hajiaghayi , Robert D. Kleinberg , Frank Thomson Leighton, and Harald R\u00e4cke . 2006 . New lower bounds for oblivious routing in undirected graphs. SODA \u201906. Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Frank Thomson Leighton, and Harald R\u00e4cke. 2006. New lower bounds for oblivious routing in undirected graphs. SODA \u201906."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/777412.777419"},{"key":"e_1_3_2_1_13_1","unstructured":"Prahladh Harsha Thomas P. Hayes Hariharan Narayanan Harald R\u00e4cke and Jaikumar Radhakrishnan. 2008. Minimizing average latency in oblivious routing. SODA \u201908.  Prahladh Harsha Thomas P. Hayes Hariharan Narayanan Harald R\u00e4cke and Jaikumar Radhakrishnan. 2008. Minimizing average latency in oblivious routing. SODA \u201908."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/97444.97453"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273440.1250680"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Praveen Kumar Yang Yuan Chris Yu Nate Foster Robert Kleinberg Petr Lapukhov Chiunlin Lim and Robert Soul\u00e9. 2018. Semi-Oblivious Traffic Engineering: The Road Not Taken. NSDI \u201918.  Praveen Kumar Yang Yuan Chris Yu Nate Foster Robert Kleinberg Petr Lapukhov Chiunlin Lim and Robert Soul\u00e9. 2018. Semi-Oblivious Traffic Engineering: The Road Not Taken. NSDI \u201918.","DOI":"10.1145\/3232755.3232781"},{"key":"e_1_3_2_1_17_1","unstructured":"He Liu Feng Lu Alex Forencich Rishi Kapoor Malveeka Tewari Geoffrey M. Voelker George Papen Alex C. Snoeren and George Porter. 2014. Circuit Switching Under the Radar with REACToR. NSDI \u201914.  He Liu Feng Lu Alex Forencich Rishi Kapoor Malveeka Tewari Geoffrey M. Voelker George Papen Alex C. Snoeren and George Porter. 2014. Circuit Switching Under the Radar with REACToR. NSDI \u201914."},{"key":"e_1_3_2_1_18_1","unstructured":"William M. Mellette Rajdeep Das Yibo Guo Rob McGuinness Alex C. Snoeren and George Porter. 2020. Expanding across time to deliver bandwidth efficiency and low latency. NSDI \u201920.  William M. Mellette Rajdeep Das Yibo Guo Rob McGuinness Alex C. Snoeren and George Porter. 2020. Expanding across time to deliver bandwidth efficiency and low latency. NSDI \u201920."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098838"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486007"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181881"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374415"},{"key":"e_1_3_2_1_23_1","volume-title":"Han Wang, Rachit Agarwal, and Hakim Weatherspoon.","author":"Shrivastav Vishal","year":"2019","unstructured":"Vishal Shrivastav , Asaf Valadarsky , Hitesh Ballani , Paolo Costa , Ki Suh Lee , Han Wang, Rachit Agarwal, and Hakim Weatherspoon. 2019 . Shoal : A Network Architecture for Disaggregated Racks. NSDI \u201919. Vishal Shrivastav, Asaf Valadarsky, Hitesh Ballani, Paolo Costa, Ki Suh Lee, Han Wang, Rachit Agarwal, and Hakim Weatherspoon. 2019. Shoal: A Network Architecture for Disaggregated Racks. NSDI \u201919."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3204411"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/0211027"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/800076.802479"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851275.1851222"}],"event":{"name":"STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing","location":"Rome Italy","acronym":"STOC '22","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519935.3520020","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519935.3520020","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:31:15Z","timestamp":1750188675000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519935.3520020"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,9]]},"references-count":27,"alternative-id":["10.1145\/3519935.3520020","10.1145\/3519935"],"URL":"https:\/\/doi.org\/10.1145\/3519935.3520020","relation":{},"subject":[],"published":{"date-parts":[[2022,6,9]]},"assertion":[{"value":"2022-06-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}