| String matching with variable length gaps P Bille, IL Gørtz, HW Vildhøj, DK Wind Theoretical Computer Science 443, 25-34, 2012 | 89 | 2012 |
| Time–space trade-offs for lempel–ziv compressed indexing P Bille, MB Ettienne, IL Gørtz, HW Vildhøj Theoretical Computer Science 713, 66-77, 2018 | 51 | 2018 |
| Fingerprints in compressed strings P Bille, IL Gørtz, PH Cording, B Sach, HW Vildhøj, S Vind Journal of Computer and System Sciences 86, 171-180, 2017 | 43 | 2017 |
| Time–space trade-offs for longest common extensions P Bille, IL Gørtz, B Sach, HW Vildhøj Journal of Discrete Algorithms 25, 42-50, 2014 | 43 | 2014 |
| String indexing for patterns with wildcards P Bille, IL Gørtz, HW Vildhøj, S Vind Theory of Computing Systems 55 (1), 41-60, 2014 | 36 | 2014 |
| Longest common extensions in sublinear space P Bille, IL Gørtz, MBT Knudsen, M Lewenstein, HW Vildhøj Annual Symposium on Combinatorial Pattern Matching, 65-76, 2015 | 32 | 2015 |
| Sublinear space algorithms for the longest common substring problem T Kociumaka, T Starikovskaya, HW Vildhøj European Symposium on Algorithms, 605-617, 2014 | 31 | 2014 |
| Dynamic relative compression, dynamic partial sums, and substring concatenation P Bille, AR Christiansen, PH Cording, IL Gørtz, FR Skjoldjensen, ... Algorithmica 80, 3207-3224, 2018 | 28 | 2018 |
| Time-space trade-offs for the longest common substring problem T Starikovskaya, HW Vildhøj Combinatorial Pattern Matching: 24th Annual Symposium, CPM 2013, Bad …, 2013 | 25 | 2013 |
| A suffix tree or not a suffix tree? T Starikovskaya, HW Vildhøj Journal of Discrete Algorithms 32, 14-23, 2015 | 23 | 2015 |
| Sparse text indexing in small space P Bille, J Fischer, IL Gørtz, T Kopelowitz, B Sach, HW Vildhøj ACM Transactions on Algorithms (TALG) 12 (3), 1-19, 2016 | 22 | 2016 |
| String indexing for patterns with wildcards P Bille, IL Gørtz, HW Vildhøj, S Vind Algorithm Theory–SWAT 2012: 13th Scandinavian Symposium and Workshops …, 2012 | 19 | 2012 |
| Sparse suffix tree construction in small space P Bille, J Fischer, IL Gørtz, T Kopelowitz, B Sach, HW Vildhøj International colloquium on automata, languages, and programming, 148-159, 2013 | 15 | 2013 |
| Time-space trade-offs for longest common extensions P Bille, IL Gørtz, B Sach, HW Vildhøj Annual Symposium on Combinatorial Pattern Matching, 293-305, 2012 | 13 | 2012 |
| Dynamic and approximate pattern matching in 2D R Clifford, A Fontaine, T Starikovskaya, HW Vildhøj International Symposium on String Processing and Information Retrieval, 133-144, 2016 | 5 | 2016 |
| Boxed permutation pattern matching M Amit, P Bille, P Hagge Cording, I Li Gørtz, H Wedel Vildhøj 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), 20: 1-20: 11, 2016 | 4 | 2016 |
| Dynamic relative compression P Bille, PH Cording, IL Gørtz, FR Skjoldjensen, HW Vildhøj, S Vind arXiv preprint arXiv:1504.07851, 2015 | 4 | 2015 |
| Topics in combinatorial pattern matching HW Vildhøj Technical University of Denmark, 2015 | 1 | 2015 |
| String Indexing for Patterns with Wildcards HW Vildhøj, S Vind Master’s thesis, Technical University of Denmark, 2011. http://www. imm. dtu …, 2011 | 1 | 2011 |
| Secure protocol implementation with lysa S Vind, HW Vildhøj Technical University of Denmark, DTU, DK-2800 Kgs. Lyngby, Denmark, 2009 | 1 | 2009 |
