{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,20]],"date-time":"2025-08-20T13:18:11Z","timestamp":1755695891115,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"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.3520059","type":"proceedings-article","created":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T15:29:32Z","timestamp":1654874972000},"page":"1116-1129","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Edge sampling and graph parameter estimation via vertex neighborhood accesses"],"prefix":"10.1145","author":[{"given":"Jakub","family":"T\u011btek","sequence":"first","affiliation":[{"name":"University of Copenhagen, Denmark"}]},{"given":"Mikkel","family":"Thorup","sequence":"additional","affiliation":[{"name":"University of Copenhagen, Denmark"}]}],"member":"320","published-online":{"date-parts":[[2022,6,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01936136"},{"volume-title":"CS 514: Advanced Algorithms II-Sublinear Algorithms 1 Sublinear Time Algorithms for Graphs","author":"Assadi Sepehr","key":"e_1_3_2_1_2_1","unstructured":"Sepehr Assadi . 2020. CS 514: Advanced Algorithms II-Sublinear Algorithms 1 Sublinear Time Algorithms for Graphs . Rutgers University . https:\/\/www.cs.rutgers.edu\/~sa1497\/courses\/cs514-s20\/lec3.pdf Sepehr Assadi. 2020. CS 514: Advanced Algorithms II-Sublinear Algorithms 1 Sublinear Time Algorithms for Graphs. Rutgers University. https:\/\/www.cs.rutgers.edu\/~sa1497\/courses\/cs514-s20\/lec3.pdf"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Omri Ben-Eliezer Talya Eden Joel Oren and Dimitris Fotakis. 2021. Sampling Multiple Nodes in Large Networks: Beyond Random Walks. arxiv:2110.13324.  Omri Ben-Eliezer Talya Eden Joel Oren and Dimitris Fotakis. 2021. Sampling Multiple Nodes in Large Networks: Beyond Random Walks. arxiv:2110.13324.","DOI":"10.1145\/3488560.3498383"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403073"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872427.2883045"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2018.149"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2566486.2568019"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.44"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.APPROX\/RANDOM.2021.51"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2019.52"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2019.52"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2017.7"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.APPROX-RANDOM.2018.11"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.4230\/OASIcs.SOSA.2018.7"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007443"},{"key":"e_1_3_2_1_16_1","volume-title":"Introduction to property testing","author":"Goldreich Oded","year":"1940","unstructured":"Oded Goldreich . 2018. Introduction to property testing . Cambridge University Press, Cambridge , United Kingdom ; New York, NY, USA. isbn:9781107 1940 52 Oded Goldreich. 2018. Introduction to property testing. Cambridge University Press, Cambridge, United Kingdom ; New York, NY, USA. isbn:9781107194052"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20203"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1952.10483446"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/800105.803390"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3294052.3319706"},{"key":"e_1_3_2_1_21_1","series-title":"SIAM Journal on computing, 33, 6","volume-title":"Tight bounds for testing bipartiteness in general graphs","author":"Kaufman Tali","year":"2004","unstructured":"Tali Kaufman , Michael Krivelevich , and Dana Ron . 2004. Tight bounds for testing bipartiteness in general graphs . SIAM Journal on computing, 33, 6 ( 2004 ), 1441\u20131483. Tali Kaufman, Michael Krivelevich, and Dana Ron. 2004. Tight bounds for testing bipartiteness in general graphs. SIAM Journal on computing, 33, 6 (2004), 1441\u20131483."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2012.625260"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.12.0130"},{"key":"e_1_3_2_1_24_1","unstructured":"Seagate. 2014. Seagate\u00ae Desktop HDD ST4000DM000 ST3000DM003. https:\/\/www.seagate.com\/www-content\/product-content\/desktop-hdd-fam\/en-us\/docs\/100710254f.pdf  Seagate. 2014. Seagate\u00ae Desktop HDD ST4000DM000 ST3000DM003. https:\/\/www.seagate.com\/www-content\/product-content\/desktop-hdd-fam\/en-us\/docs\/100710254f.pdf"},{"key":"e_1_3_2_1_25_1","unstructured":"C. Seshadhri. 2015. A simpler sublinear algorithm for approximating the triangle count. may arxiv:1505.01927. arxiv:1505.01927  C. Seshadhri. 2015. A simpler sublinear algorithm for approximating the triangle count. may arxiv:1505.01927. arxiv:1505.01927"},{"key":"e_1_3_2_1_26_1","unstructured":"Toshiba. 2019. Enterprise Hard Drives MG Series. https:\/\/www.toshiba-storage.com\/wp-content\/uploads\/2019\/09\/TOSH_DS_MG_Series_print.pdf  Toshiba. 2019. Enterprise Hard Drives MG Series. https:\/\/www.toshiba-storage.com\/wp-content\/uploads\/2019\/09\/TOSH_DS_MG_Series_print.pdf"}],"event":{"name":"STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Rome Italy","acronym":"STOC '22"},"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.3520059","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519935.3520059","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.3520059"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,9]]},"references-count":26,"alternative-id":["10.1145\/3519935.3520059","10.1145\/3519935"],"URL":"https:\/\/doi.org\/10.1145\/3519935.3520059","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"}}]}}