{"id":"https://openalex.org/W7166838264","doi":"https://doi.org/10.4230/lipics.icalp.2026.5","title":"The Impossibility of Simultaneous Time and I/O Optimality for the Planar Maxima and Convex Hull Problems","display_name":"The Impossibility of Simultaneous Time and I/O Optimality for the Planar Maxima and Convex Hull Problems","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7166838264","doi":"https://doi.org/10.4230/lipics.icalp.2026.5"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26394","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.5","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.5/LIPIcs.ICALP.2026.5.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.5/LIPIcs.ICALP.2026.5.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5035056543","display_name":"Peyman Afshani","orcid":"https://orcid.org/0000-0001-6102-0759"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Afshani, Peyman","raw_affiliation_strings":["Aarhus University, Denmark"],"raw_orcid":"https://orcid.org/0000-0001-6102-0759","affiliations":[{"raw_affiliation_string":"Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039943336","display_name":"Gerth St\u00f8lting Brodal","orcid":"https://orcid.org/0000-0001-9054-915X"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Brodal, Gerth St\u00f8lting","raw_affiliation_strings":["Aarhus University, Denmark"],"raw_orcid":"https://orcid.org/0000-0001-9054-915X","affiliations":[{"raw_affiliation_string":"Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015446804","display_name":"Nodari Sitchinava","orcid":"https://orcid.org/0000-0001-8876-4846"},"institutions":[{"id":"https://openalex.org/I117965899","display_name":"University of Hawai\u02bbi at M\u0101noa","ror":"https://ror.org/01wspgy28","country_code":"US","type":"education","lineage":["https://openalex.org/I117965899"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sitchinava, Nodari","raw_affiliation_strings":["University of Hawai'i at M\u0101noa, Honolulu, HI, USA"],"raw_orcid":"https://orcid.org/0000-0001-8876-4846","affiliations":[{"raw_affiliation_string":"University of Hawai'i at M\u0101noa, Honolulu, HI, USA","institution_ids":["https://openalex.org/I117965899"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.79032258,"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_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.36469998955726624,"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.36469998955726624,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.18970000743865967,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.09309999644756317,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"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/impossibility","display_name":"Impossibility","score":0.6747999787330627},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5623000264167786},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.5544999837875366},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.49230000376701355},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4799000024795532},{"id":"https://openalex.org/keywords/maxima","display_name":"Maxima","score":0.447299987077713},{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.4406999945640564},{"id":"https://openalex.org/keywords/output-sensitive-algorithm","display_name":"Output-sensitive algorithm","score":0.43709999322891235},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.4359999895095825}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7508000135421753},{"id":"https://openalex.org/C2776261394","wikidata":"https://www.wikidata.org/wiki/Q315562","display_name":"Impossibility","level":2,"score":0.6747999787330627},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5623000264167786},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.5544999837875366},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.49230000376701355},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4799000024795532},{"id":"https://openalex.org/C91528185","wikidata":"https://www.wikidata.org/wiki/Q520952","display_name":"Maxima","level":3,"score":0.447299987077713},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.4406999945640564},{"id":"https://openalex.org/C39132409","wikidata":"https://www.wikidata.org/wiki/Q7112860","display_name":"Output-sensitive algorithm","level":5,"score":0.43709999322891235},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.4359999895095825},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4198000133037567},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4011000096797943},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.4004000127315521},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.38119998574256897},{"id":"https://openalex.org/C97542219","wikidata":"https://www.wikidata.org/wiki/Q497863","display_name":"SIMPLE algorithm","level":2,"score":0.36899998784065247},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3582000136375427},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.35010001063346863},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.34880000352859497},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.3458999991416931},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.33410000801086426},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.3140000104904175},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.30239999294281006},{"id":"https://openalex.org/C37423430","wikidata":"https://www.wikidata.org/wiki/Q6750281","display_name":"Hull","level":2,"score":0.28529998660087585},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.28450000286102295},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.2831000089645386},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.25060001015663147}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26394","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.5","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.5/LIPIcs.ICALP.2026.5.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.icalp.2026.5","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.icalp.2026.5","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26394","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.5","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.5/LIPIcs.ICALP.2026.5.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7166838264.pdf","grobid_xml":"https://content.openalex.org/works/W7166838264.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"prove":[1],"that":[2,89,107,113,137],"no":[3,90],"deterministic":[4,92,105,130],"output-sensitive":[5,93],"algorithm":[6,95,131,136],"for":[7,76,97],"the":[8,24,32,40,50,62,67,77,122],"planar":[9],"convex":[10],"hull":[11],"and":[12,20,34,82,112,119,143],"maxima":[13],"problems":[14],"can":[15],"obtain":[16],"both":[17,31],"optimal":[18,46,91,140,144],"time":[19,55,118,142],"I/O":[21,47,146],"complexity,":[22],"where":[23],"optimality":[25,71],"is":[26],"defined":[27],"with":[28],"respect":[29],"to":[30],"input":[33],"output":[35],"sizes.":[36],"This":[37],"explains":[38],"why":[39],"best":[41,63],"previous":[42],"algorithms":[43,106],"achieved":[44],"an":[45],"bound":[48],"at":[49],"cost":[51],"of":[52,64,69,128],"sub-optimal":[53],"running":[54],"(Goodrich":[56],"et":[57],"al.":[58],"[FOCS,":[59],"1993]).":[60],"To":[61],"our":[65,109,129],"knowledge,":[66],"impossibility":[68],"simultaneous":[70],"was":[72],"only":[73],"shown":[74],"previously":[75],"permutation":[78],"problem":[79],"by":[80],"Brodal":[81],"Fagerberg":[83],"[STOC,":[84],"2003].":[85],"Our":[86],"results":[87,132],"imply":[88],"cache-oblivious":[94],"exists":[96],"either":[98],"problem.":[99],"In":[100],"addition,":[101],"we":[102],"present":[103],"simple":[104,126],"match":[108],"lower":[110],"bounds":[111],"provide":[114],"a":[115,125,134],"trade-off":[116],"between":[117],"I/Os.":[120],"On":[121],"other":[123],"hand,":[124],"modification":[127],"in":[133],"randomized":[135],"simultaneously":[138],"achieves":[139],"(worst-case)":[141],"expected":[145],"bounds.":[147]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-02T00:00:00"}