{"id":"https://openalex.org/W2100671534","doi":"https://doi.org/10.1080/00207169508804408","title":"A fast average case algorithm for lyndon decomposition","display_name":"A fast average case algorithm for lyndon decomposition","publication_year":1995,"publication_date":"1995-01-01","ids":{"openalex":"https://openalex.org/W2100671534","doi":"https://doi.org/10.1080/00207169508804408","mag":"2100671534"},"language":"en","primary_location":{"id":"doi:10.1080/00207169508804408","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169508804408","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","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/A5107931257","display_name":"Costas S. Iliopoulos","orcid":null},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]},{"id":"https://openalex.org/I124357947","display_name":"University of London","ror":"https://ror.org/04cw6st05","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"C. S. Iliopoulos","raw_affiliation_strings":["Department of Computing , King's College University of London , London, WC2R 2LS, England"],"affiliations":[{"raw_affiliation_string":"Department of Computing , King's College University of London , London, WC2R 2LS, England","institution_ids":["https://openalex.org/I183935753","https://openalex.org/I124357947"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017243867","display_name":"W. F. Smyth","orcid":null},"institutions":[{"id":"https://openalex.org/I124357947","display_name":"University of London","ror":"https://ror.org/04cw6st05","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947"]},{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"W. F. Smyth","raw_affiliation_strings":["Department of Computing , King's College University of London , London, WC2R 2LS, England"],"affiliations":[{"raw_affiliation_string":"Department of Computing , King's College University of London , London, WC2R 2LS, England","institution_ids":["https://openalex.org/I183935753","https://openalex.org/I124357947"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5107931257"],"corresponding_institution_ids":["https://openalex.org/I124357947","https://openalex.org/I183935753"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.17183547,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"57","issue":"1-2","first_page":"15","last_page":"31"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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/T11567","display_name":"semigroups and automata theory","score":0.9991000294685364,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9902999997138977,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7012569904327393},{"id":"https://openalex.org/keywords/word","display_name":"Word (group theory)","score":0.6573496460914612},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.6565445065498352},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6489033699035645},{"id":"https://openalex.org/keywords/word-length","display_name":"Word length","score":0.6121072769165039},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5423395037651062},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.53001868724823},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.46455568075180054},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.46298161149024963},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4609765112400055},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33703646063804626},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.280295193195343}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7012569904327393},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.6573496460914612},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.6565445065498352},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6489033699035645},{"id":"https://openalex.org/C3019641298","wikidata":"https://www.wikidata.org/wiki/Q625642","display_name":"Word length","level":2,"score":0.6121072769165039},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5423395037651062},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.53001868724823},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.46455568075180054},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46298161149024963},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4609765112400055},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33703646063804626},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.280295193195343},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","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/C204321447","wikidata":"https://www.wikidata.org/wiki/Q30642","display_name":"Natural language processing","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1080/00207169508804408","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169508804408","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:researchrepository.murdoch.edu.au:27526","is_oa":false,"landing_page_url":"http://researchrepository.murdoch.edu.au/id/eprint/27526/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400274","display_name":"Murdoch Research Repository (Murdoch University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I176790772","host_organization_name":"Murdoch University","host_organization_lineage":["https://openalex.org/I176790772"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"  Iliopoulos, C.S. and Smyth, W.F. <http://researchrepository.murdoch.edu.au/view/author/Smyth, William.html>   (1995) A fast average case algorithm for lyndon decomposition.   International Journal of Computer Mathematics, 57  (1-2).   pp. 15-31.  ","raw_type":"Journal Article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.55.9144","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.9144","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cas.mcmaster.ca/~bill/lw.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Quality Education","score":0.5199999809265137,"id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320309475","display_name":"Northwestern University","ror":"https://ror.org/000e0be47"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1655990431","https://openalex.org/W1821337332","https://openalex.org/W1974803623","https://openalex.org/W1985108724","https://openalex.org/W1995300673","https://openalex.org/W2023154896","https://openalex.org/W2073103034","https://openalex.org/W2093599904","https://openalex.org/W2313966519"],"related_works":["https://openalex.org/W3088566498","https://openalex.org/W2068578356","https://openalex.org/W237537940","https://openalex.org/W1898422521","https://openalex.org/W2133478886","https://openalex.org/W4235762796","https://openalex.org/W1995096030","https://openalex.org/W4250812604","https://openalex.org/W1792229902","https://openalex.org/W4250718264"],"abstract_inverted_index":{"A":[0],"simple":[1],"algorithm,":[2],"called":[3],"LD,":[4],"is":[5,29,50,82],"described":[6],"for":[7,37,46],"computing":[8,70],"the":[9,25,67,71,110],"Lyndon":[10],"decomposition":[11],"of":[12,15,69,74,95,117,121],"a":[13,75],"word":[14],"length.":[16],"Although":[17],"LD":[18,61,81,106],"requires":[19],"time":[20,36,45],"0(n":[21],"log":[22],"n)":[23],"in":[24,60,63,115],"worst":[26],"case,":[27],"it":[28],"shown":[30,83],"to":[31,54,66,84,103],"require":[32],"only":[33],"\u00ae(rc)":[34],"worst-case":[35],"words":[38,47],"which":[39],"are":[40],"\u201c1-decomposable\u201d,":[41],"and":[42,125],"\u229d(n)":[43],"average-case":[44],"whose":[48],"length":[49],"small":[51],"with":[52],"respect":[53],"alphabet":[55],"size.":[56],"The":[57],"main":[58],"interest":[59],"resides":[62],"its":[64],"application":[65],"problem":[68],"canonical":[72],"form":[73],"circular":[76],"word.":[77],"For":[78],"this":[79],"problem,":[80],"execute":[85],"significantly":[86],"faster":[87],"than":[88],"other":[89,111],"known":[90,112],"algorithms":[91,114],"on":[92,107,123],"important":[93],"classes":[94],"words.":[96],"Further,":[97],"experiment":[98],"suggests":[99],"that,":[100],"when":[101],"applied":[102],"arbitrary":[104],"words,":[105],"average":[108],"outperforms":[109],"canonization":[113],"terms":[116],"two":[118],"measures:":[119],"number":[120],"tests":[122],"letters":[124],"execution":[126],"time.":[127]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}