Petra Berenbrink
Finding Frequent Patterns in a String in Sublinear Time
Berenbrink, Petra; Ergun, Funda; Friedetzky, Tom
Citation
Berenbrink, P., Ergun, F., & Friedetzky, T. (2005). Finding Frequent Patterns in a String in Sublinear Time. In Algorithms – ESA 2005. https://doi.org/10.1007/11561071_66
Publication Date | 2005 |
---|---|
Deposit Date | Apr 24, 2017 |
Series Number | 3669 |
Book Title | Algorithms – ESA 2005 |
ISBN | 978-3-540-29118-3 |
DOI | https://doi.org/10.1007/11561071_66 |
You might also like
Infinite Balanced Allocation via Finite Capacities
(2021)
Conference Proceeding
Randomized renaming in shared memory systems
(2021)
Journal Article
Time-space trade-offs in population protocols for the majority problem
(2020)
Journal Article
Tight & Simple Load Balancing
(2019)
Conference Proceeding
Self-Stabilizing Balls and Bins in Batches
(2018)
Journal Article
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search