{"id":"https://openalex.org/W7167686129","doi":"https://doi.org/10.1145/3816782.3819191","title":"Near-Optimal Parallel Approximate Counting via Sampling","display_name":"Near-Optimal Parallel Approximate Counting via Sampling","publication_year":2026,"publication_date":"2026-07-06","ids":{"openalex":"https://openalex.org/W7167686129","doi":"https://doi.org/10.1145/3816782.3819191"},"language":null,"primary_location":{"id":"doi:10.1145/3816782.3819191","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3816782.3819191","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 38th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3816782.3819191","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101783327","display_name":"David G. Harris","orcid":"https://orcid.org/0000-0002-3021-3555"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David G. Harris","raw_affiliation_strings":["Department of Computer Science, University of Maryland, College Park, USA"],"raw_orcid":"https://orcid.org/0000-0002-3021-3555","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Maryland, College Park, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021390142","display_name":"Vladimir Kolmogorov","orcid":"https://orcid.org/0000-0002-7625-8986"},"institutions":[{"id":"https://openalex.org/I157556583","display_name":"Institute of Science and Technology Austria","ror":"https://ror.org/03gnh5541","country_code":"AT","type":"education","lineage":["https://openalex.org/I157556583"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Vladimir Kolmogorov","raw_affiliation_strings":["Institute of Science and Technology Austria, Klosterneuburg, Austria"],"raw_orcid":"https://orcid.org/0000-0002-7625-8986","affiliations":[{"raw_affiliation_string":"Institute of Science and Technology Austria, Klosterneuburg, Austria","institution_ids":["https://openalex.org/I157556583"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024428102","display_name":"H.W. Liu","orcid":"https://orcid.org/0000-0002-6461-3389"},"institutions":[{"id":"https://openalex.org/I36399199","display_name":"Nanjing University of Science and Technology","ror":"https://ror.org/00xp9wg62","country_code":"CN","type":"education","lineage":["https://openalex.org/I36399199"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hongyang Liu","raw_affiliation_strings":["School of Computer Science, State Key Laboratory for Novel Software Technology, New Cornerstone Science Laboratory, Nanjing University, Nanjing, China"],"raw_orcid":"https://orcid.org/0000-0002-6461-3389","affiliations":[{"raw_affiliation_string":"School of Computer Science, State Key Laboratory for Novel Software Technology, New Cornerstone Science Laboratory, Nanjing University, Nanjing, China","institution_ids":["https://openalex.org/I36399199"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101513638","display_name":"Yitong Yin","orcid":"https://orcid.org/0000-0001-9204-7794"},"institutions":[{"id":"https://openalex.org/I36399199","display_name":"Nanjing University of Science and Technology","ror":"https://ror.org/00xp9wg62","country_code":"CN","type":"education","lineage":["https://openalex.org/I36399199"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yitong Yin","raw_affiliation_strings":["School of Computer Science, State Key Laboratory for Novel Software Technology, New Cornerstone Science Laboratory, Nanjing University, Nanjing, China"],"raw_orcid":"https://orcid.org/0000-0001-9204-7794","affiliations":[{"raw_affiliation_string":"School of Computer Science, State Key Laboratory for Novel Software Technology, New Cornerstone Science Laboratory, Nanjing University, Nanjing, China","institution_ids":["https://openalex.org/I36399199"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101491849","display_name":"Yiyao Zhang","orcid":"https://orcid.org/0009-0000-8363-1219"},"institutions":[{"id":"https://openalex.org/I36399199","display_name":"Nanjing University of Science and Technology","ror":"https://ror.org/00xp9wg62","country_code":"CN","type":"education","lineage":["https://openalex.org/I36399199"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yiyao Zhang","raw_affiliation_strings":["School of Computer Science, State Key Laboratory for Novel Software Technology, New Cornerstone Science Laboratory, Nanjing University, Nanjing, China"],"raw_orcid":"https://orcid.org/0009-0000-8363-1219","affiliations":[{"raw_affiliation_string":"School of Computer Science, State Key Laboratory for Novel Software Technology, New Cornerstone Science Laboratory, Nanjing University, Nanjing, China","institution_ids":["https://openalex.org/I36399199"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"550","last_page":"559"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11443","display_name":"Advanced Statistical Process Monitoring","score":0.2978000044822693,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11443","display_name":"Advanced Statistical Process Monitoring","score":0.2978000044822693,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.048500001430511475,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10136","display_name":"Statistical Methods and Inference","score":0.03500000014901161,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.4659999907016754},{"id":"https://openalex.org/keywords/noise","display_name":"Noise (video)","score":0.3197000026702881},{"id":"https://openalex.org/keywords/sample","display_name":"Sample (material)","score":0.2840999960899353},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.27129998803138733}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4864000082015991},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4722000062465668},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.4659999907016754},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39899998903274536},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.3197000026702881},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.28760001063346863},{"id":"https://openalex.org/C198531522","wikidata":"https://www.wikidata.org/wiki/Q485146","display_name":"Sample (material)","level":2,"score":0.2840999960899353},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.28029999136924744},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.27129998803138733},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.243599995970726}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3816782.3819191","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3816782.3819191","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 38th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3816782.3819191","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3816782.3819191","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 38th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W3957722","https://openalex.org/W2024710200","https://openalex.org/W2060222605","https://openalex.org/W2063342497","https://openalex.org/W2068524660","https://openalex.org/W2071516900","https://openalex.org/W2088847343","https://openalex.org/W2106285343","https://openalex.org/W2161611531","https://openalex.org/W2164214871","https://openalex.org/W2963209590","https://openalex.org/W3043925259","https://openalex.org/W3111890340","https://openalex.org/W3203800035","https://openalex.org/W4226518768","https://openalex.org/W7110167338"],"related_works":[],"abstract_inverted_index":{"The":[0,14,73,99],"computational":[1],"equivalence":[2],"between":[3,43],"approximate":[4],"counting":[5,20,32],"and":[6,90,97],"sampling":[7,22,63],"is":[8,23,34,83,112],"well":[9],"established":[10],"for":[11,65],"polynomial-time":[12],"algorithms.":[13],"most":[15],"efficient":[16],"general":[17],"reduction":[18],"from":[19],"to":[21,61],"based":[24],"on":[25,134],"simulated":[26],"annealing.":[27],"In":[28],"this":[29,121],"approach,":[30],"the":[31,38,78,129],"problem":[33],"formulated":[35],"as":[36],"estimating":[37],"ratio":[39],"Q":[40,96],"=":[41,47],"Z(\u03b2max)/Z(\u03b2min)":[42],"partition":[44],"functions":[45],"Z(\u03b2)":[46],"\u03a3x\u2208\u03a9":[48],"exp(\u03b2H(x))":[49],"of":[50,80,88],"Gibbs":[51],"distributions":[52],"\u03bc\u03b2":[53,66],"over":[54],"\u03a9":[55],"with":[56,108],"Hamiltonian":[57],"H,":[58],"given":[59],"access":[60],"a":[62],"oracle":[64,81],"at":[67],"any":[68],"\u03b2":[69,132],"\u2208":[70],"[\u03b2min,":[71],"\u03b2max].":[72],"sample":[74],"complexity":[75,123],"(measured":[76],"by":[77,104],"number":[79],"calls)":[82],"typically":[84],"expressed":[85],"in":[86],"terms":[87],"q":[89],"h,":[91],"which":[92],"respectively":[93],"bound":[94,102],"ln":[95],"H.":[98],"best":[100],"upper":[101],"achieved":[103],"known":[105,118],"annealing":[106],"algorithms":[107,119],"relative":[109],"error":[110],"\u03b5":[111],"O(q\u03b5\u22122":[113],"log":[114],"h).":[115],"However,":[116],"all":[117],"attaining":[120],"near-optimal":[122],"are":[124],"inherently":[125],"sequential,":[126],"or":[127],"adaptive:":[128],"queried":[130],"parameters":[131],"depend":[133],"previous":[135],"samples.":[136]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2026-07-09T00:00:00"}