{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:11:03Z","timestamp":1750219863853,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,21]],"date-time":"2023-06-21T00:00:00Z","timestamp":1687305600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"University of Delhi, India","award":["IoE\/2021\/12\/FRP"],"award-info":[{"award-number":["IoE\/2021\/12\/FRP"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,21]]},"DOI":"10.1145\/3577193.3593727","type":"proceedings-article","created":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T18:47:05Z","timestamp":1687286825000},"page":"386-397","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Scalable algorithms for compact spanners on real world graphs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-7722-524X","authenticated-orcid":false,"given":"Maulein","family":"Pathak","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Delhi, Delhi, India"},{"name":"Keshav Mahavidyalaya, University of Delhi, New Delhi, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-5053-2059","authenticated-orcid":false,"given":"Yogish","family":"Sabharwal","sequence":"additional","affiliation":[{"name":"IBM Research India, New Delhi, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0870-0824","authenticated-orcid":false,"given":"Neelima","family":"Gupta","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Delhi, Delhi, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,6,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2020.100253"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02189308"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/4221.4227"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1993.366823"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.43"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794261295"},{"key":"e_1_3_2_1_7_1","unstructured":"CompactSpanner 2022. Compact Spanner. https:\/\/github.com\/Maulein\/Compact-Spanner.  CompactSpanner 2022. Compact Spanner. https:\/\/github.com\/Maulein\/Compact-Spanner."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3434393"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3274651"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.OPODIS.2021.16"},{"key":"e_1_3_2_1_11_1","unstructured":"GBBS 2018. Graph Based Benchmark Suite github. https:\/\/github.com\/ParAlg\/gbbs.  GBBS 2018. Graph Based Benchmark Suite github. https:\/\/github.com\/ParAlg\/gbbs."},{"key":"e_1_3_2_1_12_1","unstructured":"GRAPH 500 2010. Graph 500 Steering Committee. Graph 500 benchmark. http:\/\/www.graph500.org.  GRAPH 500 2010. Graph 500 Steering Committee. Graph 500 benchmark. http:\/\/www.graph500.org."},{"volume-title":"Personal Communications","author":"Halperin Shay","key":"e_1_3_2_1_13_1","unstructured":"Shay Halperin and Uri Zwick . 1993. Personal Communications . MIT Press , Cambridge, MA . Shay Halperin and Uri Zwick. 1993. Personal Communications. MIT Press, Cambridge, MA."},{"key":"e_1_3_2_1_14_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data.  Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2898361"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215074"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755574"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486159.2486180"},{"key":"e_1_3_2_1_19_1","unstructured":"PaRMAT 2017. PaRMAT. https:\/\/github.com\/farkhor\/PaRMAT.  PaRMAT 2017. PaRMAT. https:\/\/github.com\/farkhor\/PaRMAT."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1379811.1379818"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190130114"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/65950.65953"},{"key":"e_1_3_2_1_24_1","volume-title":"Synthesis of Parallel Algorithms","author":"Reif John H.","unstructured":"John H. Reif . 1993. Synthesis of Parallel Algorithms ( 1 st ed.). Morgan Kaufmann Publishers Inc ., San Francisco, CA, USA. John H. Reif. 1993. Synthesis of Parallel Algorithms (1st ed.). Morgan Kaufmann Publishers Inc., San Francisco, CA, USA.","edition":"1"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2017.11.003"},{"key":"e_1_3_2_1_26_1","volume-title":"Kolda","author":"Seshadhri C.","year":"2011","unstructured":"C. Seshadhri , Ali Pinar , and Tamara G . Kolda . 2011 . A Hitchhiker's Guide to Choosing Parameters of Stochastic Kronecker Graphs. CoRR abs\/1102.5046 (2011). arXiv:1102.5046 http:\/\/arxiv.org\/abs\/1102.5046 C. Seshadhri, Ali Pinar, and Tamara G. Kolda. 2011. A Hitchhiker's Guide to Choosing Parameters of Stochastic Kronecker Graphs. CoRR abs\/1102.5046 (2011). arXiv:1102.5046 http:\/\/arxiv.org\/abs\/1102.5046"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1044731.1044732"}],"event":{"name":"ICS '23: 37th International Conference on Supercomputing","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Orlando FL USA","acronym":"ICS '23"},"container-title":["Proceedings of the 37th International Conference on Supercomputing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3577193.3593727","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:32Z","timestamp":1750178852000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3577193.3593727"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,21]]},"references-count":27,"alternative-id":["10.1145\/3577193.3593727","10.1145\/3577193"],"URL":"https:\/\/doi.org\/10.1145\/3577193.3593727","relation":{},"subject":[],"published":{"date-parts":[[2023,6,21]]},"assertion":[{"value":"2023-06-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}