Stop the war!Остановите войну!
for scientists:
Google
Google Scholar
Semantic Scholar
IA Scholar
CiteSeerX
ORCIDPhilip Bille
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j29]Philip Bille
, Inge Li Gørtz, Frederik Rye Skjoldjensen:
Partial sums on the ultra-wide word RAM. Theor. Comput. Sci. 905: 99-105 (2022)- [c53]Philip Bille, Inge Li Gørtz, Shay Mozes, Teresa Anna Steiner, Oren Weimann:
The Fine-Grained Complexity of Episode Matching. CPM 2022: 4:1-4:12 - [c52]Philip Bille, Inge Li Gørtz, Tord Stordalen:
Predecessor on the Ultra-Wide Word RAM. SWAT 2022: 18:1-18:15 - [i49]Philip Bille, Inge Li Gørtz, Tord Stordalen:
Predecessor on the Ultra-Wide Word RAM. CoRR abs/2201.11550 (2022) - [i48]Philip Bille, Inge Li Gørtz, Tord Stordalen:
The Complexity of the Co-Occurrence Problem. CoRR abs/2206.10383 (2022) - 2021
- [j28]Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Top Tree Compression of Tries. Algorithmica 83(12): 3602-3628 (2021) - [c51]Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Teresa Anna Steiner:
Gapped Indexing for Consecutive Occurrences. CPM 2021: 10:1-10:19 - [i47]Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Teresa Anna Steiner:
Gapped Indexing for Consecutive Occurrences. CoRR abs/2102.02505 (2021) - [i46]Philip Bille, Inge Li Gørtz, Shay Mozes, Teresa Anna Steiner, Oren Weimann:
A Conditional Lower Bound for Episode Matching. CoRR abs/2108.08613 (2021) - 2020
- [j27]Philip Bille:
Editorial: Special Issue on Data Compression Algorithms and Their Applications. Algorithms 13(1): 28 (2020) - [c50]Philip Bille, Mikko Berggren Ettienne, Travis Gagie, Inge Li Gørtz, Nicola Prezza:
Decompressing Lempel-Ziv Compressed Text. DCC 2020: 143-152 - [c49]Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Eva Rotenberg, Teresa Anna Steiner:
String Indexing for Top-k Close Consecutive Occurrences. FSTTCS 2020: 14:1-14:17 - [c48]Philip Bille, Jonas Ellert, Johannes Fischer, Inge Li Gørtz, Florian Kurpicz, J. Ian Munro, Eva Rotenberg:
Space Efficient Construction of Lyndon Arrays in Linear Time. ICALP 2020: 14:1-14:18 - [c47]Philip Bille, Inge Li Gørtz:
Random Access in Persistent Strings. ISAAC 2020: 48:1-48:16 - [c46]Philip Bille, Inge Li Gørtz, Teresa Anna Steiner:
String Indexing with Compressed Patterns. STACS 2020: 10:1-10:13 - [c45]Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen:
Partial Sums on the Ultra-Wide Word RAM. TAMC 2020: 13-24 - [i45]Philip Bille, Inge Li Gørtz:
Random Access in Persistent Strings. CoRR abs/2006.15575 (2020) - [i44]Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Eva Rotenberg, Teresa Anna Steiner:
String Indexing for Top-k Close Consecutive Occurrences. CoRR abs/2007.04128 (2020)
2010 – 2019
- 2019
- [c44]Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Top Tree Compression of Tries. ISAAC 2019: 4:1-4:18 - [c43]Philip Bille, Inge Li Gørtz:
From Regular Expression Matching to Parsing. MFCS 2019: 71:1-71:14 - [i43]Philip Bille, Mikko Berggren Ettienne, Inge Li Gørtz:
Mergeable Dictionaries With Shifts. CoRR abs/1901.00718 (2019) - [i42]Philip Bille, Inge Li Gørtz, Pawel Gawrychowski, Gad M. Landau, Oren Weimann:
Top Tree Compression of Tries. CoRR abs/1902.02187 (2019) - [i41]Philip Bille, Inge Li Gørtz:
Sparse Regular Expression Matching. CoRR abs/1907.04752 (2019) - [i40]Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen:
Partial Sums on the Ultra-Wide Word RAM. CoRR abs/1908.10159 (2019) - [i39]Philip Bille, Inge Li Gørtz, Teresa Anna Steiner:
String Indexing with Compressed Patterns. CoRR abs/1909.11930 (2019) - [i38]Philip Bille, Jonas Ellert, Johannes Fischer, Inge Li Gørtz, Florian Kurpicz, Ian Munro, Eva Rotenberg:
Space Efficient Construction of Lyndon Arrays in Linear Time. CoRR abs/1911.03542 (2019) - 2018
- [j26]Philip Bille, Anders Roy Christiansen, Patrick Hagge Cording, Inge Li Gørtz, Frederik Rye Skjoldjensen, Hjalte Wedel Vildhøj, Søren Vind:
Dynamic Relative Compression, Dynamic Partial Sums, and Substring Concatenation. Algorithmica 80(11): 3207-3224 (2018) - [j25]Philip Bille, Travis Gagie, Inge Li Gørtz, Nicola Prezza:
A separation between RLSLPs and LZ77. J. Discrete Algorithms 50: 36-39 (2018) - [j24]Philip Bille, Anders Roy Christiansen, Patrick Hagge Cording, Inge Li Gørtz:
Finger Search in Grammar-Compressed Strings. Theory Comput. Syst. 62(8): 1715-1735 (2018) - [j23]Philip Bille, Mikko Berggren Ettienne, Inge Li Gørtz, Hjalte Wedel Vildhøj:
Time-space trade-offs for Lempel-Ziv compressed indexing. Theor. Comput. Sci. 713: 66-77 (2018) - [c42]Philip Bille, Mikko Berggren Ettienne, Roberto Grossi, Inge Li Gørtz, Eva Rotenberg:
Compressed Communication Complexity of Longest Common Prefixes. SPIRE 2018: 74-87 - [i37]Philip Bille, Mikko Berggren Ettienne, Travis Gagie, Inge Li Gørtz, Nicola Prezza:
Fast Lempel-Ziv Decompression in Linear Space. CoRR abs/1802.10347 (2018) - [i36]Philip Bille, Inge Li Gørtz:
From Regular Expression Matching to Parsing. CoRR abs/1804.02906 (2018) - [i35]Philip Bille, Mikko Berggren Ettienne, Roberto Grossi, Inge Li Gørtz, Eva Rotenberg:
Compressed Communication Complexity of Longest Common Prefixes. CoRR abs/1806.03102 (2018) - 2017
- [j22]Philip Bille, Patrick Hagge Cording, Inge Li Gørtz:
Compressed Subsequence Matching and Packed Tree Coloring. Algorithmica 77(2): 336-348 (2017) - [j21]Philip Bille, Inge Li Gørtz, Patrick Hagge Cording, Benjamin Sach, Hjalte Wedel Vildhøj, Søren Vind:
Fingerprints in compressed strings. J. Comput. Syst. Sci. 86: 171-180 (2017) - [j20]Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen:
Subsequence automata with default transitions. J. Discrete Algorithms 44: 48-55 (2017) - [c41]Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen:
Deterministic Indexing for Packed Strings. CPM 2017: 6:1-6:11 - [c40]Philip Bille, Patrick Hagge Cording, Johannes Fischer, Inge Li Gørtz:
Lempel-Ziv Compression in a Sliding Window. CPM 2017: 15:1-15:11 - [c39]Philip Bille, Mikko Berggren Ettienne, Inge Li Gørtz, Hjalte Wedel Vildhøj:
Time-Space Trade-Offs for Lempel-Ziv Compressed Indexing. CPM 2017: 16:1-16:17 - [c38]Philip Bille, Inge Li Gørtz, Nicola Prezza:
Space-Efficient Re-Pair Compression. DCC 2017: 171-180 - [c37]Philip Bille, Anders Roy Christiansen, Mikko Berggren Ettienne, Inge Li Gørtz:
Fast Dynamic Arrays. ESA 2017: 16:1-16:13 - [c36]Philip Bille, Inge Li Gørtz:
Immersive Algorithms: Better Visualization with Less Information. ITiCSE 2017: 80-81 - [c35]Philip Bille, Anders Roy Christiansen, Nicola Prezza, Frederik Rye Skjoldjensen:
Succinct Partial Sums and Fenwick Trees. SPIRE 2017: 91-96 - [c34]Philip Bille, Finn Fernstrøm, Inge Li Gørtz:
Tight Bounds for Top Tree Compression. SPIRE 2017: 97-102 - [i34]Philip Bille, Inge Li Gørtz, Nicola Prezza:
Practical and Effective Re-Pair Compression. CoRR abs/1704.08558 (2017) - [i33]Philip Bille, Anders Roy Christiansen, Nicola Prezza, Frederik Rye Skjoldjensen:
Succinct Partial Sums and Fenwick Trees. CoRR abs/1705.10987 (2017) - [i32]Philip Bille, Mikko Berggren Ettienne, Inge Li Gørtz, Hjalte Wedel Vildhøj:
Time-Space Trade-Offs for Lempel-Ziv Compressed Indexing. CoRR abs/1706.10094 (2017) - [i31]Philip Bille, Anders Roy Christiansen, Mikko Berggren Ettienne, Inge Li Gørtz:
Fast Dynamic Arrays. CoRR abs/1711.00275 (2017) - [i30]Philip Bille, Travis Gagie, Inge Li Gørtz, Nicola Prezza:
A Separation Between Run-Length SLPs and LZ77. CoRR abs/1711.07270 (2017) - 2016
- [j19]Philip Bille, Johannes Fischer, Inge Li Gørtz, Tsvi Kopelowitz, Benjamin Sach, Hjalte Wedel Vildhøj:
Sparse Text Indexing in Small Space. ACM Trans. Algorithms 12(3): 39:1-39:19 (2016) - [j18]Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Longest common extensions in trees. Theor. Comput. Sci. 638: 98-107 (2016) - [c33]Mika Amit, Philip Bille, Patrick Hagge Cording, Inge Li Gørtz, Hjalte Wedel Vildhøj:
Boxed Permutation Pattern Matching. CPM 2016: 20:1-20:11 - [c32]Philip Bille, Anders Roy Christiansen, Patrick Hagge Cording, Inge Li Gørtz:
Finger Search in Grammar-Compressed Strings. FSTTCS 2016: 36:1-36:16 - [c31]Philip Bille, Patrick Hagge Cording, Inge Li Gørtz, Frederik Rye Skjoldjensen, Hjalte Wedel Vildhøj, Søren Vind:
Dynamic Relative Compression, Dynamic Partial Sums, and Substring Concatenation. ISAAC 2016: 18:1-18:13 - [c30]Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen:
Subsequence Automata with Default Transitions. SOFSEM 2016: 208-216 - [i29]Philip Bille, Inge Li Gørtz, Nicola Prezza:
Space-Efficient Re-Pair Compression. CoRR abs/1611.01479 (2016) - [i28]Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen:
Deterministic Indexing for Packed Strings. CoRR abs/1612.01748 (2016) - [i27]Philip Bille, Markus Lohrey, Sebastian Maneth, Gonzalo Navarro:
Computation over Compressed Structured Data (Dagstuhl Seminar 16431). Dagstuhl Reports 6(10): 99-119 (2016) - 2015
- [j17]Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Tree compression with top trees. Inf. Comput. 243: 166-177 (2015) - [j16]Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann:
Random Access to Grammar-Compressed Strings and Trees. SIAM J. Comput. 44(3): 513-539 (2015) - [c29]Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Longest Common Extensions in Trees. CPM 2015: 52-64 - [c28]Philip Bille, Inge Li Gørtz, Mathias Bæk Tejs Knudsen, Moshe Lewenstein, Hjalte Wedel Vildhøj:
Longest Common Extensions in Sublinear Space. CPM 2015: 65-76 - [c27]Philip Bille, Inge Li Gørtz, Søren Vind:
Compressed Data Structures for Range Searching. LATA 2015: 577-586 - [i26]Philip Bille, Inge Li Gørtz, Mathias Bæk Tejs Knudsen, Moshe Lewenstein, Hjalte Wedel Vildhøj:
Longest Common Extensions in Sublinear Space. CoRR abs/1504.02671 (2015) - [i25]Philip Bille, Patrick Hagge Cording, Inge Li Gørtz, Frederik Rye Skjoldjensen, Hjalte Wedel Vildhøj, Søren Vind:
Dynamic Relative Compression. CoRR abs/1504.07851 (2015) - [i24]Philip Bille, Anders Roy Christiansen, Patrick Hagge Cording, Inge Li Gørtz:
Finger Search, Random Access, and Longest Common Extensions in Grammar-Compressed Strings. CoRR abs/1507.02853 (2015) - [i23]Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen:
Subsequence Automata with Default Transitions. CoRR abs/1510.08748 (2015) - [i22]Philip Bille:
On Regular Expression Matching and Deterministic Finite Automata. Tiny Trans. Comput. Sci. 3 (2015) - 2014
- [j15]Philip Bille, Inge Li Gørtz:
Substring Range Reporting. Algorithmica 69(2): 384-396 (2014) - [j14]Philip Bille, Inge Li Gørtz, Benjamin Sach, Hjalte Wedel Vildhøj:
Time-space trade-offs for longest common extensions. J. Discrete Algorithms 25: 42-50 (2014) - [j13]Philip Bille, Inge Li Gørtz, Hjalte Wedel Vildhøj, Søren Vind:
String Indexing for Patterns with Wildcards. Theory Comput. Syst. 55(1): 41-60 (2014) - [j12]Oren Ben-Kiki, Philip Bille, Dany Breslauer, Leszek Gasieniec, Roberto Grossi, Oren Weimann:
Towards optimal packed string matching. Theor. Comput. Sci. 525: 111-129 (2014) - [j11]Philip Bille, Patrick Hagge Cording, Inge Li Gørtz:
Compact q-gram profiling of compressed strings. Theor. Comput. Sci. 550: 51-58 (2014) - [c26]Philip Bille, Patrick Hagge Cording, Inge Li Gørtz:
Compressed Subsequence Matching and Packed Tree Coloring. CPM 2014: 40-49 - [c25]Søren Vind, Philip Bille, Inge Li Gørtz:
Indexing Motion Detection Data for Surveillance Video. ISM 2014: 24-27 - [i21]Philip Bille, Patrick Hagge Cording, Inge Li Gørtz:
Compact Subsequence Matching and Packed Tree Coloring. CoRR abs/1403.1065 (2014) - [i20]Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Longest Common Extensions in Trees. CoRR abs/1412.1254 (2014) - 2013
- [c24]Philip Bille, Patrick Hagge Cording, Inge Li Gørtz:
Compact q-Gram Profiling of Compressed Strings. CPM 2013: 62-73 - [c23]Philip Bille, Johannes Fischer, Inge Li Gørtz, Tsvi Kopelowitz, Benjamin Sach, Hjalte Wedel Vildhøj:
Sparse Suffix Tree Construction in Small Space. ICALP (1) 2013: 148-159 - [c22]Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Tree Compression with Top Trees. ICALP (1) 2013: 160-171 - [c21]Philip Bille, Patrick Hagge Cording, Inge Li Gørtz, Benjamin Sach, Hjalte Wedel Vildhøj, Søren Vind:
Fingerprints in Compressed Strings. WADS 2013: 146-157 - [i19]Philip Bille, Patrick Hagge Cording, Inge Li Gørtz:
Compact q-gram Profiling of Compressed Strings. CoRR abs/1304.5373 (2013) - [i18]Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Tree Compression with Top Trees. CoRR abs/1304.5702 (2013) - [i17]Philip Bille, Patrick Hagge Cording, Inge Li Gørtz, Benjamin Sach, Hjalte Wedel Vildhøj, Søren Vind:
Fingerprints in Compressed Strings. CoRR abs/1305.2777 (2013) - 2012
- [j10]Philip Bille, Inge Li Gørtz:
Fast Arc-Annotated Subsequence Matching in Linear Space. Algorithmica 62(1-2): 209-223 (2012) - [j9]Philip Bille:
Faster Approximate String Matching for Short Patterns. Theory Comput. Syst. 50(3): 492-515 (2012) - [j8]Philip Bille, Inge Li Gørtz, Hjalte Wedel Vildhøj, David Kofoed Wind:
String matching with variable length gaps. Theor. Comput. Sci. 443: 25-34 (2012) - [c20]Philip Bille, Inge Li Gørtz, Benjamin Sach, Hjalte Wedel Vildhøj:
Time-Space Trade-Offs for Longest Common Extensions. CPM 2012: 293-305 - [c19]Philip Bille, Inge Li Gørtz, Jesper Kristensen:
Longest Common Extensions via Fingerprinting. LATA 2012: 119-130 - [c18]Philip Bille, Morten Stöckel:
Fast and Cache-Oblivious Dynamic Programming with Local Dependencies. LATA 2012: 131-142 - [c17]Philip Bille, Inge Li Gørtz, Hjalte Wedel Vildhøj, Søren Vind:
String Indexing for Patterns with Wildcards. SWAT 2012: 283-294 - [i16]Philip Bille, Inge Li Gørtz, Tsvi Kopelowitz, Benjamin Sach, Hjalte Wedel Vildhøj:
Sparse Suffix Tree Construction with Small Space. CoRR abs/1207.1135 (2012) - [i15]Philip Bille, Inge Li Gørtz, Benjamin Sach, Hjalte Wedel Vildhøj:
Time-Space Trade-Offs for Longest Common Extensions. CoRR abs/1211.0270 (2012) - 2011
- [j7]Philip Bille:
Fast searching in packed strings. J. Discrete Algorithms 9(1): 49-56 (2011) - [j6]Philip Bille, Inge Li Gørtz:
The tree inclusion problem: In linear space and faster. ACM Trans. Algorithms 7(3): 38:1-38:47 (2011) - [c16]Philip Bille, Inge Li Gørtz:
Substring Range Reporting. CPM 2011: 299-308 - [c15]Oren Ben-Kiki, Philip Bille, Dany Breslauer, Leszek Gasieniec, Roberto Grossi, Oren Weimann:
Optimal Packed String Matching. FSTTCS 2011: 423-432 - [c14]Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann:
Random Access to grammar-Compressed Strings. SODA 2011: 373-389 - [i14]Philip Bille, Inge Li Gørtz:
Substring Range Reporting. CoRR abs/1108.3683 (2011) - [i13]Philip Bille, Inge Li Gørtz, Hjalte Wedel Vildhøj, David Kofoed Wind:
String Matching with Variable Length Gaps. CoRR abs/1110.2893 (2011) - [i12]Philip Bille, Inge Li Gørtz, Hjalte Wedel Vildhøj, Søren Vind:
String Indexing for Patterns with Wildcards. CoRR abs/1110.5236 (2011) - 2010
- [c13]Philip Bille, Mikkel Thorup:
Regular Expression Matching with Multi-Strings and Intervals. SODA 2010: 1297-1308 - [c12]Philip Bille, Inge Li Gørtz:
Fast Arc-Annotated Subsequence Matching in Linear Space. SOFSEM 2010: 188-199 - [c11]Philip Bille, Inge Li Gørtz, Hjalte Wedel Vildhøj, David Kofoed Wind:
String Matching with Variable Length Gaps. SPIRE 2010: 385-394 - [i11]Philip Bille, Gad M. Landau, Oren Weimann:
Random Access to Grammar Compressed Strings. CoRR abs/1001.1565 (2010)
2000 – 2009
- 2009
- [j5]Philip Bille, Inge Li Gørtz:
Matching subsequences in trees. J. Discrete Algorithms 7(3): 306-314 (2009) - [j4]Philip Bille, Rolf Fagerberg, Inge Li Gørtz:
Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts. ACM Trans. Algorithms 6(1): 3:1-3:14 (2009) - [c10]Philip Bille:
Fast Searching in Packed Strings. CPM 2009: 116-126 - [c9]Philip Bille, Mikkel Thorup:
Faster Regular Expression Matching. ICALP (1) 2009: 171-182 - [i10]Philip Bille:
Fast Searching in Packed Strings. CoRR abs/0907.3135 (2009) - [i9]Philip Bille, Inge Li Gørtz:
Fast Arc-Annotated Subsequence Matching in Linear Space. CoRR abs/0911.0577 (2009) - 2008
- [j3]Philip Bille, Martin Farach-Colton:
Fast and compact regular expression matching. Theor. Comput. Sci. 409(3): 486-496 (2008) - [i8]Philip Bille:
Faster Approximate String Matching for Short Patterns. CoRR abs/0811.3490 (2008) - 2007
- [c8]Philip Bille, Rolf Fagerberg, Inge Li Gørtz:
Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts. CPM 2007: 52-62 - [c7]Philip Bille, Anna Pagh, Rasmus Pagh:
Fast Evaluation of Union-Intersection Expressions. ISAAC 2007: 739-750 - [i7]Philip Bille, Anna Pagh, Rasmus Pagh:
Fast evaluation of union-intersection expressions. CoRR abs/0708.3259 (2007) - [i6]Philip Bille:
Pattern Matching in Trees and Strings. CoRR abs/0708.4288 (2007) - 2006
- [c6]Philip Bille, Inge Li Gørtz:
Matching Subsequences in Trees. CIAC 2006: 248-259 - [c5]Philip Bille:
New Algorithms for Regular Expression Matching. ICALP (1) 2006: 643-654 - [c4]Arjan Kuijper, Ole Fogh Olsen, Philip Bille, Peter J. Giblin:
Matching 2D Shapes using their Symmetry Sets. ICPR (2) 2006: 179-182 - [i5]Philip Bille:
New Algorithms for Regular Expression Matching. CoRR abs/cs/0606116 (2006) - [i4]Philip Bille, Inge Li Gørtz:
The Tree Inclusion Problem: In Linear Space and Faster. CoRR abs/cs/0608124 (2006) - [i3]Philip Bille, Rolf Fagerberg, Inge Li Gørtz:
Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts. CoRR abs/cs/0609085 (2006) - 2005
- [j2]