{"id":"https://openalex.org/W3183860143","doi":"https://doi.org/10.4230/lipics.icalp.2021.63","title":"Linear Time Runs Over General Ordered Alphabets","display_name":"Linear Time Runs Over General Ordered Alphabets","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3183860143","doi":"https://doi.org/10.4230/lipics.icalp.2021.63","mag":"3183860143"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:14132","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.63","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol198-icalp2021/LIPIcs.ICALP.2021.63/LIPIcs.ICALP.2021.63.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,"listed_in":[],"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"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol198-icalp2021/LIPIcs.ICALP.2021.63/LIPIcs.ICALP.2021.63.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5035566443","display_name":"Jonas Ellert","orcid":"https://orcid.org/0000-0003-3305-6185","observed_orcids":["https://orcid.org/0000-0003-3305-6185"]},"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":"Ellert, Jonas","raw_affiliation_strings":["Department of Computer Science, Technical University of Dortmund, Germany","TU Dortmund University, Dortmund, Germany"],"raw_orcid":"https://orcid.org/0000-0003-3305-6185","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Technical University of Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]},{"raw_affiliation_string":"TU Dortmund University, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055443993","display_name":"Johannes Fischer","orcid":"https://orcid.org/0000-0002-3384-597X","observed_orcids":["https://orcid.org/0000-0002-3384-597X"]},"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":"Fischer, Johannes","raw_affiliation_strings":["Department of Computer Science, Technical University of Dortmund, Germany","TU Dortmund University, Dortmund, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Technical University of Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]},{"raw_affiliation_string":"TU Dortmund University, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I200332995"],"apc_list":null,"apc_paid":null,"fwci":1.7217,"has_fulltext":true,"cited_by_count":20,"citation_normalized_percentile":{"value":0.82837723,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":99},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"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/T11567","display_name":"semigroups and automata theory","score":0.0010999999940395355,"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/linear-time-algorithms","display_name":"linear-time algorithms","score":0.6309999823570251},{"id":"https://openalex.org/keywords/combinatorics-on-words","display_name":"combinatorics on words","score":0.7699999809265137}],"concepts":[{"id":"https://openalex.org/C33436860","wikidata":"https://www.wikidata.org/wiki/Q341835","display_name":"Ackermann function","level":3,"score":0.867112398147583},{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.8263672590255737},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8087140917778015},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.7431479692459106},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.6645107269287109},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.624164879322052},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.534487247467041},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5163751840591431},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4634343087673187},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.3616848587989807},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3527635931968689},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.18954509496688843},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.127208411693573},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0712512731552124},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","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":3,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:14132","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.63","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol198-icalp2021/LIPIcs.ICALP.2021.63/LIPIcs.ICALP.2021.63.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,"listed_in":[],"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.2021.63","doi":"https://doi.org/10.4230/lipics.icalp.2021.63","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.icalp.2021.63","pdf_url":null,"source":{"id":"https://openalex.org/S4393917817","display_name":"Leibniz international proceedings in informatics","issn_l":"1868-8969","issn":["1868-8969"],"is_oa":true,"is_in_doaj":true,"is_core":false,"listed_in":["doaj","jufo-1","norway-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},{"id":"mag:3183860143","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/corr/corr2102.html#abs-2102-08670","pdf_url":null,"source":{"id":"https://openalex.org/S4306418971","display_name":"International Colloquium on Automata, Languages and Programming","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"International Colloquium on Automata, Languages and Programming","raw_type":null}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:14132","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.63","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol198-icalp2021/LIPIcs.ICALP.2021.63/LIPIcs.ICALP.2021.63.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,"listed_in":[],"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":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3183860143.pdf","grobid_xml":"https://content.openalex.org/works/W3183860143.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W1504306421","https://openalex.org/W1523480252","https://openalex.org/W1542553486","https://openalex.org/W1602103078","https://openalex.org/W1807114696","https://openalex.org/W1841567773","https://openalex.org/W1882010690","https://openalex.org/W1973456884","https://openalex.org/W1992151876","https://openalex.org/W1998674287","https://openalex.org/W2011273749","https://openalex.org/W2014277465","https://openalex.org/W2051593658","https://openalex.org/W2137971218","https://openalex.org/W2149098716","https://openalex.org/W2195269417","https://openalex.org/W2199929370","https://openalex.org/W2417075471","https://openalex.org/W2468020159","https://openalex.org/W2962862999","https://openalex.org/W2963452431","https://openalex.org/W2987134948"],"related_works":["https://openalex.org/W2195269417","https://openalex.org/W2199929370","https://openalex.org/W2614278629","https://openalex.org/W2951149401","https://openalex.org/W2610819251","https://openalex.org/W4231636649","https://openalex.org/W6910511065","https://openalex.org/W2963452431","https://openalex.org/W2076967798","https://openalex.org/W2051593658"],"abstract_inverted_index":{"A":[0],"run":[1],"in":[2,31,133],"a":[3,6,40,43,62],"string":[4,13,41],"is":[5,92],"maximal":[7],"periodic":[8],"substring.":[9],"For":[10],"example,":[11],"the":[12,16,93,112,123],"bananatree":[14],"contains":[15],"runs":[17,30,38,65],"anana":[18],"=":[19,23],"(an)^{5/2}":[20],"and":[21,35],"ee":[22],"e\u00b2.":[24],"There":[25],"are":[26],"less":[27],"than":[28],"n":[29],"any":[32],"length-n":[33],"string,":[34],"computing":[36],"all":[37],"for":[39,67],"over":[42,136],"linearly-sortable":[44],"alphabet":[45],"takes":[46],"\ud835\udcaa(n)":[47,105],"time":[48,64,88,106,135],"(Bannai":[49],"et":[50,82],"al.,":[51,83],"SIAM":[52],"J.":[53],"Comput.":[54],"2017).":[55],"Kosolobov":[56],"conjectured":[57],"that":[58],"there":[59],"also":[60,120],"exists":[61],"linear":[63,134],"algorithm":[66,89],"general":[68,137],"ordered":[69,138],"alphabets":[70,139],"(Inf.":[71],"Process.":[72],"Lett.":[73],"2016).":[74],"The":[75],"conjecture":[76],"was":[77],"almost":[78],"proven":[79],"by":[80,107],"Crochemore":[81],"who":[84],"presented":[85],"an":[86],"\ud835\udcaa(n\u03b1(n))":[87],"(where":[90],"\u03b1(n)":[91],"extremely":[94],"slowly":[95],"growing":[96],"inverse":[97],"Ackermann":[98],"function).":[99],"We":[100],"show":[101],"how":[102],"to":[103],"achieve":[104],"exploiting":[108],"combinatorial":[109],"properties":[110],"of":[111],"Lyndon":[113],"array,":[114],"thus":[115],"proving":[116],"Kosolobov\u2019s":[117],"conjecture.":[118],"This":[119],"positively":[121],"answers":[122],"at":[124],"least":[125],"29-year-old":[126],"question":[127],"whether":[128],"square-freeness":[129],"can":[130],"be":[131],"tested":[132],"(Breslauer,":[140],"PhD":[141],"thesis,":[142],"Columbia":[143],"University":[144],"1992).":[145]},"counts_by_year":[{"year":2026,"cited_by_count":6},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-11-10T11:39:43.021295","created_date":"2021-08-02T00:00:00"}
