{"id":"https://openalex.org/W1969406444","doi":"https://doi.org/10.1016/s0020-0190(97)00099-9","title":"A better lower bound on the competitive ratio of the randomized 2-server problem","display_name":"A better lower bound on the competitive ratio of the randomized 2-server problem","publication_year":1997,"publication_date":"1997-07-01","ids":{"openalex":"https://openalex.org/W1969406444","doi":"https://doi.org/10.1016/s0020-0190(97)00099-9","mag":"1969406444"},"language":"en","primary_location":{"id":"doi:10.1016/s0020-0190(97)00099-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0020-0190(97)00099-9","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","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/A5024529572","display_name":"Marek Chrob\u00e1k","orcid":"https://orcid.org/0000-0002-8673-2709"},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Marek Chrobak","raw_affiliation_strings":["Department of Computer Science, University of California Riverside, CA 92521, USA","Department of Computer Science, University of California, Riverside, CA 92521, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California Riverside, CA 92521, USA","institution_ids":["https://openalex.org/I103635307"]},{"raw_affiliation_string":"Department of Computer Science, University of California, Riverside, CA 92521, USA","institution_ids":["https://openalex.org/I103635307"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038877069","display_name":"Lawrence L. Larmore","orcid":null},"institutions":[{"id":"https://openalex.org/I133999245","display_name":"University of Nevada, Las Vegas","ror":"https://ror.org/0406gha72","country_code":"US","type":"education","lineage":["https://openalex.org/I133999245"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lawrence L. Larmore","raw_affiliation_strings":["Department of Computer Science, University of Nevada, Las Vegas, NV 89154-4019, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Nevada, Las Vegas, NV 89154-4019, USA","institution_ids":["https://openalex.org/I133999245"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022565251","display_name":"Carsten Lund","orcid":null},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Carsten Lund","raw_affiliation_strings":["AT&T Labs, 600 Mountain Ave., Murray Hill, NJ 07940, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AT&T Labs, 600 Mountain Ave., Murray Hill, NJ 07940, USA","institution_ids":["https://openalex.org/I1283103587"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032712536","display_name":"Nick Reingold","orcid":null},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nick Reingold","raw_affiliation_strings":["AT&T Labs, 600 Mountain Ave., Murray Hill, NJ 07940, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AT&T Labs, 600 Mountain Ave., Murray Hill, NJ 07940, USA","institution_ids":["https://openalex.org/I1283103587"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5024529572"],"corresponding_institution_ids":["https://openalex.org/I103635307"],"apc_list":{"value":2040,"currency":"USD","value_usd":2040},"apc_paid":null,"fwci":2.5989,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.89753716,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"63","issue":"2","first_page":"79","last_page":"83"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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":"Optimization and Search Problems","score":1.0,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9606999754905701,"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/T11182","display_name":"Auction Theory and Applications","score":0.9596999883651733,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.8828814029693604},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7701799869537354},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.7641634941101074},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.5557149648666382},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5018205642700195},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.49354422092437744},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4670996069908142},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.42115840315818787},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36437416076660156},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26312482357025146},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.2506290078163147}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.8828814029693604},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7701799869537354},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.7641634941101074},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.5557149648666382},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5018205642700195},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.49354422092437744},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4670996069908142},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.42115840315818787},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36437416076660156},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26312482357025146},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2506290078163147},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s0020-0190(97)00099-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0020-0190(97)00099-9","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.54.2102","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.2102","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ucr.edu/~marek/pubs/2s_rand_lower_bound.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1979856149","https://openalex.org/W2031323309","https://openalex.org/W2038661317","https://openalex.org/W2054831624","https://openalex.org/W2082099352","https://openalex.org/W2083392624","https://openalex.org/W2086989193","https://openalex.org/W2089998595","https://openalex.org/W2168823865","https://openalex.org/W6660014849","https://openalex.org/W7048482821"],"related_works":["https://openalex.org/W2047204419","https://openalex.org/W2092227404","https://openalex.org/W1580966357","https://openalex.org/W2772037640","https://openalex.org/W2073006754","https://openalex.org/W2143393151","https://openalex.org/W2169102169","https://openalex.org/W2147462763","https://openalex.org/W2093226551","https://openalex.org/W2063410603"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}