Philip Bille
Philip Bille
Bekræftet mail på - Startside
Citeret af
Citeret af
A survey on tree edit distance and related problems
P Bille
Theoretical computer science 337 (1-3), 217-239, 2005
Random access to grammar-compressed strings and trees
P Bille, GM Landau, R Raman, K Sadakane, SR Satti, O Weimann
SIAM Journal on Computing 44 (3), 513-539, 2015
Labeling schemes for small distances in trees
S Alstrup, P Bille, T Rauhe
SIAM Journal on Discrete Mathematics 19 (2), 448-462, 2005
String matching with variable length gaps
P Bille, IL Gørtz, HW Vildhøj, DK Wind
Theoretical Computer Science 443, 25-34, 2012
Fast and compact regular expression matching
P Bille, M Farach-Colton
Theoretical Computer Science 409 (3), 486-496, 2008
Tree compression with top trees
P Bille, IL Gørtz, GM Landau, O Weimann
Information and Computation 243, 166-177, 2015
Time–space trade-offs for longest common extensions
P Bille, IL Gørtz, B Sach, HW Vildhøj
Journal of Discrete Algorithms 25, 42-50, 2014
Fast evaluation of union-intersection expressions
P Bille, A Pagh, R Pagh
International Symposium on Algorithms and Computation, 739-750, 2007
The tree inclusion problem: In optimal space and faster
P Bille, I Li Gørtz
Automata, Languages and Programming, 61-61, 2005
Regular expression matching with multi-strings and intervals
P Bille, M Thorup
Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010
String indexing for patterns with wildcards
P Bille, IL Gørtz, HW Vildhøj, S Vind
Theory of Computing Systems 55 (1), 41-60, 2014
Time–space trade-offs for lempel–Ziv compressed indexing
P Bille, MB Ettienne, IL Gørtz, HW Vildhøj
Theoretical Computer Science 713, 66-77, 2018
Sparse text indexing in small space
P Bille, J Fischer, IL Gørtz, T Kopelowitz, B Sach, HW Vildhøj
ACM Transactions on Algorithms (TALG) 12 (3), 1-19, 2016
Faster regular expression matching
P Bille, M Thorup
International Colloquium on Automata, Languages, and Programming, 171-182, 2009
Space-efficient re-pair compression
P Bille, IL Gørtz, N Prezza
2017 Data Compression Conference (DCC), 171-180, 2017
Fingerprints in compressed strings
P Bille, IL Gørtz, PH Cording, B Sach, HW Vildhøj, S Vind
Journal of Computer and System Sciences 86, 171-180, 2017
Longest common extensions in sublinear space
P Bille, IL Gørtz, MBT Knudsen, M Lewenstein, HW Vildhøj
Annual Symposium on Combinatorial Pattern Matching, 65-76, 2015
Substring range reporting
P Bille, IL Gørtz
Annual Symposium on Combinatorial Pattern Matching, 299-308, 2011
New algorithms for regular expression matching
P Bille
International Colloquium on Automata, Languages, and Programming, 643-654, 2006
Optimal packed string matching
O Ben-Kiki, P Bille, D Breslauer, L Gasieniec, R Grossi, O Weimann
IARCS annual conference on foundations of software technology and …, 2011
Systemet kan ikke foretage handlingen nu. Prøv igen senere.
Artikler 1–20