Carl Philipp Reh

According to our database, Carl Philipp Reh authored at least 11 papers between 2016 and 2021.

Collaborative distances:

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

2021

The Smallest Grammar Problem Revisited.

Hideo Bannai, Momoko Hirayama, Danny Hucke, Shunsuke Inenaga, Artur Jez, Markus Lohrey, Carl Philipp Reh

IEEE Trans. Inf. Theory, 2021

Approximation Ratios of RePair, LongestMatch and Greedy on Unary Strings.

Danny Hucke, Carl Philipp Reh

Algorithms, 2021

2020

Grammar-Based Compression of Unranked Trees.

Adrià Gascón, Markus Lohrey, Sebastian Maneth, Carl Philipp Reh, Kurt Sieber

Theory Comput. Syst., 2020

Navigating Forest Straight-Line Programs in Constant Time.

Carl Philipp Reh, Kurt Sieber

Proceedings of the String Processing and Information Retrieval, 2020

2019

Algorithmic aspects of grammar-compressed trees.

Carl Philipp Reh

PhD thesis, 2019

Size-optimal top dag compression.

Markus Lohrey, Carl Philipp Reh, Kurt Sieber

Inf. Process. Lett., 2019

2018

Constant-Time Tree Traversal and Subtree Equality Check for Grammar-Compressed Trees.

Markus Lohrey, Sebastian Maneth, Carl Philipp Reh

Algorithmica, 2018

2017

Optimal top dag compression.

Markus Lohrey, Carl Philipp Reh, Kurt Sieber

CoRR, 2017

Compression of Unordered XML Trees.

Markus Lohrey, Sebastian Maneth, Carl Philipp Reh

Proceedings of the 20th International Conference on Database Theory, 2017

2016

The Smallest Grammar Problem Revisited.

Danny Hucke, Markus Lohrey, Carl Philipp Reh

Proceedings of the String Processing and Information Retrieval, 2016

Traversing Grammar-Compressed Trees with Constant Delay.

Markus Lohrey, Sebastian Maneth, Carl Philipp Reh

Proceedings of the 2016 Data Compression Conference, 2016