{"id":"https://openalex.org/W6910511065","doi":"https://doi.org/10.4230/lipics.esa.2023.14","title":"Lyndon Arrays in Sublinear Time","display_name":"Lyndon Arrays in Sublinear Time","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W6910511065","doi":"https://doi.org/10.4230/lipics.esa.2023.14"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:18667","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.14","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol274-esa2023/LIPIcs.ESA.2023.14/LIPIcs.ESA.2023.14.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-vol274-esa2023/LIPIcs.ESA.2023.14/LIPIcs.ESA.2023.14.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011046118","display_name":"Hideo Bannai","orcid":"https://orcid.org/0000-0002-6856-5185","observed_orcids":["https://orcid.org/0000-0002-6856-5185"]},"institutions":[{"id":"https://openalex.org/I125602781","display_name":"Tokyo Medical and Dental University","ror":"https://ror.org/051k3eh31","country_code":"JP","type":"education","lineage":["https://openalex.org/I125602781","https://openalex.org/I4400009020"]},{"id":"https://openalex.org/I4405287574","display_name":"M&D Data Science Center","ror":"https://ror.org/05jtn1j81","country_code":"JP","type":"facility","lineage":["https://openalex.org/I4400009020","https://openalex.org/I4405287574"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Bannai, Hideo","raw_affiliation_strings":["M&D Data Science Center, Tokyo Medical and Dental University, Japan"],"raw_orcid":"https://orcid.org/0000-0002-6856-5185","affiliations":[{"raw_affiliation_string":"M&D Data Science Center, Tokyo Medical and Dental University, Japan","institution_ids":["https://openalex.org/I125602781","https://openalex.org/I4405287574"]}]},{"author_position":"last","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":["Technical University of Dortmund, Germany"],"raw_orcid":"https://orcid.org/0000-0003-3305-6185","affiliations":[{"raw_affiliation_string":"Technical University of Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.9363,"has_fulltext":true,"cited_by_count":11,"citation_normalized_percentile":{"value":0.84496124,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":98},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"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":1.0,"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":9.999999747378752e-05,"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/T12288","display_name":"Optimization and Search Problems","score":0.0,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/lyndon-words","display_name":"Lyndon words","score":0.9919999837875366},{"id":"https://openalex.org/keywords/sublinear-algorithms","display_name":"sublinear-time algorithms","score":0.7940000295639038},{"id":"https://openalex.org/keywords/succinct-data-structures","display_name":"succinct data structures","score":0.859000027179718},{"id":"https://openalex.org/keywords/integer-alphabet","display_name":"integer alphabet","score":0.7110000252723694},{"id":"https://openalex.org/keywords/word-ram","display_name":"word RAM","score":0.8180000185966492},{"id":"https://openalex.org/keywords/lookup-tables","display_name":"look-up table","score":0.7250000238418579},{"id":"https://openalex.org/keywords/runs","display_name":"runs","score":0.8230000138282776},{"id":"https://openalex.org/keywords/string-algorithms","display_name":"string algorithms","score":0.43799999356269836}],"concepts":[{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.7695000171661377},{"id":"https://openalex.org/C2779804580","wikidata":"https://www.wikidata.org/wiki/Q102047","display_name":"Suffix","level":2,"score":0.6906999945640564},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.6869000196456909},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.652899980545044},{"id":"https://openalex.org/C2779259728","wikidata":"https://www.wikidata.org/wiki/Q281472","display_name":"Suffix array","level":3,"score":0.6463000178337097},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6019999980926514},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.599399983882904},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.5866000056266785},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5551999807357788},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5094000101089478},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.490200012922287},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4713999927043915},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4602000117301941},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3919000029563904},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.3865000009536743},{"id":"https://openalex.org/C2781166958","wikidata":"https://www.wikidata.org/wiki/Q1426863","display_name":"Suffix tree","level":3,"score":0.37470000982284546},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.3716000020503998},{"id":"https://openalex.org/C164804908","wikidata":"https://www.wikidata.org/wiki/Q2985058","display_name":"Combinatorics on words","level":3,"score":0.36910000443458557},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.3675999939441681},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.36739999055862427},{"id":"https://openalex.org/C130187892","wikidata":"https://www.wikidata.org/wiki/Q133327","display_name":"Spacetime","level":2,"score":0.337799996137619},{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.3294999897480011},{"id":"https://openalex.org/C118146561","wikidata":"https://www.wikidata.org/wiki/Q5532514","display_name":"Generalized suffix tree","level":4,"score":0.32499998807907104},{"id":"https://openalex.org/C173734053","wikidata":"https://www.wikidata.org/wiki/Q47577","display_name":"Fibonacci number","level":2,"score":0.3172999918460846},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.30230000615119934},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.30059999227523804},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.2919999957084656},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.29010000824928284},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.28780001401901245},{"id":"https://openalex.org/C3019641298","wikidata":"https://www.wikidata.org/wiki/Q625642","display_name":"Word length","level":2,"score":0.287200003862381},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.28360000252723694},{"id":"https://openalex.org/C100903775","wikidata":"https://www.wikidata.org/wiki/Q5157028","display_name":"Compressed suffix array","level":4,"score":0.28029999136924744},{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.27489998936653137},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.2720000147819519},{"id":"https://openalex.org/C184992742","wikidata":"https://www.wikidata.org/wiki/Q7243229","display_name":"Prime (order theory)","level":2,"score":0.26589998602867126},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.25859999656677246},{"id":"https://openalex.org/C190290938","wikidata":"https://www.wikidata.org/wiki/Q387015","display_name":"Trie","level":3,"score":0.2572000026702881},{"id":"https://openalex.org/C44667518","wikidata":"https://www.wikidata.org/wiki/Q12321","display_name":"Palindrome","level":4,"score":0.2551000118255615}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:18667","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.14","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol274-esa2023/LIPIcs.ESA.2023.14/LIPIcs.ESA.2023.14.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.esa.2023.14","doi":"https://doi.org/10.4230/lipics.esa.2023.14","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.esa.2023.14","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"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:18667","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.14","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol274-esa2023/LIPIcs.ESA.2023.14/LIPIcs.ESA.2023.14.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":[{"id":"https://openalex.org/G4091776703","display_name":"Combinatorics of string lexicographic orders and their applications","funder_award_id":"20H04141","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W6910511065.pdf","grobid_xml":"https://content.openalex.org/works/W6910511065.grobid-xml"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W1502253143","https://openalex.org/W1542553486","https://openalex.org/W1565650557","https://openalex.org/W1807114696","https://openalex.org/W1882010690","https://openalex.org/W1986197414","https://openalex.org/W1998674287","https://openalex.org/W2011273749","https://openalex.org/W2014277465","https://openalex.org/W2035314514","https://openalex.org/W2073103034","https://openalex.org/W2092245166","https://openalex.org/W2093788424","https://openalex.org/W2108866402","https://openalex.org/W2111487449","https://openalex.org/W2147935317","https://openalex.org/W2149098716","https://openalex.org/W2167049470","https://openalex.org/W2195269417","https://openalex.org/W2199929370","https://openalex.org/W2313966519","https://openalex.org/W2468020159","https://openalex.org/W2576782855","https://openalex.org/W2885974306","https://openalex.org/W2891065437","https://openalex.org/W2939697258","https://openalex.org/W2947842203","https://openalex.org/W2963452431","https://openalex.org/W3183860143","https://openalex.org/W3197565376","https://openalex.org/W4221156500","https://openalex.org/W4285219033","https://openalex.org/W4313031064","https://openalex.org/W4389217053","https://openalex.org/W7223735430"],"related_works":["https://openalex.org/W3128109002","https://openalex.org/W2987134948","https://openalex.org/W4231636649","https://openalex.org/W2418403027","https://openalex.org/W2610819251","https://openalex.org/W3003477910","https://openalex.org/W2204113621","https://openalex.org/W3087991744","https://openalex.org/W7117305821","https://openalex.org/W7138910215"],"abstract_inverted_index":{"A":[0],"Lyndon":[1,21,28,36,44,156,218],"word":[2,29],"is":[3,7,19,25,86,92,160,184],"a":[4,20,27,50,53,57,76,221],"string":[5,55,91,108],"that":[6,137,203],"lexicographically":[8],"smaller":[9],"than":[10],"all":[11],"of":[12,41,46,49,78,123,145,154,177,189,211],"its":[13,32],"non-trivial":[14],"suffixes.":[15],"For":[16,52],"example,":[17],"airbus":[18],"word,":[22],"but":[23],"amtrak":[24],"not":[26,87],"due":[30,186],"to":[31,148,173,187,196],"suffix":[33,48],"ak.":[34],"The":[35,158,167],"array":[37,62,219],"stores":[38],"the":[39,42,61,90,107,150,155,178,198,204,209,217],"length":[40],"longest":[43],"prefix":[45],"each":[47],"string.":[51],"length-n":[54],"over":[56,93],"general":[58],"ordered":[59],"alphabet,":[60],"can":[63,109],"be":[64,110],"computed":[65],"in":[66,112,180,208,224],"O(n)":[67],"time":[68,85,142,159],"(Bille":[69],"et":[70],"al.,":[71],"ICALP":[72],"2020).":[73],"However,":[74],"on":[75],"word-RAM":[77],"word-width":[79],"w":[80,163],"\u2265":[81],"log\u2082":[82],"n,":[83],"linear":[84],"optimal":[88,161],"if":[89],"integer":[94],"alphabet":[95],"{0,":[96],"\u2026":[97],",":[98],"\u03c3}":[99],"with":[100],"\u03c3":[101],"\u226a":[102],"n.":[103],"In":[104],"this":[105],"case,":[106],"stored":[111],"O(n":[113,118,130,138],"log":[114],"\u03c3)":[115],"bits":[116],"(or":[117],"/":[119,131,139],"log_\u03c3":[120,132,140],"n)":[121,133,141],"words)":[122],"memory,":[124],"and":[125,143,227],"reading":[126],"it":[127],"takes":[128],"only":[129],"time.":[134,182],"We":[135,201],"show":[136],"words":[144],"space":[146],"suffice":[147],"compute":[149],"succinct":[151],"2n-bit":[152],"version":[153],"array.":[157],"for":[162],"=":[164],"O(log":[165],"n).":[166],"algorithm":[168,205],"uses":[169],"precomputed":[170],"lookup":[171],"tables":[172],"perform":[174],"significant":[175],"parts":[176],"computation":[179,210],"constant":[181],"This":[183],"possible":[185],"properties":[188],"periodic":[190,214],"substrings,":[191],"which":[192],"we":[193],"carefully":[194],"analyze":[195],"achieve":[197],"desired":[199],"result.":[200],"envision":[202],"has":[206],"applications":[207],"runs":[212],"(maximal":[213],"substrings),":[215],"where":[216],"plays":[220],"central":[222],"role":[223],"both":[225],"theoretically":[226],"practically":[228],"fast":[229],"algorithms.":[230]},"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2025-10-10T00:00:00"}
