{"id":"https://openalex.org/W4416943850","doi":"https://doi.org/10.4230/lipics.cpm.2026.32","title":"Balancing Two-Dimensional Straight-Line Programs","display_name":"Balancing Two-Dimensional Straight-Line Programs","publication_year":2025,"publication_date":"2025-11-27","ids":{"openalex":"https://openalex.org/W4416943850","doi":"https://doi.org/10.4230/lipics.cpm.2026.32"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2511.22212","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.22212","pdf_url":"https://arxiv.org/pdf/2511.22212","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"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":null,"raw_type":"text"},"type":"article","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2511.22212","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5120538978","display_name":"Itai Boneh","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Boneh, Itai","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5120538979","display_name":"Est\u00e9ban Gabory","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gabory, Est\u00e9ban","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022706035","display_name":"Pawe\u0142 Gawrychowski","orcid":"https://orcid.org/0000-0002-6993-5440"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gawrychowski, Pawe\u0142","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5114633636","display_name":"Adam G\u00f3rkiewicz","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"G\u00f3rkiewicz, Adam","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"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.34093333,"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.32670000195503235,"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.32670000195503235,"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.26660001277923584,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.1160999983549118,"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/complement","display_name":"Complement (music)","score":0.6852999925613403},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.597100019454956},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.5773000121116638},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5385000109672546},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5080000162124634},{"id":"https://openalex.org/keywords/character","display_name":"Character (mathematics)","score":0.47119998931884766}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7325000166893005},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.6852999925613403},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.597100019454956},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5773000121116638},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5385000109672546},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5080000162124634},{"id":"https://openalex.org/C2780861071","wikidata":"https://www.wikidata.org/wiki/Q1062934","display_name":"Character (mathematics)","level":2,"score":0.47119998931884766},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4230000078678131},{"id":"https://openalex.org/C101722063","wikidata":"https://www.wikidata.org/wiki/Q218825","display_name":"Random access","level":2,"score":0.35899999737739563},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34869998693466187},{"id":"https://openalex.org/C41431624","wikidata":"https://www.wikidata.org/wiki/Q1053357","display_name":"Block size","level":3,"score":0.3077999949455261},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.2727999985218048},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26930001378059387},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.260699987411499},{"id":"https://openalex.org/C2776502983","wikidata":"https://www.wikidata.org/wiki/Q690182","display_name":"Contrast (vision)","level":2,"score":0.259799987077713},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.25850000977516174}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:arXiv.org:2511.22212","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.22212","pdf_url":"https://arxiv.org/pdf/2511.22212","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"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":null,"raw_type":"text"},{"id":"pmh:oai:drops-oai.dagstuhl.de:25958","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2026.32","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol369-cpm2026/LIPIcs.CPM.2026.32/LIPIcs.CPM.2026.32.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":"publishedVersion"},{"id":"doi:10.48550/arxiv.2511.22212","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2511.22212","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"},{"id":"doi:10.4230/lipics.cpm.2026.32","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.cpm.2026.32","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2511.22212","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.22212","pdf_url":"https://arxiv.org/pdf/2511.22212","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"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":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,83,105,151,190],"consider":[1,84],"building,":[2],"given":[3,207],"a":[4,13,21,43,126,163,178,193,208,215,224,244,258,269,274,313],"straight-line":[5],"program":[6],"(SLP)":[7],"consisting":[8],"of":[9,17,24,31,45,71,97,117,120,129,137,147,166,180,211,217,229,246,276,317],"g":[10,131,213],"productions":[11],"deriving":[12,214],"two-dimensional":[14,89,118],"string":[15,144,216],"T":[16],"size":[18,46,72,101,121,130,148,167,212,218,234,247,277,318],"N\u00d7":[19,122,219],"N,":[20,220],"structure":[22,44,245,275,316],"capable":[23],"providing":[25,249,281],"random":[26,50,250,282,298],"access":[27,51,251,283,299],"to":[28,41,160,239,272],"any":[29,134,291],"character":[30],"T.":[32],"For":[33],"one-dimensional":[34],"strings,":[35],"it":[36,58],"is":[37,59,110,243],"now":[38],"known":[39,60,194],"how":[40,159],"build":[42,93],"\ud835\udcaa(g)":[47,73,248],"that":[48,61,107,133,173,192,241],"provides":[49],"in":[52,252,284],"\ud835\udcaa(log":[53,76,139,231,253,285],"N)":[54,77,140,232,254,280,288],"time.":[55],"In":[56],"fact,":[57],"this":[62,153,262],"can":[63,91,175,222,263],"be":[64,146,264],"obtained":[65],"by":[66,125,198,305],"building":[67],"an":[68,94,114,155],"equivalent":[69,95],"SLP":[70,96,128,136,165,187,210,226],"and":[74,102,233,307],"depth":[75,138,230],"[Ganardi,":[78,199],"Je\u017c,":[79,200],"Lohrey,":[80,201],"JACM":[81,202],"2021].":[82],"the":[85,99,108,142],"analogous":[86],"question":[87],"for":[88,256,268,290],"strings:":[90],"we":[92,171,184,221],"roughly":[98],"same":[100,143,296],"small":[103],"depth?":[104],"show":[106,191],"answer":[109],"negative:":[111],"there":[112,242],"exists":[113],"infinite":[115],"family":[116],"strings":[119],"N":[123],"described":[124],"2D":[127,135,164,181,186,209,225,259],"such":[132,162,257],"describing":[141],"must":[145],"\u03a9(g\u22c5":[149],"N/log\u00b3N).":[150],"complement":[152],"with":[154,188,227,312],"upper":[156],"bound":[157],"showing":[158],"construct":[161,223],"\ud835\udcaa(g\u22c5":[168],"N).":[169,321],"Next,":[170],"observe":[172],"one":[174],"naturally":[176],"define":[177],"generalization":[179],"SLP,":[182],"which":[183],"call":[185],"holes.":[189],"general":[195],"balancing":[196],"theorem":[197],"2021]":[203],"immediately":[204],"implies":[205],"that,":[206],"holes":[228],"\ud835\udcaa(g).":[235],"This":[236],"allows":[237],"us":[238],"conclude":[240],"time":[255,300],"SLP.":[260],"Further,":[261],"extended":[265],"(analogously":[266],"as":[267],"1D":[270],"SLP)":[271],"obtain":[273],"\ud835\udcaa(g":[278,319],"log^\u03b5":[279],"N/log":[286],"log":[287],"time,":[289],"\u03b5":[292],">":[293],"0.":[294],"The":[295],"(optimal)":[297],"was":[301],"very":[302],"recently":[303],"achieved":[304],"[De":[306],"Kempa,":[308],"SODA":[309],"2026],":[310],"but":[311],"significantly":[314],"larger":[315],"log^{2+\u03b5}":[320]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-12-03T00:00:00"}