Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: William F. Smyth
@article{DBLP:journals/jcb/GoldingKMS23,
author = {Geoffrey Brian Golding and
Holly Koponen and
Neerja Mhaskar and
W. F. Smyth},
title = {Computing Maximal Covers for Protein Sequences},
journal = {J. Comput. Biol.},
volume = {30},
number = {2},
pages = {149--160},
year = {2023},
url = {https://doi.org/10.1089/cmb.2021.0520},
doi = {10.1089/CMB.2021.0520},
timestamp = {Wed, 31 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcb/GoldingKMS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/DaykinMS23,
author = {Jacqueline W. Daykin and
Neerja Mhaskar and
W. F. Smyth},
editor = {Weili Wu and
Jianxiong Guo},
title = {V-Words, Lyndon Words and Substring circ-UMFFs},
booktitle = {Combinatorial Optimization and Applications - 17th International Conference,
{COCOA} 2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings,
Part {I}},
series = {Lecture Notes in Computer Science},
volume = {14461},
pages = {471--484},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-49611-0\_34},
doi = {10.1007/978-3-031-49611-0\_34},
timestamp = {Thu, 04 Jan 2024 08:13:46 +0100},
biburl = {https://dblp.org/rec/conf/cocoa/DaykinMS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ifip12/AlzamelDHILS23,
author = {Mai Alzamel and
Jacqueline W. Daykin and
Christopher Hampson and
Costas S. Iliopoulos and
Zara Lim and
W. F. Smyth},
editor = {Ilias Maglogiannis and
Lazaros S. Iliadis and
Antonios Papaleonidas and
Ioannis P. Chochliouros},
title = {Local Maximal Equality-Free Periodicities},
booktitle = {Artificial Intelligence Applications and Innovations. {AIAI} 2023
{IFIP} {WG} 12.5 International Workshops - {MHDW} 2023, 5G-PINE 2023,
{\(\Alpha\)}{\(\Iota\)}BMG 2023, and {VAA-CP-EB} 2023, Le{\'{o}}n,
Spain, June 14-17, 2023, Proceedings},
series = {{IFIP} Advances in Information and Communication Technology},
volume = {677},
pages = {359--368},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-34171-7\_29},
doi = {10.1007/978-3-031-34171-7\_29},
timestamp = {Thu, 15 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ifip12/AlzamelDHILS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stringology/KoponenNS23,
author = {Holly Koponen and
Mhaskar Neerja and
William F. Smyth},
editor = {Jan Holub and
Jan Zd{\'{a}}rek},
title = {Improved Practical Algorithms to Compute Maximal Covers},
booktitle = {Prague Stringology Conference 2023, Prague, Czech Republic, August
28-29, 2023},
pages = {30--41},
publisher = {Czech Technical University in Prague, Faculty of Information Technology,
Department of Theoretical Computer Science},
year = {2023},
url = {http://www.stringology.org/event/2023/p04.html},
timestamp = {Wed, 31 Jan 2024 17:00:02 +0100},
biburl = {https://dblp.org/rec/conf/stringology/KoponenNS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/MhaskarS22,
author = {Neerja Mhaskar and
W. F. Smyth},
title = {String Covering: {A} Survey},
journal = {Fundam. Informaticae},
volume = {190},
number = {1},
pages = {17--45},
year = {2022},
url = {https://doi.org/10.3233/FI-222164},
doi = {10.3233/FI-222164},
timestamp = {Mon, 13 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/fuin/MhaskarS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2204-08331,
author = {Hossein Dehghani and
Neerja Mhaskar and
W. F. Smyth},
title = {Practical {KMP/BM} Style Pattern-Matching on Indeterminate Strings},
journal = {CoRR},
volume = {abs/2204.08331},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2204.08331},
doi = {10.48550/ARXIV.2204.08331},
eprinttype = {arXiv},
eprint = {2204.08331},
timestamp = {Tue, 19 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2204-08331.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-11856,
author = {Neerja Mhaskar and
William F. Smyth},
title = {String Covering: {A} Survey},
journal = {CoRR},
volume = {abs/2211.11856},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.11856},
doi = {10.48550/ARXIV.2211.11856},
eprinttype = {arXiv},
eprint = {2211.11856},
timestamp = {Thu, 24 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-11856.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LouzaMS21,
author = {Felipe A. Louza and
Neerja Mhaskar and
W. F. Smyth},
title = {A new approach to regular {\&} indeterminate strings},
journal = {Theor. Comput. Sci.},
volume = {854},
pages = {105--115},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2020.12.007},
doi = {10.1016/J.TCS.2020.12.007},
timestamp = {Tue, 26 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LouzaMS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DaykinMS21,
author = {Jacqueline W. Daykin and
Neerja Mhaskar and
W. F. Smyth},
title = {Computation of the suffix array, Burrows-Wheeler transform and FM-index
in \emph{V}-order},
journal = {Theor. Comput. Sci.},
volume = {880},
pages = {82--96},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2021.06.004},
doi = {10.1016/J.TCS.2021.06.004},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/DaykinMS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/FoucaudGKRS20,
author = {Florent Foucaud and
Leszek Gasieniec and
Ralf Klasing and
Tomasz Radzik and
Bill Smyth},
title = {{IWOCA} 2020 in Bordeaux (Oops! On-Line!)},
journal = {Bull. {EATCS}},
volume = {132},
year = {2020},
url = {http://eatcs.org/beatcs/index.php/beatcs/article/view/631},
timestamp = {Wed, 10 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eatcs/FoucaudGKRS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stringology/NeerjaS20,
author = {Mhaskar Neerja and
William F. Smyth},
editor = {Jan Holub and
Jan Zd{\'{a}}rek},
title = {Simple {KMP} Pattern-Matching on Indeterminate Strings},
booktitle = {Prague Stringology Conference 2020, Prague, Czech Republic, August
31 - September 2, 2020},
pages = {125--133},
publisher = {Czech Technical University in Prague, Faculty of Information Technology,
Department of Theoretical Computer Science},
year = {2020},
url = {http://www.stringology.org/event/2020/p11.html},
timestamp = {Wed, 10 Feb 2021 08:42:18 +0100},
biburl = {https://dblp.org/rec/conf/stringology/NeerjaS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2012-07892,
author = {Felipe A. Louza and
Neerja Mhaskar and
W. F. Smyth},
title = {A New Approach to Regular {\&} Indeterminate Strings},
journal = {CoRR},
volume = {abs/2012.07892},
year = {2020},
url = {https://arxiv.org/abs/2012.07892},
eprinttype = {arXiv},
eprint = {2012.07892},
timestamp = {Sat, 02 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2012-07892.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/GlenSS19,
author = {Amy Glen and
Jamie Simpson and
W. F. Smyth},
title = {Palindromes in starlike trees},
journal = {Australas. {J} Comb.},
volume = {73},
pages = {242--246},
year = {2019},
url = {http://ajc.maths.uq.edu.au/pdf/73/ajc\_v73\_p242.pdf},
timestamp = {Mon, 22 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/GlenSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AlzamelISS19,
author = {Mai Alzamel and
Costas S. Iliopoulos and
W. F. Smyth and
Wing{-}Kin Sung},
title = {Off-line and on-line algorithms for closed string factorization},
journal = {Theor. Comput. Sci.},
volume = {792},
pages = {12--19},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2018.10.033},
doi = {10.1016/J.TCS.2018.10.033},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AlzamelISS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GlenSS19,
author = {Amy Glen and
Jamie Simpson and
W. F. Smyth},
title = {More properties of the Fibonacci word on an infinite alphabet},
journal = {Theor. Comput. Sci.},
volume = {795},
pages = {301--311},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2019.07.011},
doi = {10.1016/J.TCS.2019.07.011},
timestamp = {Thu, 31 Oct 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GlenSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/AlatabbiDMRS19,
author = {Ali Alatabbi and
Jacqueline W. Daykin and
Neerja Mhaskar and
M. Sohel Rahman and
W. F. Smyth},
editor = {Gautam K. Das and
Partha Sarathi Mandal and
Krishnendu Mukhopadhyaya and
Shin{-}Ichi Nakano},
title = {Applications of V-Order: Suffix Arrays, the Burrows-Wheeler Transform
{\&} the FM-index},
booktitle = {{WALCOM:} Algorithms and Computation - 13th International Conference,
{WALCOM} 2019, Guwahati, India, February 27 - March 2, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11355},
pages = {329--338},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-10564-8\_26},
doi = {10.1007/978-3-030-10564-8\_26},
timestamp = {Wed, 31 Mar 2021 12:03:13 +0200},
biburl = {https://dblp.org/rec/conf/walcom/AlatabbiDMRS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LiptakS18,
author = {Zsuzsanna Lipt{\'{a}}k and
W. F. Smyth},
title = {Preface},
journal = {Discret. Appl. Math.},
volume = {246},
pages = {1},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2018.05.055},
doi = {10.1016/J.DAM.2018.05.055},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/LiptakS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/MhaskarS18,
author = {Neerja Mhaskar and
W. F. Smyth},
title = {Frequency Covers for Strings},
journal = {Fundam. Informaticae},
volume = {163},
number = {3},
pages = {275--289},
year = {2018},
url = {https://doi.org/10.3233/FI-2018-1744},
doi = {10.3233/FI-2018-1744},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fuin/MhaskarS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/LouzaSMT18,
author = {Felipe A. Louza and
William F. Smyth and
Giovanni Manzini and
Guilherme P. Telles},
title = {Lyndon array construction during Burrows-Wheeler inversion},
journal = {J. Discrete Algorithms},
volume = {50},
pages = {2--9},
year = {2018},
url = {https://doi.org/10.1016/j.jda.2018.08.001},
doi = {10.1016/J.JDA.2018.08.001},
timestamp = {Fri, 10 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/LouzaSMT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/MhaskarS18,
author = {Neerja Mhaskar and
William F. Smyth},
title = {String covering with optimal covers},
journal = {J. Discrete Algorithms},
volume = {51},
pages = {26--38},
year = {2018},
url = {https://doi.org/10.1016/j.jda.2018.09.003},
doi = {10.1016/J.JDA.2018.09.003},
timestamp = {Thu, 10 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/MhaskarS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BrankovicRS18,
author = {Ljiljana Brankovic and
Joe Ryan and
William F. Smyth},
title = {Editorial},
journal = {J. Discrete Algorithms},
volume = {52-53},
pages = {1},
year = {2018},
url = {https://doi.org/10.1016/j.jda.2018.11.015},
doi = {10.1016/J.JDA.2018.11.015},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/BrankovicRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DaykinFHIS18,
author = {Jacqueline W. Daykin and
Frantisek Franek and
Jan Holub and
A. S. M. Sohidull Islam and
W. F. Smyth},
title = {Reconstructing a string from its Lyndon arrays},
journal = {Theor. Comput. Sci.},
volume = {710},
pages = {44--51},
year = {2018},
url = {https://doi.org/10.1016/j.tcs.2017.04.008},
doi = {10.1016/J.TCS.2017.04.008},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DaykinFHIS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HellingRSS18,
author = {Joel Helling and
Patrick J. Ryan and
W. F. Smyth and
Michael Soltys},
title = {Constructing an indeterminate string from its associated graph},
journal = {Theor. Comput. Sci.},
volume = {710},
pages = {88--96},
year = {2018},
url = {https://doi.org/10.1016/j.tcs.2017.02.016},
doi = {10.1016/J.TCS.2017.02.016},
timestamp = {Mon, 16 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/HellingRSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stringology/AlatabbiDNRS18,
author = {Ali Alatabbi and
Jacqueline W. Daykin and
Mhaskar Neerja and
Mohammad Sohel Rahman and
William F. Smyth},
editor = {Jan Holub and
Jan Zd{\'{a}}rek},
title = {A Faster V-order String Comparison Algorithm},
booktitle = {Prague Stringology Conference 2018, Prague, Czech Republic, August
27-28, 2018},
pages = {38--48},
publisher = {Czech Technical University in Prague, Faculty of Information Technology,
Department of Theoretical Computer Science},
year = {2018},
url = {http://www.stringology.org/event/2018/p05.html},
timestamp = {Wed, 10 Feb 2021 08:42:26 +0100},
biburl = {https://dblp.org/rec/conf/stringology/AlatabbiDNRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stringology/FranekLS18,
author = {Frantisek Franek and
Michael Liut and
William F. Smyth},
editor = {Jan Holub and
Jan Zd{\'{a}}rek},
title = {On Baier's Sort of Maximal Lyndon Substrings},
booktitle = {Prague Stringology Conference 2018, Prague, Czech Republic, August
27-28, 2018},
pages = {63--78},
publisher = {Czech Technical University in Prague, Faculty of Information Technology,
Department of Theoretical Computer Science},
year = {2018},
url = {http://www.stringology.org/event/2018/p07.html},
timestamp = {Wed, 10 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stringology/FranekLS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/iwoca/2017,
editor = {Ljiljana Brankovic and
Joe Ryan and
William F. Smyth},
title = {Combinatorial Algorithms - 28th International Workshop, {IWOCA} 2017,
Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {10765},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-78825-8},
doi = {10.1007/978-3-319-78825-8},
isbn = {978-3-319-78824-1},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/2017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-10646,
author = {Amy Glen and
Jamie Simpson and
W. F. Smyth},
title = {Palindromes in starlike trees},
journal = {CoRR},
volume = {abs/1805.10646},
year = {2018},
url = {http://arxiv.org/abs/1805.10646},
eprinttype = {arXiv},
eprint = {1805.10646},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-10646.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/GlenSS17,
author = {Amy Glen and
Jamie Simpson and
W. F. Smyth},
title = {Counting Lyndon Factors},
journal = {Electron. J. Comb.},
volume = {24},
number = {3},
pages = {3},
year = {2017},
url = {https://doi.org/10.37236/6915},
doi = {10.37236/6915},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/GlenSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BealAS17,
author = {Richard Beal and
Donald A. Adjeroh and
W. F. Smyth},
title = {A prefix array for parameterized strings},
journal = {J. Discrete Algorithms},
volume = {42},
pages = {23--34},
year = {2017},
url = {https://doi.org/10.1016/j.jda.2016.11.002},
doi = {10.1016/J.JDA.2016.11.002},
timestamp = {Wed, 03 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/BealAS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stringology/FranekPS17,
author = {Frantisek Franek and
Asma Paracha and
William F. Smyth},
editor = {Jan Holub and
Jan Zd{\'{a}}rek},
title = {The Linear Equivalence of the Suffix Array and the Partially Sorted
Lyndon Array},
booktitle = {Proceedings of the Prague Stringology Conference 2017, Prague, Czech
Republic, August 28-30, 2017},
pages = {77--84},
publisher = {Department of Theoretical Computer Science, Faculty of Information
Technology, Czech Technical University in Prague},
year = {2017},
url = {http://www.stringology.org/event/2017/p08.html},
timestamp = {Wed, 10 Feb 2021 08:42:21 +0100},
biburl = {https://dblp.org/rec/conf/stringology/FranekPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GlenSS17,
author = {Amy Glen and
Jamie Simpson and
William F. Smyth},
title = {Counting Lyndon factors},
journal = {CoRR},
volume = {abs/1701.00928},
year = {2017},
url = {http://arxiv.org/abs/1701.00928},
eprinttype = {arXiv},
eprint = {1701.00928},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GlenSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1710-02782,
author = {Amy Glen and
Jamie Simpson and
W. F. Smyth},
title = {More properties of the Fibonacci word on an infinite alphabet},
journal = {CoRR},
volume = {abs/1710.02782},
year = {2017},
url = {http://arxiv.org/abs/1710.02782},
eprinttype = {arXiv},
eprint = {1710.02782},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1710-02782.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1710-10105,
author = {Felipe A. Louza and
W. F. Smyth and
Giovanni Manzini and
Guilherme P. Telles},
title = {Lyndon Array Construction during Burrows-Wheeler Inversion},
journal = {CoRR},
volume = {abs/1710.10105},
year = {2017},
url = {http://arxiv.org/abs/1710.10105},
eprinttype = {arXiv},
eprint = {1710.10105},
timestamp = {Fri, 10 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1710-10105.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-06264,
author = {Peter Burcsi and
Zsuzsanna Lipt{\'{a}}k and
W. F. Smyth},
title = {On the Parikh-de-Bruijn grid},
journal = {CoRR},
volume = {abs/1711.06264},
year = {2017},
url = {http://arxiv.org/abs/1711.06264},
eprinttype = {arXiv},
eprint = {1711.06264},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-06264.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AlatabbiRS16,
author = {Ali Alatabbi and
M. Sohel Rahman and
W. F. Smyth},
title = {Computing covers using prefix tables},
journal = {Discret. Appl. Math.},
volume = {212},
pages = {2--9},
year = {2016},
url = {https://doi.org/10.1016/j.dam.2015.05.019},
doi = {10.1016/J.DAM.2015.05.019},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AlatabbiRS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BaiFS16,
author = {Haoyue Bai and
Frantisek Franek and
William F. Smyth},
title = {The New Periodicity Lemma revisited},
journal = {Discret. Appl. Math.},
volume = {212},
pages = {30--36},
year = {2016},
url = {https://doi.org/10.1016/j.dam.2016.05.003},
doi = {10.1016/J.DAM.2016.05.003},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BaiFS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FiciLLPS16,
author = {Gabriele Fici and
Thierry Lecroq and
Arnaud Lefebvre and
{\'{E}}lise Prieur{-}Gaston and
William F. Smyth},
title = {A note on easy and efficient computation of full abelian periods of
a word},
journal = {Discret. Appl. Math.},
volume = {212},
pages = {88--95},
year = {2016},
url = {https://doi.org/10.1016/j.dam.2015.09.024},
doi = {10.1016/J.DAM.2015.09.024},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FiciLLPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AlatabbiDKRS16,
author = {Ali Alatabbi and
Jacqueline W. Daykin and
Juha K{\"{a}}rkk{\"{a}}inen and
M. Sohel Rahman and
W. F. Smyth},
title = {V-Order: New combinatorial properties {\&} a simple comparison
algorithm},
journal = {Discret. Appl. Math.},
volume = {215},
pages = {41--46},
year = {2016},
url = {https://doi.org/10.1016/j.dam.2016.07.006},
doi = {10.1016/J.DAM.2016.07.006},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AlatabbiDKRS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jalc/AlatabbiIRSS16,
author = {Ali Alatabbi and
Abu Sayed Md. Sohidull Islam and
Mohammad Sohel Rahman and
Jamie Simpson and
W. F. Smyth},
title = {Enhanced Covers of Regular and Indeterminate Strings Using Prefix
Tables},
journal = {J. Autom. Lang. Comb.},
volume = {21},
number = {3},
pages = {131--147},
year = {2016},
url = {https://doi.org/10.25596/jalc-2016-131},
doi = {10.25596/JALC-2016-131},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jalc/AlatabbiIRSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stringology/FranekIRS16,
author = {Frantisek Franek and
A. S. M. Sohidull Islam and
Mohammad Sohel Rahman and
William F. Smyth},
editor = {Jan Holub and
Jan Zd{\'{a}}rek},
title = {Algorithms to Compute the Lyndon Array},
booktitle = {Proceedings of the Prague Stringology Conference 2016, Prague, Czech
Republic, August 29-31, 2016},
pages = {172--184},
publisher = {Department of Theoretical Computer Science, Faculty of Information
Technology, Czech Technical University in Prague},
year = {2016},
url = {http://www.stringology.org/event/2016/p15.html},
timestamp = {Wed, 10 Feb 2021 08:42:25 +0100},
biburl = {https://dblp.org/rec/conf/stringology/FranekIRS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/iwoca/2015,
editor = {Zsuzsanna Lipt{\'{a}}k and
William F. Smyth},
title = {Combinatorial Algorithms - 26th International Workshop, {IWOCA} 2015,
Verona, Italy, October 5-7, 2015, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {9538},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-29516-9},
doi = {10.1007/978-3-319-29516-9},
isbn = {978-3-319-29515-2},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/2015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FranekIRS16,
author = {Frantisek Franek and
A. S. M. Sohidull Islam and
M. Sohel Rahman and
William F. Smyth},
title = {Algorithms to Compute the Lyndon Array},
journal = {CoRR},
volume = {abs/1605.08935},
year = {2016},
url = {http://arxiv.org/abs/1605.08935},
eprinttype = {arXiv},
eprint = {1605.08935},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FranekIRS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/LiptakS15,
author = {Zsuzsanna Lipt{\'{a}}k and
Bill Smyth},
title = {{IWOCA} 2015 in Verona, Italy},
journal = {Bull. {EATCS}},
volume = {115},
year = {2015},
url = {http://eatcs.org/beatcs/index.php/beatcs/article/view/319},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eatcs/LiptakS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/AlatabbiDRS15,
author = {Ali Alatabbi and
Jacqueline W. Daykin and
Mohammad Sohel Rahman and
William F. Smyth},
title = {Simple Linear Comparison of Strings in V-order},
journal = {Fundam. Informaticae},
volume = {139},
number = {2},
pages = {115--126},
year = {2015},
url = {https://doi.org/10.3233/FI-2015-1228},
doi = {10.3233/FI-2015-1228},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/fuin/AlatabbiDRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Smyth15,
author = {Bill Smyth},
title = {Perspectives: Journal of Discrete Algorithms Special StringMasters
Issue {(2015)}},
journal = {J. Discrete Algorithms},
volume = {32},
pages = {3--5},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.01.002},
doi = {10.1016/J.JDA.2015.01.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Smyth15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/AlatabbiRS15,
author = {Ali Alatabbi and
M. Sohel Rahman and
William F. Smyth},
title = {Inferring an indeterminate string from a prefix graph},
journal = {J. Discrete Algorithms},
volume = {32},
pages = {6--13},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2014.12.006},
doi = {10.1016/J.JDA.2014.12.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/AlatabbiRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BharatiS15,
author = {R. Bharati and
W. F. Smyth},
title = {Editorial},
journal = {J. Discrete Algorithms},
volume = {33},
pages = {1},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.02.001},
doi = {10.1016/J.JDA.2015.02.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BharatiS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BlandS15,
author = {Widmer Bland and
William F. Smyth},
title = {Three overlapping squares: The general case characterized {\&}
applications},
journal = {Theor. Comput. Sci.},
volume = {596},
pages = {23--40},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.06.037},
doi = {10.1016/J.TCS.2015.06.037},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BlandS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Christodoulakis15,
author = {Manolis Christodoulakis and
Patrick J. Ryan and
William F. Smyth and
Shu Wang},
title = {Indeterminate strings, prefix arrays {\&} undirected graphs},
journal = {Theor. Comput. Sci.},
volume = {600},
pages = {34--48},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.06.056},
doi = {10.1016/J.TCS.2015.06.056},
timestamp = {Mon, 16 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/Christodoulakis15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AlatabbiRS15,
author = {Ali Alatabbi and
Mohammad Sohel Rahman and
William F. Smyth},
title = {Inferring an Indeterminate String from a Prefix Graph},
journal = {CoRR},
volume = {abs/1502.07870},
year = {2015},
url = {http://arxiv.org/abs/1502.07870},
eprinttype = {arXiv},
eprint = {1502.07870},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AlatabbiRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AlatabbiIRSS15,
author = {Ali Alatabbi and
A. S. M. Sohidull Islam and
Mohammad Sohel Rahman and
Jamie Simpson and
William F. Smyth},
title = {Enhanced Covers of Regular {\&} Indeterminate Strings using Prefix
Tables},
journal = {CoRR},
volume = {abs/1506.06793},
year = {2015},
url = {http://arxiv.org/abs/1506.06793},
eprinttype = {arXiv},
eprint = {1506.06793},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AlatabbiIRSS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AlatabbiDRS15,
author = {Ali Alatabbi and
Jacqueline W. Daykin and
Mohammad Sohel Rahman and
William F. Smyth},
title = {String Comparison in V-Order: New Lexicographic Properties {\&}
On-line Applications},
journal = {CoRR},
volume = {abs/1507.07038},
year = {2015},
url = {http://arxiv.org/abs/1507.07038},
eprinttype = {arXiv},
eprint = {1507.07038},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AlatabbiDRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FiciLLPS15,
author = {Gabriele Fici and
Thierry Lecroq and
Arnaud Lefebvre and
{\'{E}}lise Prieur{-}Gaston and
William F. Smyth},
title = {A Note on Easy and Efficient Computation of Full Abelian Periods of
a Word},
journal = {CoRR},
volume = {abs/1510.00634},
year = {2015},
url = {http://arxiv.org/abs/1510.00634},
eprinttype = {arXiv},
eprint = {1510.00634},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FiciLLPS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DaykinS14,
author = {Jacqueline W. Daykin and
William F. Smyth},
title = {A bijective variant of the Burrows-Wheeler Transform using V-order},
journal = {Theor. Comput. Sci.},
volume = {531},
pages = {77--89},
year = {2014},
url = {https://doi.org/10.1016/j.tcs.2014.03.014},
doi = {10.1016/J.TCS.2014.03.014},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/DaykinS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/BartonIPS14,
author = {Carl Barton and
Costas S. Iliopoulos and
Solon P. Pissis and
William F. Smyth},
editor = {Jan Kratochv{\'{\i}}l and
Mirka Miller and
Dalibor Froncek},
title = {Fast and Simple Computations Using Prefix Tables Under Hamming and
Edit Distance},
booktitle = {Combinatorial Algorithms - 25th International Workshop, {IWOCA} 2014,
Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8986},
pages = {49--61},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-19315-1\_5},
doi = {10.1007/978-3-319-19315-1\_5},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/BartonIPS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stringology/BaiFS14,
author = {Haoyue Bai and
Frantisek Franek and
William F. Smyth},
editor = {Jan Holub and
Jan Zd{\'{a}}rek},
title = {Two Squares Canonical Factorization},
booktitle = {Proceedings of the Prague Stringology Conference 2014, Prague, Czech
Republic, September 1-3, 2014},
pages = {52--58},
publisher = {Department of Theoretical Computer Science, Faculty of Information
Technology, Czech Technical University in Prague},
year = {2014},
url = {http://www.stringology.org/event/2014/p06.html},
timestamp = {Wed, 10 Feb 2021 08:42:22 +0100},
biburl = {https://dblp.org/rec/conf/stringology/BaiFS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/AlatabbiDRS14,
author = {Ali Alatabbi and
Jacqueline W. Daykin and
M. Sohel Rahman and
William F. Smyth},
editor = {Sudebkumar Prasant Pal and
Kunihiko Sadakane},
title = {Simple Linear Comparison of Strings in V-Order - (Extended Abstract)},
booktitle = {Algorithms and Computation - 8th International Workshop, {WALCOM}
2014, Chennai, India, February 13-15, 2014, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8344},
pages = {80--89},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-04657-0\_10},
doi = {10.1007/978-3-319-04657-0\_10},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/AlatabbiDRS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChristodoulakisRSW14,
author = {Manolis Christodoulakis and
Patrick J. Ryan and
W. F. Smyth and
Shu Wang},
title = {Indeterminate Strings, Prefix Arrays {\&} Undirected Graphs},
journal = {CoRR},
volume = {abs/1406.3289},
year = {2014},
url = {http://arxiv.org/abs/1406.3289},
eprinttype = {arXiv},
eprint = {1406.3289},
timestamp = {Mon, 16 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChristodoulakisRSW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AlatabbiRS14,
author = {Ali Alatabbi and
Mohammad Sohel Rahman and
William F. Smyth},
title = {Computing Covers Using Prefix Tables},
journal = {CoRR},
volume = {abs/1412.3016},
year = {2014},
url = {http://arxiv.org/abs/1412.3016},
eprinttype = {arXiv},
eprint = {1412.3016},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AlatabbiRS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bmcbi/IlieMGS13,
author = {Lucian Ilie and
Hamid Mohamadi and
Geoffrey Brian Golding and
William F. Smyth},
title = {{BOND:} Basic OligoNucleotide Design},
journal = {{BMC} Bioinform.},
volume = {14},
pages = {69},
year = {2013},
url = {https://doi.org/10.1186/1471-2105-14-69},
doi = {10.1186/1471-2105-14-69},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bmcbi/IlieMGS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/Smyth13,
author = {W. F. Smyth},
title = {Computing regularities in strings: {A} survey},
journal = {Eur. J. Comb.},
volume = {34},
number = {1},
pages = {3--14},
year = {2013},
url = {https://doi.org/10.1016/j.ejc.2012.07.010},
doi = {10.1016/J.EJC.2012.07.010},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/Smyth13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ArumugamS13,
author = {S. Arumugam and
William F. Smyth},
title = {Editorial},
journal = {J. Discrete Algorithms},
volume = {23},
pages = {1},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2013.10.001},
doi = {10.1016/J.JDA.2013.10.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ArumugamS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DaykinDS13,
author = {David E. Daykin and
Jacqueline W. Daykin and
W. F. Smyth},
title = {A linear partitioning algorithm for Hybrid Lyndons using \emph{V}V-order},
journal = {Theor. Comput. Sci.},
volume = {483},
pages = {149--161},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2012.02.001},
doi = {10.1016/J.TCS.2012.02.001},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DaykinDS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FlouriIKPPST13,
author = {Tom{\'{a}}s Flouri and
Costas S. Iliopoulos and
Tomasz Kociumaka and
Solon P. Pissis and
Simon J. Puglisi and
W. F. Smyth and
Wojciech Tyczynski},
title = {Enhanced string covering},
journal = {Theor. Comput. Sci.},
volume = {506},
pages = {102--114},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2013.08.013},
doi = {10.1016/J.TCS.2013.08.013},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/FlouriIKPPST13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/DaykinDIS13,
author = {David E. Daykin and
Jacqueline W. Daykin and
Costas S. Iliopoulos and
W. F. Smyth},
editor = {Harout K. Aydinian and
Ferdinando Cicalese and
Christian Deppe},
title = {Generic Algorithms for Factoring Strings},
booktitle = {Information Theory, Combinatorics, and Search Theory - In Memory of
Rudolf Ahlswede},
series = {Lecture Notes in Computer Science},
volume = {7777},
pages = {402--418},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-36899-8\_18},
doi = {10.1007/978-3-642-36899-8\_18},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/birthday/DaykinDIS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/BlandKS13,
author = {Widmer Bland and
Gregory Kucherov and
W. F. Smyth},
editor = {Thierry Lecroq and
Laurent Mouchard},
title = {Prefix Table Construction and Conversion},
booktitle = {Combinatorial Algorithms - 24th International Workshop, {IWOCA} 2013,
Rouen, France, July 10-12, 2013, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8288},
pages = {41--53},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45278-9\_5},
doi = {10.1007/978-3-642-45278-9\_5},
timestamp = {Wed, 25 Sep 2019 18:08:04 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/BlandKS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/csur/Al-HafeedhCIKSTY12,
author = {Anisa Al{-}Hafeedh and
Maxime Crochemore and
Lucian Ilie and
Evguenia Kopylova and
William F. Smyth and
German Tischler and
Munina Yusufu},
title = {A comparison of index-based lempel-Ziv {LZ77} factorization algorithms},
journal = {{ACM} Comput. Surv.},
volume = {45},
number = {1},
pages = {5:1--5:17},
year = {2012},
url = {https://doi.org/10.1145/2379776.2379781},
doi = {10.1145/2379776.2379781},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/csur/Al-HafeedhCIKSTY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/Smyth12,
author = {Bill Smyth},
title = {Report from {IWOCA} 2012},
journal = {Bull. {EATCS}},
volume = {108},
pages = {163--167},
year = {2012},
url = {http://eatcs.org/beatcs/index.php/beatcs/article/view/56},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eatcs/Smyth12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DaykinSZ12,
author = {Jacqueline W. Daykin and
Bill Smyth and
Lynette van Zijl},
title = {Editorial},
journal = {J. Discrete Algorithms},
volume = {10},
pages = {1},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.08.004},
doi = {10.1016/J.JDA.2011.08.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/DaykinSZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KopylovaS12,
author = {Evguenia Kopylova and
William F. Smyth},
title = {The three squares lemma revisited},
journal = {J. Discrete Algorithms},
volume = {11},
pages = {3--14},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.03.009},
doi = {10.1016/J.JDA.2011.03.009},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/KopylovaS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/IliopoulosS12,
author = {Costas S. Iliopoulos and
William F. Smyth},
title = {Editorial},
journal = {J. Discrete Algorithms},
volume = {14},
pages = {1},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.03.005},
doi = {10.1016/J.JDA.2012.03.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/IliopoulosS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/IliopoulosS12a,
author = {Costas S. Iliopoulos and
William F. Smyth},
title = {Editorial},
journal = {J. Discrete Algorithms},
volume = {16},
pages = {1},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.07.002},
doi = {10.1016/J.JDA.2012.07.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/IliopoulosS12a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/FranekFSS12,
author = {Frantisek Franek and
Robert C. G. Fuller and
Jamie Simpson and
William F. Smyth},
title = {More results on overlapping squares},
journal = {J. Discrete Algorithms},
volume = {17},
pages = {2--8},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.03.003},
doi = {10.1016/J.JDA.2012.03.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/FranekFSS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stringology/FlouriIKPPST12,
author = {Tom{\'{a}}s Flouri and
Costas S. Iliopoulos and
Tomasz Kociumaka and
Solon P. Pissis and
Simon J. Puglisi and
William F. Smyth and
Wojciech Tyczynski},
editor = {Jan Holub and
Jan Zd{\'{a}}rek},
title = {New and Efficient Approaches to the Quasiperiodic Characterisation
of a String},
booktitle = {Proceedings of the Prague Stringology Conference 2012, Prague, Czech
Republic, August 27-28, 2012},
pages = {75--88},
publisher = {Department of Theoretical Computer Science, Faculty of Information
Technology, Czech Technical University in Prague},
year = {2012},
url = {http://www.stringology.org/event/2012/p08.html},
timestamp = {Wed, 10 Feb 2021 08:42:20 +0100},
biburl = {https://dblp.org/rec/conf/stringology/FlouriIKPPST12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stringology/FiciLLPS12,
author = {Gabriele Fici and
Thierry Lecroq and
Arnaud Lefebvre and
{\'{E}}lise Prieur{-}Gaston and
William F. Smyth},
editor = {Jan Holub and
Jan Zd{\'{a}}rek},
title = {Quasi-linear Time Computation of the Abelian Periods of a Word},
booktitle = {Proceedings of the Prague Stringology Conference 2012, Prague, Czech
Republic, August 27-28, 2012},
pages = {103--110},
publisher = {Department of Theoretical Computer Science, Faculty of Information
Technology, Czech Technical University in Prague},
year = {2012},
url = {http://www.stringology.org/event/2012/p10.html},
timestamp = {Wed, 10 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stringology/FiciLLPS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/iwoca/2012,
editor = {S. Arumugam and
W. F. Smyth},
title = {Combinatorial Algorithms, 23rd International Workshop, {IWOCA} 2012,
Tamil Nadu, India, July 19-21, 2012, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7643},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-35926-2},
doi = {10.1007/978-3-642-35926-2},
isbn = {978-3-642-35925-5},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/2012.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/IlieS11,
author = {Lucian Ilie and
William F. Smyth},
title = {Minimum Unique Substrings and Maximum Repeats},
journal = {Fundam. Informaticae},
volume = {110},
number = {1-4},
pages = {183--195},
year = {2011},
url = {https://doi.org/10.3233/FI-2011-536},
doi = {10.3233/FI-2011-536},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fuin/IlieS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/isci/IliopoulosMS11,
author = {Costas S. Iliopoulos and
Manal Mohamed and
William F. Smyth},
title = {New complexity results for the k-covers problem},
journal = {Inf. Sci.},
volume = {181},
number = {12},
pages = {2571--2575},
year = {2011},
url = {https://doi.org/10.1016/j.ins.2011.02.009},
doi = {10.1016/J.INS.2011.02.009},
timestamp = {Tue, 29 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/isci/IliopoulosMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/DaykinDS11,
author = {David E. Daykin and
Jacqueline W. Daykin and
William F. Smyth},
editor = {Raffaele Giancarlo and
Giovanni Manzini},
title = {String Comparison and Lyndon-Like Factorization Using V-Order in Linear
Time},
booktitle = {Combinatorial Pattern Matching - 22nd Annual Symposium, {CPM} 2011,
Palermo, Italy, June 27-29, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6661},
pages = {65--76},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-21458-5\_8},
doi = {10.1007/978-3-642-21458-5\_8},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/DaykinDS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/iwoca/2010,
editor = {Costas S. Iliopoulos and
William F. Smyth},
title = {Combinatorial Algorithms - 21st International Workshop, {IWOCA} 2010,
London, UK, July 26-28, 2010, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {6460},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-19222-7},
doi = {10.1007/978-3-642-19222-7},
isbn = {978-3-642-19221-0},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/2010.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/iwoca/2011,
editor = {Costas S. Iliopoulos and
William F. Smyth},
title = {Combinatorial Algorithms - 22nd International Workshop, {IWOCA} 2011,
Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7056},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25011-8},
doi = {10.1007/978-3-642-25011-8},
isbn = {978-3-642-25010-1},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/2011.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mics/PuglisiSY10,
author = {Simon J. Puglisi and
William F. Smyth and
Munina Yusufu},
title = {Fast, Practical Algorithms for Computing All the Repeats in a String},
journal = {Math. Comput. Sci.},
volume = {3},
number = {4},
pages = {373--389},
year = {2010},
url = {https://doi.org/10.1007/s11786-010-0033-6},
doi = {10.1007/S11786-010-0033-6},
timestamp = {Wed, 12 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mics/PuglisiSY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aina/RidzuanPTS10,
author = {Farida Ridzuan and
Vidyasagar M. Potdar and
Alex Talevski and
William F. Smyth},
title = {Key Parameters in Identifying Cost of Spam 2.0},
booktitle = {24th {IEEE} International Conference on Advanced Information Networking
and Applications, {AINA} 2010, Perth, Australia, 20-13 April 2010},
pages = {789--796},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/AINA.2010.163},
doi = {10.1109/AINA.2010.163},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/aina/RidzuanPTS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/DaykinDS09,
author = {David E. Daykin and
Jacqueline W. Daykin and
William F. Smyth},
title = {Combinatorics of Unique Maximal Factorization Families (UMFFs)},
journal = {Fundam. Informaticae},
volume = {97},
number = {3},
pages = {295--309},
year = {2009},
url = {https://doi.org/10.3233/FI-2009-202},
doi = {10.3233/FI-2009-202},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/fuin/DaykinDS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/IliopoulosSY09,
author = {Costas S. Iliopoulos and
William F. Smyth and
Munina Yusufu},
title = {Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences},
journal = {Fundam. Informaticae},
volume = {97},
number = {3},
pages = {311--320},
year = {2009},
url = {https://doi.org/10.3233/FI-2009-203},
doi = {10.3233/FI-2009-203},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fuin/IliopoulosSY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/SmythW09,
author = {William F. Smyth and
Shu Wang},
title = {An Adaptive Hybrid Pattern-Matching Algorithm on Indeterminate Strings},
journal = {Int. J. Found. Comput. Sci.},
volume = {20},
number = {6},
pages = {985--1004},
year = {2009},
url = {https://doi.org/10.1142/S0129054109007005},
doi = {10.1142/S0129054109007005},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/SmythW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SmythW09,
author = {William F. Smyth and
Shu Wang},
title = {A new approach to the periodicity lemma on strings with holes},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {43},
pages = {4295--4302},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.010},
doi = {10.1016/J.TCS.2009.07.010},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/SmythW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/ChristodoulakisIRS08,
author = {Manolis Christodoulakis and
Costas S. Iliopoulos and
Mohammad Sohel Rahman and
William F. Smyth},
title = {Identifying Rhythms in Musical Texts},
journal = {Int. J. Found. Comput. Sci.},
volume = {19},
number = {1},
pages = {37--51},
year = {2008},
url = {https://doi.org/10.1142/S0129054108005528},
doi = {10.1142/S0129054108005528},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/ChristodoulakisIRS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/HolubSW08,
author = {Jan Holub and
William F. Smyth and
Shu Wang},
title = {Fast pattern-matching on indeterminate strings},
journal = {J. Discrete Algorithms},
volume = {6},
number = {1},
pages = {37--50},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2006.10.003},
doi = {10.1016/J.JDA.2006.10.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/HolubSW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mics/ChenPS08,
author = {Gang Chen and
Simon J. Puglisi and
William F. Smyth},
title = {Lempel-Ziv Factorization Using Less Time {\&} Space},
journal = {Math. Comput. Sci.},
volume = {1},
number = {4},
pages = {605--623},
year = {2008},
url = {https://doi.org/10.1007/s11786-007-0024-4},
doi = {10.1007/S11786-007-0024-4},
timestamp = {Wed, 12 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mics/ChenPS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/PuglisiSS08,
author = {Simon J. Puglisi and
Jamie Simpson and
William F. Smyth},
title = {How many runs can a string contain?},
journal = {Theor. Comput. Sci.},
volume = {401},
number = {1-3},
pages = {165--171},
year = {2008},
url = {https://doi.org/10.1016/j.tcs.2008.04.020},
doi = {10.1016/J.TCS.2008.04.020},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/PuglisiSS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcc/CrochemoreIS08,
author = {Maxime Crochemore and
Lucian Ilie and
William F. Smyth},
title = {A Simple Algorithm for Computing the Lempel Ziv Factorization},
booktitle = {2008 Data Compression Conference {(DCC} 2008), 25-27 March 2008, Snowbird,
UT, {USA}},
pages = {482--488},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/DCC.2008.36},
doi = {10.1109/DCC.2008.36},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dcc/CrochemoreIS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/SmythW08,
author = {William F. Smyth and
Shu Wang},
editor = {Amihood Amir and
Andrew Turpin and
Alistair Moffat},
title = {New Perspectives on the Prefix Array},
booktitle = {String Processing and Information Retrieval, 15th International Symposium,
{SPIRE} 2008, Melbourne, Australia, November 10-12, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5280},
pages = {133--143},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-89097-3\_14},
doi = {10.1007/978-3-540-89097-3\_14},
timestamp = {Tue, 14 May 2019 10:00:55 +0200},
biburl = {https://dblp.org/rec/conf/spire/SmythW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stringology/SmythWY08,
author = {William F. Smyth and
Shu Wang and
Mao Yu},
editor = {Jan Holub and
Jan Zd{\'{a}}rek},
title = {An Adaptive Hybrid Pattern-Matching Algorithm on Indeterminate Strings},
booktitle = {Proceedings of the Prague Stringology Conference 2008, Prague, Czech
Republic, September 1-3, 2008},
pages = {95--107},
publisher = {Prague Stringology Club, Department of Computer Science and Engineering,
Faculty of Electrical Engineering, Czech Technical University in Prague},
year = {2008},
url = {http://www.stringology.org/event/2008/p09.html},
timestamp = {Wed, 10 Feb 2021 08:42:20 +0100},
biburl = {https://dblp.org/rec/conf/stringology/SmythWY08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stringology/PuglisiSY08,
author = {Simon J. Puglisi and
William F. Smyth and
Munina Yusufu},
editor = {Jan Holub and
Jan Zd{\'{a}}rek},
title = {Fast Optimal Algorithms for Computing All the Repeats in a String},
booktitle = {Proceedings of the Prague Stringology Conference 2008, Prague, Czech
Republic, September 1-3, 2008},
pages = {161--169},
publisher = {Prague Stringology Club, Department of Computer Science and Engineering,
Faculty of Electrical Engineering, Czech Technical University in Prague},
year = {2008},
url = {http://www.stringology.org/event/2008/p15.html},
timestamp = {Wed, 10 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stringology/PuglisiSY08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/csur/PuglisiST07,
author = {Simon J. Puglisi and
William F. Smyth and
Andrew Turpin},
title = {A taxonomy of suffix array construction algorithms},
journal = {{ACM} Comput. Surv.},
volume = {39},
number = {2},
pages = {4},
year = {2007},
url = {https://doi.org/10.1145/1242471.1242472},
doi = {10.1145/1242471.1242472},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/csur/PuglisiST07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcb/ChristodoulakisGIAS07,
author = {Manolis Christodoulakis and
Geoffrey Brian Golding and
Costas S. Iliopoulos and
Yoan Jos{\'{e}} Pinz{\'{o}}n Ardila and
William F. Smyth},
title = {Efficient Algorithms for Counting and Reporting Segregating Sites
in Genomic Sequences},
journal = {J. Comput. Biol.},
volume = {14},
number = {7},
pages = {1001--1010},
year = {2007},
url = {https://doi.org/10.1089/cmb.2006.0136},
doi = {10.1089/CMB.2006.0136},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcb/ChristodoulakisGIAS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/FranekJS07,
author = {Frantisek Franek and
Christopher G. Jennings and
William F. Smyth},
title = {A simple fast hybrid pattern-matching algorithm},
journal = {J. Discrete Algorithms},
volume = {5},
number = {4},
pages = {682--695},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.11.004},
doi = {10.1016/J.JDA.2006.11.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/FranekJS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/FranekJS07a,
author = {Frantisek Franek and
Jiandong Jiang and
William F. Smyth},
title = {Two-pattern strings {II} - frequency of occurrence and substring complexity},
journal = {J. Discrete Algorithms},
volume = {5},
number = {4},
pages = {739--748},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.04.002},
doi = {10.1016/J.JDA.2006.04.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/FranekJS07a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/ChenPS07,
author = {Gang Chen and
Simon J. Puglisi and
William F. Smyth},
editor = {Bin Ma and
Kaizhong Zhang},
title = {Fast and Practical Algorithms for Computing All the Runs in a String},
booktitle = {Combinatorial Pattern Matching, 18th Annual Symposium, {CPM} 2007,
London, Canada, July 9-11, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4580},
pages = {307--315},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73437-6\_31},
doi = {10.1007/978-3-540-73437-6\_31},
timestamp = {Mon, 13 Mar 2023 16:58:28 +0100},
biburl = {https://dblp.org/rec/conf/cpm/ChenPS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigsoft/BasitPSTJ07,
author = {Hamid Abdul Basit and
Simon J. Puglisi and
William F. Smyth and
Andrew Turpin and
Stan Jarzabek},
editor = {Ivica Crnkovic and
Antonia Bertolino},
title = {Efficient token based clone detection with flexible tokenization},
booktitle = {Proceedings of the 6th joint meeting of the European Software Engineering
Conference and the {ACM} {SIGSOFT} International Symposium on Foundations
of Software Engineering, 2007, Dubrovnik, Croatia, September 3-7,
2007},
pages = {513--516},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1295014.1295029},
doi = {10.1145/1295014.1295029},
timestamp = {Tue, 01 Feb 2022 10:45:16 +0100},
biburl = {https://dblp.org/rec/conf/sigsoft/BasitPSTJ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/FranekS06,
author = {Frantisek Franek and
William F. Smyth},
title = {Reconstructing a Suffix Array},
journal = {Int. J. Found. Comput. Sci.},
volume = {17},
number = {6},
pages = {1281--1296},
year = {2006},
url = {https://doi.org/10.1142/S0129054106004418},
doi = {10.1142/S0129054106004418},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/FranekS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FanPST06,
author = {Kangmin Fan and
Simon J. Puglisi and
William F. Smyth and
Andrew Turpin},
title = {A New Periodicity Lemma},
journal = {{SIAM} J. Discret. Math.},
volume = {20},
number = {3},
pages = {656--668},
year = {2006},
url = {https://doi.org/10.1137/050630180},
doi = {10.1137/050630180},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/FanPST06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/adc/PuglisiST06,
author = {Simon J. Puglisi and
William F. Smyth and
Andrew Turpin},
editor = {Gillian Dobbie and
James Bailey},
title = {Suffix arrays: what are they good for?},
booktitle = {Database Technologies 2006, Proceedings of the 17th Australasian Database
Conference, {ADC} 2006, Hobart, Tasmania, Australia, January 16-19
2006},
series = {{CRPIT}},
volume = {49},
pages = {17--18},
publisher = {Australian Computer Society},
year = {2006},
url = {https://dl.acm.org/citation.cfm?id=1151738},
timestamp = {Tue, 16 Apr 2019 17:19:28 +0200},
biburl = {https://dblp.org/rec/conf/adc/PuglisiST06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/RahmanILMS06,
author = {M. Sohel Rahman and
Costas S. Iliopoulos and
Inbok Lee and
Manal Mohamed and
William F. Smyth},
editor = {Danny Z. Chen and
D. T. Lee},
title = {Finding Patterns with Variable Length Gaps or Don't Cares},
booktitle = {Computing and Combinatorics, 12th Annual International Conference,
{COCOON} 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4112},
pages = {146--155},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11809678\_17},
doi = {10.1007/11809678\_17},
timestamp = {Tue, 29 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/RahmanILMS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/PuglisiST06,
author = {Simon J. Puglisi and
William F. Smyth and
Andrew Turpin},
editor = {Fabio Crestani and
Paolo Ferragina and
Mark Sanderson},
title = {Inverted Files Versus Suffix Arrays for Locating Patterns in Primary
Memory},
booktitle = {String Processing and Information Retrieval, 13th International Conference,
{SPIRE} 2006, Glasgow, UK, October 11-13, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4209},
pages = {122--133},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11880561\_11},
doi = {10.1007/11880561\_11},
timestamp = {Tue, 14 May 2019 10:00:55 +0200},
biburl = {https://dblp.org/rec/conf/spire/PuglisiST06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stringology/ChristodoulakisIRS06,
author = {Manolis Christodoulakis and
Costas S. Iliopoulos and
Mohammad Sohel Rahman and
William F. Smyth},
editor = {Jan Holub and
Jan Zd{\'{a}}rek},
title = {Song classifications for dancing},
booktitle = {Proceedings of the Prague Stringology Conference, Prague, Czech Republic,
August 28-30, 2006},
pages = {41--48},
publisher = {Department of Computer Science and Engineering, Faculty of Electrical
Engineering, Czech Technical University},
year = {2006},
url = {http://www.stringology.org/event/2006/p06.html},
timestamp = {Wed, 10 Feb 2021 08:42:24 +0100},
biburl = {https://dblp.org/rec/conf/stringology/ChristodoulakisIRS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/FranekS05,
author = {Frantisek Franek and
William F. Smyth},
title = {Sorting suffixes of two-pattern strings},
journal = {Int. J. Found. Comput. Sci.},
volume = {16},
number = {6},
pages = {1135--1144},
year = {2005},
url = {https://doi.org/10.1142/S0129054105003704},
doi = {10.1142/S0129054105003704},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/FranekS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jalc/ColeIMSY05,
author = {Richard Cole and
Costas S. Iliopoulos and
Manal Mohamed and
William F. Smyth and
Lu Yang},
title = {The Complexity of the Minimum k-Cover Problem},
journal = {J. Autom. Lang. Comb.},
volume = {10},
number = {5/6},
pages = {641--653},
year = {2005},
url = {https://doi.org/10.25596/jalc-2005-641},
doi = {10.25596/JALC-2005-641},
timestamp = {Tue, 29 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jalc/ColeIMSY05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/FanSS05,
author = {Kangmin Fan and
William F. Smyth and
R. J. Simpson},
editor = {Alberto Apostolico and
Maxime Crochemore and
Kunsoo Park},
title = {A New Periodicity Lemma},
booktitle = {Combinatorial Pattern Matching, 16th Annual Symposium, {CPM} 2005,
Jeju Island, Korea, June 19-22, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3537},
pages = {257--265},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11496656\_22},
doi = {10.1007/11496656\_22},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/cpm/FanSS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/FranekJS05,
author = {Frantisek Franek and
Christopher G. Jennings and
William F. Smyth},
editor = {Alberto Apostolico and
Maxime Crochemore and
Kunsoo Park},
title = {A Simple Fast Hybrid Pattern-Matching Algorithm},
booktitle = {Combinatorial Pattern Matching, 16th Annual Symposium, {CPM} 2005,
Jeju Island, Korea, June 19-22, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3537},
pages = {288--297},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11496656\_25},
doi = {10.1007/11496656\_25},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/FranekJS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcc/PuglisiST05,
author = {Simon J. Puglisi and
William F. Smyth and
Andrew Turpin},
title = {The Performance of Linear Time Suffix Sorting Algorithms},
booktitle = {2005 Data Compression Conference {(DCC} 2005), 29-31 March 2005, Snowbird,
UT, {USA}},
pages = {358--367},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/DCC.2005.87},
doi = {10.1109/DCC.2005.87},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dcc/PuglisiST05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stringology/PuglisiST05,
author = {Simon J. Puglisi and
William F. Smyth and
Andrew Turpin},
editor = {Jan Holub and
Milan Sim{\'{a}}nek},
title = {A taxonomy of suffix array construction algorithms},
booktitle = {Proceedings of the Prague Stringology Conference, Prague, Czech Republic,
August 29-31, 2005},
pages = {1--30},
publisher = {Department of Computer Science and Engineering, Faculty of Electrical
Engineering, Czech Technical University},
year = {2005},
url = {http://www.stringology.org/event/2005/p1.html},
timestamp = {Wed, 10 Feb 2021 08:42:20 +0100},
biburl = {https://dblp.org/rec/conf/stringology/PuglisiST05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stringology/FranekS05,
author = {Frantisek Franek and
William F. Smyth},
editor = {Jan Holub and
Milan Sim{\'{a}}nek},
title = {Reconstructing a suffix array},
booktitle = {Proceedings of the Prague Stringology Conference, Prague, Czech Republic,
August 29-31, 2005},
pages = {54--68},
publisher = {Department of Computer Science and Engineering, Faculty of Electrical
Engineering, Czech Technical University},
year = {2005},
url = {http://www.stringology.org/event/2005/p4.html},
timestamp = {Wed, 10 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stringology/FranekS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stringology/FranekS04,
author = {Frantisek Franek and
William F. Smyth},
editor = {Milan Sim{\'{a}}nek and
Jan Holub},
title = {Sorting suffixes of two-pattern strings},
booktitle = {Proceedings of the Prague Stringology Conference 2004, Prague, Czech
Republic, August 30 - September 1, 2004},
pages = {69--78},
publisher = {Department of Computer Science and Engineering, Faculty of Electrical
Engineering, Czech Technical University},
year = {2004},
url = {http://www.stringology.org/event/2004/p6.html},
timestamp = {Wed, 10 Feb 2021 08:42:22 +0100},
biburl = {https://dblp.org/rec/conf/stringology/FranekS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jalc/FranekST03,
author = {Frantisek Franek and
William F. Smyth and
Yudong Tang},
title = {Computing all Repeats Using Suffix Arrays},
journal = {J. Autom. Lang. Comb.},
volume = {8},
number = {4},
pages = {579--591},
year = {2003},
url = {https://doi.org/10.25596/jalc-2003-579},
doi = {10.25596/JALC-2003-579},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jalc/FranekST03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jalc/FranekHSX03,
author = {Frantisek Franek and
Jan Holub and
William F. Smyth and
Xiangdong Xiao},
title = {Computing Quasi Suffix Arrays},
journal = {J. Autom. Lang. Comb.},
volume = {8},
number = {4},
pages = {593--606},
year = {2003},
url = {https://doi.org/10.25596/jalc-2003-593},
doi = {10.25596/JALC-2003-593},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jalc/FranekHSX03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/FranekLS03,
author = {Frantisek Franek and
Weilin Lu and
William F. Smyth},
title = {Two-pattern strings {I} - {A} recognition algorithm},
journal = {J. Discrete Algorithms},
volume = {1},
number = {5-6},
pages = {445--460},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00037-6},
doi = {10.1016/S1570-8667(03)00037-6},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/FranekLS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/FranekSX03,
author = {Frantisek Franek and
William F. Smyth and
Xiangdong Xiao},
title = {A Note on Crochemore's Repetitions Algorithm - {A} Fast Space-Efficient
Approach},
journal = {Nord. J. Comput.},
volume = {10},
number = {1},
pages = {21--28},
year = {2003},
timestamp = {Wed, 14 Jan 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/njc/FranekSX03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/IliopoulosMMPST03,
author = {Costas S. Iliopoulos and
Manal Mohamed and
Laurent Mouchard and
Katerina Perdikuri and
William F. Smyth and
Athanasios K. Tsakalidis},
title = {String Regularities with Don't Cares},
journal = {Nord. J. Comput.},
volume = {10},
number = {1},
pages = {40--51},
year = {2003},
timestamp = {Tue, 29 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/njc/IliopoulosMMPST03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dicta/SmythLCM03,
author = {Bill Smyth and
Chiou Peng Lam and
Xin Chen and
Valerie Maxville},
editor = {Changming Sun and
Hugues Talbot and
S{\'{e}}bastien Ourselin and
Tony Adriaansen},
title = {Heuristics for Image Retrieval Using Spatial Configurations},
booktitle = {Proceedings of the Seventh International Conference on Digital Image
Computing: Techniques and Applications, {DICTA} 2003, 10-12 December
2003, Macquarie University, Sydney, Australia},
pages = {909--918},
publisher = {{CSIRO} Publishing},
year = {2003},
url = {http://www.cmis.csiro.au/Hugues.Talbot/dicta2003/cdrom/pdf/0909.pdf},
timestamp = {Mon, 30 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dicta/SmythLCM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stringology/ColeIMSY03,
author = {Richard Cole and
Costas S. Iliopoulos and
Manal Mohamed and
William F. Smyth and
Lu Yang},
editor = {Milan Sim{\'{a}}nek},
title = {Computing the Minimum k-Cover of a String},
booktitle = {Proceedings of the Prague Stringology Conference 2003, Prague, Czech
Republic, September 22-24, 2003},
pages = {51--64},
publisher = {Department of Computer Science and Engineering, Faculty of Electrical
Engineering, Czech Technical University},
year = {2003},
url = {http://www.stringology.org/event/2003/p5.html},
timestamp = {Tue, 29 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stringology/ColeIMSY03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LiS02,
author = {Yin Li and
William F. Smyth},
title = {Computing the Cover Array in Linear Time},
journal = {Algorithmica},
volume = {32},
number = {1},
pages = {95--106},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0062-2},
doi = {10.1007/S00453-001-0062-2},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LiS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acsc/TurpinS02,
author = {Andrew Turpin and
William F. Smyth},
editor = {Michael J. Oudshoorn},
title = {An Approach to Phrase Selection for Offline Data Compression},
booktitle = {Computer Science 2002, Twenty-Fifth Australasian Computer Science
Conference (ACSC2002), Monash University, Melbourne, Victoria, Australia,
January/February 2002},
series = {{CRPIT}},
volume = {4},
pages = {267--273},
publisher = {Australian Computer Society},
year = {2002},
url = {http://crpit.scem.westernsydney.edu.au/abstracts/CRPITV4Turpin.html},
timestamp = {Wed, 10 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/acsc/TurpinS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/FranekJLS02,
author = {Frantisek Franek and
Jiandong Jiang and
Weilin Lu and
William F. Smyth},
editor = {Alberto Apostolico and
Masayuki Takeda},
title = {Two-Pattern Strings},
booktitle = {Combinatorial Pattern Matching, 13th Annual Symposium, {CPM} 2002,
Fukuoka, Japan, July 3-5, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2373},
pages = {76--84},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45452-7\_8},
doi = {10.1007/3-540-45452-7\_8},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/cpm/FranekJLS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stringology/FranekSX02,
author = {Frantisek Franek and
William F. Smyth and
Xiangdong Xiao},
editor = {Miroslav Bal{\'{\i}}k and
Milan Sim{\'{a}}nek},
title = {A Note on Crochemore's Repetitions Algorithm a Fast Space-Efficient
Approach},
booktitle = {Proceedings of the Prague Stringology Conference 2002, Prague, Czech
Republic, September 23-24, 2002},
pages = {56--43},
publisher = {Department of Computer Science and Engineering, Faculty of Electrical
Engineering, Czech Technical University},
year = {2002},
url = {http://www.stringology.org/event/2002/p5.html},
timestamp = {Wed, 10 Feb 2021 08:42:25 +0100},
biburl = {https://dblp.org/rec/conf/stringology/FranekSX02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stringology/IliopoulosMMPST02,
author = {Costas S. Iliopoulos and
Manal Mohamed and
Laurent Mouchard and
Katerina Perdikuri and
William F. Smyth and
Athanasios K. Tsakalidis},
editor = {Miroslav Bal{\'{\i}}k and
Milan Sim{\'{a}}nek},
title = {String Regularities with Don't Cares},
booktitle = {Proceedings of the Prague Stringology Conference 2002, Prague, Czech
Republic, September 23-24, 2002},
pages = {65--74},
publisher = {Department of Computer Science and Engineering, Faculty of Electrical
Engineering, Czech Technical University},
year = {2002},
url = {http://www.stringology.org/event/2002/p8.html},
timestamp = {Tue, 29 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stringology/IliopoulosMMPST02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SimIPS01,
author = {Jeong Seop Sim and
Costas S. Iliopoulos and
Kunsoo Park and
William F. Smyth},
title = {Approximate periods of strings},
journal = {Theor. Comput. Sci.},
volume = {262},
number = {1},
pages = {557--568},
year = {2001},
url = {https://doi.org/10.1016/S0304-3975(00)00365-0},
doi = {10.1016/S0304-3975(00)00365-0},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/SimIPS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FrankKS00,
author = {Frantisek Franek and
Ayse Karaman and
W. F. Smyth},
title = {Repetitions in Sturmian strings},
journal = {Theor. Comput. Sci.},
volume = {249},
number = {2},
pages = {289--303},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(00)00063-3},
doi = {10.1016/S0304-3975(00)00063-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FrankKS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Smyth00,
author = {W. F. Smyth},
title = {Repetitive perhaps, but certainly not boring},
journal = {Theor. Comput. Sci.},
volume = {249},
number = {2},
pages = {343--355},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(00)00067-0},
doi = {10.1016/S0304-3975(00)00067-0},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Smyth00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stringology/FranekLS00,
author = {Frantisek Franek and
Weilin Lu and
William F. Smyth},
title = {Repetitions in two-pattern strings},
booktitle = {Proceedings of the Prague Stringology Club Workshop 2000, Prague,
Czech Republic, September 2, 2000},
pages = {32--48},
publisher = {Department of Computer Science and Engineering, Faculty of Electrical
Engineering, Czech Technical University},
year = {2000},
url = {http://www.stringology.org/event/2000/p4.html},
timestamp = {Wed, 10 Feb 2021 08:42:22 +0100},
biburl = {https://dblp.org/rec/conf/stringology/FranekLS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MooreSM99,
author = {Dennis W. G. Moore and
William F. Smyth and
D. Miller},
title = {Counting Distinct Strings},
journal = {Algorithmica},
volume = {23},
number = {1},
pages = {1--13},
year = {1999},
url = {https://doi.org/10.1007/PL00009247},
doi = {10.1007/PL00009247},
timestamp = {Tue, 19 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/MooreSM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/SimIPS99,
author = {Jeong Seop Sim and
Costas S. Iliopoulos and
Kunsoo Park and
William F. Smyth},
editor = {Maxime Crochemore and
Mike Paterson},
title = {Approximate Periods of Strings},
booktitle = {Combinatorial Pattern Matching, 10th Annual Symposium, {CPM} 99, Warwick
University, UK, July 22-24, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1645},
pages = {123--133},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48452-3\_10},
doi = {10.1007/3-540-48452-3\_10},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/cpm/SimIPS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/IliopoulosMS97,
author = {Costas S. Iliopoulos and
Dennis W. G. Moore and
William F. Smyth},
title = {A Characterization of the Squares in a Fibonacci String},
journal = {Theor. Comput. Sci.},
volume = {172},
number = {1-2},
pages = {281--291},
year = {1997},
url = {https://doi.org/10.1016/S0304-3975(96)00141-7},
doi = {10.1016/S0304-3975(96)00141-7},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/IliopoulosMS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/DuvalS96,
author = {Art M. Duval and
William F. Smyth},
title = {Covering a Circular String with Substrings of Fixed Length},
journal = {Int. J. Found. Comput. Sci.},
volume = {7},
number = {1},
pages = {87--93},
year = {1996},
url = {https://doi.org/10.1142/S0129054196000075},
doi = {10.1142/S0129054196000075},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/DuvalS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HartsfieldS95,
author = {Nora Hartsfield and
W. F. Smyth},
title = {A family of sparse graphs of large sum number},
journal = {Discret. Math.},
volume = {141},
number = {1-3},
pages = {163--171},
year = {1995},
url = {https://doi.org/10.1016/0012-365X(93)E0196-B},
doi = {10.1016/0012-365X(93)E0196-B},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HartsfieldS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcm/IliopoulosS95,
author = {Costas S. Iliopoulos and
William F. Smyth},
title = {A fast average case algorithm for lyndon decomposition},
journal = {Int. J. Comput. Math.},
volume = {57},
number = {1-2},
pages = {15--31},
year = {1995},
url = {https://doi.org/10.1080/00207169508804408},
doi = {10.1080/00207169508804408},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcm/IliopoulosS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MooreS95,
author = {Dennis W. G. Moore and
William F. Smyth},
title = {A Correction to "An Optimal Algorithm to Compute all the Covers
of a String"},
journal = {Inf. Process. Lett.},
volume = {54},
number = {2},
pages = {101--103},
year = {1995},
url = {https://doi.org/10.1016/0020-0190(94)00235-Q},
doi = {10.1016/0020-0190(94)00235-Q},
timestamp = {Mon, 18 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/MooreS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MooreS94,
author = {Dennis W. G. Moore and
William F. Smyth},
title = {An Optimal Algorithm to Compute all the Covers of a String},
journal = {Inf. Process. Lett.},
volume = {50},
number = {5},
pages = {239--246},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00045-X},
doi = {10.1016/0020-0190(94)00045-X},
timestamp = {Mon, 18 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/MooreS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DaykinIS94,
author = {Jacqueline W. Daykin and
Costas S. Iliopoulos and
William F. Smyth},
title = {Parallel {RAM} Algorithms for Factorizing Words},
journal = {Theor. Comput. Sci.},
volume = {127},
number = {1},
pages = {53--67},
year = {1994},
url = {https://doi.org/10.1016/0304-3975(94)90100-7},
doi = {10.1016/0304-3975(94)90100-7},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DaykinIS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/MooreS94,
author = {Dennis W. G. Moore and
William F. Smyth},
editor = {Daniel Dominic Sleator},
title = {Computing the Covers of a String in Linear Time},
booktitle = {Proceedings of the Fifth Annual {ACM-SIAM} Symposium on Discrete Algorithms.
23-25 January 1994, Arlington, Virginia, {USA}},
pages = {511--515},
publisher = {{ACM/SIAM}},
year = {1994},
url = {http://dl.acm.org/citation.cfm?id=314464.314636},
timestamp = {Thu, 05 Jul 2018 07:29:19 +0200},
biburl = {https://dblp.org/rec/conf/soda/MooreS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cryptologia/SmythS93,
author = {William F. Smyth and
Reihaneh Safavi{-}Naini},
title = {Automated Cryptanalysis of Substitution Ciphers},
journal = {Cryptologia},
volume = {17},
number = {4},
pages = {407--418},
year = {1993},
url = {https://doi.org/10.1080/0161-119391868033},
doi = {10.1080/0161-119391868033},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cryptologia/SmythS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/EadesLS93,
author = {Peter Eades and
Xuemin Lin and
W. F. Smyth},
title = {A Fast and Effective Heuristic for the Feedback Arc Set Problem},
journal = {Inf. Process. Lett.},
volume = {47},
number = {6},
pages = {319--323},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90079-O},
doi = {10.1016/0020-0190(93)90079-O},
timestamp = {Mon, 16 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/EadesLS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CaccettaS92,
author = {Lou Caccetta and
W. F. Smyth},
title = {Graphs of maximum diameter},
journal = {Discret. Math.},
volume = {102},
number = {2},
pages = {121--141},
year = {1992},
url = {https://doi.org/10.1016/0012-365X(92)90047-J},
doi = {10.1016/0012-365X(92)90047-J},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/CaccettaS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/IliopoulosS92,
author = {Costas S. Iliopoulos and
William F. Smyth},
title = {Optimal Algorithms for Computing the canonical form of a circular
string},
journal = {Theor. Comput. Sci.},
volume = {92},
number = {1},
pages = {87--105},
year = {1992},
url = {https://doi.org/10.1016/0304-3975(92)90137-5},
doi = {10.1016/0304-3975(92)90137-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/IliopoulosS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cj/Smyth91,
author = {W. F. Smyth},
title = {Mu-Balancing M-Way Search Trees},
journal = {Comput. J.},
volume = {34},
number = {5},
pages = {406--414},
year = {1991},
url = {https://doi.org/10.1093/comjnl/34.5.406},
doi = {10.1093/COMJNL/34.5.406},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cj/Smyth91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/RedishS90,
author = {K. A. Redish and
W. F. Smyth},
title = {Closed form expressions for the iterated floor function},
journal = {Discret. Math.},
volume = {91},
number = {3},
pages = {317--321},
year = {1990},
url = {https://doi.org/10.1016/0012-365X(90)90240-I},
doi = {10.1016/0012-365X(90)90240-I},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/RedishS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/oa/IliopoulosS89,
author = {Costas S. Iliopoulos and
William F. Smyth},
editor = {Hristo N. Djidjev},
title = {{PRAM} Algorithms for Identifying Polygon Similarity},
booktitle = {Optimal Algorithms, International Symposium, Varna, Bulgaria, May
29 - June 2, 1989, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {401},
pages = {25--32},
publisher = {Springer},
year = {1989},
url = {https://doi.org/10.1007/3-540-51859-2\_4},
doi = {10.1007/3-540-51859-2\_4},
timestamp = {Wed, 14 Jul 2021 17:16:13 +0200},
biburl = {https://dblp.org/rec/conf/oa/IliopoulosS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cj/RedishS87,
author = {K. A. Redish and
W. F. Smyth},
title = {Evaluating Measures of Program Quality},
journal = {Comput. J.},
volume = {30},
number = {3},
pages = {228--232},
year = {1987},
url = {https://doi.org/10.1093/comjnl/30.3.228},
doi = {10.1093/COMJNL/30.3.228},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cj/RedishS87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cacm/RedishS86,
author = {K. A. Redish and
W. F. Smyth},
title = {Program Style Analysis: {A} Natural By-Product of Program Compilation},
journal = {Commun. {ACM}},
volume = {29},
number = {2},
pages = {126--133},
year = {1986},
url = {https://doi.org/10.1145/5657.5661},
doi = {10.1145/5657.5661},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cacm/RedishS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ifip/SmythJ80,
author = {W. F. Smyth and
N. W. N. Jayasiri},
editor = {Simon H. Lavington},
title = {The Encouragement of Effective Computer Use in Developing Countries},
booktitle = {Information Processing, Proceedings of the 8th {IFIP} Congress 1980,
Tokyo, Japan - October 6-9, 1980 and Melbourne, Australia - October
14-17, 1980},
pages = {885--890},
publisher = {North-Holland/IFIP},
year = {1980},
timestamp = {Fri, 26 Jul 2019 22:58:40 +0200},
biburl = {https://dblp.org/rec/conf/ifip/SmythJ80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/afips/SmythA76,
author = {W. F. Smyth and
Ilona Arany},
title = {Another algorithm for reducing bandwidth and profile of a sparse matrix},
booktitle = {American Federation of Information Processing Societies: 1976 National
Computer Conference, 7-10 June 1976, New York, NY, {USA}},
series = {{AFIPS} Conference Proceedings},
volume = {45},
pages = {987--994},
publisher = {{AFIPS} Press},
year = {1976},
url = {https://doi.org/10.1145/1499799.1499935},
doi = {10.1145/1499799.1499935},
timestamp = {Wed, 14 Apr 2021 16:50:07 +0200},
biburl = {https://dblp.org/rec/conf/afips/SmythA76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cj/SmythR74,
author = {W. F. Smyth and
E. Radaceanu},
title = {A Storage Scheme for Hierarchic Structures},
journal = {Comput. J.},
volume = {17},
number = {2},
pages = {152--156},
year = {1974},
url = {https://doi.org/10.1093/comjnl/17.2.152},
doi = {10.1093/COMJNL/17.2.152},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cj/SmythR74.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ifip/SmythB74,
author = {W. F. Smyth and
W. M. L. Benzi},
editor = {Jack L. Rosenfeld},
title = {An Algorithm for Finding the Diameter of a Graph},
booktitle = {Information Processing, Proceedings of the 6th {IFIP} Congress 1974,
Stockholm, Sweden, August 5-10, 1974},
pages = {500--503},
publisher = {North-Holland},
year = {1974},
timestamp = {Fri, 26 Jul 2019 22:58:40 +0200},
biburl = {https://dblp.org/rec/conf/ifip/SmythB74.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ifip/AranySS71,
author = {Ilona Arany and
Lajos Szoda and
W. F. Smyth},
editor = {Charles V. Freiman and
John E. Griffith and
Jack L. Rosenfeld},
title = {An Improved Method for Reducing the Bandwidth of Sparse Symmetric
Matrices},
booktitle = {Information Processing, Proceedings of {IFIP} Congress 1971, Volume
2 - Applications, Ljubljana, Yugoslavia, August 23-28, 1971},
pages = {1246--1250},
publisher = {North-Holland},
year = {1971},
timestamp = {Fri, 26 Jul 2019 15:39:52 +0200},
biburl = {https://dblp.org/rec/conf/ifip/AranySS71.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-21 17:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
