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

Filter
Article in proceedings

Search results

  • 2025

    Dynamic Range Minimum Queries on the Ultra-wide Word RAM

    Bille, P., Gørtz, I. L., Pérez López, M. & Stordalen, T., 2025, Proceedings of the 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025. Springer, p. 122-135

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

  • Fast Practical Compression of Deterministic Finite Automata

    Bille, P., Gørtz, I. L. & Pedersen, M. R., 2025, 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025. Springer, Vol. 15538. p. 136-150 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

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

  • 2024

    Gapped String Indexing in Subquadratic Space and Sublinear Query Time

    Bille, P., Gørtz, I. L., Lewenstein, M., Pissis, S. P., Rotenberg, E. & Steiner, T. A., 2024, Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Vol. 289. p. 16:1-16:21

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

    Open Access
    File
    12 Downloads (Orbit)

  • Rank and Select on Degenerate Strings

    Bille, P., Gørtz, I. L. & Stordalen, T., 2024, Proceedings of the 2024 Data Compression Conference (DCC). IEEE, p. 283-292

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

  • Size-Constrained Weighted Ancestors with Applications

    Bille, P., Nekrich, Y. & Pissis, S. P., 2024, Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Vol. 294. p. 14:1-14:12

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

    Open Access
    File
    9 Downloads (Orbit)

  • Sparse Regular Expression Matching

    Bille, P. & Gørtz, I. L., 2024, Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Society for Industrial and Applied Mathematics, p. 3354-3375

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

  • 2023

    Hierarchical Relative Lempel-Ziv Compression

    Bille, P., Gørtz, I. L., Puglisi, S. J. & Tarnow, S. R., 2023, Proceedings of the 21st International Symposium on Experimental Algorithms (SEA 2023). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Vol. 265. p. 18:1-18:16

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

    Open Access
    File
    25 Downloads (Orbit)

  • Sliding Window String Indexing in Streams

    Bille, P., Fischer, J., Gørtz, I. L., Pedersen, M. R. & Stordalen, T. J., 2023, Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 259. 18 p. 4

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

    Open Access
    File
    42 Downloads (Orbit)
  • 2022

    Predecessor on the Ultra-Wide Word RAM

    Bille, P., Gørtz, I. L. & Stordalen, T., 2022, Proceedings of the 18th Scandinavian Workshop and Symposium on Algorithms. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 227. 15 p. 18. (Leibniz International Proceedings in Informatics, LIPIcs).

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

    Open Access
    File
    65 Downloads (Orbit)

  • The Complexity of the Co-Occurrence Problem

    Bille, P., Gørtz, I. L. & Stordalen, T. J., 2022, String Processing and Information Retrieval. Springer, p. 38–52 (Lecture Notes in Computer Science, Vol. 13617).

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

    File
    25 Downloads (Orbit)

  • The Fine-Grained Complexity of Episode Matching

    Bille, P., Gørtz, I. L., Mozes, S., Steiner, T. A. & Weimann, O., 1 Jun 2022, Proceedings of 33rd Annual Symposium on Combinatorial Pattern Matching. Bannai, H. & Holub, J. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 12 p. 4. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 223).

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

    Open Access
    File
    62 Downloads (Orbit)
  • 2020

    Decompressing lempel-ziv compressed text

    Bille, P., Berggren Ettienne, M., Gagie, T., Li Gortz, I. & Prezza, N., Mar 2020, Proceedings of Data Compression Conference 2020. Bilgin, A., Marcellin, M. W., Serra-Sagrista, J. & Storer, J. A. (eds.). IEEE, p. 143-152 9105689

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

  • Partial Sums on the Ultra-Wide Word RAM

    Bille, P., Gørtz, I. L. & Jensen, F. R. S., 2020, Theory and Applications of Models of Computation. Chen, J., Feng, Q. & Xu, J. (eds.). Springer, p. 13-24 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 12337 LNCS).

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

    Open Access
    File
    65 Downloads (Orbit)

  • Random access in persistent strings

    Bille, P. & Gørtz, I. L., Dec 2020, Proceedings of 31st International Symposium on Algorithms and Computation. Cao, Y., Cheng, S.-W. & Li, M. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 481-4816 48. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 181).

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

    Open Access
    File
    19 Downloads (Orbit)

  • Space efficient construction of Lyndon arrays in linear time

    Bille, P., Ellert, J., Fischer, J., Gørtz, I. L., Kurpicz, F., Ian Munro, J. & Rotenberg, E., 1 Jun 2020, Proceedings of 47th International Colloquium on Automata, Languages and Programming. Czumaj, A., Dawar, A. & Merelli, E. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 14:1--14:18 (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 168).

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

    Open Access
    File
    75 Downloads (Orbit)

  • String indexing for top-k close consecutive occurrences

    Bille, P., Gørtz, I. L., Pedersen, M. R., Rotenberg, E. & Steiner, T. A., Dec 2020, Proceedings of 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Saxena, N. & Simon, S. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 17 p. 14. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 182).

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

    Open Access
    File
    35 Downloads (Orbit)

  • String indexing with compressed patterns

    Bille, P., Gørtz, I. L. & Steiner, T. A., Mar 2020, Proceedings of 37th International Symposium on Theoretical Aspects of Computer Science. Paul, C. & Blaser, M. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 13 p. LIPIcs-STACS-2020-10. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 154).

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

    Open Access
    File
    160 Downloads (Orbit)
  • 2019

    From regular expression matching to parsing

    Bille, P. & Gørtz, I. L., 1 Aug 2019, Proceedings of 44th International Symposium on Mathematical Foundations of Computer Science. Katoen, J.-P., Heggernes, P. & Rossmanith, P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 14 p. 71. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 138).

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

    Open Access
    File
    153 Downloads (Orbit)

  • Top Tree Compression of Tries

    Bille, P., Gawrychowski, P., Gørtz, I. L., Landau, G. M. & Weimann, O., 2019, Proceedings of 30th International Symposium on Algorithms and Computation. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 4:1--4:18 (Leibniz International Proceedings in Informatics, Vol. 149).

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

    Open Access
    File
    83 Downloads (Orbit)
  • 2018

    Compressed Communication Complexity of Longest Common Prefixes

    Bille, P., Berggreen Ettienne, M., Grossi, R., Gørtz, I. L. & Rotenberg, E., 2018, String Processing and Information Retrieval. Springer, p. 74-87 (Lecture Notes in Computer Science, Vol. 11147).

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

    File
    166 Downloads (Orbit)
  • 2017

    Deterministic indexing for packed strings

    Bille, P., Gørtz, I. L. & Skjoldjensen, F. R., 2017, Proceedings of 28th Annual Symposium on Combinatorial Pattern Matching. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Vol. 78. 6 p. (Leibniz International Proceedings in Informatics).

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

    Open Access
    File
    428 Downloads (Orbit)

  • Fast Dynamic Arrays

    Bille, P., Christiansen, A. R., Ettienne, M. B. & Gørtz, I. L., 2017, Proceedings of 5th Annual European Symposium on Algorithms. p. 16:1--16:13

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

    Open Access
    File
    463 Downloads (Orbit)

  • Immersive Algorithms: Better Visualization with Less Information

    Bille, P. & Gørtz, I. L., 2017, Proceedings of ITiCSE ’17. Association for Computing Machinery, 2 p.

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

    Open Access
    File
    428 Downloads (Orbit)

  • Lempel-Ziv Compression in a Sliding Window

    Bille, P., Cording, P. H., Fischer, J. & Gørtz, I. L., 2017, Proceedings of 28th Annual Symposium on Combinatorial Pattern Matching. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 15 1 p. (Leibniz International Proceedings in Informatics, Vol. 78).

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

    Open Access
    File
    1263 Downloads (Orbit)

  • Space-Efficient Re-Pair Compression

    Bille, P., Gørtz, I. L. & Prezza, N., 2017, Proceedings of 2017 Data Compression Conference. IEEE, Vol. Part F1. p. 171-80 (Data Compression Conference. Proceedings).

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

  • Succinct partial sums and fenwick trees

    Bille, P., Christiansen, A. R., Prezza, N. & Skjoldjensen, F. R., 2017, String Processing and Information Retrieval. Springer, p. 91-96 (Lecture Notes in Computer Science, Vol. 10508).

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

    File
    291 Downloads (Orbit)

  • Tight bounds for top tree compression

    Bille, P., Fernstrøm, F. & Gørtz, I. L., 2017, String Processing and Information Retrieval. Springer, p. 97-102 (Lecture Notes in Computer Science, Vol. 10508).

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

  • Time-space trade-offs for lempel-ziv compressed indexing

    Bille, P., Ettienne, M. B., Gørtz, I. L. & Vildhøj, H. W., 2017, Proceedings of 28th Annual Symposium on Combinatorial Pattern Matching. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 16 p. (Leibniz International Proceedings in Informatics).

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

    Open Access
    File
    344 Downloads (Orbit)
  • 2016

    Boxed Permutation Pattern Matching.

    Amit, M., Bille, P., Cording, P. H., Gørtz, I. L. & Vildhøj, H. W., 2016, Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016). p. 1-11 20. (Leibniz International Proceedings in Informatics).

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

  • Dynamic Relative Compression, Dynamic Partial Sums, and Substring Concatenation

    Bille, P., Cording, P. H., Gørtz, I. L., Skjoldjensen, F. R., Vildhøj, H. W. & Vind, S. J., 2016, Proceedings of the 27th International Symposium on Algorithms and Computation (ISAAC 2016). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 13 p. 18. (Leibniz International Proceedings in Informatics, Vol. 64).

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

    Open Access
    File
    284 Downloads (Orbit)

  • Finger Search in Grammar-Compressed Strings

    Bille, P., Christiansen, A. R., Cording, P. H. & Gørtz, I. L., 2016, Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 16 p. 36. (Leibniz International Proceedings in Informatics, Vol. 65).

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

    Open Access
    File
    332 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
    370 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
    288 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)
  • 2014

    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
    415 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
    494 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

  • 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
    335 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

    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
    645 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
    496 Downloads (Orbit)
  • 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