{"id":"https://openalex.org/W7133318956","doi":"https://doi.org/10.48550/arxiv.2603.00898","title":"High Probability Work Efficient Parallel Algorithms","display_name":"High Probability Work Efficient Parallel Algorithms","publication_year":2026,"publication_date":"2026-03-01","ids":{"openalex":"https://openalex.org/W7133318956","doi":"https://doi.org/10.48550/arxiv.2603.00898"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.00898","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.00898","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.00898","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5125385563","display_name":"Chase Hutton","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hutton, Chase","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5114425627","display_name":"Adam Melrod","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Melrod, Adam","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"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":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6128000020980835,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6128000020980835,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.12290000170469284,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.03269999846816063,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.6022999882698059},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5238999724388123},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.5015000104904175},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4311999976634979},{"id":"https://openalex.org/keywords/analysis-of-parallel-algorithms","display_name":"Analysis of parallel algorithms","score":0.429500013589859},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3982999920845032},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.3693999946117401},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.3677999973297119},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.3564999997615814},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.3544999957084656}],"concepts":[{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.6022999882698059},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5647000074386597},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5281999707221985},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5238999724388123},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.5015000104904175},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4311999976634979},{"id":"https://openalex.org/C538114610","wikidata":"https://www.wikidata.org/wiki/Q24282658","display_name":"Analysis of parallel algorithms","level":3,"score":0.429500013589859},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3982999920845032},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.3693999946117401},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.3677999973297119},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3564999997615814},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.3544999957084656},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.3465999960899353},{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.34299999475479126},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3386000096797943},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.3359000086784363},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.32899999618530273},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.320499986410141},{"id":"https://openalex.org/C6802819","wikidata":"https://www.wikidata.org/wiki/Q1072174","display_name":"Linear system","level":2,"score":0.3093999922275543},{"id":"https://openalex.org/C46686674","wikidata":"https://www.wikidata.org/wiki/Q466303","display_name":"Boosting (machine learning)","level":2,"score":0.30809998512268066},{"id":"https://openalex.org/C200985842","wikidata":"https://www.wikidata.org/wiki/Q3375503","display_name":"Random permutation","level":3,"score":0.30230000615119934},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.30070000886917114},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.29829999804496765},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2946000099182129},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.29330000281333923},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.29120001196861267},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.28929999470710754},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2851000130176544},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.2833000123500824},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.27869999408721924},{"id":"https://openalex.org/C97542219","wikidata":"https://www.wikidata.org/wiki/Q497863","display_name":"SIMPLE algorithm","level":2,"score":0.27559998631477356},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.27230000495910645},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.27000001072883606},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.26980000734329224},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.2685000002384186},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.25859999656677246},{"id":"https://openalex.org/C176032523","wikidata":"https://www.wikidata.org/wiki/Q753127","display_name":"Topological sorting","level":3,"score":0.2583000063896179},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.2540999948978424},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.25119999051094055}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.00898","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.00898","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.00898","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.00898","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Randomized":[0],"parallel":[1,38,45,116],"algorithms":[2,118,219],"for":[3,35,84,100,113,220],"many":[4],"fundamental":[5],"problems":[6,132],"achieve":[7],"optimal":[8],"linear":[9,124,204],"work":[10,50,62,148,205,214],"in":[11,102,147],"expectation,":[12],"but":[13],"upgrading":[14],"this":[15,29,33,156,209],"guarantee":[16],"to":[17,121,129,150,193,211],"hold":[18],"with":[19,157],"high":[20,122],"probability":[21,123],"(whp)":[22],"remains":[23],"a":[24,92,111,136,141,144,158,168,180,186],"recurring":[25],"theoretical":[26],"challenge.":[27],"In":[28],"paper,":[30],"we":[31,41,94,109],"address":[32],"gap":[34],"several":[36],"core":[37],"primitives.":[39],"First,":[40],"present":[42],"the":[43,59,105,151,176,194],"first":[44],"semisort":[46],"algorithm":[47,99],"achieving":[48],"$O(n)$":[49,60],"and":[51,81,197,215,223],"$O(\\text{polylog":[52],"}":[53],"n)$":[54],"depth":[55,217],"whp,":[56],"improving":[57],"upon":[58],"expected":[61,120],"bound":[63],"of":[64,87,171],"Gu":[65],"et":[66],"al.":[67],"[SPAA":[68],"2015].":[69],"Our":[70],"analysis":[71],"introduces":[72],"new":[73],"concentration":[74],"arguments":[75],"based":[76],"on":[77],"simple":[78],"tabulation":[79],"hashing":[80],"tail":[82],"bounds":[83],"weighted":[85],"sums":[86],"geometric":[88],"random":[89,182],"variables.":[90],"As":[91],"corollary,":[93],"obtain":[95,212],"an":[96,163],"integer":[97],"sorting":[98],"keys":[101],"$[n]$":[103],"matching":[104],"same":[106],"bounds.":[107],"Second,":[108],"introduce":[110],"framework":[112,127,210],"boosting":[114],"randomized":[115],"graph":[117,145,178],"from":[119],"work.":[125],"The":[126],"applies":[128],"\\emph{locally":[130],"extendable}":[131],"--":[133],"those":[134],"admitting":[135],"deterministic":[137,198],"procedure":[138],"that":[139],"extends":[140],"solution":[142],"across":[143,200],"cut":[146,152],"proportional":[149],"size.":[153],"We":[154,207],"combine":[155],"\\emph{culled":[159],"balanced":[160,181],"partition}":[161],"scheme:":[162],"iterative":[164],"culling":[165],"phase":[166],"removes":[167],"polylogarithmic":[169,216],"number":[170],"high-degree":[172],"vertices,":[173],"after":[174],"which":[175],"remaining":[177],"admits":[179],"vertex":[183],"whp":[184,191,218],"via":[185],"bounded-differences":[187],"argument.":[188],"Applying":[189],"work-inefficient":[190],"subroutines":[192],"small":[195],"pieces":[196],"extension":[199],"cuts":[201],"yields":[202],"overall":[203],"whp.":[206],"instantiate":[208],"$O(m)$":[213],"$(\u0394+1)$-vertex":[221],"coloring":[222],"maximal":[224],"independent":[225],"set.":[226]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-03-04T00:00:00"}