Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Philip Bille
@inproceedings{DBLP:conf/soda/BilleG24,
author = {Philip Bille and
Inge Li G{\o}rtz},
editor = {David P. Woodruff},
title = {Sparse Regular Expression Matching},
booktitle = {Proceedings of the 2024 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2024, Alexandria, VA, USA, January 7-10, 2024},
pages = {3354--3375},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977912.120},
doi = {10.1137/1.9781611977912.120},
timestamp = {Thu, 04 Apr 2024 19:38:10 +0200},
biburl = {https://dblp.org/rec/conf/soda/BilleG24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BilleGLPRS24,
author = {Philip Bille and
Inge Li G{\o}rtz and
Moshe Lewenstein and
Solon P. Pissis and
Eva Rotenberg and
Teresa Anna Steiner},
editor = {Olaf Beyersdorff and
Mamadou Moustapha Kant{\'{e}} and
Orna Kupferman and
Daniel Lokshtanov},
title = {Gapped String Indexing in Subquadratic Space and Sublinear Query Time},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2024, March 12-14, 2024, Clermont-Ferrand, France},
series = {LIPIcs},
volume = {289},
pages = {16:1--16:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.STACS.2024.16},
doi = {10.4230/LIPICS.STACS.2024.16},
timestamp = {Mon, 11 Mar 2024 15:43:27 +0100},
biburl = {https://dblp.org/rec/conf/stacs/BilleGLPRS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BilleGPS23,
author = {Philip Bille and
Inge Li G{\o}rtz and
Max Rish{\o}j Pedersen and
Teresa Anna Steiner},
title = {Gapped Indexing for Consecutive Occurrences},
journal = {Algorithmica},
volume = {85},
number = {4},
pages = {879--901},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01051-6},
doi = {10.1007/S00453-022-01051-6},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BilleGPS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BilleG23,
author = {Philip Bille and
Inge Li G{\o}rtz},
title = {Random Access in Persistent Strings and Segment Selection},
journal = {Theory Comput. Syst.},
volume = {67},
number = {4},
pages = {694--713},
year = {2023},
url = {https://doi.org/10.1007/s00224-022-10109-5},
doi = {10.1007/S00224-022-10109-5},
timestamp = {Sat, 19 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BilleG23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BilleGS23,
author = {Philip Bille and
Inge Li G{\o}rtz and
Teresa Anna Steiner},
title = {String Indexing with Compressed Patterns},
journal = {{ACM} Trans. Algorithms},
volume = {19},
number = {4},
pages = {32:1--32:19},
year = {2023},
url = {https://doi.org/10.1145/3607141},
doi = {10.1145/3607141},
timestamp = {Sun, 17 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/BilleGS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/Bille0GPS23,
author = {Philip Bille and
Johannes Fischer and
Inge Li G{\o}rtz and
Max Rish{\o}j Pedersen and
Tord Joakim Stordalen},
editor = {Laurent Bulteau and
Zsuzsanna Lipt{\'{a}}k},
title = {Sliding Window String Indexing in Streams},
booktitle = {34th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2023,
June 26-28, 2023, Marne-la-Vall{\'{e}}e, France},
series = {LIPIcs},
volume = {259},
pages = {4:1--4:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CPM.2023.4},
doi = {10.4230/LIPICS.CPM.2023.4},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/Bille0GPS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/BilleGPT23,
author = {Philip Bille and
Inge Li G{\o}rtz and
Simon J. Puglisi and
Simon R. Tarnow},
editor = {Loukas Georgiadis},
title = {Hierarchical Relative Lempel-Ziv Compression},
booktitle = {21st International Symposium on Experimental Algorithms, {SEA} 2023,
July 24-26, 2023, Barcelona, Spain},
series = {LIPIcs},
volume = {265},
pages = {18:1--18:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.SEA.2023.18},
doi = {10.4230/LIPICS.SEA.2023.18},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wea/BilleGPT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2301-09477,
author = {Philip Bille and
Johannes Fischer and
Inge Li G{\o}rtz and
Max Rish{\o}j Pedersen and
Tord Joakim Stordalen},
title = {Sliding Window String Indexing in Streams},
journal = {CoRR},
volume = {abs/2301.09477},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2301.09477},
doi = {10.48550/ARXIV.2301.09477},
eprinttype = {arXiv},
eprint = {2301.09477},
timestamp = {Thu, 26 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2301-09477.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-12771,
author = {Philip Bille and
Inge Li G{\o}rtz and
Max Rish{\o}j Pedersen},
title = {Faster Compression of Deterministic Finite Automata},
journal = {CoRR},
volume = {abs/2306.12771},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.12771},
doi = {10.48550/ARXIV.2306.12771},
eprinttype = {arXiv},
eprint = {2306.12771},
timestamp = {Tue, 27 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-12771.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-19702,
author = {Philip Bille and
Inge Li G{\o}rtz and
Tord Stordalen},
title = {Rank and Select on Degenerate Strings},
journal = {CoRR},
volume = {abs/2310.19702},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2310.19702},
doi = {10.48550/ARXIV.2310.19702},
eprinttype = {arXiv},
eprint = {2310.19702},
timestamp = {Fri, 03 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2310-19702.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-15777,
author = {Philip Bille and
Yakov Nekrich and
Solon P. Pissis},
title = {Size-constrained Weighted Ancestors with Applications},
journal = {CoRR},
volume = {abs/2311.15777},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.15777},
doi = {10.48550/ARXIV.2311.15777},
eprinttype = {arXiv},
eprint = {2311.15777},
timestamp = {Fri, 01 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-15777.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/BilleG22,
author = {Philip Bille and
Inge Li G{\o}rtz},
title = {From regular expression matching to parsing},
journal = {Acta Informatica},
volume = {59},
number = {6},
pages = {709--724},
year = {2022},
url = {https://doi.org/10.1007/s00236-022-00420-6},
doi = {10.1007/S00236-022-00420-6},
timestamp = {Tue, 06 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/acta/BilleG22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BilleGS22,
author = {Philip Bille and
Inge Li G{\o}rtz and
Frederik Rye Skjoldjensen},
title = {Partial sums on the ultra-wide word {RAM}},
journal = {Theor. Comput. Sci.},
volume = {905},
pages = {99--105},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.01.002},
doi = {10.1016/J.TCS.2022.01.002},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BilleGS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BilleGPRS22,
author = {Philip Bille and
Inge Li G{\o}rtz and
Max Rish{\o}j Pedersen and
Eva Rotenberg and
Teresa Anna Steiner},
title = {String indexing for top-\emph{k} close consecutive occurrences},
journal = {Theor. Comput. Sci.},
volume = {927},
pages = {133--147},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.06.004},
doi = {10.1016/J.TCS.2022.06.004},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BilleGPRS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BilleGMSW22,
author = {Philip Bille and
Inge Li G{\o}rtz and
Shay Mozes and
Teresa Anna Steiner and
Oren Weimann},
editor = {Hideo Bannai and
Jan Holub},
title = {The Fine-Grained Complexity of Episode Matching},
booktitle = {33rd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2022,
June 27-29, 2022, Prague, Czech Republic},
series = {LIPIcs},
volume = {223},
pages = {4:1--4:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CPM.2022.4},
doi = {10.4230/LIPICS.CPM.2022.4},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cpm/BilleGMSW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/BilleGS22,
author = {Philip Bille and
Inge Li G{\o}rtz and
Tord Stordalen},
editor = {Diego Arroyuelo and
Barbara Poblete},
title = {The Complexity of the Co-occurrence Problem},
booktitle = {String Processing and Information Retrieval - 29th International Symposium,
{SPIRE} 2022, Concepci{\'{o}}n, Chile, November 8-10, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13617},
pages = {38--52},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-20643-6\_4},
doi = {10.1007/978-3-031-20643-6\_4},
timestamp = {Mon, 05 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/spire/BilleGS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BilleGS22,
author = {Philip Bille and
Inge Li G{\o}rtz and
Tord Stordalen},
editor = {Artur Czumaj and
Qin Xin},
title = {Predecessor on the Ultra-Wide Word {RAM}},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {18:1--18:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.18},
doi = {10.4230/LIPICS.SWAT.2022.18},
timestamp = {Sun, 12 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/BilleGS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-11550,
author = {Philip Bille and
Inge Li G{\o}rtz and
Tord Stordalen},
title = {Predecessor on the Ultra-Wide Word {RAM}},
journal = {CoRR},
volume = {abs/2201.11550},
year = {2022},
url = {https://arxiv.org/abs/2201.11550},
eprinttype = {arXiv},
eprint = {2201.11550},
timestamp = {Tue, 01 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-11550.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2206-10383,
author = {Philip Bille and
Inge Li G{\o}rtz and
Tord Stordalen},
title = {The Complexity of the Co-Occurrence Problem},
journal = {CoRR},
volume = {abs/2206.10383},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2206.10383},
doi = {10.48550/ARXIV.2206.10383},
eprinttype = {arXiv},
eprint = {2206.10383},
timestamp = {Mon, 27 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2206-10383.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-11371,
author = {Philip Bille and
Inge Li G{\o}rtz and
Simon J. Puglisi and
Simon R. Tarnow},
title = {Hierarchical Relative Lempel-Ziv Compression},
journal = {CoRR},
volume = {abs/2208.11371},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.11371},
doi = {10.48550/ARXIV.2208.11371},
eprinttype = {arXiv},
eprint = {2208.11371},
timestamp = {Tue, 30 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-11371.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-16860,
author = {Philip Bille and
Inge Li G{\o}rtz and
Moshe Lewenstein and
Solon P. Pissis and
Eva Rotenberg and
Teresa Anna Steiner},
title = {Gapped String Indexing in Subquadratic Space and Sublinear Query Time},
journal = {CoRR},
volume = {abs/2211.16860},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.16860},
doi = {10.48550/ARXIV.2211.16860},
eprinttype = {arXiv},
eprint = {2211.16860},
timestamp = {Fri, 02 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-16860.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BilleGGLW21,
author = {Philip Bille and
Pawel Gawrychowski and
Inge Li G{\o}rtz and
Gad M. Landau and
Oren Weimann},
title = {Top Tree Compression of Tries},
journal = {Algorithmica},
volume = {83},
number = {12},
pages = {3602--3628},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00869-w},
doi = {10.1007/S00453-021-00869-W},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BilleGGLW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BilleGPS21,
author = {Philip Bille and
Inge Li G{\o}rtz and
Max Rish{\o}j Pedersen and
Teresa Anna Steiner},
editor = {Pawel Gawrychowski and
Tatiana Starikovskaya},
title = {Gapped Indexing for Consecutive Occurrences},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2021,
July 5-7, 2021, Wroc{\l}aw, Poland},
series = {LIPIcs},
volume = {191},
pages = {10:1--10:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CPM.2021.10},
doi = {10.4230/LIPICS.CPM.2021.10},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/BilleGPS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-02505,
author = {Philip Bille and
Inge Li G{\o}rtz and
Max Rish{\o}j Pedersen and
Teresa Anna Steiner},
title = {Gapped Indexing for Consecutive Occurrences},
journal = {CoRR},
volume = {abs/2102.02505},
year = {2021},
url = {https://arxiv.org/abs/2102.02505},
eprinttype = {arXiv},
eprint = {2102.02505},
timestamp = {Tue, 09 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-02505.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2108-08613,
author = {Philip Bille and
Inge Li G{\o}rtz and
Shay Mozes and
Teresa Anna Steiner and
Oren Weimann},
title = {A Conditional Lower Bound for Episode Matching},
journal = {CoRR},
volume = {abs/2108.08613},
year = {2021},
url = {https://arxiv.org/abs/2108.08613},
eprinttype = {arXiv},
eprint = {2108.08613},
timestamp = {Mon, 23 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2108-08613.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/Bille20,
author = {Philip Bille},
title = {Editorial: Special Issue on Data Compression Algorithms and Their
Applications},
journal = {Algorithms},
volume = {13},
number = {1},
pages = {28},
year = {2020},
url = {https://doi.org/10.3390/a13010028},
doi = {10.3390/A13010028},
timestamp = {Thu, 06 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithms/Bille20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcc/BilleEGGP20,
author = {Philip Bille and
Mikko Berggren Ettienne and
Travis Gagie and
Inge Li G{\o}rtz and
Nicola Prezza},
editor = {Ali Bilgin and
Michael W. Marcellin and
Joan Serra{-}Sagrist{\`{a}} and
James A. Storer},
title = {Decompressing Lempel-Ziv Compressed Text},
booktitle = {Data Compression Conference, {DCC} 2020, Snowbird, UT, USA, March
24-27, 2020},
pages = {143--152},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/DCC47342.2020.00022},
doi = {10.1109/DCC47342.2020.00022},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dcc/BilleEGGP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BilleGPRS20,
author = {Philip Bille and
Inge Li G{\o}rtz and
Max Rish{\o}j Pedersen and
Eva Rotenberg and
Teresa Anna Steiner},
editor = {Nitin Saxena and
Sunil Simon},
title = {String Indexing for Top-k Close Consecutive Occurrences},
booktitle = {40th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2020, December 14-18, 2020,
{BITS} Pilani, {K} {K} Birla Goa Campus, Goa, India (Virtual Conference)},
series = {LIPIcs},
volume = {182},
pages = {14:1--14:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2020.14},
doi = {10.4230/LIPICS.FSTTCS.2020.14},
timestamp = {Sat, 21 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/BilleGPRS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BilleE0GKMR20,
author = {Philip Bille and
Jonas Ellert and
Johannes Fischer and
Inge Li G{\o}rtz and
Florian Kurpicz and
J. Ian Munro and
Eva Rotenberg},
editor = {Artur Czumaj and
Anuj Dawar and
Emanuela Merelli},
title = {Space Efficient Construction of Lyndon Arrays in Linear Time},
booktitle = {47th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2020, July 8-11, 2020, Saarbr{\"{u}}cken, Germany (Virtual
Conference)},
series = {LIPIcs},
volume = {168},
pages = {14:1--14:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2020.14},
doi = {10.4230/LIPICS.ICALP.2020.14},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BilleE0GKMR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BilleG20,
author = {Philip Bille and
Inge Li G{\o}rtz},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Random Access in Persistent Strings},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {48:1--48:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.48},
doi = {10.4230/LIPICS.ISAAC.2020.48},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BilleG20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BilleGS20,
author = {Philip Bille and
Inge Li G{\o}rtz and
Teresa Anna Steiner},
editor = {Christophe Paul and
Markus Bl{\"{a}}ser},
title = {String Indexing with Compressed Patterns},
booktitle = {37th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2020, March 10-13, 2020, Montpellier, France},
series = {LIPIcs},
volume = {154},
pages = {10:1--10:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.STACS.2020.10},
doi = {10.4230/LIPICS.STACS.2020.10},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BilleGS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/BilleGS20,
author = {Philip Bille and
Inge Li G{\o}rtz and
Frederik Rye Skjoldjensen},
editor = {Jianer Chen and
Qilong Feng and
Jinhui Xu},
title = {Partial Sums on the Ultra-Wide Word {RAM}},
booktitle = {Theory and Applications of Models of Computation, 16th International
Conference, {TAMC} 2020, Changsha, China, October 18-20, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12337},
pages = {13--24},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-59267-7\_2},
doi = {10.1007/978-3-030-59267-7\_2},
timestamp = {Sat, 14 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/tamc/BilleGS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-15575,
author = {Philip Bille and
Inge Li G{\o}rtz},
title = {Random Access in Persistent Strings},
journal = {CoRR},
volume = {abs/2006.15575},
year = {2020},
url = {https://arxiv.org/abs/2006.15575},
eprinttype = {arXiv},
eprint = {2006.15575},
timestamp = {Wed, 01 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-15575.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-04128,
author = {Philip Bille and
Inge Li G{\o}rtz and
Max Rish{\o}j Pedersen and
Eva Rotenberg and
Teresa Anna Steiner},
title = {String Indexing for Top-k Close Consecutive Occurrences},
journal = {CoRR},
volume = {abs/2007.04128},
year = {2020},
url = {https://arxiv.org/abs/2007.04128},
eprinttype = {arXiv},
eprint = {2007.04128},
timestamp = {Mon, 20 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-04128.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BilleGGLW19,
author = {Philip Bille and
Pawel Gawrychowski and
Inge Li G{\o}rtz and
Gad M. Landau and
Oren Weimann},
editor = {Pinyan Lu and
Guochuan Zhang},
title = {Top Tree Compression of Tries},
booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC}
2019, December 8-11, 2019, Shanghai University of Finance and Economics,
Shanghai, China},
series = {LIPIcs},
volume = {149},
pages = {4:1--4:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.4},
doi = {10.4230/LIPICS.ISAAC.2019.4},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/BilleGGLW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BilleG19,
author = {Philip Bille and
Inge Li G{\o}rtz},
editor = {Peter Rossmanith and
Pinar Heggernes and
Joost{-}Pieter Katoen},
title = {From Regular Expression Matching to Parsing},
booktitle = {44th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2019, August 26-30, 2019, Aachen, Germany},
series = {LIPIcs},
volume = {138},
pages = {71:1--71:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2019.71},
doi = {10.4230/LIPICS.MFCS.2019.71},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BilleG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-00718,
author = {Philip Bille and
Mikko Berggren Ettienne and
Inge Li G{\o}rtz},
title = {Mergeable Dictionaries With Shifts},
journal = {CoRR},
volume = {abs/1901.00718},
year = {2019},
url = {http://arxiv.org/abs/1901.00718},
eprinttype = {arXiv},
eprint = {1901.00718},
timestamp = {Thu, 31 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1901-00718.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-02187,
author = {Philip Bille and
Inge Li G{\o}rtz and
Pawel Gawrychowski and
Gad M. Landau and
Oren Weimann},
title = {Top Tree Compression of Tries},
journal = {CoRR},
volume = {abs/1902.02187},
year = {2019},
url = {http://arxiv.org/abs/1902.02187},
eprinttype = {arXiv},
eprint = {1902.02187},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1902-02187.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-04752,
author = {Philip Bille and
Inge Li G{\o}rtz},
title = {Sparse Regular Expression Matching},
journal = {CoRR},
volume = {abs/1907.04752},
year = {2019},
url = {http://arxiv.org/abs/1907.04752},
eprinttype = {arXiv},
eprint = {1907.04752},
timestamp = {Wed, 17 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-04752.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1908-10159,
author = {Philip Bille and
Inge Li G{\o}rtz and
Frederik Rye Skjoldjensen},
title = {Partial Sums on the Ultra-Wide Word {RAM}},
journal = {CoRR},
volume = {abs/1908.10159},
year = {2019},
url = {http://arxiv.org/abs/1908.10159},
eprinttype = {arXiv},
eprint = {1908.10159},
timestamp = {Thu, 29 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1908-10159.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-11930,
author = {Philip Bille and
Inge Li G{\o}rtz and
Teresa Anna Steiner},
title = {String Indexing with Compressed Patterns},
journal = {CoRR},
volume = {abs/1909.11930},
year = {2019},
url = {http://arxiv.org/abs/1909.11930},
eprinttype = {arXiv},
eprint = {1909.11930},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1909-11930.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-03542,
author = {Philip Bille and
Jonas Ellert and
Johannes Fischer and
Inge Li G{\o}rtz and
Florian Kurpicz and
Ian Munro and
Eva Rotenberg},
title = {Space Efficient Construction of Lyndon Arrays in Linear Time},
journal = {CoRR},
volume = {abs/1911.03542},
year = {2019},
url = {http://arxiv.org/abs/1911.03542},
eprinttype = {arXiv},
eprint = {1911.03542},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-03542.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BilleCCGSVV18,
author = {Philip Bille and
Anders Roy Christiansen and
Patrick Hagge Cording and
Inge Li G{\o}rtz and
Frederik Rye Skjoldjensen and
Hjalte Wedel Vildh{\o}j and
S{\o}ren Vind},
title = {Dynamic Relative Compression, Dynamic Partial Sums, and Substring
Concatenation},
journal = {Algorithmica},
volume = {80},
number = {11},
pages = {3207--3224},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0380-7},
doi = {10.1007/S00453-017-0380-7},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BilleCCGSVV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BilleGGP18,
author = {Philip Bille and
Travis Gagie and
Inge Li G{\o}rtz and
Nicola Prezza},
title = {A separation between RLSLPs and {LZ77}},
journal = {J. Discrete Algorithms},
volume = {50},
pages = {36--39},
year = {2018},
url = {https://doi.org/10.1016/j.jda.2018.09.002},
doi = {10.1016/J.JDA.2018.09.002},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/BilleGGP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BilleCCG18,
author = {Philip Bille and
Anders Roy Christiansen and
Patrick Hagge Cording and
Inge Li G{\o}rtz},
title = {Finger Search in Grammar-Compressed Strings},
journal = {Theory Comput. Syst.},
volume = {62},
number = {8},
pages = {1715--1735},
year = {2018},
url = {https://doi.org/10.1007/s00224-017-9839-9},
doi = {10.1007/S00224-017-9839-9},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BilleCCG18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BilleEGV18,
author = {Philip Bille and
Mikko Berggren Ettienne and
Inge Li G{\o}rtz and
Hjalte Wedel Vildh{\o}j},
title = {Time-space trade-offs for Lempel-Ziv compressed indexing},
journal = {Theor. Comput. Sci.},
volume = {713},
pages = {66--77},
year = {2018},
url = {https://doi.org/10.1016/j.tcs.2017.12.021},
doi = {10.1016/J.TCS.2017.12.021},
timestamp = {Mon, 12 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BilleEGV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/BilleEGGR18,
author = {Philip Bille and
Mikko Berggren Ettienne and
Roberto Grossi and
Inge Li G{\o}rtz and
Eva Rotenberg},
editor = {Travis Gagie and
Alistair Moffat and
Gonzalo Navarro and
Ernesto Cuadros{-}Vargas},
title = {Compressed Communication Complexity of Longest Common Prefixes},
booktitle = {String Processing and Information Retrieval - 25th International Symposium,
{SPIRE} 2018, Lima, Peru, October 9-11, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11147},
pages = {74--87},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-00479-8\_7},
doi = {10.1007/978-3-030-00479-8\_7},
timestamp = {Wed, 28 Feb 2024 00:16:41 +0100},
biburl = {https://dblp.org/rec/conf/spire/BilleEGGR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-10347,
author = {Philip Bille and
Mikko Berggren Ettienne and
Travis Gagie and
Inge Li G{\o}rtz and
Nicola Prezza},
title = {Fast Lempel-Ziv Decompression in Linear Space},
journal = {CoRR},
volume = {abs/1802.10347},
year = {2018},
url = {http://arxiv.org/abs/1802.10347},
eprinttype = {arXiv},
eprint = {1802.10347},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-10347.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-02906,
author = {Philip Bille and
Inge Li G{\o}rtz},
title = {From Regular Expression Matching to Parsing},
journal = {CoRR},
volume = {abs/1804.02906},
year = {2018},
url = {http://arxiv.org/abs/1804.02906},
eprinttype = {arXiv},
eprint = {1804.02906},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-02906.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-03102,
author = {Philip Bille and
Mikko Berggren Ettienne and
Roberto Grossi and
Inge Li G{\o}rtz and
Eva Rotenberg},
title = {Compressed Communication Complexity of Longest Common Prefixes},
journal = {CoRR},
volume = {abs/1806.03102},
year = {2018},
url = {http://arxiv.org/abs/1806.03102},
eprinttype = {arXiv},
eprint = {1806.03102},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-03102.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BilleCG17,
author = {Philip Bille and
Patrick Hagge Cording and
Inge Li G{\o}rtz},
title = {Compressed Subsequence Matching and Packed Tree Coloring},
journal = {Algorithmica},
volume = {77},
number = {2},
pages = {336--348},
year = {2017},
url = {https://doi.org/10.1007/s00453-015-0068-9},
doi = {10.1007/S00453-015-0068-9},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BilleCG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BilleGCSVV17,
author = {Philip Bille and
Inge Li G{\o}rtz and
Patrick Hagge Cording and
Benjamin Sach and
Hjalte Wedel Vildh{\o}j and
S{\o}ren Vind},
title = {Fingerprints in compressed strings},
journal = {J. Comput. Syst. Sci.},
volume = {86},
pages = {171--180},
year = {2017},
url = {https://doi.org/10.1016/j.jcss.2017.01.002},
doi = {10.1016/J.JCSS.2017.01.002},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/BilleGCSVV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BilleGS17,
author = {Philip Bille and
Inge Li G{\o}rtz and
Frederik Rye Skjoldjensen},
title = {Subsequence automata with default transitions},
journal = {J. Discrete Algorithms},
volume = {44},
pages = {48--55},
year = {2017},
url = {https://doi.org/10.1016/j.jda.2017.05.001},
doi = {10.1016/J.JDA.2017.05.001},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/BilleGS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BilleGS17,
author = {Philip Bille and
Inge Li G{\o}rtz and
Frederik Rye Skjoldjensen},
editor = {Juha K{\"{a}}rkk{\"{a}}inen and
Jakub Radoszewski and
Wojciech Rytter},
title = {Deterministic Indexing for Packed Strings},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017,
July 4-6, 2017, Warsaw, Poland},
series = {LIPIcs},
volume = {78},
pages = {6:1--6:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.CPM.2017.6},
doi = {10.4230/LIPICS.CPM.2017.6},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/cpm/BilleGS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BilleCFG17,
author = {Philip Bille and
Patrick Hagge Cording and
Johannes Fischer and
Inge Li G{\o}rtz},
editor = {Juha K{\"{a}}rkk{\"{a}}inen and
Jakub Radoszewski and
Wojciech Rytter},
title = {Lempel-Ziv Compression in a Sliding Window},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017,
July 4-6, 2017, Warsaw, Poland},
series = {LIPIcs},
volume = {78},
pages = {15:1--15:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.CPM.2017.15},
doi = {10.4230/LIPICS.CPM.2017.15},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cpm/BilleCFG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BilleEGV17,
author = {Philip Bille and
Mikko Berggren Ettienne and
Inge Li G{\o}rtz and
Hjalte Wedel Vildh{\o}j},
editor = {Juha K{\"{a}}rkk{\"{a}}inen and
Jakub Radoszewski and
Wojciech Rytter},
title = {Time-Space Trade-Offs for Lempel-Ziv Compressed Indexing},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017,
July 4-6, 2017, Warsaw, Poland},
series = {LIPIcs},
volume = {78},
pages = {16:1--16:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.CPM.2017.16},
doi = {10.4230/LIPICS.CPM.2017.16},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cpm/BilleEGV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcc/BilleGP17,
author = {Philip Bille and
Inge Li G{\o}rtz and
Nicola Prezza},
editor = {Ali Bilgin and
Michael W. Marcellin and
Joan Serra{-}Sagrist{\`{a}} and
James A. Storer},
title = {Space-Efficient Re-Pair Compression},
booktitle = {2017 Data Compression Conference, {DCC} 2017, Snowbird, UT, USA, April
4-7, 2017},
pages = {171--180},
publisher = {{IEEE}},
year = {2017},
url = {https://doi.org/10.1109/DCC.2017.24},
doi = {10.1109/DCC.2017.24},
timestamp = {Wed, 16 Oct 2019 14:14:57 +0200},
biburl = {https://dblp.org/rec/conf/dcc/BilleGP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BilleCEG17,
author = {Philip Bille and
Anders Roy Christiansen and
Mikko Berggren Ettienne and
Inge Li G{\o}rtz},
editor = {Kirk Pruhs and
Christian Sohler},
title = {Fast Dynamic Arrays},
booktitle = {25th Annual European Symposium on Algorithms, {ESA} 2017, September
4-6, 2017, Vienna, Austria},
series = {LIPIcs},
volume = {87},
pages = {16:1--16:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ESA.2017.16},
doi = {10.4230/LIPICS.ESA.2017.16},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/esa/BilleCEG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iticse/BilleG17,
author = {Philip Bille and
Inge Li G{\o}rtz},
editor = {Renzo Davoli and
Michael Goldweber and
Guido R{\"{o}}{\ss}ling and
Irene Polycarpou},
title = {Immersive Algorithms: Better Visualization with Less Information},
booktitle = {Proceedings of the 2017 {ACM} Conference on Innovation and Technology
in Computer Science Education, ITiCSE 2017, Bologna, Italy, July 3-5,
2017},
pages = {80--81},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3059009.3072972},
doi = {10.1145/3059009.3072972},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iticse/BilleG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/BilleCPS17,
author = {Philip Bille and
Anders Roy Christiansen and
Nicola Prezza and
Frederik Rye Skjoldjensen},
editor = {Gabriele Fici and
Marinella Sciortino and
Rossano Venturini},
title = {Succinct Partial Sums and Fenwick Trees},
booktitle = {String Processing and Information Retrieval - 24th International Symposium,
{SPIRE} 2017, Palermo, Italy, September 26-29, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10508},
pages = {91--96},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-67428-5\_8},
doi = {10.1007/978-3-319-67428-5\_8},
timestamp = {Tue, 14 May 2019 10:00:55 +0200},
biburl = {https://dblp.org/rec/conf/spire/BilleCPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/BilleFG17,
author = {Philip Bille and
Finn Fernstr{\o}m and
Inge Li G{\o}rtz},
editor = {Gabriele Fici and
Marinella Sciortino and
Rossano Venturini},
title = {Tight Bounds for Top Tree Compression},
booktitle = {String Processing and Information Retrieval - 24th International Symposium,
{SPIRE} 2017, Palermo, Italy, September 26-29, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10508},
pages = {97--102},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-67428-5\_9},
doi = {10.1007/978-3-319-67428-5\_9},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/spire/BilleFG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BilleGP17,
author = {Philip Bille and
Inge Li G{\o}rtz and
Nicola Prezza},
title = {Practical and Effective Re-Pair Compression},
journal = {CoRR},
volume = {abs/1704.08558},
year = {2017},
url = {http://arxiv.org/abs/1704.08558},
eprinttype = {arXiv},
eprint = {1704.08558},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BilleGP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BilleCPS17,
author = {Philip Bille and
Anders Roy Christiansen and
Nicola Prezza and
Frederik Rye Skjoldjensen},
title = {Succinct Partial Sums and Fenwick Trees},
journal = {CoRR},
volume = {abs/1705.10987},
year = {2017},
url = {http://arxiv.org/abs/1705.10987},
eprinttype = {arXiv},
eprint = {1705.10987},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BilleCPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BilleEGV17,
author = {Philip Bille and
Mikko Berggren Ettienne and
Inge Li G{\o}rtz and
Hjalte Wedel Vildh{\o}j},
title = {Time-Space Trade-Offs for Lempel-Ziv Compressed Indexing},
journal = {CoRR},
volume = {abs/1706.10094},
year = {2017},
url = {http://arxiv.org/abs/1706.10094},
eprinttype = {arXiv},
eprint = {1706.10094},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BilleEGV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-00275,
author = {Philip Bille and
Anders Roy Christiansen and
Mikko Berggren Ettienne and
Inge Li G{\o}rtz},
title = {Fast Dynamic Arrays},
journal = {CoRR},
volume = {abs/1711.00275},
year = {2017},
url = {http://arxiv.org/abs/1711.00275},
eprinttype = {arXiv},
eprint = {1711.00275},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-00275.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-07270,
author = {Philip Bille and
Travis Gagie and
Inge Li G{\o}rtz and
Nicola Prezza},
title = {A Separation Between Run-Length SLPs and {LZ77}},
journal = {CoRR},
volume = {abs/1711.07270},
year = {2017},
url = {http://arxiv.org/abs/1711.07270},
eprinttype = {arXiv},
eprint = {1711.07270},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-07270.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Bille0GKSV16,
author = {Philip Bille and
Johannes Fischer and
Inge Li G{\o}rtz and
Tsvi Kopelowitz and
Benjamin Sach and
Hjalte Wedel Vildh{\o}j},
title = {Sparse Text Indexing in Small Space},
journal = {{ACM} Trans. Algorithms},
volume = {12},
number = {3},
pages = {39:1--39:19},
year = {2016},
url = {https://doi.org/10.1145/2836166},
doi = {10.1145/2836166},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/Bille0GKSV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BilleGGLW16,
author = {Philip Bille and
Pawel Gawrychowski and
Inge Li G{\o}rtz and
Gad M. Landau and
Oren Weimann},
title = {Longest common extensions in trees},
journal = {Theor. Comput. Sci.},
volume = {638},
pages = {98--107},
year = {2016},
url = {https://doi.org/10.1016/j.tcs.2015.08.009},
doi = {10.1016/J.TCS.2015.08.009},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BilleGGLW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/AmitBCGV16,
author = {Mika Amit and
Philip Bille and
Patrick Hagge Cording and
Inge Li G{\o}rtz and
Hjalte Wedel Vildh{\o}j},
editor = {Roberto Grossi and
Moshe Lewenstein},
title = {Boxed Permutation Pattern Matching},
booktitle = {27th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2016,
June 27-29, 2016, Tel Aviv, Israel},
series = {LIPIcs},
volume = {54},
pages = {20:1--20:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CPM.2016.20},
doi = {10.4230/LIPICS.CPM.2016.20},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/cpm/AmitBCGV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BilleCCG16,
author = {Philip Bille and
Anders Roy Christiansen and
Patrick Hagge Cording and
Inge Li G{\o}rtz},
editor = {Akash Lal and
S. Akshay and
Saket Saurabh and
Sandeep Sen},
title = {Finger Search in Grammar-Compressed Strings},
booktitle = {36th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2016, December 13-15, 2016,
Chennai, India},
series = {LIPIcs},
volume = {65},
pages = {36:1--36:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2016.36},
doi = {10.4230/LIPICS.FSTTCS.2016.36},
timestamp = {Tue, 30 Nov 2021 13:29:05 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/BilleCCG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BilleCGSVV16,
author = {Philip Bille and
Patrick Hagge Cording and
Inge Li G{\o}rtz and
Frederik Rye Skjoldjensen and
Hjalte Wedel Vildh{\o}j and
S{\o}ren Vind},
editor = {Seok{-}Hee Hong},
title = {Dynamic Relative Compression, Dynamic Partial Sums, and Substring
Concatenation},
booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC}
2016, December 12-14, 2016, Sydney, Australia},
series = {LIPIcs},
volume = {64},
pages = {18:1--18:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.18},
doi = {10.4230/LIPICS.ISAAC.2016.18},
timestamp = {Thu, 27 Apr 2023 14:57:19 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BilleCGSVV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/BilleGS16,
author = {Philip Bille and
Inge Li G{\o}rtz and
Frederik Rye Skjoldjensen},
editor = {Rusins Martins Freivalds and
Gregor Engels and
Barbara Catania},
title = {Subsequence Automata with Default Transitions},
booktitle = {{SOFSEM} 2016: Theory and Practice of Computer Science - 42nd International
Conference on Current Trends in Theory and Practice of Computer Science,
Harrachov, Czech Republic, January 23-28, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9587},
pages = {208--216},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-49192-8\_17},
doi = {10.1007/978-3-662-49192-8\_17},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/BilleGS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BilleGP16,
author = {Philip Bille and
Inge Li G{\o}rtz and
Nicola Prezza},
title = {Space-Efficient Re-Pair Compression},
journal = {CoRR},
volume = {abs/1611.01479},
year = {2016},
url = {http://arxiv.org/abs/1611.01479},
eprinttype = {arXiv},
eprint = {1611.01479},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BilleGP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BilleGS16,
author = {Philip Bille and
Inge Li G{\o}rtz and
Frederik Rye Skjoldjensen},
title = {Deterministic Indexing for Packed Strings},
journal = {CoRR},
volume = {abs/1612.01748},
year = {2016},
url = {http://arxiv.org/abs/1612.01748},
eprinttype = {arXiv},
eprint = {1612.01748},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BilleGS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/BilleLMN16,
author = {Philip Bille and
Markus Lohrey and
Sebastian Maneth and
Gonzalo Navarro},
title = {Computation over Compressed Structured Data (Dagstuhl Seminar 16431)},
journal = {Dagstuhl Reports},
volume = {6},
number = {10},
pages = {99--119},
year = {2016},
url = {https://doi.org/10.4230/DagRep.6.10.99},
doi = {10.4230/DAGREP.6.10.99},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/BilleLMN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BilleGLW15,
author = {Philip Bille and
Inge Li G{\o}rtz and
Gad M. Landau and
Oren Weimann},
title = {Tree compression with top trees},
journal = {Inf. Comput.},
volume = {243},
pages = {166--177},
year = {2015},
url = {https://doi.org/10.1016/j.ic.2014.12.012},
doi = {10.1016/J.IC.2014.12.012},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/BilleGLW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BilleLRSSW15,
author = {Philip Bille and
Gad M. Landau and
Rajeev Raman and
Kunihiko Sadakane and
Srinivasa Rao Satti and
Oren Weimann},
title = {Random Access to Grammar-Compressed Strings and Trees},
journal = {{SIAM} J. Comput.},
volume = {44},
number = {3},
pages = {513--539},
year = {2015},
url = {https://doi.org/10.1137/130936889},
doi = {10.1137/130936889},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BilleLRSSW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BilleGGLW15,
author = {Philip Bille and
Pawel Gawrychowski and
Inge Li G{\o}rtz and
Gad M. Landau and
Oren Weimann},
editor = {Ferdinando Cicalese and
Ely Porat and
Ugo Vaccaro},
title = {Longest Common Extensions in Trees},
booktitle = {Combinatorial Pattern Matching - 26th Annual Symposium, {CPM} 2015,
Ischia Island, Italy, June 29 - July 1, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9133},
pages = {52--64},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-19929-0\_5},
doi = {10.1007/978-3-319-19929-0\_5},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/BilleGGLW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BilleGKLV15,
author = {Philip Bille and
Inge Li G{\o}rtz and
Mathias B{\ae}k Tejs Knudsen and
Moshe Lewenstein and
Hjalte Wedel Vildh{\o}j},
editor = {Ferdinando Cicalese and
Ely Porat and
Ugo Vaccaro},
title = {Longest Common Extensions in Sublinear Space},
booktitle = {Combinatorial Pattern Matching - 26th Annual Symposium, {CPM} 2015,
Ischia Island, Italy, June 29 - July 1, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9133},
pages = {65--76},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-19929-0\_6},
doi = {10.1007/978-3-319-19929-0\_6},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/BilleGKLV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lata/BilleGV15,
author = {Philip Bille and
Inge Li G{\o}rtz and
S{\o}ren Vind},
editor = {Adrian{-}Horia Dediu and
Enrico Formenti and
Carlos Mart{\'{\i}}n{-}Vide and
Bianca Truthe},
title = {Compressed Data Structures for Range Searching},
booktitle = {Language and Automata Theory and Applications - 9th International
Conference, {LATA} 2015, Nice, France, March 2-6, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8977},
pages = {577--586},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-15579-1\_45},
doi = {10.1007/978-3-319-15579-1\_45},
timestamp = {Mon, 16 Sep 2019 15:27:03 +0200},
biburl = {https://dblp.org/rec/conf/lata/BilleGV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BilleGKLV15,
author = {Philip Bille and
Inge Li G{\o}rtz and
Mathias B{\ae}k Tejs Knudsen and
Moshe Lewenstein and
Hjalte Wedel Vildh{\o}j},
title = {Longest Common Extensions in Sublinear Space},
journal = {CoRR},
volume = {abs/1504.02671},
year = {2015},
url = {http://arxiv.org/abs/1504.02671},
eprinttype = {arXiv},
eprint = {1504.02671},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BilleGKLV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BilleCGSVV15,
author = {Philip Bille and
Patrick Hagge Cording and
Inge Li G{\o}rtz and
Frederik Rye Skjoldjensen and
Hjalte Wedel Vildh{\o}j and
S{\o}ren Vind},
title = {Dynamic Relative Compression},
journal = {CoRR},
volume = {abs/1504.07851},
year = {2015},
url = {http://arxiv.org/abs/1504.07851},
eprinttype = {arXiv},
eprint = {1504.07851},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BilleCGSVV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BilleCCG15,
author = {Philip Bille and
Anders Roy Christiansen and
Patrick Hagge Cording and
Inge Li G{\o}rtz},
title = {Finger Search, Random Access, and Longest Common Extensions in Grammar-Compressed
Strings},
journal = {CoRR},
volume = {abs/1507.02853},
year = {2015},
url = {http://arxiv.org/abs/1507.02853},
eprinttype = {arXiv},
eprint = {1507.02853},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BilleCCG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BilleGS15,
author = {Philip Bille and
Inge Li G{\o}rtz and
Frederik Rye Skjoldjensen},
title = {Subsequence Automata with Default Transitions},
journal = {CoRR},
volume = {abs/1510.08748},
year = {2015},
url = {http://arxiv.org/abs/1510.08748},
eprinttype = {arXiv},
eprint = {1510.08748},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BilleGS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tinytocs/Bille15,
author = {Philip Bille},
title = {On Regular Expression Matching and Deterministic Finite Automata},
journal = {Tiny Trans. Comput. Sci.},
volume = {3},
year = {2015},
url = {http://tinytocs.org/vol3/papers/TinyToCS\_3\_bille.pdf},
timestamp = {Tue, 14 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tinytocs/Bille15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BilleG14,
author = {Philip Bille and
Inge Li G{\o}rtz},
title = {Substring Range Reporting},
journal = {Algorithmica},
volume = {69},
number = {2},
pages = {384--396},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9733-4},
doi = {10.1007/S00453-012-9733-4},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BilleG14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BilleGSV14,
author = {Philip Bille and
Inge Li G{\o}rtz and
Benjamin Sach and
Hjalte Wedel Vildh{\o}j},
title = {Time-space trade-offs for longest common extensions},
journal = {J. Discrete Algorithms},
volume = {25},
pages = {42--50},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2013.06.003},
doi = {10.1016/J.JDA.2013.06.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BilleGSV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BilleGVV14,
author = {Philip Bille and
Inge Li G{\o}rtz and
Hjalte Wedel Vildh{\o}j and
S{\o}ren Vind},
title = {String Indexing for Patterns with Wildcards},
journal = {Theory Comput. Syst.},
volume = {55},
number = {1},
pages = {41--60},
year = {2014},
url = {https://doi.org/10.1007/s00224-013-9498-4},
doi = {10.1007/S00224-013-9498-4},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BilleGVV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Ben-KikiBBGGW14,
author = {Oren Ben{-}Kiki and
Philip Bille and
Dany Breslauer and
Leszek Gasieniec and
Roberto Grossi and
Oren Weimann},
title = {Towards optimal packed string matching},
journal = {Theor. Comput. Sci.},
volume = {525},
pages = {111--129},
year = {2014},
url = {https://doi.org/10.1016/j.tcs.2013.06.013},
doi = {10.1016/J.TCS.2013.06.013},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Ben-KikiBBGGW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BilleCG14,
author = {Philip Bille and
Patrick Hagge Cording and
Inge Li G{\o}rtz},
title = {Compact q-gram profiling of compressed strings},
journal = {Theor. Comput. Sci.},
volume = {550},
pages = {51--58},
year = {2014},
url = {https://doi.org/10.1016/j.tcs.2014.07.010},
doi = {10.1016/J.TCS.2014.07.010},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BilleCG14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BilleCG14,
author = {Philip Bille and
Patrick Hagge Cording and
Inge Li G{\o}rtz},
editor = {Alexander S. Kulikov and
Sergei O. Kuznetsov and
Pavel A. Pevzner},
title = {Compressed Subsequence Matching and Packed Tree Coloring},
booktitle = {Combinatorial Pattern Matching - 25th Annual Symposium, {CPM} 2014,
Moscow, Russia, June 16-18, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8486},
pages = {40--49},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-07566-2\_5},
doi = {10.1007/978-3-319-07566-2\_5},
timestamp = {Wed, 25 Sep 2019 18:18:47 +0200},
biburl = {https://dblp.org/rec/conf/cpm/BilleCG14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ism/VindBG14,
author = {S{\o}ren Vind and
Philip Bille and
Inge Li G{\o}rtz},
title = {Indexing Motion Detection Data for Surveillance Video},
booktitle = {2014 {IEEE} International Symposium on Multimedia, {ISM} 2014, Taichung,
Taiwan, December 10-12, 2014},
pages = {24--27},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/ISM.2014.36},
doi = {10.1109/ISM.2014.36},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ism/VindBG14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BilleCG14,
author = {Philip Bille and
Patrick Hagge Cording and
Inge Li G{\o}rtz},
title = {Compact Subsequence Matching and Packed Tree Coloring},
journal = {CoRR},
volume = {abs/1403.1065},
year = {2014},
url = {http://arxiv.org/abs/1403.1065},
eprinttype = {arXiv},
eprint = {1403.1065},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BilleCG14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BilleGLW14,
author = {Philip Bille and
Inge Li G{\o}rtz and
Gad M. Landau and
Oren Weimann},
title = {Longest Common Extensions in Trees},
journal = {CoRR},
volume = {abs/1412.1254},
year = {2014},
url = {http://arxiv.org/abs/1412.1254},
eprinttype = {arXiv},
eprint = {1412.1254},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BilleGLW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BilleCG13,
author = {Philip Bille and
Patrick Hagge Cording and
Inge Li G{\o}rtz},
editor = {Johannes Fischer and
Peter Sanders},
title = {Compact q-Gram Profiling of Compressed Strings},
booktitle = {Combinatorial Pattern Matching, 24th Annual Symposium, {CPM} 2013,
Bad Herrenalb, Germany, June 17-19, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7922},
pages = {62--73},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38905-4\_8},
doi = {10.1007/978-3-642-38905-4\_8},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/BilleCG13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BilleFGKSV13,
author = {Philip Bille and
Johannes Fischer and
Inge Li G{\o}rtz and
Tsvi Kopelowitz and
Benjamin Sach and
Hjalte Wedel Vildh{\o}j},
editor = {Fedor V. Fomin and
Rusins Freivalds and
Marta Z. Kwiatkowska and
David Peleg},
title = {Sparse Suffix Tree Construction in Small Space},
booktitle = {Automata, Languages, and Programming - 40th International Colloquium,
{ICALP} 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {7965},
pages = {148--159},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39206-1\_13},
doi = {10.1007/978-3-642-39206-1\_13},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BilleFGKSV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BilleGLW13,
author = {Philip Bille and
Inge Li G{\o}rtz and
Gad M. Landau and
Oren Weimann},
editor = {Fedor V. Fomin and
Rusins Freivalds and
Marta Z. Kwiatkowska and
David Peleg},
title = {Tree Compression with Top Trees},
booktitle = {Automata, Languages, and Programming - 40th International Colloquium,
{ICALP} 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {7965},
pages = {160--171},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39206-1\_14},
doi = {10.1007/978-3-642-39206-1\_14},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/BilleGLW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BilleCGSVV13,
author = {Philip Bille and
Patrick Hagge Cording and
Inge Li G{\o}rtz and
Benjamin Sach and
Hjalte Wedel Vildh{\o}j and
S{\o}ren Vind},
editor = {Frank Dehne and
Roberto Solis{-}Oba and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Fingerprints in Compressed Strings},
booktitle = {Algorithms and Data Structures - 13th International Symposium, {WADS}
2013, London, ON, Canada, August 12-14, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8037},
pages = {146--157},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40104-6\_13},
doi = {10.1007/978-3-642-40104-6\_13},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BilleCGSVV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-5373,
author = {Philip Bille and
Patrick Hagge Cording and
Inge Li G{\o}rtz},
title = {Compact q-gram Profiling of Compressed Strings},
journal = {CoRR},
volume = {abs/1304.5373},
year = {2013},
url = {http://arxiv.org/abs/1304.5373},
eprinttype = {arXiv},
eprint = {1304.5373},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1304-5373.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-5702,
author = {Philip Bille and
Inge Li G{\o}rtz and
Gad M. Landau and
Oren Weimann},
title = {Tree Compression with Top Trees},
journal = {CoRR},
volume = {abs/1304.5702},
year = {2013},
url = {http://arxiv.org/abs/1304.5702},
eprinttype = {arXiv},
eprint = {1304.5702},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1304-5702.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1305-2777,
author = {Philip Bille and
Patrick Hagge Cording and
Inge Li G{\o}rtz and
Benjamin Sach and
Hjalte Wedel Vildh{\o}j and
S{\o}ren Vind},
title = {Fingerprints in Compressed Strings},
journal = {CoRR},
volume = {abs/1305.2777},
year = {2013},
url = {http://arxiv.org/abs/1305.2777},
eprinttype = {arXiv},
eprint = {1305.2777},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1305-2777.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BilleG12,
author = {Philip Bille and
Inge Li G{\o}rtz},
title = {Fast Arc-Annotated Subsequence Matching in Linear Space},
journal = {Algorithmica},
volume = {62},
number = {1-2},
pages = {209--223},
year = {2012},
url = {https://doi.org/10.1007/s00453-010-9451-8},
doi = {10.1007/S00453-010-9451-8},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BilleG12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Bille12,
author = {Philip Bille},
title = {Faster Approximate String Matching for Short Patterns},
journal = {Theory Comput. Syst.},
volume = {50},
number = {3},
pages = {492--515},
year = {2012},
url = {https://doi.org/10.1007/s00224-011-9322-y},
doi = {10.1007/S00224-011-9322-Y},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/Bille12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BilleGVW12,
author = {Philip Bille and
Inge Li G{\o}rtz and
Hjalte Wedel Vildh{\o}j and
David Kofoed Wind},
title = {String matching with variable length gaps},
journal = {Theor. Comput. Sci.},
volume = {443},
pages = {25--34},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2012.03.029},
doi = {10.1016/J.TCS.2012.03.029},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BilleGVW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BilleGSV12,
author = {Philip Bille and
Inge Li G{\o}rtz and
Benjamin Sach and
Hjalte Wedel Vildh{\o}j},
editor = {Juha K{\"{a}}rkk{\"{a}}inen and
Jens Stoye},
title = {Time-Space Trade-Offs for Longest Common Extensions},
booktitle = {Combinatorial Pattern Matching - 23rd Annual Symposium, {CPM} 2012,
Helsinki, Finland, July 3-5, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7354},
pages = {293--305},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31265-6\_24},
doi = {10.1007/978-3-642-31265-6\_24},
timestamp = {Tue, 21 Mar 2023 21:02:12 +0100},
biburl = {https://dblp.org/rec/conf/cpm/BilleGSV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lata/BilleGK12,
author = {Philip Bille and
Inge Li G{\o}rtz and
Jesper Kristensen},
editor = {Adrian{-}Horia Dediu and
Carlos Mart{\'{\i}}n{-}Vide},
title = {Longest Common Extensions via Fingerprinting},
booktitle = {Language and Automata Theory and Applications - 6th International
Conference, {LATA} 2012, {A} Coru{\~{n}}a, Spain, March 5-9, 2012.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7183},
pages = {119--130},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-28332-1\_11},
doi = {10.1007/978-3-642-28332-1\_11},
timestamp = {Sun, 02 Oct 2022 16:11:11 +0200},
biburl = {https://dblp.org/rec/conf/lata/BilleGK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lata/BilleS12,
author = {Philip Bille and
Morten St{\"{o}}ckel},
editor = {Adrian{-}Horia Dediu and
Carlos Mart{\'{\i}}n{-}Vide},
title = {Fast and Cache-Oblivious Dynamic Programming with Local Dependencies},
booktitle = {Language and Automata Theory and Applications - 6th International
Conference, {LATA} 2012, {A} Coru{\~{n}}a, Spain, March 5-9, 2012.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7183},
pages = {131--142},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-28332-1\_12},
doi = {10.1007/978-3-642-28332-1\_12},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lata/BilleS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BilleGVV12,
author = {Philip Bille and
Inge Li G{\o}rtz and
Hjalte Wedel Vildh{\o}j and
S{\o}ren Vind},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {String Indexing for Patterns with Wildcards},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {283--294},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_25},
doi = {10.1007/978-3-642-31155-0\_25},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BilleGVV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-1135,
author = {Philip Bille and
Inge Li G{\o}rtz and
Tsvi Kopelowitz and
Benjamin Sach and
Hjalte Wedel Vildh{\o}j},
title = {Sparse Suffix Tree Construction with Small Space},
journal = {CoRR},
volume = {abs/1207.1135},
year = {2012},
url = {http://arxiv.org/abs/1207.1135},
eprinttype = {arXiv},
eprint = {1207.1135},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1207-1135.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1211-0270,
author = {Philip Bille and
Inge Li G{\o}rtz and
Benjamin Sach and
Hjalte Wedel Vildh{\o}j},
title = {Time-Space Trade-Offs for Longest Common Extensions},
journal = {CoRR},
volume = {abs/1211.0270},
year = {2012},
url = {http://arxiv.org/abs/1211.0270},
eprinttype = {arXiv},
eprint = {1211.0270},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1211-0270.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Bille11,
author = {Philip Bille},
title = {Fast searching in packed strings},
journal = {J. Discrete Algorithms},
volume = {9},
number = {1},
pages = {49--56},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2010.09.003},
doi = {10.1016/J.JDA.2010.09.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Bille11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BilleG11,
author = {Philip Bille and
Inge Li G{\o}rtz},
title = {The tree inclusion problem: In linear space and faster},
journal = {{ACM} Trans. Algorithms},
volume = {7},
number = {3},
pages = {38:1--38:47},
year = {2011},
url = {https://doi.org/10.1145/1978782.1978793},
doi = {10.1145/1978782.1978793},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/BilleG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BilleG11,
author = {Philip Bille and
Inge Li G{\o}rtz},
editor = {Raffaele Giancarlo and
Giovanni Manzini},
title = {Substring Range Reporting},
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 = {299--308},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-21458-5\_26},
doi = {10.1007/978-3-642-21458-5\_26},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/BilleG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Ben-KikiBBGGW11,
author = {Oren Ben{-}Kiki and
Philip Bille and
Dany Breslauer and
Leszek Gasieniec and
Roberto Grossi and
Oren Weimann},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Optimal Packed String Matching},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {423--432},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.423},
doi = {10.4230/LIPICS.FSTTCS.2011.423},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/Ben-KikiBBGGW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BilleLRSSW11,
author = {Philip Bille and
Gad M. Landau and
Rajeev Raman and
Kunihiko Sadakane and
Srinivasa Rao Satti and
Oren Weimann},
editor = {Dana Randall},
title = {Random Access to grammar-Compressed Strings},
booktitle = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25,
2011},
pages = {373--389},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973082.30},
doi = {10.1137/1.9781611973082.30},
timestamp = {Tue, 02 Feb 2021 17:07:23 +0100},
biburl = {https://dblp.org/rec/conf/soda/BilleLRSSW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1108-3683,
author = {Philip Bille and
Inge Li G{\o}rtz},
title = {Substring Range Reporting},
journal = {CoRR},
volume = {abs/1108.3683},
year = {2011},
url = {http://arxiv.org/abs/1108.3683},
eprinttype = {arXiv},
eprint = {1108.3683},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1108-3683.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1110-2893,
author = {Philip Bille and
Inge Li G{\o}rtz and
Hjalte Wedel Vildh{\o}j and
David Kofoed Wind},
title = {String Matching with Variable Length Gaps},
journal = {CoRR},
volume = {abs/1110.2893},
year = {2011},
url = {http://arxiv.org/abs/1110.2893},
eprinttype = {arXiv},
eprint = {1110.2893},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1110-2893.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1110-5236,
author = {Philip Bille and
Inge Li G{\o}rtz and
Hjalte Wedel Vildh{\o}j and
S{\o}ren Vind},
title = {String Indexing for Patterns with Wildcards},
journal = {CoRR},
volume = {abs/1110.5236},
year = {2011},
url = {http://arxiv.org/abs/1110.5236},
eprinttype = {arXiv},
eprint = {1110.5236},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1110-5236.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BilleT10,
author = {Philip Bille and
Mikkel Thorup},
editor = {Moses Charikar},
title = {Regular Expression Matching with Multi-Strings and Intervals},
booktitle = {Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010},
pages = {1297--1308},
publisher = {{SIAM}},
year = {2010},
url = {https://doi.org/10.1137/1.9781611973075.104},
doi = {10.1137/1.9781611973075.104},
timestamp = {Tue, 02 Feb 2021 17:07:39 +0100},
biburl = {https://dblp.org/rec/conf/soda/BilleT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/BilleG10,
author = {Philip Bille and
Inge Li G{\o}rtz},
editor = {Jan van Leeuwen and
Anca Muscholl and
David Peleg and
Jaroslav Pokorn{\'{y}} and
Bernhard Rumpe},
title = {Fast Arc-Annotated Subsequence Matching in Linear Space},
booktitle = {{SOFSEM} 2010: Theory and Practice of Computer Science, 36th Conference
on Current Trends in Theory and Practice of Computer Science, Spindleruv
Ml{\'{y}}n, Czech Republic, January 23-29, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5901},
pages = {188--199},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-11266-9\_16},
doi = {10.1007/978-3-642-11266-9\_16},
timestamp = {Sat, 30 Sep 2023 09:57:10 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/BilleG10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/BilleGVW10,
author = {Philip Bille and
Inge Li G{\o}rtz and
Hjalte Wedel Vildh{\o}j and
David Kofoed Wind},
editor = {Edgar Ch{\'{a}}vez and
Stefano Lonardi},
title = {String Matching with Variable Length Gaps},
booktitle = {String Processing and Information Retrieval - 17th International Symposium,
{SPIRE} 2010, Los Cabos, Mexico, October 11-13, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6393},
pages = {385--394},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-16321-0\_40},
doi = {10.1007/978-3-642-16321-0\_40},
timestamp = {Sat, 05 Sep 2020 18:08:29 +0200},
biburl = {https://dblp.org/rec/conf/spire/BilleGVW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1001-1565,
author = {Philip Bille and
Gad M. Landau and
Oren Weimann},
title = {Random Access to Grammar Compressed Strings},
journal = {CoRR},
volume = {abs/1001.1565},
year = {2010},
url = {http://arxiv.org/abs/1001.1565},
eprinttype = {arXiv},
eprint = {1001.1565},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1001-1565.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BilleG09,
author = {Philip Bille and
Inge Li G{\o}rtz},
title = {Matching subsequences in trees},
journal = {J. Discrete Algorithms},
volume = {7},
number = {3},
pages = {306--314},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.11.005},
doi = {10.1016/J.JDA.2008.11.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BilleG09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BilleFG09,
author = {Philip Bille and
Rolf Fagerberg and
Inge Li G{\o}rtz},
title = {Improved approximate string matching and regular expression matching
on Ziv-Lempel compressed texts},
journal = {{ACM} Trans. Algorithms},
volume = {6},
number = {1},
pages = {3:1--3:14},
year = {2009},
url = {https://doi.org/10.1145/1644015.1644018},
doi = {10.1145/1644015.1644018},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/BilleFG09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/Bille09,
author = {Philip Bille},
editor = {Gregory Kucherov and
Esko Ukkonen},
title = {Fast Searching in Packed Strings},
booktitle = {Combinatorial Pattern Matching, 20th Annual Symposium, {CPM} 2009,
Lille, France, June 22-24, 2009, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5577},
pages = {116--126},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02441-2\_11},
doi = {10.1007/978-3-642-02441-2\_11},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/cpm/Bille09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BilleT09,
author = {Philip Bille and
Mikkel Thorup},
editor = {Susanne Albers and
Alberto Marchetti{-}Spaccamela and
Yossi Matias and
Sotiris E. Nikoletseas and
Wolfgang Thomas},
title = {Faster Regular Expression Matching},
booktitle = {Automata, Languages and Programming, 36th International Colloquium,
{ICALP} 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {5555},
pages = {171--182},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02927-1\_16},
doi = {10.1007/978-3-642-02927-1\_16},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BilleT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0907-3135,
author = {Philip Bille},
title = {Fast Searching in Packed Strings},
journal = {CoRR},
volume = {abs/0907.3135},
year = {2009},
url = {http://arxiv.org/abs/0907.3135},
eprinttype = {arXiv},
eprint = {0907.3135},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0907-3135.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0911-0577,
author = {Philip Bille and
Inge Li G{\o}rtz},
title = {Fast Arc-Annotated Subsequence Matching in Linear Space},
journal = {CoRR},
volume = {abs/0911.0577},
year = {2009},
url = {http://arxiv.org/abs/0911.0577},
eprinttype = {arXiv},
eprint = {0911.0577},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0911-0577.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BilleF08,
author = {Philip Bille and
Martin Farach{-}Colton},
title = {Fast and compact regular expression matching},
journal = {Theor. Comput. Sci.},
volume = {409},
number = {3},
pages = {486--496},
year = {2008},
url = {https://doi.org/10.1016/j.tcs.2008.08.042},
doi = {10.1016/J.TCS.2008.08.042},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BilleF08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0811-3490,
author = {Philip Bille},
title = {Faster Approximate String Matching for Short Patterns},
journal = {CoRR},
volume = {abs/0811.3490},
year = {2008},
url = {http://arxiv.org/abs/0811.3490},
eprinttype = {arXiv},
eprint = {0811.3490},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0811-3490.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BilleFG07,
author = {Philip Bille and
Rolf Fagerberg and
Inge Li G{\o}rtz},
editor = {Bin Ma and
Kaizhong Zhang},
title = {Improved Approximate String Matching and Regular Expression Matching
on Ziv-Lempel Compressed Texts},
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 = {52--62},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73437-6\_8},
doi = {10.1007/978-3-540-73437-6\_8},
timestamp = {Mon, 13 Mar 2023 16:58:28 +0100},
biburl = {https://dblp.org/rec/conf/cpm/BilleFG07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BillePP07,
author = {Philip Bille and
Anna Pagh and
Rasmus Pagh},
editor = {Takeshi Tokuyama},
title = {Fast Evaluation of Union-Intersection Expressions},
booktitle = {Algorithms and Computation, 18th International Symposium, {ISAAC}
2007, Sendai, Japan, December 17-19, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4835},
pages = {739--750},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77120-3\_64},
doi = {10.1007/978-3-540-77120-3\_64},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BillePP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0708-3259,
author = {Philip Bille and
Anna Pagh and
Rasmus Pagh},
title = {Fast evaluation of union-intersection expressions},
journal = {CoRR},
volume = {abs/0708.3259},
year = {2007},
url = {http://arxiv.org/abs/0708.3259},
eprinttype = {arXiv},
eprint = {0708.3259},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0708-3259.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0708-4288,
author = {Philip Bille},
title = {Pattern Matching in Trees and Strings},
journal = {CoRR},
volume = {abs/0708.4288},
year = {2007},
url = {http://arxiv.org/abs/0708.4288},
eprinttype = {arXiv},
eprint = {0708.4288},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0708-4288.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BilleG06,
author = {Philip Bille and
Inge Li G{\o}rtz},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {Matching Subsequences in Trees},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {248--259},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_25},
doi = {10.1007/11758471\_25},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BilleG06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Bille06,
author = {Philip Bille},
editor = {Michele Bugliesi and
Bart Preneel and
Vladimiro Sassone and
Ingo Wegener},
title = {New Algorithms for Regular Expression Matching},
booktitle = {Automata, Languages and Programming, 33rd International Colloquium,
{ICALP} 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {4051},
pages = {643--654},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11786986\_56},
doi = {10.1007/11786986\_56},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Bille06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icpr/KuijperOBG06,
author = {Arjan Kuijper and
Ole Fogh Olsen and
Philip Bille and
Peter J. Giblin},
title = {Matching 2D Shapes using their Symmetry Sets},
booktitle = {18th International Conference on Pattern Recognition {(ICPR} 2006),
20-24 August 2006, Hong Kong, China},
pages = {179--182},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/ICPR.2006.782},
doi = {10.1109/ICPR.2006.782},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icpr/KuijperOBG06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0606116,
author = {Philip Bille},
title = {New Algorithms for Regular Expression Matching},
journal = {CoRR},
volume = {abs/cs/0606116},
year = {2006},
url = {http://arxiv.org/abs/cs/0606116},
eprinttype = {arXiv},
eprint = {cs/0606116},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0606116.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0608124,
author = {Philip Bille and
Inge Li G{\o}rtz},
title = {The Tree Inclusion Problem: In Linear Space and Faster},
journal = {CoRR},
volume = {abs/cs/0608124},
year = {2006},
url = {http://arxiv.org/abs/cs/0608124},
eprinttype = {arXiv},
eprint = {cs/0608124},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0608124.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0609085,
author = {Philip Bille and
Rolf Fagerberg and
Inge Li G{\o}rtz},
title = {Improved Approximate String Matching and Regular Expression Matching
on Ziv-Lempel Compressed Texts},
journal = {CoRR},
volume = {abs/cs/0609085},
year = {2006},
url = {http://arxiv.org/abs/cs/0609085},
eprinttype = {arXiv},
eprint = {cs/0609085},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0609085.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/AlstrupBR05,
author = {Stephen Alstrup and
Philip Bille and
Theis Rauhe},
title = {Labeling Schemes for Small Distances in Trees},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {2},
pages = {448--462},
year = {2005},
url = {https://doi.org/10.1137/S0895480103433409},
doi = {10.1137/S0895480103433409},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/AlstrupBR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Bille05,
author = {Philip Bille},
title = {A survey on tree edit distance and related problems},
journal = {Theor. Comput. Sci.},
volume = {337},
number = {1-3},
pages = {217--239},
year = {2005},
url = {https://doi.org/10.1016/j.tcs.2004.12.030},
doi = {10.1016/J.TCS.2004.12.030},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Bille05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BilleG05,
author = {Philip Bille and
Inge Li G{\o}rtz},
editor = {Lu{\'{\i}}s Caires and
Giuseppe F. Italiano and
Lu{\'{\i}}s Monteiro and
Catuscia Palamidessi and
Moti Yung},
title = {The Tree Inclusion Problem: In Optimal Space and Faster},
booktitle = {Automata, Languages and Programming, 32nd International Colloquium,
{ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3580},
pages = {66--77},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11523468\_6},
doi = {10.1007/11523468\_6},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BilleG05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0509069,
author = {Philip Bille and
Martin Farach{-}Colton},
title = {Fast and Compact Regular Expression Matching},
journal = {CoRR},
volume = {abs/cs/0509069},
year = {2005},
url = {http://arxiv.org/abs/cs/0509069},
eprinttype = {arXiv},
eprint = {cs/0509069},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0509069.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0512061,
author = {Philip Bille and
Inge Li G{\o}rtz},
title = {Matching Subsequences in Trees},
journal = {CoRR},
volume = {abs/cs/0512061},
year = {2005},
url = {http://arxiv.org/abs/cs/0512061},
eprinttype = {arXiv},
eprint = {cs/0512061},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0512061.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eccv/KuijperOGBN04,
author = {Arjan Kuijper and
Ole Fogh Olsen and
Peter J. Giblin and
Philip Bille and
Mads Nielsen},
editor = {Tom{\'{a}}s Pajdla and
Jiri Matas},
title = {From a 2D Shape to a String Structure Using the Symmetry Set},
booktitle = {Computer Vision - {ECCV} 2004, 8th European Conference on Computer
Vision, Prague, Czech Republic, May 11-14, 2004. Proceedings, Part
{II}},
series = {Lecture Notes in Computer Science},
volume = {3022},
pages = {313--325},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24671-8\_25},
doi = {10.1007/978-3-540-24671-8\_25},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/eccv/KuijperOGBN04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AlstrupBR03,
author = {Stephen Alstrup and
Philip Bille and
Theis Rauhe},
title = {Labeling schemes for small distances in trees},
booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}},
pages = {689--698},
publisher = {{ACM/SIAM}},
year = {2003},
url = {http://dl.acm.org/citation.cfm?id=644108.644220},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/AlstrupBR03.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-07 22:30 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:
