{"id":"https://openalex.org/W1992273661","doi":"https://doi.org/10.1145/1328911.1328916","title":"Randomized minimum spanning tree algorithms using exponentially fewer random bits","display_name":"Randomized minimum spanning tree algorithms using exponentially fewer random bits","publication_year":2008,"publication_date":"2008-03-01","ids":{"openalex":"https://openalex.org/W1992273661","doi":"https://doi.org/10.1145/1328911.1328916","mag":"1992273661"},"language":"en","primary_location":{"id":"doi:10.1145/1328911.1328916","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1328911.1328916","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5076564426","display_name":"Seth Pettie","orcid":"https://orcid.org/0000-0002-0495-3904"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Seth Pettie","raw_affiliation_strings":["University of Michigan, Ann Arbor, MI"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Michigan, Ann Arbor, MI","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101698836","display_name":"Vijaya Ramachandran","orcid":"https://orcid.org/0000-0001-7561-5235"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vijaya Ramachandran","raw_affiliation_strings":["The University of Texas at Austin, Austin, TX","The University of Texas at Austin, Austin, TX;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Texas at Austin, Austin, TX","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"The University of Texas at Austin, Austin, TX;","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.9187,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.91124063,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"4","issue":"1","first_page":"1","last_page":"27"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7505240440368652},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7415921688079834},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.7186894416809082},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6227259635925293},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5459205508232117},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.5159493088722229},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.4755118489265442},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.4747363030910492},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.43591418862342834},{"id":"https://openalex.org/keywords/reverse-delete-algorithm","display_name":"Reverse-delete algorithm","score":0.4339510202407837},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.4240926206111908},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2825169563293457}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7505240440368652},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7415921688079834},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.7186894416809082},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6227259635925293},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5459205508232117},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.5159493088722229},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.4755118489265442},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.4747363030910492},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.43591418862342834},{"id":"https://openalex.org/C199346575","wikidata":"https://www.wikidata.org/wiki/Q4925151","display_name":"Reverse-delete algorithm","level":4,"score":0.4339510202407837},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.4240926206111908},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2825169563293457}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1328911.1328916","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1328911.1328916","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.118.4653","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.118.4653","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eecs.umich.edu/~pettie/papers/random-mst.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.8199999928474426}],"awards":[{"id":"https://openalex.org/G5080136330","display_name":null,"funder_award_id":"CCR-9988160","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G673213770","display_name":null,"funder_award_id":"003658-0029-1999","funder_id":"https://openalex.org/F4320308138","funder_display_name":"Texas Higher Education Coordinating Board"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320308138","display_name":"Texas Higher Education Coordinating Board","ror":"https://ror.org/05as1qb59"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":56,"referenced_works":["https://openalex.org/W783504","https://openalex.org/W70027040","https://openalex.org/W1507575253","https://openalex.org/W1584086289","https://openalex.org/W1866422804","https://openalex.org/W1965525854","https://openalex.org/W1965680834","https://openalex.org/W1974807151","https://openalex.org/W1976080419","https://openalex.org/W1978099551","https://openalex.org/W1978624651","https://openalex.org/W1982512167","https://openalex.org/W1982842799","https://openalex.org/W1989640573","https://openalex.org/W1996641400","https://openalex.org/W1998777945","https://openalex.org/W1999812064","https://openalex.org/W2003754544","https://openalex.org/W2011824743","https://openalex.org/W2012857639","https://openalex.org/W2015645889","https://openalex.org/W2016284597","https://openalex.org/W2017927472","https://openalex.org/W2030153860","https://openalex.org/W2032841680","https://openalex.org/W2035693183","https://openalex.org/W2039221685","https://openalex.org/W2039757598","https://openalex.org/W2041786457","https://openalex.org/W2047976119","https://openalex.org/W2048500523","https://openalex.org/W2049182037","https://openalex.org/W2059771614","https://openalex.org/W2063844956","https://openalex.org/W2079849139","https://openalex.org/W2087216833","https://openalex.org/W2089290774","https://openalex.org/W2094900885","https://openalex.org/W2105310556","https://openalex.org/W2110824700","https://openalex.org/W2125182537","https://openalex.org/W2128865241","https://openalex.org/W2134490689","https://openalex.org/W2138304862","https://openalex.org/W2152506249","https://openalex.org/W2155086352","https://openalex.org/W2156372444","https://openalex.org/W2160495255","https://openalex.org/W2167630072","https://openalex.org/W2169528473","https://openalex.org/W2273959428","https://openalex.org/W2295428206","https://openalex.org/W2752885492","https://openalex.org/W3145128584","https://openalex.org/W4231916799","https://openalex.org/W4389615663"],"related_works":["https://openalex.org/W2899787781","https://openalex.org/W2381121915","https://openalex.org/W2390742649","https://openalex.org/W3016811403","https://openalex.org/W2384589661","https://openalex.org/W2387385213","https://openalex.org/W1571815623","https://openalex.org/W2274518162","https://openalex.org/W2138304862","https://openalex.org/W1992273661"],"abstract_inverted_index":{"For":[0],"many":[1,190],"fundamental":[2],"problems":[3,56,79],"there":[4,57],"exist":[5],"randomized":[6,74,149,175],"algorithms":[7,62,150,201,261],"that":[8,81,180],"are":[9,13,22,58,118,142,240,254],"asymptotically":[10],"optimal":[11,60],"and":[12,38,44,48,65,165,237,250,264],"superior":[14],"to":[15,120,129,151,242],"the":[16,23,29,34,45,53,73,91,106,122,134,166,185,196,219,228,243,255,258],"best-known":[17],"deterministic":[18,61,197,259],"algorithm.":[19,188],"Among":[20],"these":[21,78],"minimum":[24,40,176,198,222],"spanning":[25,41,177,199,223],"tree":[26,42,178,200,224],"(MST)":[27],"problem,":[28,33],"MST":[30,235,260],"sensitivity":[31],"analysis":[32],"parallel":[35,39],"connected":[36],"components":[37],"problems,":[43],"local":[46],"sorting":[47],"set":[49],"maxima":[50],"problems.":[51],"(For":[52],"first":[54],"two":[55],"provably":[59],"with":[63,154],"unknown,":[64],"possibly":[66],"superlinear,":[67],"running":[68,136],"times.)":[69],"One":[70],"downside":[71],"of":[72,86,93,108,124,139,169,218,245,257,262],"methods":[75,102],"for":[76,103],"solving":[77],"is":[80,172,181],"they":[82],"use":[83],"a":[84,155,173,211,215],"number":[85,123],"random":[87,109,125],"bits":[88,110,126],"linear":[89,128],"in":[90,111],"size":[92],"input.":[94],"In":[95,114,189],"this":[96,170],"article":[97],"we":[98,117,213],"develop":[99],"some":[100,115],"general":[101],"reducing":[104],"exponentially":[105],"consumption":[107],"comparison-based":[112],"algorithms.":[113,225],"cases":[116],"able":[119],"reduce":[121],"from":[127,184,227],"nearly":[130],"constant,":[131],"without":[132],"affecting":[133],"expected":[135],"time.":[137],"Most":[138],"our":[140,208],"results":[141],"obtained":[143],"by":[144],"adjusting":[145],"or":[146,157],"reorganizing":[147],"existing":[148,220],"work":[152],"well":[153],"pairwise":[156],"O":[158],"(1)-wise":[159],"independent":[160],"sampler.":[161],"The":[162],"prominent":[163],"exception,":[164],"main":[167],"focus":[168],"article,":[171],"linear-time":[174],"algorithm":[179,209],"not":[182],"derived":[183],"well-known":[186],"Karger-Klein-Tarjan":[187,229],"ways":[191],"it":[192],"resembles":[193],"more":[194],"closely":[195],"based":[202],"on":[203],"soft":[204,251],"heaps.":[205],"Further,":[206],"using":[207],"as":[210,232],"guide,":[212],"present":[214],"unified":[216],"view":[217],"\u201cnongreedy\u201d":[221],"Concepts":[226],"algorithm,":[230],"such":[231],"F":[233],"-lightness,":[234],"verification,":[236],"sampled":[238],"graphs,":[239],"related":[241],"concepts":[244],"edge":[246],"corruption,":[247],"subgraph":[248],"contractibility,":[249],"heaps,":[252],"which":[253],"basis":[256],"Chazelle":[263],"Pettie-Ramachandran.":[265]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}