{"id":"https://openalex.org/W96431103","doi":null,"title":"Randomization in online computation","display_name":"Randomization in online computation","alternate_titles":[],"publication_year":1997,"publication_date":"1997-01-01","ids":{"openalex":"https://openalex.org/W96431103","mag":"96431103"},"language":"en","primary_location":{"id":"mag:96431103","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=269056","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W96431103"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5034376192","display_name":"Steven S. Seiden","orcid":"https://orcid.org/0009-0006-4358-946X","observed_orcids":["https://orcid.org/0009-0006-4358-946X"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Steven S. Seiden","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5034376192"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9259,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.69487751,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"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/T11269","display_name":"Algorithms and Data Compression","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":9.999999747378752e-05,"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/online-algorithms","display_name":"online algorithms","score":0.8730000257492065},{"id":"https://openalex.org/keywords/randomized-algorithms","display_name":"randomized algorithms","score":0.8700000047683716},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"competitive analysis","score":0.6140000224113464},{"id":"https://openalex.org/keywords/metrical-task-systems","display_name":"metrical task systems","score":0.8579999804496765},{"id":"https://openalex.org/keywords/thresholding","display_name":"thresholding","score":0.8389999866485596},{"id":"https://openalex.org/keywords/harmonic-numbers","display_name":"harmonic numbers","score":0.6309999823570251},{"id":"https://openalex.org/keywords/independent-jobs","display_name":"independent jobs","score":0.6340000033378601},{"id":"https://openalex.org/keywords/makespan-minimization","display_name":"makespan minimization","score":0.7910000085830688}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.9052374362945557},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.7172471284866333},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.716331958770752},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6906095743179321},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.6428707242012024},{"id":"https://openalex.org/C2777894999","wikidata":"https://www.wikidata.org/wiki/Q4781758","display_name":"Approx","level":2,"score":0.6419707536697388},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5490631461143494},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5174737572669983},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.501176118850708},{"id":"https://openalex.org/C191178318","wikidata":"https://www.wikidata.org/wiki/Q2256906","display_name":"Thresholding","level":3,"score":0.4782882332801819},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44815361499786377},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39709949493408203},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3549209237098694},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.22786763310432434},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15894082188606262},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:96431103","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=269056","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2027131870","https://openalex.org/W4241266436","https://openalex.org/W1980712336","https://openalex.org/W4413940000","https://openalex.org/W2143393151","https://openalex.org/W2149452866","https://openalex.org/W7011559641","https://openalex.org/W1527683310","https://openalex.org/W1802738979","https://openalex.org/W7135905912"],"abstract_inverted_index":{"We":[0],"study":[1,18],"the":[2,8,19,132,148,201,215,241,292,300,341],"use":[3],"of":[4,10,24,77,120,135,179,231,243,269,303],"randomization":[5],"to":[6],"improve":[7],"performance":[9],"online":[11,115,127],"algorithms.":[12],"Two":[13,229,250],"problems":[14],"are":[15,198,236,256,337],"examined.\r\nFirst":[16],"we":[17,42,45,82,101],"metrical":[20],"task":[21,60],"system":[22],"problem":[23,112,119,137],"Borodin,":[25,62],"Linial,":[26,63],"and":[27,64,72,165,184,212,248],"Saks.":[28],"For":[29,58,151,332],"this":[30,136,254,317,333],"problem,":[31],"these":[32],"authors":[33],"give":[34],"a":[35,40,47,74,84,98,155],"deterministic":[36,133,203,218,301,343],"($2n-1$)-competitive":[37],"algorithm.":[38],"Using":[39,97],"technique":[41,100],"call":[43],"thresholding,":[44,81],"design":[46,83,102],"randomized":[48,85,149,156,168,251,335],"algorithm":[49,68,86,104,158,169,260,290,302,344],"which":[50,69,87,105,339],"is":[51,70,88,106,114,173,240,314,318,330],"($e/(e":[52],"-":[53,56],"1)n-1/(e-1)\\approx":[54],"1.5820n":[55],"0.5820)$-competitive.":[57],"uniform":[59],"systems,":[61],"Saks":[65],"present":[66],"an":[67,103],"$2H\\sb2$-competitive,":[71],"show":[73],"lower":[75,204],"bound":[76,205],"$H\\sb{n}.$":[78],"Again":[79],"using":[80],"$(H\\sb{n}/{\\rm":[89],"ln}2":[90],"+":[91,95,108,272,277],"1":[92],"\\approx":[93],"1.4427H\\sb{n}":[94],"1)$-competitive.":[96],"different":[99],"$(H\\sb{n}":[107],"O(\\sqrt{":[109],"logn}))$-competitive.\r\nThe":[110],"second":[111,289,324],"studied":[113,140],"multiprocessor":[116,232],"scheduling.":[117],"The":[118,238,258,288,323],"scheduling":[121,233],"independent":[122],"jobs":[123],"on":[124,147],"m":[125,152,187,207,222,282,309],"machines":[126],"originates":[128],"with":[129,234],"Graham.":[130],"While":[131],"case":[134],"has":[138,144],"been":[139,145],"extensively,":[141],"little":[142],"work":[143],"done":[146],"case.":[150],"=":[153,188,208,223,283,310],"2":[154],"4/3-competitive":[157],"was":[159],"found":[160],"by":[161],"Bartal,":[162,244],"Fiat,":[163],"Karloff":[164],"Vohra.":[166],"A":[167],"for":[170,186,206,221,253,263,281,294,307,320,345],"$m\\ge":[171],"3$":[172],"presented.":[174,257],"It":[175,298,313],"achieves":[176],"competitive":[177,196,219,267],"ratios":[178,197,268],"1.55665,":[180],"1.65888,":[181],"1.73376,":[182],"1.78295":[183],"1.81681,":[185],"3,":[189,209,224,285],"4,":[190,210,225,286],"5,":[191,226],"6,":[192,227],"7":[193],"respectively.":[194,287],"These":[195],"less":[199,213],"than":[200,214],"best":[202,216,342],"5":[211],"known":[217],"ratio":[220],"7.":[228],"models":[230],"rejection":[235],"studied.":[237],"first":[239,259,293],"model":[242,255,325],"Leonardi,":[245],"Marchetti-Spaccamela,":[246],"Sgall":[247],"Stougie.":[249],"algorithms":[252,336],"performs":[261],"well":[262],"small":[264,346],"m,":[265],"achieving":[266],"3/2,":[270],"(7":[271],"$\\sqrt{129})/10":[273],"<":[274,279],"1.83579,":[275],"(5":[276],"2\\sqrt{22})/7":[278],"2.05441$":[280],"2,":[284],"outperforms":[291],"$m":[295],"\\ge":[296],"5.$":[297],"beats":[299],"Bartal":[304],"et":[305],"al.":[306],"all":[308,321],"5,$\\...$,":[311],"1000.":[312],"conjectured":[315],"that":[316,328],"true":[319],"m.":[322,347],"differs":[326],"in":[327],"preemption":[329],"allowed.":[331],"model,":[334],"presented":[338],"outperform":[340]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W96431103","counts_by_year":[],"updated_date":"2025-11-06T04:12:42.849631","created_date":"2016-06-24T00:00:00"}
