Cristian Urbina

Orcid: 0000-0001-8979-9055

According to our database1, Cristian Urbina authored at least 15 papers between 2021 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Incongruity-sensitive access to highly compressed strings.
CoRR, February, 2026

On Occurrence-Preserving Morphisms.
Proceedings of the 37th Annual Symposium on Combinatorial Pattern Matching, 2026

Sensitivity of Repetitiveness Measures to String Reversal.
Proceedings of the 37th Annual Symposium on Combinatorial Pattern Matching, 2026

2025
Generalized straight-line programs.
Acta Informatica, March, 2025

Repetitiveness measures based on string morphisms.
Theor. Comput. Sci., 2025

Smallest Suffixient Sets as a Repetitiveness Measure.
Proceedings of the String Processing and Information Retrieval, 2025

Morphisms and BWT-Run Sensitivity.
Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science, 2025

2024
Exploring Repetitiveness Measures for Two-Dimensional Strings.
CoRR, 2024

Generalization of Repetitiveness Measures for Two-Dimensional Strings.
Proceedings of the String Processing and Information Retrieval, 2024

Iterated Straight-Line Programs.
Proceedings of the LATIN 2024: Theoretical Informatics, 2024

2023
Bit Catastrophes for the Burrows-Wheeler Transform.
Proceedings of the Developments in Language Theory - 27th International Conference, 2023

L-Systems for Measuring Repetitiveness.
Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

On the Impact of Morphisms on BWT-Runs.
Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

2022
Balancing Run-Length Straight-Line Programs.
Proceedings of the String Processing and Information Retrieval, 2022

2021
On Stricter Reachable Repetitiveness Measures.
Proceedings of the String Processing and Information Retrieval, 2021


  Loading...