Anders Roy Christiansen

According to our database, Anders Roy Christiansen authored at least 9 papers between 2015 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

Optimal-Time Dictionary-Compressed Indexes.

Anders Roy Christiansen, Mikko Berggren Ettienne, Tomasz Kociumaka, Gonzalo Navarro, Nicola Prezza

ACM Trans. Algorithms, 2021

2018

Compressed and Practical Data Structures for Strings.

Anders Roy Christiansen

PhD thesis, 2018

Finger Search in Grammar-Compressed Strings.

Philip Bille, Anders Roy Christiansen, Patrick Hagge Cording, Inge Li Gørtz

Theory Comput. Syst., 2018

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

Philip Bille, Anders Roy Christiansen, Patrick Hagge Cording, Inge Li Gørtz, Frederik Rye Skjoldjensen, Hjalte Wedel Vildhøj, Søren Vind

Algorithmica, 2018

Compressed Indexing with Signature Grammars.

Anders Roy Christiansen, Mikko Berggren Ettienne

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017

Succinct Partial Sums and Fenwick Trees.

Philip Bille, Anders Roy Christiansen, Nicola Prezza, Frederik Rye Skjoldjensen

Proceedings of the String Processing and Information Retrieval, 2017

Fast Dynamic Arrays.

Philip Bille, Anders Roy Christiansen, Mikko Berggren Ettienne, Inge Li Gørtz

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016

Parallel Lookups in String Indexes.

Anders Roy Christiansen, Martin Farach-Colton

Proceedings of the String Processing and Information Retrieval, 2016

2015

Finger Search, Random Access, and Longest Common Extensions in Grammar-Compressed Strings.

Philip Bille, Anders Roy Christiansen, Patrick Hagge Cording, Inge Li Gørtz

CoRR, 2015