{"id":"https://openalex.org/W2166577392","doi":"https://doi.org/10.1017/s0963548303005601","title":"Tail Bounds and Expectations for Random Arc Allocation and Applications","display_name":"Tail Bounds and Expectations for Random Arc Allocation and Applications","publication_year":2003,"publication_date":"2003-05-01","ids":{"openalex":"https://openalex.org/W2166577392","doi":"https://doi.org/10.1017/s0963548303005601","mag":"2166577392"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548303005601","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548303005601","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and 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/A5082922326","display_name":"Peter Sanders","orcid":"https://orcid.org/0000-0003-3330-9349"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"PETER SANDERS","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany (e-mail:","Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany (e-mail: sanders@mpi-sb.mpg.de)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany (e-mail:","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany (e-mail: sanders@mpi-sb.mpg.de)","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5098146401","display_name":"BERTHOLD VCKING","orcid":null},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"BERTHOLD V\u00d6CKING","raw_affiliation_strings":["Department of Computer Science, Universit\u00e4t Dortmund, Informatik 2, Baroper Str. 301, 44221 Dortmund, Germany (e-mail:","Department of Computer Science, Universit\u00e4t Dortmund, Informatik 2, Baroper Str. 301, 44221 Dortmund, Germany (e-mail: voecking@ls2.cs.uni-dortmund.de)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Universit\u00e4t Dortmund, Informatik 2, Baroper Str. 301, 44221 Dortmund, Germany (e-mail:","institution_ids":["https://openalex.org/I200332995"]},{"raw_affiliation_string":"Department of Computer Science, Universit\u00e4t Dortmund, Informatik 2, Baroper Str. 301, 44221 Dortmund, Germany (e-mail: voecking@ls2.cs.uni-dortmund.de)#TAB#","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5082922326"],"corresponding_institution_ids":["https://openalex.org/I4210109712"],"apc_list":null,"apc_paid":null,"fwci":0.2477,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.59127912,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"12","issue":"3","first_page":"301","last_page":"318"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.9997000098228455,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9991999864578247,"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/scheduling","display_name":"Scheduling (production processes)","score":0.6463636159896851},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.5619741678237915},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.5499706268310547},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5460886359214783},{"id":"https://openalex.org/keywords/arc","display_name":"Arc (geometry)","score":0.4946543872356415},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47386741638183594},{"id":"https://openalex.org/keywords/random-variable","display_name":"Random variable","score":0.47210779786109924},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47114983201026917},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4549126923084259},{"id":"https://openalex.org/keywords/position","display_name":"Position (finance)","score":0.4404575228691101},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4283975660800934},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32316499948501587},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.27154308557510376},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.24293997883796692},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10101303458213806},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.10064315795898438},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.0868949294090271}],"concepts":[{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6463636159896851},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.5619741678237915},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.5499706268310547},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5460886359214783},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.4946543872356415},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47386741638183594},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.47210779786109924},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47114983201026917},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4549126923084259},{"id":"https://openalex.org/C198082294","wikidata":"https://www.wikidata.org/wiki/Q3399648","display_name":"Position (finance)","level":2,"score":0.4404575228691101},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4283975660800934},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32316499948501587},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.27154308557510376},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.24293997883796692},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10101303458213806},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.10064315795898438},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0868949294090271},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1017/s0963548303005601","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548303005601","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.88.7598","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.88.7598","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-i1.informatik.rwth-aachen.de/~voecking/publications/SWAT02.pdf","raw_type":"text"},{"id":"pmh:oai:edoc.mpg.de:201878","is_oa":false,"landing_page_url":"http://edoc.mpg.de/201878","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Combinatorics, Probability and Computing, v.12, 225-244 (2003)","raw_type":"Article"},{"id":"pmh:oai:pure.mpg.de:item_1330211","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-000F-2E4F-1","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1528588904","https://openalex.org/W1587463421","https://openalex.org/W1678178911","https://openalex.org/W1979213597","https://openalex.org/W2008982530","https://openalex.org/W2028981745","https://openalex.org/W2050315502","https://openalex.org/W2055175657","https://openalex.org/W2057399436","https://openalex.org/W2066204507","https://openalex.org/W2068728923","https://openalex.org/W2074937107","https://openalex.org/W2077296244","https://openalex.org/W2089073523","https://openalex.org/W2107092025","https://openalex.org/W2126391667","https://openalex.org/W2166706887","https://openalex.org/W2168395296","https://openalex.org/W2319285881","https://openalex.org/W2396673608","https://openalex.org/W2751862591","https://openalex.org/W2912437396"],"related_works":["https://openalex.org/W2544839741","https://openalex.org/W2810064750","https://openalex.org/W2152099439","https://openalex.org/W1984163603","https://openalex.org/W3036572561","https://openalex.org/W1885735754","https://openalex.org/W3130422087","https://openalex.org/W2515218844","https://openalex.org/W3045564025","https://openalex.org/W2149931498"],"abstract_inverted_index":{"Suppose":[0],"$n$":[1],"circular":[2],"arcs":[3,32],"of":[4,31,39,79],"lengths":[5],"$\\len_i":[6],"\\in":[7],"[0,1],0\\leq":[8],"i<n$":[9],",":[10,26,28],"are":[11],"placed":[12],"uniformly":[13],"at":[14,35],"random":[15,52],"on":[16],"a":[17],"unit":[18],"length":[19],"circle.":[20,41],"We":[21,75],"study":[22],"the":[23,29,36,40,62,77],"maximum":[24,64],"overlap":[25,34,65],"i.e.":[27],"number":[30],"that":[33],"same":[37],"position":[38],"In":[42],"particular,":[43],"we":[44,59],"give":[45],"almost":[46],"exact":[47],"tail":[48,57],"bounds":[49,58],"for":[50,87,94],"this":[51],"variable.":[53],"By":[54],"applying":[55],"these":[56],"can":[60],"characterize":[61],"expected":[63],"exactly":[66],"up":[67],"to":[68,98,105],"constant":[69],"factors":[70],"in":[71],"lower":[72],"order":[73],"terms.":[74],"illustrate":[76],"strength":[78],"our":[80],"results":[81],"by":[82],"presenting":[83],"new":[84],"performance":[85],"guarantees":[86],"three":[88],"algorithmic":[89],"applications:":[90],"minimizing":[91],"rotational":[92],"delays":[93],"disks,":[95,100],"scheduling":[96],"accesses":[97],"parallel":[99],"and":[101],"allocating":[102],"memory":[103],"blocks":[104],"limit":[106],"cache":[107],"interference":[108],"misses.":[109]},"counts_by_year":[{"year":2018,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}