Philip Bille - RankMe

167 papers A* 6A 3B 33C 11Misc 1Journal 98Unranked 15

Year	Rank	Type	Title / Venue / Authors
2025	—	`conf`	Compact Data Structures for Collections of Sets. From Strings to Graphs, and Back Again Jarno N. Alanko, Philip Bille, Inge Li Gørtz, Gonzalo Navarro, Simon J. Puglisi
2025	B	`conf`	Compressed Dictionary Matching on Run-Length Encoded Strings. CPM Philip Bille, Inge Li Gørtz, Simon J. Puglisi, Simon R. Tarnow
2025	J	`jnl`	Compressed Dictionary Matching on Run-Length Encoded Strings. CoRR Philip Bille, Inge Li Gørtz, Simon J. Puglisi, Simon R. Tarnow
2025	J	`jnl`	Differentially Private Substring and Document Counting. Proc. ACM Manag. Data Giulia Bernardini, Philip Bille, Inge Li Gørtz, Teresa Anna Steiner
2025	—	`conf`	Dynamic Range Minimum Queries on the Ultra-wide Word RAM. SOFSEM (1) Philip Bille, Inge Li Gørtz, Máximo Pérez López, Tord Stordalen
2025	—	`conf`	Fast Practical Compression of Deterministic Finite Automata. SOFSEM (1) Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen
2025	J	`jnl`	Improved Extended Regular Expression Matching. CoRR Philip Bille, Inge Li Gørtz, Rikke Schjeldrup Jessen
2025	B	`conf`	Succinct Data Structures for Segments. CPM Philip Bille, Inge Li Gørtz, Simon R. Tarnow
2025	B	`conf`	Text Indexing for Simple Regular Expressions. CPM Hideo Bannai, Philip Bille, Inge Li Gørtz, Gad M. Landau, Gonzalo Navarro, Nicola Prezza, Teresa Anna Steiner, Simon Rumle Tarnow
2025	J	`jnl`	Toward Greener Matrix Operations by Lossless Compressed Formats. IEEE Access Francesco Tosoni, Philip Bille, Valerio Brunacci, Alessio De Angelis, Paolo Ferragina, Giovanni Manzini
2024	J	`jnl`	Differentially Private Substring and Document Counting. CoRR Giulia Bernardini, Philip Bille, Inge Li Gørtz, Teresa Anna Steiner
2024	J	`jnl`	Dynamic Range Minimum Queries on the Ultra-Wide Word RAM. CoRR Philip Bille, Inge Li Gørtz, Tord Stordalen, Máximo Pérez López
2024	B	`conf`	Faster Sliding Window String Indexing in Streams. CPM Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Simon R. Tarnow
2024	A	`conf`	Gapped String Indexing in Subquadratic Space and Sublinear Query Time. STACS Philip Bille, Inge Li Gørtz, Moshe Lewenstein, Solon P. Pissis, Eva Rotenberg, Teresa Anna Steiner
2024	J	`jnl`	Predecessor on the Ultra-Wide Word RAM. Algorithmica Philip Bille, Inge Li Gørtz, Tord Stordalen
2024	B	`conf`	Rank and Select on Degenerate Strings. DCC Philip Bille, Inge Li Gørtz, Tord Stordalen
2024	—	`conf`	Size-Constrained Weighted Ancestors with Applications. SWAT Philip Bille, Yakov Nekrich, Solon P. Pissis
2024	Misc	`conf`	Snake in Optimal Space and Time. FUN Philip Bille, Martín Farach-Colton, Inge Li Gørtz, Ivor van der Hoog
2024	A*	`conf`	Sparse Regular Expression Matching. SODA Philip Bille, Inge Li Gørtz
2024	J	`jnl`	Succinct Data Structures for Segments. CoRR Philip Bille, Inge Li Gørtz, Simon R. Tarnow
2024	B	`conf`	Tight Bounds for Compressing Substring Samples. CPM Philip Bille, Christian Mikkelsen Fuglsang, Inge Li Gørtz
2024	J	`jnl`	Toward Greener Matrix Operations by Lossless Compressed Formats. CoRR Francesco Tosoni, Philip Bille, Valerio Brunacci, Alessio De Angelis, Paolo Ferragina, Giovanni Manzini
2023	J	`jnl`	Faster Compression of Deterministic Finite Automata. CoRR Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen
2023	J	`jnl`	Gapped Indexing for Consecutive Occurrences. Algorithmica Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Teresa Anna Steiner
2023	B	`conf`	Hierarchical Relative Lempel-Ziv Compression. SEA Philip Bille, Inge Li Gørtz, Simon J. Puglisi, Simon R. Tarnow
2023	J	`jnl`	Random Access in Persistent Strings and Segment Selection. Theory Comput. Syst. Philip Bille, Inge Li Gørtz
2023	J	`jnl`	Rank and Select on Degenerate Strings. CoRR Philip Bille, Inge Li Gørtz, Tord Stordalen
2023	J	`jnl`	Size-constrained Weighted Ancestors with Applications. CoRR Philip Bille, Yakov Nekrich, Solon P. Pissis
2023	B	`conf`	Sliding Window String Indexing in Streams. CPM Philip Bille, Johannes Fischer, Inge Li Gørtz, Max Rishøj Pedersen, Tord Joakim Stordalen
2023	J	`jnl`	Sliding Window String Indexing in Streams. CoRR Philip Bille, Johannes Fischer, Inge Li Gørtz, Max Rishøj Pedersen, Tord Joakim Stordalen
2023	J	`jnl`	String Indexing with Compressed Patterns. ACM Trans. Algorithms Philip Bille, Inge Li Gørtz, Teresa Anna Steiner
2022	J	`jnl`	From regular expression matching to parsing. Acta Informatica Philip Bille, Inge Li Gørtz
2022	J	`jnl`	Gapped String Indexing in Subquadratic Space and Sublinear Query Time. CoRR Philip Bille, Inge Li Gørtz, Moshe Lewenstein, Solon P. Pissis, Eva Rotenberg, Teresa Anna Steiner
2022	J	`jnl`	Hierarchical Relative Lempel-Ziv Compression. CoRR Philip Bille, Inge Li Gørtz, Simon J. Puglisi, Simon R. Tarnow
2022	J	`jnl`	Partial sums on the ultra-wide word RAM. Theor. Comput. Sci. Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen
2022	—	`conf`	Predecessor on the Ultra-Wide Word RAM. SWAT Philip Bille, Inge Li Gørtz, Tord Stordalen
2022	J	`jnl`	Predecessor on the Ultra-Wide Word RAM. CoRR Philip Bille, Inge Li Gørtz, Tord Stordalen
2022	J	`jnl`	String indexing for top- Theor. Comput. Sci. Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Eva Rotenberg, Teresa Anna Steiner
2022	J	`jnl`	The Complexity of the Co-Occurrence Problem. CoRR Philip Bille, Inge Li Gørtz, Tord Stordalen
2022	C	`conf`	The Complexity of the Co-occurrence Problem. SPIRE Philip Bille, Inge Li Gørtz, Tord Stordalen
2022	B	`conf`	The Fine-Grained Complexity of Episode Matching. CPM Philip Bille, Inge Li Gørtz, Shay Mozes, Teresa Anna Steiner, Oren Weimann
2021	J	`jnl`	A Conditional Lower Bound for Episode Matching. CoRR Philip Bille, Inge Li Gørtz, Shay Mozes, Teresa Anna Steiner, Oren Weimann
2021	B	`conf`	Gapped Indexing for Consecutive Occurrences. CPM Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Teresa Anna Steiner
2021	J	`jnl`	Gapped Indexing for Consecutive Occurrences. CoRR Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Teresa Anna Steiner
2021	J	`jnl`	Top Tree Compression of Tries. Algorithmica Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann
2020	B	`conf`	Decompressing Lempel-Ziv Compressed Text. DCC Philip Bille, Mikko Berggren Ettienne, Travis Gagie, Inge Li Gørtz, Nicola Prezza
2020	J	`jnl`	Editorial: Special Issue on Data Compression Algorithms and Their Applications. Algorithms Philip Bille
2020	C	`conf`	Partial Sums on the Ultra-Wide Word RAM. TAMC Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen
2020	B	`conf`	Random Access in Persistent Strings. ISAAC Philip Bille, Inge Li Gørtz
2020	J	`jnl`	Random Access in Persistent Strings. CoRR Philip Bille, Inge Li Gørtz
2020	A*	`conf`	Space Efficient Construction of Lyndon Arrays in Linear Time. ICALP Philip Bille, Jonas Ellert, Johannes Fischer, Inge Li Gørtz, Florian Kurpicz, J. Ian Munro, Eva Rotenberg
2020	—	`conf`	String Indexing for Top-k Close Consecutive Occurrences. FSTTCS Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Eva Rotenberg, Teresa Anna Steiner
2020	J	`jnl`	String Indexing for Top-k Close Consecutive Occurrences. CoRR Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Eva Rotenberg, Teresa Anna Steiner
2020	A	`conf`	String Indexing with Compressed Patterns. STACS Philip Bille, Inge Li Gørtz, Teresa Anna Steiner
2019	B	`conf`	From Regular Expression Matching to Parsing. MFCS Philip Bille, Inge Li Gørtz
2019	J	`jnl`	Mergeable Dictionaries With Shifts. CoRR Philip Bille, Mikko Berggren Ettienne, Inge Li Gørtz
2019	J	`jnl`	Partial Sums on the Ultra-Wide Word RAM. CoRR Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen
2019	J	`jnl`	Space Efficient Construction of Lyndon Arrays in Linear Time. CoRR Philip Bille, Jonas Ellert, Johannes Fischer, Inge Li Gørtz, Florian Kurpicz, Ian Munro, Eva Rotenberg
2019	J	`jnl`	Sparse Regular Expression Matching. CoRR Philip Bille, Inge Li Gørtz
2019	J	`jnl`	String Indexing with Compressed Patterns. CoRR Philip Bille, Inge Li Gørtz, Teresa Anna Steiner
2019	B	`conf`	Top Tree Compression of Tries. ISAAC Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann
2019	J	`jnl`	Top Tree Compression of Tries. CoRR Philip Bille, Inge Li Gørtz, Pawel Gawrychowski, Gad M. Landau, Oren Weimann
2018	J	`jnl`	A separation between RLSLPs and LZ77. J. Discrete Algorithms Philip Bille, Travis Gagie, Inge Li Gørtz, Nicola Prezza
2018	C	`conf`	Compressed Communication Complexity of Longest Common Prefixes. SPIRE Philip Bille, Mikko Berggren Ettienne, Roberto Grossi, Inge Li Gørtz, Eva Rotenberg
2018	J	`jnl`	Compressed Communication Complexity of Longest Common Prefixes. CoRR Philip Bille, Mikko Berggren Ettienne, Roberto Grossi, Inge Li Gørtz, Eva Rotenberg
2018	J	`jnl`	Dynamic Relative Compression, Dynamic Partial Sums, and Substring Concatenation. Algorithmica Philip Bille, Anders Roy Christiansen, Patrick Hagge Cording, Inge Li Gørtz, Frederik Rye Skjoldjensen, Hjalte Wedel Vildhøj, Søren Vind
2018	J	`jnl`	Fast Lempel-Ziv Decompression in Linear Space. CoRR Philip Bille, Mikko Berggren Ettienne, Travis Gagie, Inge Li Gørtz, Nicola Prezza
2018	J	`jnl`	Finger Search in Grammar-Compressed Strings. Theory Comput. Syst. Philip Bille, Anders Roy Christiansen, Patrick Hagge Cording, Inge Li Gørtz
2018	J	`jnl`	From Regular Expression Matching to Parsing. CoRR Philip Bille, Inge Li Gørtz
2018	J	`jnl`	Time-space trade-offs for Lempel-Ziv compressed indexing. Theor. Comput. Sci. Philip Bille, Mikko Berggren Ettienne, Inge Li Gørtz, Hjalte Wedel Vildhøj
2017	J	`jnl`	A Separation Between Run-Length SLPs and LZ77. CoRR Philip Bille, Travis Gagie, Inge Li Gørtz, Nicola Prezza
2017	J	`jnl`	Compressed Subsequence Matching and Packed Tree Coloring. Algorithmica Philip Bille, Patrick Hagge Cording, Inge Li Gørtz
2017	B	`conf`	Deterministic Indexing for Packed Strings. CPM Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen
2017	A	`conf`	Fast Dynamic Arrays. ESA Philip Bille, Anders Roy Christiansen, Mikko Berggren Ettienne, Inge Li Gørtz
2017	J	`jnl`	Fast Dynamic Arrays. CoRR Philip Bille, Anders Roy Christiansen, Mikko Berggren Ettienne, Inge Li Gørtz
2017	J	`jnl`	Fingerprints in compressed strings. J. Comput. Syst. Sci. Philip Bille, Inge Li Gørtz, Patrick Hagge Cording, Benjamin Sach, Hjalte Wedel Vildhøj, Søren Vind
2017	B	`conf`	Immersive Algorithms: Better Visualization with Less Information. ITiCSE Philip Bille, Inge Li Gørtz
2017	B	`conf`	Lempel-Ziv Compression in a Sliding Window. CPM Philip Bille, Patrick Hagge Cording, Johannes Fischer, Inge Li Gørtz
2017	J	`jnl`	Practical and Effective Re-Pair Compression. CoRR Philip Bille, Inge Li Gørtz, Nicola Prezza
2017	B	`conf`	Space-Efficient Re-Pair Compression. DCC Philip Bille, Inge Li Gørtz, Nicola Prezza
2017	J	`jnl`	Subsequence automata with default transitions. J. Discrete Algorithms Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen
2017	C	`conf`	Succinct Partial Sums and Fenwick Trees. SPIRE Philip Bille, Anders Roy Christiansen, Nicola Prezza, Frederik Rye Skjoldjensen
2017	J	`jnl`	Succinct Partial Sums and Fenwick Trees. CoRR Philip Bille, Anders Roy Christiansen, Nicola Prezza, Frederik Rye Skjoldjensen
2017	C	`conf`	Tight Bounds for Top Tree Compression. SPIRE Philip Bille, Finn Fernstrøm, Inge Li Gørtz
2017	B	`conf`	Time-Space Trade-Offs for Lempel-Ziv Compressed Indexing. CPM Philip Bille, Mikko Berggren Ettienne, Inge Li Gørtz, Hjalte Wedel Vildhøj
2017	J	`jnl`	Time-Space Trade-Offs for Lempel-Ziv Compressed Indexing. CoRR Philip Bille, Mikko Berggren Ettienne, Inge Li Gørtz, Hjalte Wedel Vildhøj
2016	B	`conf`	Boxed Permutation Pattern Matching. CPM Mika Amit, Philip Bille, Patrick Hagge Cording, Inge Li Gørtz, Hjalte Wedel Vildhøj
2016	J	`jnl`	Computation over Compressed Structured Data (Dagstuhl Seminar 16431). Dagstuhl Reports Philip Bille, Markus Lohrey, Sebastian Maneth, Gonzalo Navarro
2016	J	`jnl`	Deterministic Indexing for Packed Strings. CoRR Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen
2016	B	`conf`	Dynamic Relative Compression, Dynamic Partial Sums, and Substring Concatenation. ISAAC Philip Bille, Patrick Hagge Cording, Inge Li Gørtz, Frederik Rye Skjoldjensen, Hjalte Wedel Vildhøj, Søren Vind
2016	—	`conf`	Finger Search in Grammar-Compressed Strings. FSTTCS Philip Bille, Anders Roy Christiansen, Patrick Hagge Cording, Inge Li Gørtz
2016	J	`jnl`	Longest common extensions in trees. Theor. Comput. Sci. Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann
2016	J	`jnl`	Space-Efficient Re-Pair Compression. CoRR Philip Bille, Inge Li Gørtz, Nicola Prezza
2016	J	`jnl`	Sparse Text Indexing in Small Space. ACM Trans. Algorithms Philip Bille, Johannes Fischer, Inge Li Gørtz, Tsvi Kopelowitz, Benjamin Sach, Hjalte Wedel Vildhøj
2016	B	`conf`	Subsequence Automata with Default Transitions. SOFSEM Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen
2015	C	`conf`	Compressed Data Structures for Range Searching. LATA Philip Bille, Inge Li Gørtz, Søren Vind
2015	J	`jnl`	Dynamic Relative Compression. CoRR Philip Bille, Patrick Hagge Cording, Inge Li Gørtz, Frederik Rye Skjoldjensen, Hjalte Wedel Vildhøj, Søren Vind
2015	J	`jnl`	Finger Search, Random Access, and Longest Common Extensions in Grammar-Compressed Strings. CoRR Philip Bille, Anders Roy Christiansen, Patrick Hagge Cording, Inge Li Gørtz
2015	B	`conf`	Longest Common Extensions in Sublinear Space. CPM Philip Bille, Inge Li Gørtz, Mathias Bæk Tejs Knudsen, Moshe Lewenstein, Hjalte Wedel Vildhøj
2015	J	`jnl`	Longest Common Extensions in Sublinear Space. CoRR Philip Bille, Inge Li Gørtz, Mathias Bæk Tejs Knudsen, Moshe Lewenstein, Hjalte Wedel Vildhøj
2015	B	`conf`	Longest Common Extensions in Trees. CPM Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann
2015	J	`jnl`	On Regular Expression Matching and Deterministic Finite Automata. Tiny Trans. Comput. Sci. Philip Bille
2015	J	`jnl`	Random Access to Grammar-Compressed Strings and Trees. SIAM J. Comput. Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann
2015	J	`jnl`	Subsequence Automata with Default Transitions. CoRR Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen
2015	J	`jnl`	Tree compression with top trees. Inf. Comput. Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann
2014	J	`jnl`	Compact Subsequence Matching and Packed Tree Coloring. CoRR Philip Bille, Patrick Hagge Cording, Inge Li Gørtz
2014	J	`jnl`	Compact q-gram profiling of compressed strings. Theor. Comput. Sci. Philip Bille, Patrick Hagge Cording, Inge Li Gørtz
2014	B	`conf`	Compressed Subsequence Matching and Packed Tree Coloring. CPM Philip Bille, Patrick Hagge Cording, Inge Li Gørtz
2014	C	`conf`	Indexing Motion Detection Data for Surveillance Video. ISM Søren Vind, Philip Bille, Inge Li Gørtz
2014	J	`jnl`	Longest Common Extensions in Trees. CoRR Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann
2014	J	`jnl`	String Indexing for Patterns with Wildcards. Theory Comput. Syst. Philip Bille, Inge Li Gørtz, Hjalte Wedel Vildhøj, Søren Vind
2014	J	`jnl`	Substring Range Reporting. Algorithmica Philip Bille, Inge Li Gørtz
2014	J	`jnl`	Time-space trade-offs for longest common extensions. J. Discrete Algorithms Philip Bille, Inge Li Gørtz, Benjamin Sach, Hjalte Wedel Vildhøj
2014	J	`jnl`	Towards optimal packed string matching. Theor. Comput. Sci. Oren Ben-Kiki, Philip Bille, Dany Breslauer, Leszek Gasieniec, Roberto Grossi, Oren Weimann
2013	B	`conf`	Compact q-Gram Profiling of Compressed Strings. CPM Philip Bille, Patrick Hagge Cording, Inge Li Gørtz
2013	J	`jnl`	Compact q-gram Profiling of Compressed Strings CoRR Philip Bille, Patrick Hagge Cording, Inge Li Gørtz
2013	J	`jnl`	Fingerprints in Compressed Strings CoRR Philip Bille, Patrick Hagge Cording, Inge Li Gørtz, Benjamin Sach, Hjalte Wedel Vildhøj, Søren Vind
2013	B	`conf`	Fingerprints in Compressed Strings. WADS Philip Bille, Patrick Hagge Cording, Inge Li Gørtz, Benjamin Sach, Hjalte Wedel Vildhøj, Søren Vind
2013	—	`conf`	Sparse Suffix Tree Construction in Small Space. ICALP (1) Philip Bille, Johannes Fischer, Inge Li Gørtz, Tsvi Kopelowitz, Benjamin Sach, Hjalte Wedel Vildhøj
2013	J	`jnl`	Tree Compression with Top Trees CoRR Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann
2013	—	`conf`	Tree Compression with Top Trees. ICALP (1) Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann
2012	J	`jnl`	Fast Arc-Annotated Subsequence Matching in Linear Space. Algorithmica Philip Bille, Inge Li Gørtz
2012	C	`conf`	Fast and Cache-Oblivious Dynamic Programming with Local Dependencies. LATA Philip Bille, Morten Stöckel
2012	J	`jnl`	Faster Approximate String Matching for Short Patterns. Theory Comput. Syst. Philip Bille
2012	C	`conf`	Longest Common Extensions via Fingerprinting. LATA Philip Bille, Inge Li Gørtz, Jesper Kristensen
2012	J	`jnl`	Sparse Suffix Tree Construction with Small Space CoRR Philip Bille, Inge Li Gørtz, Tsvi Kopelowitz, Benjamin Sach, Hjalte Wedel Vildhøj
2012	—	`conf`	String Indexing for Patterns with Wildcards. SWAT Philip Bille, Inge Li Gørtz, Hjalte Wedel Vildhøj, Søren Vind
2012	J	`jnl`	String matching with variable length gaps. Theor. Comput. Sci. Philip Bille, Inge Li Gørtz, Hjalte Wedel Vildhøj, David Kofoed Wind
2012	J	`jnl`	Time-Space Trade-Offs for Longest Common Extensions CoRR Philip Bille, Inge Li Gørtz, Benjamin Sach, Hjalte Wedel Vildhøj
2012	B	`conf`	Time-Space Trade-Offs for Longest Common Extensions. CPM Philip Bille, Inge Li Gørtz, Benjamin Sach, Hjalte Wedel Vildhøj
2011	J	`jnl`	Fast searching in packed strings. J. Discrete Algorithms Philip Bille
2011	—	`conf`	Optimal Packed String Matching. FSTTCS Oren Ben-Kiki, Philip Bille, Dany Breslauer, Leszek Gasieniec, Roberto Grossi, Oren Weimann
2011	A*	`conf`	Random Access to grammar-Compressed Strings. SODA Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann
2011	J	`jnl`	String Indexing for Patterns with Wildcards CoRR Philip Bille, Inge Li Gørtz, Hjalte Wedel Vildhøj, Søren Vind
2011	J	`jnl`	String Matching with Variable Length Gaps CoRR Philip Bille, Inge Li Gørtz, Hjalte Wedel Vildhøj, David Kofoed Wind
2011	J	`jnl`	Substring Range Reporting CoRR Philip Bille, Inge Li Gørtz
2011	B	`conf`	Substring Range Reporting. CPM Philip Bille, Inge Li Gørtz
2011	J	`jnl`	The tree inclusion problem: In linear space and faster. ACM Trans. Algorithms Philip Bille, Inge Li Gørtz
2010	B	`conf`	Fast Arc-Annotated Subsequence Matching in Linear Space. SOFSEM Philip Bille, Inge Li Gørtz
2010	J	`jnl`	Random Access to Grammar Compressed Strings CoRR Philip Bille, Gad M. Landau, Oren Weimann
2010	A*	`conf`	Regular Expression Matching with Multi-Strings and Intervals. SODA Philip Bille, Mikkel Thorup
2010	C	`conf`	String Matching with Variable Length Gaps. SPIRE Philip Bille, Inge Li Gørtz, Hjalte Wedel Vildhøj, David Kofoed Wind
2009	J	`jnl`	Fast Arc-Annotated Subsequence Matching in Linear Space CoRR Philip Bille, Inge Li Gørtz
2009	J	`jnl`	Fast Searching in Packed Strings CoRR Philip Bille
2009	B	`conf`	Fast Searching in Packed Strings. CPM Philip Bille
2009	—	`conf`	Faster Regular Expression Matching. ICALP (1) Philip Bille, Mikkel Thorup
2009	J	`jnl`	Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts. ACM Trans. Algorithms Philip Bille, Rolf Fagerberg, Inge Li Gørtz
2009	J	`jnl`	Matching subsequences in trees. J. Discrete Algorithms Philip Bille, Inge Li Gørtz
2008	J	`jnl`	Fast and compact regular expression matching. Theor. Comput. Sci. Philip Bille, Martin Farach-Colton
2008	J	`jnl`	Faster Approximate String Matching for Short Patterns CoRR Philip Bille
2007	B	`conf`	Fast Evaluation of Union-Intersection Expressions. ISAAC Philip Bille, Anna Pagh, Rasmus Pagh
2007	J	`jnl`	Fast evaluation of union-intersection expressions CoRR Philip Bille, Anna Pagh, Rasmus Pagh
2007	B	`conf`	Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts. CPM Philip Bille, Rolf Fagerberg, Inge Li Gørtz
2007	J	`jnl`	Pattern Matching in Trees and Strings CoRR Philip Bille
2006	J	`jnl`	Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts CoRR Philip Bille, Rolf Fagerberg, Inge Li Gørtz
2006	—	`conf`	Matching 2D Shapes using their Symmetry Sets. ICPR (2) Arjan Kuijper, Ole Fogh Olsen, Philip Bille, Peter J. Giblin
2006	C	`conf`	Matching Subsequences in Trees. CIAC Philip Bille, Inge Li Gørtz
2006	J	`jnl`	New Algorithms for Regular Expression Matching CoRR Philip Bille
2006	—	`conf`	New Algorithms for Regular Expression Matching. ICALP (1) Philip Bille
2006	J	`jnl`	The Tree Inclusion Problem: In Linear Space and Faster CoRR Philip Bille, Inge Li Gørtz
2005	J	`jnl`	A survey on tree edit distance and related problems. Theor. Comput. Sci. Philip Bille
2005	J	`jnl`	Fast and Compact Regular Expression Matching CoRR Philip Bille, Martin Farach-Colton
2005	J	`jnl`	Labeling Schemes for Small Distances in Trees. SIAM J. Discret. Math. Stephen Alstrup, Philip Bille, Theis Rauhe
2005	J	`jnl`	Matching Subsequences in Trees CoRR Philip Bille, Inge Li Gørtz
2005	A*	`conf`	The Tree Inclusion Problem: In Optimal Space and Faster. ICALP Philip Bille, Inge Li Gørtz
2004	—	`conf`	From a 2D Shape to a String Structure Using the Symmetry Set. ECCV (2) Arjan Kuijper, Ole Fogh Olsen, Peter J. Giblin, Philip Bille, Mads Nielsen
2003	A*	`conf`	Labeling schemes for small distances in trees. SODA Stephen Alstrup, Philip Bille, Theis Rauhe