{"id":"https://openalex.org/W2052708742","doi":"https://doi.org/10.1137/s0097539792230277","title":"Tight Bounds on Oblivious Chaining","display_name":"Tight Bounds on Oblivious Chaining","publication_year":1994,"publication_date":"1994-12-01","ids":{"openalex":"https://openalex.org/W2052708742","doi":"https://doi.org/10.1137/s0097539792230277","mag":"2052708742"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539792230277","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792230277","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/A5109880876","display_name":"Shiva Chaudhuri","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Shiva Chaudhuri","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5109880876"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4637,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.63772455,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"23","issue":"6","first_page":"1253","last_page":"1265"},"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.9998999834060669,"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.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/chaining","display_name":"Chaining","score":0.9231271147727966},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6411018371582031},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5973746180534363},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4921717047691345},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.4871372878551483},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4593127369880676},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4505003094673157},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4389275312423706},{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.43139517307281494},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42162972688674927},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42080575227737427}],"concepts":[{"id":"https://openalex.org/C49020025","wikidata":"https://www.wikidata.org/wiki/Q1059099","display_name":"Chaining","level":2,"score":0.9231271147727966},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6411018371582031},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5973746180534363},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4921717047691345},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.4871372878551483},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4593127369880676},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4505003094673157},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4389275312423706},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.43139517307281494},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42162972688674927},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42080575227737427},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s0097539792230277","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792230277","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.44.8213","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.8213","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mpi-sb.mpg.de/~shiva/publications/obliv-ch.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1534829670","https://openalex.org/W1564095107","https://openalex.org/W1938119559","https://openalex.org/W1966913545","https://openalex.org/W2031713274","https://openalex.org/W2047234016","https://openalex.org/W2070570981"],"related_works":["https://openalex.org/W2139508594","https://openalex.org/W3196321793","https://openalex.org/W3080705045","https://openalex.org/W2385527937","https://openalex.org/W2005880840","https://openalex.org/W4385305499","https://openalex.org/W1983915440","https://openalex.org/W1549756090","https://openalex.org/W1779369758","https://openalex.org/W3095925971"],"abstract_inverted_index":{"The":[0,48,90,136,168],"chaining":[1,49,65,106,145,154],"problem":[2,50,66],"is":[3,77,84,113,122,182,187],"defined":[4],"as":[5,52],"follows.":[6],"Given":[7],"values":[8],"at":[9],"$a_1":[10],",":[11,26],"\\ldots":[12,27],",a_n":[13],",a_i":[14],"=":[15,33,37,46],"0$":[16],"or":[17],"1,":[18],"$1":[19],"\\leqslant":[20,22],"i":[21],"n$,":[23],"compute":[24],"$b_1":[25],",b_n":[28],"$":[29],"such":[30],"that":[31,62,152,156],"$b_i":[32],"\\max":[34],"\\{":[35,44],"j|a_j":[36],"1,j":[38],"<":[39],"i\\}":[40],"$.":[41],"(Define":[42],"$\\max":[43],"\\}":[45],"0$.)":[47],"appears":[51],"a":[53,85,93,126,140,163],"subproblem":[54],"in":[55,70,109,158],"many":[56],"contexts.":[57],"There":[58],"are":[59,147],"known":[60],"algorithms":[61,96,132,146],"solve":[63],"the":[64,78,117,120,180,194],"on":[67,193],"CROW":[68],"PRAMs":[69],"$O(\\alpha":[71,110],"(n))$":[72,111],"time,":[73],"where":[74],"$\\alpha":[75],"(n)$":[76],"inverse":[79],"of":[80,95,119,166,196],"Ackerman\u2019s":[81],"function,":[82],"and":[83,173,184],"very":[86],"slowly":[87],"growing":[88],"function.":[89],"author":[91],"studies":[92],"class":[94],"(called":[97],"oblivious":[98,105,131],"algorithms)":[99],"for":[100,130,143],"this":[101,185],"problem.":[102],"A":[103],"simple":[104],"algorithm":[107,121,155],"running":[108],"time":[112],"presented.":[114],"More":[115],"importantly,":[116],"optimality":[118],"demonstrated":[123,183],"by":[124,150],"showing":[125,151],"matching":[127],"lower":[128,141],"bound":[129,142],"using":[133],"n":[134],"processors.":[135,167],"first":[137],"steps":[138,160],"toward":[139],"all":[144],"also":[148],"provided":[149],"any":[153],"runs":[157],"two":[159,181],"must":[161],"use":[162,170],"superlinear":[164],"number":[165],"proofs":[169],"prefix":[171,197],"graphs":[172],"weak":[174],"superconcentrators":[175],"An":[176],"interesting":[177],"connection":[178],"between":[179],"idea":[186],"used":[188],"to":[189],"obtain":[190],"improved":[191],"bounds":[192],"size":[195],"graphs.":[198]},"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}