iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://api.openalex.org/works/doi:10.1007/11523468_69
{"id":"https://openalex.org/W2125245799","doi":"https://doi.org/10.1007/11523468_69","title":"The Generalized Deadlock Resolution Problem","display_name":"The Generalized Deadlock Resolution Problem","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2125245799","doi":"https://doi.org/10.1007/11523468_69","mag":"2125245799"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1007/11523468_69","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319965","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Springer Nature","Springer Science+Business Media"],"type":"book series"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"book-chapter","type_crossref":"book-chapter","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/A5041706388","display_name":"Kamal Jain","orcid":"https://orcid.org/0000-0001-5153-0405"},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Kamal Jain","raw_affiliation_strings":["Microsoft Research,"],"affiliations":[{"raw_affiliation_string":"Microsoft Research,","institution_ids":["https://openalex.org/I4210164937"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111876448","display_name":"MohammadTaghi Hajiaghayi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"MohammadTaghi Hajiaghayi","raw_affiliation_strings":["MIT Computer Science and Artificial Intelligence Laboratory,"],"affiliations":[{"raw_affiliation_string":"MIT Computer Science and Artificial Intelligence Laboratory,","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080065269","display_name":"Kunal Talwar","orcid":null},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Kunal Talwar","raw_affiliation_strings":["Microsoft Research,"],"affiliations":[{"raw_affiliation_string":"Microsoft Research,","institution_ids":["https://openalex.org/I4210164937"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392,"provenance":"doaj"},"apc_paid":null,"fwci":0.393,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.865164,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":82,"max":83},"biblio":{"volume":null,"issue":null,"first_page":"853","last_page":"865"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Distributed Coordination in Online Robotics Research","score":0.9993,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12288","display_name":"Distributed Coordination in Online Robotics Research","score":0.9993,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10772","display_name":"Distributed Fault Tolerance and Consistency in Systems","score":0.9977,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10829","display_name":"Networks on Chip in System-on-Chip Design","score":0.9976,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/deadlock-prevention-algorithms","display_name":"Deadlock prevention algorithms","score":0.646349},{"id":"https://openalex.org/keywords/adwords-problem","display_name":"AdWords Problem","score":0.506424}],"concepts":[{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.7815015},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.69640875},{"id":"https://openalex.org/C113429609","wikidata":"https://www.wikidata.org/wiki/Q4060699","display_name":"Deadlock prevention algorithms","level":3,"score":0.646349},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.59937817},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2580175}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1007/11523468_69","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319965","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Springer Nature","Springer Science+Business Media"],"type":"book series"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":28,"referenced_works":["https://openalex.org/W102859379","https://openalex.org/W1479863711","https://openalex.org/W1484040084","https://openalex.org/W1967786783","https://openalex.org/W1969171522","https://openalex.org/W1979024254","https://openalex.org/W1979930990","https://openalex.org/W1982180670","https://openalex.org/W1982568673","https://openalex.org/W1988100845","https://openalex.org/W1995262435","https://openalex.org/W2009976792","https://openalex.org/W2011039300","https://openalex.org/W2023408771","https://openalex.org/W2040831377","https://openalex.org/W2059453880","https://openalex.org/W2060367456","https://openalex.org/W2066775342","https://openalex.org/W2070745908","https://openalex.org/W2072095153","https://openalex.org/W2081880478","https://openalex.org/W2131053137","https://openalex.org/W2133017912","https://openalex.org/W2143996311","https://openalex.org/W2148177011","https://openalex.org/W2150148016","https://openalex.org/W2295961103","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3137070212","https://openalex.org/W2379911191","https://openalex.org/W2360686363","https://openalex.org/W2166954426","https://openalex.org/W2136552483","https://openalex.org/W2117224408","https://openalex.org/W2050076411","https://openalex.org/W2001478969","https://openalex.org/W1900787600","https://openalex.org/W1542183432"],"abstract_inverted_index":{"In":[0],"this":[1,75,191],"paper":[2],"we":[3,120,148,154,181,194],"initiate":[4],"the":[5,8,16,38,54,87,95,103,117,127,134,161],"study":[6],"of":[7,18,40,53,129,136],"AND-OR":[9,22],"directed":[10,55,104],"feedback":[11,23,56],"vertex":[12,24,57],"set":[13,25,58],"problem":[14,26,34,45,107],"from":[15],"viewpoint":[17],"approximation":[19,189],"algorithms.":[20],"This":[21,44],"is":[27,99],"motivated":[28],"by":[29],"a":[30,50,65,71,78,145],"practical":[31],"deadlock":[32,151],"resolution":[33,152],"that":[35,93,147],"appears":[36],"in":[37],"development":[39],"distributed":[41],"database":[42],"systems.":[43],"also":[46,143],"turns":[47],"out":[48],"be":[49,82],"natural":[51,203],"generalization":[52],"problem.":[59,76,192],"Awerbuch":[60],"and":[61,199],"Micali":[62],"[1]":[63],"gave":[64],"polynomial":[66],"time":[67],"algorithm":[68],"to":[69,114],"find":[70],"minimal":[72,79],"solution":[73,80,98],"for":[74,160,190],"Unfortunately,":[77],"can":[81],"arbitrarily":[83],"more":[84],"expensive":[85],"than":[86],"minimum":[88,96],"cost":[89,97],"solution.":[90],"We":[91,142],"show":[92],"finding":[94],"as":[100,102],"hard":[101,113],"Steiner":[105],"tree":[106],"(and":[108],"thus":[109],"\u03a9(log":[110],"2":[111],"n)":[112,188],"approximate).":[115],"On":[116],"positive":[118],"side,":[119],"give":[121,182,195],"algorithms":[122],"which":[123],"work":[124],"well":[125],"when":[126],"number":[128,135],"writers":[130,178],"(AND":[131,179],"nodes)":[132,139],"or":[133],"readers":[137],"(OR":[138],"are":[140,177],"small.":[141],"consider":[144],"variant":[146],"call":[149],"permanent":[150],"where":[153],"cannot":[155],"specify":[156],"an":[157,183,196],"execution":[158],"order":[159],"surviving":[162],"processes;":[163],"they":[164,170],"should":[165],"get":[166],"completed":[167],"even":[168],"if":[169],"were":[171],"scheduled":[172],"adversarially.":[173],"When":[174],"all":[175],"processes":[176],"nodes),":[180],"O(log":[184],"n":[185],"log":[186,187],"Finally":[193],"LP-rounding":[197],"approach":[198],"discuss":[200],"some":[201],"other":[202],"variants.":[204]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2125245799","counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2024-10-18T13:52:48.662450","created_date":"2016-06-24"}