BibTeX records: Benjamin Sach

download as .bib file

@article{DBLP:journals/toc/CliffordJS19,
  author       = {Rapha{\"{e}}l Clifford and
                  Markus Jalsenius and
                  Benjamin Sach},
  title        = {Time Bounds for Streaming Problems},
  journal      = {Theory Comput.},
  volume       = {15},
  pages        = {1--31},
  year         = {2019},
  url          = {https://doi.org/10.4086/toc.2019.v015a002},
  doi          = {10.4086/TOC.2019.V015A002},
  timestamp    = {Tue, 09 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/toc/CliffordJS19.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/prl/McVicarSMLSB16,
  author       = {Matt McVicar and
                  Benjamin Sach and
                  C{\'{e}}dric Mesnage and
                  Jefrey Lijffijt and
                  Eirini Spyropoulou and
                  Tijl De Bie},
  title        = {SuMoTED: An intuitive edit distance between rooted unordered uniquely-labelled
                  trees},
  journal      = {Pattern Recognit. Lett.},
  volume       = {79},
  pages        = {52--59},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.patrec.2016.04.012},
  doi          = {10.1016/J.PATREC.2016.04.012},
  timestamp    = {Sat, 22 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/prl/McVicarSMLSB16.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}
}
@inproceedings{DBLP:conf/esa/CliffordJS16,
  author       = {Rapha{\"{e}}l Clifford and
                  Markus Jalsenius and
                  Benjamin Sach},
  editor       = {Piotr Sankowski and
                  Christos D. Zaroliagis},
  title        = {Cell-Probe Lower Bounds for Bit Stream Computation},
  booktitle    = {24th Annual European Symposium on Algorithms, {ESA} 2016, August 22-24,
                  2016, Aarhus, Denmark},
  series       = {LIPIcs},
  volume       = {57},
  pages        = {31:1--31:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2016},
  url          = {https://doi.org/10.4230/LIPIcs.ESA.2016.31},
  doi          = {10.4230/LIPICS.ESA.2016.31},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/esa/CliffordJS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CliffordFPSS16,
  author       = {Rapha{\"{e}}l Clifford and
                  Allyx Fontaine and
                  Ely Porat and
                  Benjamin Sach and
                  Tatiana Starikovskaya},
  editor       = {Robert Krauthgamer},
  title        = {The \emph{k}-mismatch problem revisited},
  booktitle    = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
  pages        = {2039--2052},
  publisher    = {{SIAM}},
  year         = {2016},
  url          = {https://doi.org/10.1137/1.9781611974331.ch142},
  doi          = {10.1137/1.9781611974331.CH142},
  timestamp    = {Tue, 02 Feb 2021 17:07:56 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/CliffordFPSS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/Longo0MOSS16,
  author       = {Jake Longo and
                  Daniel P. Martin and
                  Luke Mather and
                  Elisabeth Oswald and
                  Benjamin Sach and
                  Martijn Stam},
  title        = {How low can you go? Using side-channel data to enhance brute-force
                  key recovery},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {609},
  year         = {2016},
  url          = {http://eprint.iacr.org/2016/609},
  timestamp    = {Mon, 11 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/Longo0MOSS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/CliffordFPSS15,
  author       = {Rapha{\"{e}}l Clifford and
                  Allyx Fontaine and
                  Ely Porat and
                  Benjamin Sach and
                  Tatiana Starikovskaya},
  editor       = {Nikhil Bansal and
                  Irene Finocchi},
  title        = {Dictionary Matching in a Stream},
  booktitle    = {Algorithms - {ESA} 2015 - 23rd Annual European Symposium, Patras,
                  Greece, September 14-16, 2015, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {9294},
  pages        = {361--372},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-662-48350-3\_31},
  doi          = {10.1007/978-3-662-48350-3\_31},
  timestamp    = {Tue, 15 Feb 2022 07:54:27 +0100},
  biburl       = {https://dblp.org/rec/conf/esa/CliffordFPSS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CliffordJS15,
  author       = {Rapha{\"{e}}l Clifford and
                  Markus Jalsenius and
                  Benjamin Sach},
  editor       = {Piotr Indyk},
  title        = {Cell-probe bounds for online edit distance and other pattern matching
                  problems},
  booktitle    = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
  pages        = {552--561},
  publisher    = {{SIAM}},
  year         = {2015},
  url          = {https://doi.org/10.1137/1.9781611973730.37},
  doi          = {10.1137/1.9781611973730.37},
  timestamp    = {Tue, 02 Feb 2021 17:07:30 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/CliffordJS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/GawrychowskiKSS15,
  author       = {Pawel Gawrychowski and
                  Gregory Kucherov and
                  Benjamin Sach and
                  Tatiana Starikovskaya},
  editor       = {Costas S. Iliopoulos and
                  Simon J. Puglisi and
                  Emine Yilmaz},
  title        = {Computing the Longest Unbordered Substring},
  booktitle    = {String Processing and Information Retrieval - 22nd International Symposium,
                  {SPIRE} 2015, London, UK, September 1-4, 2015, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {9309},
  pages        = {246--257},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-319-23826-5\_24},
  doi          = {10.1007/978-3-319-23826-5\_24},
  timestamp    = {Tue, 15 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/spire/GawrychowskiKSS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CliffordJS15,
  author       = {Rapha{\"{e}}l Clifford and
                  Markus Jalsenius and
                  Benjamin Sach},
  title        = {The complexity of computation in bit streams},
  journal      = {CoRR},
  volume       = {abs/1504.00834},
  year         = {2015},
  url          = {http://arxiv.org/abs/1504.00834},
  eprinttype    = {arXiv},
  eprint       = {1504.00834},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/CliffordJS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CliffordFPSS15,
  author       = {Rapha{\"{e}}l Clifford and
                  Allyx Fontaine and
                  Ely Porat and
                  Benjamin Sach and
                  Tatiana Starikovskaya},
  title        = {Dictionary matching in a stream},
  journal      = {CoRR},
  volume       = {abs/1504.06242},
  year         = {2015},
  url          = {http://arxiv.org/abs/1504.06242},
  eprinttype    = {arXiv},
  eprint       = {1504.06242},
  timestamp    = {Tue, 15 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/CliffordFPSS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CliffordFPSS15a,
  author       = {Rapha{\"{e}}l Clifford and
                  Allyx Fontaine and
                  Ely Porat and
                  Benjamin Sach and
                  Tatiana Starikovskaya},
  title        = {The k-mismatch problem revisited},
  journal      = {CoRR},
  volume       = {abs/1508.00731},
  year         = {2015},
  url          = {http://arxiv.org/abs/1508.00731},
  eprinttype    = {arXiv},
  eprint       = {1508.00731},
  timestamp    = {Tue, 15 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/CliffordFPSS15a.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/corr/CliffordJS14,
  author       = {Rapha{\"{e}}l Clifford and
                  Markus Jalsenius and
                  Benjamin Sach},
  title        = {Cell-Probe Bounds for Online Edit Distance and Other Pattern Matching
                  Problems},
  journal      = {CoRR},
  volume       = {abs/1407.6559},
  year         = {2014},
  url          = {http://arxiv.org/abs/1407.6559},
  eprinttype    = {arXiv},
  eprint       = {1407.6559},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/CliffordJS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CliffordJS14a,
  author       = {Rapha{\"{e}}l Clifford and
                  Markus Jalsenius and
                  Benjamin Sach},
  title        = {Time Bounds for Streaming Problems},
  journal      = {CoRR},
  volume       = {abs/1412.6935},
  year         = {2014},
  url          = {http://arxiv.org/abs/1412.6935},
  eprinttype    = {arXiv},
  eprint       = {1412.6935},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/CliffordJS14a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ButmanCCJLPPS13,
  author       = {Ayelet Butman and
                  Peter Clifford and
                  Rapha{\"{e}}l Clifford and
                  Markus Jalsenius and
                  Noa Lewenstein and
                  Benny Porat and
                  Ely Porat and
                  Benjamin Sach},
  title        = {Pattern Matching under Polynomial Transformation},
  journal      = {{SIAM} J. Comput.},
  volume       = {42},
  number       = {2},
  pages        = {611--633},
  year         = {2013},
  url          = {https://doi.org/10.1137/110853327},
  doi          = {10.1137/110853327},
  timestamp    = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/ButmanCCJLPPS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CliffordJPS13,
  author       = {Rapha{\"{e}}l Clifford and
                  Markus Jalsenius and
                  Ely Porat and
                  Benjamin Sach},
  title        = {Space lower bounds for online pattern matching},
  journal      = {Theor. Comput. Sci.},
  volume       = {483},
  pages        = {68--74},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2012.06.012},
  doi          = {10.1016/J.TCS.2012.06.012},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/CliffordJPS13.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/soda/CliffordJS13,
  author       = {Rapha{\"{e}}l Clifford and
                  Markus Jalsenius and
                  Benjamin Sach},
  editor       = {Sanjeev Khanna},
  title        = {Tight Cell-Probe Bounds for Online Hamming Distance Computation},
  booktitle    = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2013, New Orleans, Louisiana, USA, January 6-8,
                  2013},
  pages        = {664--674},
  publisher    = {{SIAM}},
  year         = {2013},
  url          = {https://doi.org/10.1137/1.9781611973105.48},
  doi          = {10.1137/1.9781611973105.48},
  timestamp    = {Tue, 02 Feb 2021 17:07:29 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/CliffordJS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/JalseniusPS13,
  author       = {Markus Jalsenius and
                  Benny Porat and
                  Benjamin Sach},
  editor       = {Natacha Portier and
                  Thomas Wilke},
  title        = {Parameterized Matching in the Streaming Model},
  booktitle    = {30th International Symposium on Theoretical Aspects of Computer Science,
                  {STACS} 2013, February 27 - March 2, 2013, Kiel, Germany},
  series       = {LIPIcs},
  volume       = {20},
  pages        = {400--411},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2013},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2013.400},
  doi          = {10.4230/LIPICS.STACS.2013.400},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/JalseniusPS13.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-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/mst/CliffordJMS12,
  author       = {Rapha{\"{e}}l Clifford and
                  Markus Jalsenius and
                  Ashley Montanaro and
                  Benjamin Sach},
  title        = {The Complexity of Flood Filling Games},
  journal      = {Theory Comput. Syst.},
  volume       = {50},
  number       = {1},
  pages        = {72--92},
  year         = {2012},
  url          = {https://doi.org/10.1007/s00224-011-9339-2},
  doi          = {10.1007/S00224-011-9339-2},
  timestamp    = {Sat, 24 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mst/CliffordJMS12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/CliffordJPS12,
  author       = {Rapha{\"{e}}l Clifford and
                  Markus Jalsenius and
                  Ely Porat and
                  Benjamin Sach},
  editor       = {Juha K{\"{a}}rkk{\"{a}}inen and
                  Jens Stoye},
  title        = {Pattern Matching in Multiple Streams},
  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        = {97--109},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-31265-6\_8},
  doi          = {10.1007/978-3-642-31265-6\_8},
  timestamp    = {Tue, 21 Mar 2023 21:02:12 +0100},
  biburl       = {https://dblp.org/rec/conf/cpm/CliffordJPS12.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    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/cpm/BilleGSV12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-3470,
  author       = {Rapha{\"{e}}l Clifford and
                  Markus Jalsenius and
                  Ely Porat and
                  Benjamin Sach},
  title        = {Pattern Matching in Multiple Streams},
  journal      = {CoRR},
  volume       = {abs/1202.3470},
  year         = {2012},
  url          = {http://arxiv.org/abs/1202.3470},
  eprinttype    = {arXiv},
  eprint       = {1202.3470},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1202-3470.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-1207-1885,
  author       = {Rapha{\"{e}}l Clifford and
                  Markus Jalsenius and
                  Benjamin Sach},
  title        = {Tight Cell-Probe Bounds for Online Hamming Distance Computation},
  journal      = {CoRR},
  volume       = {abs/1207.1885},
  year         = {2012},
  url          = {http://arxiv.org/abs/1207.1885},
  eprinttype    = {arXiv},
  eprint       = {1207.1885},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1207-1885.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/CliffordS11,
  author       = {Rapha{\"{e}}l Clifford and
                  Benjamin Sach},
  title        = {Pattern matching in pseudo real-time},
  journal      = {J. Discrete Algorithms},
  volume       = {9},
  number       = {1},
  pages        = {67--81},
  year         = {2011},
  url          = {https://doi.org/10.1016/j.jda.2010.09.005},
  doi          = {10.1016/J.JDA.2010.09.005},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/CliffordS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/CliffordJPS11,
  author       = {Rapha{\"{e}}l Clifford and
                  Markus Jalsenius and
                  Ely Porat and
                  Benjamin Sach},
  editor       = {Raffaele Giancarlo and
                  Giovanni Manzini},
  title        = {Space Lower Bounds for Online Pattern Matching},
  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        = {184--196},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-21458-5\_17},
  doi          = {10.1007/978-3-642-21458-5\_17},
  timestamp    = {Tue, 14 May 2019 10:00:38 +0200},
  biburl       = {https://dblp.org/rec/conf/cpm/CliffordJPS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1106-4412,
  author       = {Rapha{\"{e}}l Clifford and
                  Markus Jalsenius and
                  Ely Porat and
                  Benjamin Sach},
  title        = {Space Lower Bounds for Online Pattern Matching},
  journal      = {CoRR},
  volume       = {abs/1106.4412},
  year         = {2011},
  url          = {http://arxiv.org/abs/1106.4412},
  eprinttype    = {arXiv},
  eprint       = {1106.4412},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1106-4412.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1109-1494,
  author       = {Ayelet Butman and
                  Peter Clifford and
                  Rapha{\"{e}}l Clifford and
                  Markus Jalsenius and
                  Noa Lewenstein and
                  Benny Porat and
                  Ely Porat and
                  Benjamin Sach},
  title        = {Pattern Matching under Polynomial Transformation},
  journal      = {CoRR},
  volume       = {abs/1109.1494},
  year         = {2011},
  url          = {http://arxiv.org/abs/1109.1494},
  eprinttype    = {arXiv},
  eprint       = {1109.1494},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1109-1494.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1109-5269,
  author       = {Rapha{\"{e}}l Clifford and
                  Markus Jalsenius and
                  Benjamin Sach},
  title        = {Streaming Pattern Matching with Relabelling},
  journal      = {CoRR},
  volume       = {abs/1109.5269},
  year         = {2011},
  url          = {http://arxiv.org/abs/1109.5269},
  eprinttype    = {arXiv},
  eprint       = {1109.5269},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1109-5269.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/ethos/Sach10,
  author       = {Benjamin Sach},
  title        = {Approximate and pseudo real-time pattern matching},
  school       = {University of Bristol, {UK}},
  year         = {2010},
  url          = {https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.539773},
  timestamp    = {Tue, 05 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/phd/ethos/Sach10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CliffordS10,
  author       = {Rapha{\"{e}}l Clifford and
                  Benjamin Sach},
  title        = {Permuted function matching},
  journal      = {Inf. Process. Lett.},
  volume       = {110},
  number       = {22},
  pages        = {1012--1015},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.ipl.2010.08.017},
  doi          = {10.1016/J.IPL.2010.08.017},
  timestamp    = {Tue, 06 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/CliffordS10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/CliffordS10,
  author       = {Rapha{\"{e}}l Clifford and
                  Benjamin Sach},
  editor       = {Amihood Amir and
                  Laxmi Parida},
  title        = {Pseudo-realtime Pattern Matching: Closing the Gap},
  booktitle    = {Combinatorial Pattern Matching, 21st Annual Symposium, {CPM} 2010,
                  New York, NY, USA, June 21-23, 2010. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6129},
  pages        = {101--111},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-13509-5\_10},
  doi          = {10.1007/978-3-642-13509-5\_10},
  timestamp    = {Tue, 14 May 2019 10:00:38 +0200},
  biburl       = {https://dblp.org/rec/conf/cpm/CliffordS10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/ArthurCJMS10,
  author       = {David Arthur and
                  Rapha{\"{e}}l Clifford and
                  Markus Jalsenius and
                  Ashley Montanaro and
                  Benjamin Sach},
  editor       = {Paolo Boldi and
                  Luisa Gargano},
  title        = {The Complexity of Flood Filling Games},
  booktitle    = {Fun with Algorithms, 5th International Conference, {FUN} 2010, Ischia,
                  Italy, June 2-4, 2010. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6099},
  pages        = {307--318},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-13122-6\_30},
  doi          = {10.1007/978-3-642-13122-6\_30},
  timestamp    = {Tue, 14 May 2019 10:00:45 +0200},
  biburl       = {https://dblp.org/rec/conf/fun/ArthurCJMS10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1001-4420,
  author       = {David Arthur and
                  Rapha{\"{e}}l Clifford and
                  Markus Jalsenius and
                  Ashley Montanaro and
                  Benjamin Sach},
  title        = {The Complexity of Flood Filling Games},
  journal      = {CoRR},
  volume       = {abs/1001.4420},
  year         = {2010},
  url          = {http://arxiv.org/abs/1001.4420},
  eprinttype    = {arXiv},
  eprint       = {1001.4420},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1001-4420.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/CliffordS09,
  author       = {Rapha{\"{e}}l Clifford and
                  Benjamin Sach},
  editor       = {Gregory Kucherov and
                  Esko Ukkonen},
  title        = {Online Approximate Matching with Non-local Distances},
  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        = {142--153},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-02441-2\_13},
  doi          = {10.1007/978-3-642-02441-2\_13},
  timestamp    = {Tue, 14 May 2019 10:00:38 +0200},
  biburl       = {https://dblp.org/rec/conf/cpm/CliffordS09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/CliffordHPS09,
  author       = {Rapha{\"{e}}l Clifford and
                  Aram W. Harrow and
                  Alexandru Popa and
                  Benjamin Sach},
  editor       = {Jussi Karlgren and
                  Jorma Tarhio and
                  Heikki Hyyr{\"{o}}},
  title        = {Generalised Matching},
  booktitle    = {String Processing and Information Retrieval, 16th International Symposium,
                  {SPIRE} 2009, Saariselk{\"{a}}, Finland, August 25-27, 2009,
                  Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5721},
  pages        = {295--301},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03784-9\_29},
  doi          = {10.1007/978-3-642-03784-9\_29},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/spire/CliffordHPS09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0802-1026,
  author       = {Benjamin Sach and
                  Rapha{\"{e}}l Clifford},
  title        = {An Empirical Study of Cache-Oblivious Priority Queues and their Application
                  to the Shortest Path Problem},
  journal      = {CoRR},
  volume       = {abs/0802.1026},
  year         = {2008},
  url          = {http://arxiv.org/abs/0802.1026},
  eprinttype    = {arXiv},
  eprint       = {0802.1026},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-0802-1026.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/CliffordS07,
  author       = {Rapha{\"{e}}l Clifford and
                  Benjamin Sach},
  editor       = {Jan van Leeuwen and
                  Giuseppe F. Italiano and
                  Wiebe van der Hoek and
                  Christoph Meinel and
                  Harald Sack and
                  Frantisek Pl{\'{a}}sil},
  title        = {Fast Approximate Point Set Matching for Information Retrieval},
  booktitle    = {{SOFSEM} 2007: Theory and Practice of Computer Science, 33rd Conference
                  on Current Trends in Theory and Practice of Computer Science, Harrachov,
                  Czech Republic, January 20-26, 2007, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4362},
  pages        = {212--223},
  publisher    = {Springer},
  year         = {2007},
  url          = {https://doi.org/10.1007/978-3-540-69507-3\_17},
  doi          = {10.1007/978-3-540-69507-3\_17},
  timestamp    = {Fri, 21 Oct 2022 16:47:28 +0200},
  biburl       = {https://dblp.org/rec/conf/sofsem/CliffordS07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics