( en | de | ru )

 

Disambiguation of "Bille, Philip"

Author of the publication

copydeleteadd this publication to your clipboard
Labeling schemes for small distances in trees.

, , and . SODA, page 689-698. ACM/SIAM, (2003)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Martin Bille

Heinz Bille

Stefanie Bille

Josef Bille

Ulrich Bille

 

Other publications of authors with the same name

Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts, , and . CoRR, (2006)Fast Evaluation of Union-Intersection Expressions., , and . ISAAC, volume 4835 of Lecture Notes in Computer Science, page 739-750. Springer, (2007)Sparse Suffix Tree Construction in Small Space., , , , , and . ICALP (1), volume 7965 of Lecture Notes in Computer Science, page 148-159. Springer, (2013)Fingerprints in Compressed Strings., , , , , and . WADS, volume 8037 of Lecture Notes in Computer Science, page 146-157. Springer, (2013)The Tree Inclusion Problem: In Optimal Space and Faster., and . ICALP, volume 3580 of Lecture Notes in Computer Science, page 66-77. Springer, (2005)Space-Efficient Re-Pair Compression., , and . DCC, page 171-180. IEEE, (2017)Editorial: Special Issue on Data Compression Algorithms and Their Applications.. Algorithms, 13 (1): 28 (2020)Size-constrained Weighted Ancestors with Applications., , and . CoRR, (2023)String Indexing for Top-k Close Consecutive Occurrences., , , , and . FSTTCS, volume 182 of LIPIcs, page 14:1-14:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Faster Regular Expression Matching., and . ICALP (1), volume 5555 of Lecture Notes in Computer Science, page 171-182. Springer, (2009)