Obserwuj
Philip Bille
Philip Bille
Technical University of Denmark
Zweryfikowany adres z dtu.dk - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
A survey on tree edit distance and related problems
P Bille
Theoretical computer science 337 (1-3), 217-239, 2005
12312005
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
210*2015
Labeling schemes for small distances in trees
S Alstrup, P Bille, T Rauhe
SIAM Journal on Discrete Mathematics 19 (2), 448-462, 2005
972005
String matching with variable length gaps
P Bille, IL Gørtz, HW Vildhøj, DK Wind
Theoretical Computer Science 443, 25-34, 2012
912012
Fast and compact regular expression matching
P Bille, M Farach-Colton
Theoretical Computer Science 409 (3), 486-496, 2008
832008
Tree compression with top trees
P Bille, IL Gørtz, GM Landau, O Weimann
Information and Computation 243, 166-177, 2015
652015
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
60*2018
Fast evaluation of union-intersection expressions
P Bille, A Pagh, R Pagh
International Symposium on Algorithms and Computation, 739-750, 2007
582007
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
552014
String indexing for patterns with wildcards
P Bille, IL Gørtz, HW Vildhøj, S Vind
Theory of Computing Systems 55, 41-60, 2014
522014
The tree inclusion problem: In optimal space and faster
P Bille, I Li Gørtz
Automata, Languages and Programming, 61-61, 2005
50*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
492010
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
48*2016
Faster regular expression matching
P Bille, M Thorup
Automata, Languages and Programming: 36th International Colloquium, ICALP …, 2009
472009
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
432017
Space-efficient re-pair compression
P Bille, IL Gørtz, N Prezza
2017 Data Compression Conference (DCC), 171-180, 2017
392017
Substring range reporting
P Bille, IL Gørtz
Algorithmica 69, 384-396, 2014
352014
Dynamic relative compression, dynamic partial sums, and substring concatenation
P Bille, AR Christiansen, PH Cording, IL Gørtz, FR Skjoldjensen, ...
Algorithmica 80, 3207-3224, 2018
32*2018
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
322015
New algorithms for regular expression matching
P Bille
International Colloquium on Automata, Languages, and Programming, 643-654, 2006
302006
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20