Philip Bille

View Scopus Profile

Philip Bille

Algorithms, Logic and Graphs

 https://orcid.org/0000-0002-1120-5154

  • Richard Petersens Plads, 322, 007

    2800 Kgs. Lyngby

    Denmark

Search results

  • 2016

    Longest common extensions in trees.

    Bille, P., Gawrychowski, P., Gørtz, I. L., Landau, G. M. & Weimann, O., 2016, In: Theoretical Computer Science. 638, p. 98-107

    Research output: Contribution to journal › Journal article › Research › peer-review

    Open Access
    File
    361 Downloads (Orbit)

  • Sparse Text Indexing in Small Space

    Bille, P., Fischer, J., Gørtz, I. L., Kopelowitz, T., Sach, B. & Vildhøj, H. W., 2016, In: A C M Transactions on Algorithms. 12, 3, p. 1-19 39.

    Research output: Contribution to journal › Journal article › Research › peer-review

    Open Access
    File
    382 Downloads (Orbit)

  • Subsequence Automata with Default Transitions

    Bille, P., Gørtz, I. L. & Skjoldjensen, F. R., 2016, SOFSEM 2016: Theory and Practice of Computer Science: 42nd International Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 23-28, 2016, Proceedings. Springer, Vol. 9587 . p. 208-216 9 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    Open Access
    File
    371 Downloads (Orbit)
  • 2015

    Compressed Data Structures for Range Searching

    Bille, P., Gørtz, I. L. & Vind, S. J., 2015, Proceedings of the 9th International Conference on Language and Automata Theory and Applications (LATA 2015). Dediu, A.-H., Formenti, E., Martín-Vide, C. & Truthe, B. (eds.). Springer, p. 577-586 (Lecture Notes in Computer Science, Vol. 8977).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    Open Access
    File
    554 Downloads (Orbit)

  • Longest Common Extensions in Sublinear Space

    Bille, P., Gørtz, I. L., Knudsen, M. B. T., Lewenstein, M. & Vildhøj, H. W., 2015, Combinatorial Pattern Matching: 26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 -- July 1, 2015, Proceedings. Springer, p. 65-76 (Lecture Notes in Computer Science, Vol. 9133).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    Open Access
    File
    290 Downloads (Orbit)

  • Longest Common Extensions in Trees

    Bille, P., Gawrychowski, P., Gørtz, I. L., Landau, G. M. & Weimann, O., 2015, Proceedings of the 26th Annual Symposium on Combinatorial Pattern Matching, CPM 2015. Cicalese, F., Porat, E. & Vaccaro, U. (eds.). Springer, p. 52-64 (Lecture Notes in Computer Science, Vol. 9133).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    Open Access
    File
    393 Downloads (Orbit)

  • On Regular Expression Matching and Deterministic Finite Automata

    Bille, P., 2015, In: Tiny ToCS . 3, p. 1

    Research output: Contribution to journal › Comment/debate › Research › peer-review

    Open Access
    File
    194 Downloads (Orbit)

  • Random Access to Grammar-Compressed Strings and Trees

    Bille, P., Landau, G. M., Raman, R., Sadakane, K., Satti, S. R. & Weimann, O., 2015, In: SIAM Journal on Computing. 44, 3, p. 513-539

    Research output: Contribution to journal › Journal article › Research › peer-review

    Open Access
    File
    958 Downloads (Orbit)

  • Tree compression with top trees

    Bille, P., Gørtz, I. L., Landau, G. M. & Weimann, O., 2015, In: Information and Computation. 243, p. 166-177

    Research output: Contribution to journal › Journal article › Research › peer-review

    Open Access
    File
    658 Downloads (Orbit)
  • 2014

    Compact q-gram profiling of compressed strings

    Bille, P., Cording, P. H. & Gørtz, I. L., 2014, In: Theoretical Computer Science. 550, p. 51-58

    Research output: Contribution to journal › Journal article › Research › peer-review

  • Compressed Subsequence Matching and Packed Tree Coloring

    Bille, P., Cording, P. H. & Gørtz, I. L., 2014, Combinatorial Pattern Matching: Proceedings of the 25th Annual Symposium on Combinatorial Pattern Matching, CPM 2014 . Kulikov, A. S., Kuznetsov, S. O. & Pevzner, P. (eds.). Springer, p. 40-49 (Lecture Notes in Computer Science, Vol. 8486).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    Open Access
    File
    416 Downloads (Orbit)

  • Indexing Motion Detection Data for Surveillance Video

    Vind, S. J., Bille, P. & Gørtz, I. L., 2014, Proceedings of the IEEE International Symposium on Multimedia (ISM2014). IEEE Press, p. 24-27 4 p.

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    Open Access
    File
    495 Downloads (Orbit)

  • String Indexing for Patterns with Wildcards

    Bille, P., Gørtz, I. L., Vildhøj, H. W. & Vind, S. J., 2014, In: Theory of Computing Systems. 55, 1, p. 41-60 20 p.

    Research output: Contribution to journal › Journal article › Research › peer-review

  • Substring Range Reporting

    Bille, P. & Gørtz, I. L., 2014, In: Algorithmica. 69, 2, p. 384-396

    Research output: Contribution to journal › Journal article › Research › peer-review

  • Time–space trade-offs for longest common extensions

    Bille, P., Gørtz, I. L., Sach, B. & Vildhøj, H. W., 2014, In: Journal of Discrete Algorithms. 25, p. 42-50

    Research output: Contribution to journal › Journal article › Research › peer-review

    Open Access
    File
    313 Downloads (Orbit)

  • Towards optimal packed string matching

    Ben-Kiki, O., Bille, P., Breslauer, D., Ga̧sieniec, L., Grossi, R. & Weimann, O., 2014, In: Theoretical Computer Science. 525, p. 111-129

    Research output: Contribution to journal › Journal article › Research › peer-review

    Open Access
    File
    473 Downloads (Orbit)
  • 2013

    Compact q-gram Profiling of Compressed Strings

    Bille, P., Cording, P. H. & Gørtz, I. L., 2013, Combinatorial Pattern Matching: 24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings. Springer, p. 62-73 (Lecture Notes in Computer Science, Vol. 7922).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    File
    382 Downloads (Orbit)

  • Fingerprints in Compressed Strings

    Bille, P., Cording, P. H., Gørtz, I. L., Sach, B., Vildhøj, H. W. & Vind, S. J., 2013, Algorithms and Data Structures: 13th International Symposium, WADS 2013, London, ON, Canada, August 12-14, 2013. Proceedings. Springer, p. 146-157 (Lecture Notes in Computer Science, Vol. 8037).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    File
    440 Downloads (Orbit)

  • Sparse suffix tree construction in small space

    Bille, P., Fischer, J., Gørtz, I. L., Kopelowitz, T., Sach, B. & Vildhøj, H. W., 2013, Automata, Languages, and Programming: 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I. Springer, p. 148-159 (Lecture Notes in Computer Science, Vol. 7965).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  • Tree compression with top trees

    Bille, P., Gørtz, I. L., Landau, G. M. & Weimann, O., 2013, Automata, Languages, and Programming: 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I. Springer, p. 160-171 (Lecture Notes in Computer Science, Vol. 7965).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  • 2012

    Fast and Cache-Oblivious Dynamic Programming with Local Dependencies

    Bille, P. & Stöckel, M., 2012, Language and Automata Theory and Applications: 6th International Conference, LATA 2012 A Coruña, Spain, March 5-9, 2012 Proceedings. Springer, p. 131–142 (Lecture Notes in Computer Science, Vol. 7183).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  • Fast Arc-Annotated Subsequence Matching in Linear Space

    Bille, P. & Gørtz, I. L., 2012, In: Algorithmica. 62, 1-2, p. 209-223

    Research output: Contribution to journal › Journal article › Research › peer-review

  • Faster Approximate String Matching for Short Patterns

    Bille, P., 2012, In: Theory of Computing Systems. 50, 3, p. 492–515

    Research output: Contribution to journal › Journal article › Research › peer-review

  • Longest Common Extensions via Fingerprinting

    Bille, P., Gørtz, I. L. & Kristensen, J., 2012, Language and Automata Theory and Applications: 6th International Conference, LATA 2012 A Coruña, Spain, March 5-9, 2012 Proceedings. Springer, p. 119-130 (Lecture Notes in Computer Science, Vol. 7183).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  • String Indexing for Patterns With Wildcards

    Bille, P., Gørtz, I. L., Vildhøj, H. W. & Vind, S. J., 2012, Algorithm Theory – SWAT 2012: 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012. Proceedings. Fornin, F. V. & Kaski, P. (eds.). Springer, p. 283-294 (Lecture Notes in Computer Science, Vol. 7357).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    Open Access
    File
    338 Downloads (Orbit)

  • String matching with variable length gaps

    Bille, P., Gørtz, I. L., Vildhøj, H. W. & Wind, D. K., 2012, In: Theoretical Computer Science. 443, p. 25-34

    Research output: Contribution to journal › Journal article › Research › peer-review

    1 Downloads (Orbit)

  • Time-Space Trade-offs for Longest Common Extensions

    Bille, P., Gortz, I. L., Sach, B. & Vildhoj, H. W., 2012, Combinatorial Pattern Matching. Kärkkäinen, J. & Stoye, J. (eds.). Springer, p. 293-305 (Lecture Notes in Computer Science, Vol. 7354).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  • 2011

    Fast searching in packed strings

    Bille, P., 2011, In: Journal of Discrete Algorithms (Amsterdam). 9, 1, p. 49-56

    Research output: Contribution to journal › Journal article › Research › peer-review

  • Optimal Packed String Matching

    Ben-Kiki, O., Bille, P., Breslauer, D., Gasieniec, L., Grossi, R. & Weimann, O., 2011, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011). Chakraborty, S. & Kumar, A. (eds.). Dagstuhl, Germany: Schloss Dagstuhl-Leibniz-Zentrum fuer Informati, p. 423-432 (Leibniz International Proceedings in Informatics; No. 13).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    Open Access
    File
    652 Downloads (Orbit)

  • Random Access to Grammar-Compressed Strings

    Bille, P., Landau, G. M., Raman, R., Sadakane, K., Satti, S. R. & Weimann, O., 2011, Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms. San Francisco: Society for Industrial and Applied Mathematics, p. 373-389

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    1 Downloads (Orbit)

  • Substring Range Reporting

    Bille, P. & Gørtz, I. L., 2011, Combinatorial Pattern Matching: 22nd Annual Symposium, CPM 2011 Palermo, Italy, June 27-29, 2011 Proceedings. Springer, Vol. 6661. p. 299-308 (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    Open Access
    File
    497 Downloads (Orbit)

  • The Tree Inclusion Problem: In Linear Space and Faster

    Bille, P. & Gørtz, I. L., 2011, In: A C M Transactions on Algorithms. 7, 3, p. 38

    Research output: Contribution to journal › Journal article › Research › peer-review

  • 2010

    Fast Arc-Annotated Subsequence Matching in Linear Space

    Bille, P. & Gørtz, I. L., 2010, SOFSEM 2010: Theory and Practice of Computer Science. Springer, p. 188-199 (Lecture Notes in Computer Science, Vol. 5901).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  • Regular Expression Matching with Multi-Strings and Intervals

    Bille, P. & Thorup, M., 2010, Symposium on Discrete Algorithms.

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  • String Matching with Variable Length Gaps

    Bille, P., Gørtz, I. L., Vildhøj, H. W. & Wind, D. K., 2010, String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010. Springer, p. 385-394 (Lecture Notes in Computer Science; No. 6393).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  • 2009

    Faster Regular Expression Matching

    Bille, P. & Thorup, M., 2009, International Colloquium on Automata, Languages and Programming.

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  • Fast Searching in Packed Strings

    Bille, P., 2009, Combinatorial Pattern Matching. p. 116-126 (Lecture Notes in Computer Science, Vol. 5577).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review