Philip Bille

2022

doi dblp
The Complexity of the Co-occurrence Problem.
Philip Bille|Inge Li Gørtz|Tord Stordalen
String Processing and Information Retrieval - 29th International Symposium, SPIRE 2022, Concepción, Chile, November 8-10, 2022, Proceedings

2018

doi dblp
Compressed Communication Complexity of Longest Common Prefixes.
Philip Bille|Mikko Berggren Ettienne|Roberto Grossi|Inge Li Gørtz|Eva Rotenberg
String Processing and Information Retrieval - 25th International Symposium, SPIRE 2018, Lima, Peru, October 9-11, 2018, Proceedings

2017

doi dblp
Succinct Partial Sums and Fenwick Trees.
Philip Bille|Anders Roy Christiansen|Nicola Prezza|Frederik Rye Skjoldjensen
String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Palermo, Italy, September 26-29, 2017, Proceedings
doi dblp
Tight Bounds for Top Tree Compression.
Philip Bille|Finn Fernstrøm|Inge Li Gørtz
String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Palermo, Italy, September 26-29, 2017, Proceedings

2010

doi dblp
String Matching with Variable Length Gaps.
Philip Bille|Inge Li Gørtz|Hjalte Wedel Vildhøj|David Kofoed Wind
String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Los Cabos, Mexico, October 11-13, 2010. Proceedings