Search the dblp DataBase
Philip Bille :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Philip Bille , Inge Li Gørtz Matching Subsequences in Trees. [Citation Graph (0, 0)][DBLP ] CIAC, 2006, pp:248-259 [Conf ] Arjan Kuijper , Ole Fogh Olsen , Peter J. Giblin , Philip Bille , Mads Nielsen From a 2D Shape to a String Structure Using the Symmetry Set. [Citation Graph (0, 0)][DBLP ] ECCV (2), 2004, pp:313-325 [Conf ] Philip Bille New Algorithms for Regular Expression Matching. [Citation Graph (0, 0)][DBLP ] ICALP (1), 2006, pp:643-654 [Conf ] Philip Bille , Inge Li Gørtz The Tree Inclusion Problem: In Optimal Space and Faster. [Citation Graph (0, 0)][DBLP ] ICALP, 2005, pp:66-77 [Conf ] Arjan Kuijper , Ole Fogh Olsen , Philip Bille , Peter J. Giblin Matching 2D Shapes using their Symmetry Sets. [Citation Graph (0, 0)][DBLP ] ICPR (2), 2006, pp:179-182 [Conf ] Stephen Alstrup , Philip Bille , Theis Rauhe Labeling schemes for small distances in trees. [Citation Graph (0, 0)][DBLP ] SODA, 2003, pp:689-698 [Conf ] Stephen Alstrup , Philip Bille , Theis Rauhe Labeling Schemes for Small Distances in Trees. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2005, v:19, n:2, pp:448-462 [Journal ] Philip Bille A survey on tree edit distance and related problems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:337, n:1-3, pp:217-239 [Journal ] Philip Bille , Rolf Fagerberg , Inge Li Gørtz Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts. [Citation Graph (0, 0)][DBLP ] CPM, 2007, pp:52-62 [Conf ] Philip Bille , Rolf Fagerberg , Inge Li Gørtz Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Philip Bille New Algorithms for Regular Expression Matching [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Philip Bille , Inge Li Gørtz The Tree Inclusion Problem: In Linear Space and Faster [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Philip Bille , Anna Pagh , Rasmus Pagh Fast evaluation of union-intersection expressions [Citation Graph (0, 0)][DBLP ] CoRR, 2007, v:0, n:, pp:- [Journal ] Philip Bille Pattern Matching in Trees and Strings [Citation Graph (0, 0)][DBLP ] CoRR, 2007, v:0, n:, pp:- [Journal ] Fast Searching in Packed Strings. [Citation Graph (, )][DBLP ] Faster Regular Expression Matching. [Citation Graph (, )][DBLP ] Fast Evaluation of Union-Intersection Expressions. [Citation Graph (, )][DBLP ] Regular Expression Matching with Multi-Strings and Intervals. [Citation Graph (, )][DBLP ] Fast Arc-Annotated Subsequence Matching in Linear Space. [Citation Graph (, )][DBLP ] Fast and Compact Regular Expression Matching [Citation Graph (, )][DBLP ] Matching Subsequences in Trees [Citation Graph (, )][DBLP ] Faster Approximate String Matching for Short Patterns [Citation Graph (, )][DBLP ] Fast Searching in Packed Strings [Citation Graph (, )][DBLP ] Fast Arc-Annotated Subsequence Matching in Linear Space [Citation Graph (, )][DBLP ] Random Access to Grammar Compressed Strings [Citation Graph (, )][DBLP ] Search in 0.002secs, Finished in 0.003secs