{"id":"https://openalex.org/W2070432726","doi":"https://doi.org/10.1137/s0097539793250330","title":"Randomness-Optimal Unique Element Isolation with Applications to Perfect Matching and Related Problems","display_name":"Randomness-Optimal Unique Element Isolation with Applications to Perfect Matching and Related Problems","publication_year":1995,"publication_date":"1995-10-01","ids":{"openalex":"https://openalex.org/W2070432726","doi":"https://doi.org/10.1137/s0097539793250330","mag":"2070432726"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539793250330","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539793250330","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5102712900","display_name":"Suresh Chari","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Suresh Chari","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068867068","display_name":"Pankaj Rohatgi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pankaj Rohatgi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5005118312","display_name":"Aravind Srinivasan","orcid":"https://orcid.org/0000-0002-0062-3684"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Aravind Srinivasan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.5816,"has_fulltext":false,"cited_by_count":53,"citation_normalized_percentile":{"value":0.83127131,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"24","issue":"5","first_page":"1036","last_page":"1050"},"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.9993000030517578,"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.9993000030517578,"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/T10237","display_name":"Cryptography and Data Security","score":0.9990000128746033,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9951000213623047,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/randomness","display_name":"Randomness","score":0.8923267126083374},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6633532047271729},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6438335180282593},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6255632042884827},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6200402975082397},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5671190023422241},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5459266901016235},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5373827815055847},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5178639888763428},{"id":"https://openalex.org/keywords/element","display_name":"Element (criminal law)","score":0.42354628443717957},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3674766421318054}],"concepts":[{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.8923267126083374},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6633532047271729},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6438335180282593},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6255632042884827},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6200402975082397},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5671190023422241},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5459266901016235},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5373827815055847},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5178639888763428},{"id":"https://openalex.org/C200288055","wikidata":"https://www.wikidata.org/wiki/Q2621792","display_name":"Element (criminal law)","level":2,"score":0.42354628443717957},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3674766421318054},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539793250330","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539793250330","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1494759436","https://openalex.org/W1977741646","https://openalex.org/W1982406523","https://openalex.org/W1988698339","https://openalex.org/W2011594074","https://openalex.org/W2019038806","https://openalex.org/W2022124805","https://openalex.org/W2056352038","https://openalex.org/W2057512592","https://openalex.org/W2064306958","https://openalex.org/W2069919161","https://openalex.org/W2079828065","https://openalex.org/W2113097540","https://openalex.org/W2113291984","https://openalex.org/W2137407595","https://openalex.org/W2178192088","https://openalex.org/W2216649337","https://openalex.org/W2343730655","https://openalex.org/W2610479830","https://openalex.org/W2610729871","https://openalex.org/W2800024591"],"related_works":["https://openalex.org/W1983915440","https://openalex.org/W2013784340","https://openalex.org/W3095925971","https://openalex.org/W4377371889","https://openalex.org/W4389362338","https://openalex.org/W2113623403","https://openalex.org/W2055932080","https://openalex.org/W1968512104","https://openalex.org/W2565109825","https://openalex.org/W1862126075"],"abstract_inverted_index":{"In":[0],"this":[1,121,196],"paper,":[2],"we":[3,55],"precisely":[4],"characterize":[5],"the":[6,10,19,65,80,93,117,153,159,164,192,213,259,270,282],"randomness":[7,118,200],"complexity":[8,119,201],"of":[9,67,95,107,120,155,166,175,202,216,241,261,272,281],"unique":[11,87,230],"element":[12,231],"isolation":[13,232],"problem,":[14],"a":[15,41,57,112,129,251],"crucial":[16],"step":[17],"in":[18,36,84,158,195,269,274],"$RNC$":[20,237],"algorithm":[21,132,185,204],"for":[22,59,116,133,226,239],"perfect":[23,134,156],"matching":[24,113,135,242],"by":[25],"Mulmuley,":[26,96],"Vazirani,":[27,97,99],"and":[28,35,44,98,168,190,243,289],"Vazirani":[29],"[Combinatorica,":[30],"7":[31],"(1987),":[32],"pp.":[33,179],"105\u2013113]":[34],"several":[37,227],"other":[38],"applications.":[39],"Given":[40],"set":[42,83],"S":[43,68],"an":[45,183],"unknown":[46],"family":[47],"$\\mathcal{F}":[48],"\\subseteq":[49,286,292],"2^{S}$":[50],"with":[51,88],"$|\\mathcal{F}|":[52],"\\leq":[53],"Z$,":[54],"present":[56,182],"scheme":[58,127,221],"assigning":[60],"polynomially":[61],"bounded":[62],"weights":[63],"to":[64,257,277],"elements":[66],"using":[69],"only":[70],"$O(\\log":[71,138],"Z":[72,139,146,187],"+":[73,140],"\\log":[74,103,141,207,218],"|S|)$":[75],"random":[76,143,209,253],"bits,":[77,105,144],"such":[78,235],"that":[79],"minimum":[81],"weight":[82,125],"$\\mathcal{F}$":[85],"is":[86,147,188,205,233],"high":[89],"probability.":[90],"This":[91,162],"generalizes":[92,163],"solution":[94],"who":[100,181],"use":[101],"$O(S":[102],"S)$":[104],"independent":[106],"Z.":[108],"We":[109,249],"also":[110,222],"provide":[111],"lower":[114],"bound":[115,151,215],"problem.":[122],"The":[123,198],"new":[124,279],"assignment":[126],"yields":[128],"randomness-efficient":[130,224,252],"$RNC^{2}$":[131],"which":[136,265],"uses":[137],"n)$":[142],"where":[145,229],"any":[148],"given":[149],"upper":[150],"on":[152,173,212,246],"number":[154],"matchings":[157],"input":[160],"graph.":[161],"result":[165],"Grigoriev":[167],"Karpinski":[169],"[Proc.":[170],"IEEE":[171],"Symposium":[172],"Foundations":[174],"computer":[176],"Science,":[177],"1987,":[178],"166\u2013172],":[180],"$NC^{3}$":[184],"when":[186],"polynomial":[189],"improves":[191],"running":[193],"time":[194],"case.":[197],"worst-case":[199],"our":[203],"$O(n":[206],"(m/n))$":[208],"bits":[210],"improving":[211],"previous":[214],"$O(m":[217],"n)$.":[219],"Our":[220],"gives":[223],"solutions":[225],"problems":[228,245],"used,":[234],"as":[236],"algorithms":[238],"variants":[240],"basic":[244],"linear":[247],"matroids.":[248],"obtain":[250],"reduction":[254],"from":[255],"SAT":[256],"USAT,":[258],"language":[260],"uniquely":[262],"satisfiable":[263],"formulas,":[264],"can":[266],"be":[267],"derandomized":[268],"case":[271],"languages":[273],"Few":[275,284,290],"P":[276],"yield":[278],"proofs":[280],"results":[283],"$P":[285,291],"\\oplus":[287],"P$":[288],"C_{=}":[293],"P$.":[294]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}