Did you mean: tomas

search result

Cover von SOFSEM 2021: Theory and Practice of Computer Science
47th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25 - 29, 2021, Proceedings
Search for this author
Year: 2021
Publisher: Heidelberg, Springer
Series: Lecture notes in computer science : ARCoSS; 12607
Media group: MONOGRAPHIE
Cover von Unary Words Have the Smallest Levenshtein k-Neighbourhoods

Unary Words Have the Smallest Levenshtein k-Neighbourhoods

Year: 2020
Media group: LIPIcs
Cover von Improved Algorithms for the Range Next Value Problem and Applications

Improved Algorithms for the Range Next Value Problem and Applications

Year: 2008
Media group: ARTICLE
Cover von Linear-Time Computation of Shortest Covers of All Rotations of a String

Linear-Time Computation of Shortest Covers of All Rotations of a String

Author: Waleń, Tomasz; Zuba, Wiktor
Year: 2022
Media group: LIPIcs
Cover von Quasi-Linear-Time Algorithm for Longest Common Circular Factor

Quasi-Linear-Time Algorithm for Longest Common Circular Factor

Author: Straszynski, Juliusz; Zuba, Wiktor
Year: 2019
Media group: LIPIcs
Cover von Evaluating Graph Queries Using Semantic Treewidth

Evaluating Graph Queries Using Semantic Treewidth

Year: 2024
Media group: LIPIcs
Cover von Languages Given by Finite Automata over the Unary Alphabet

Languages Given by Finite Automata over the Unary Alphabet

Author: Skrzypczak, Michał; Stephan, Frank
Year: 2023
Media group: LIPIcs
Cover von An Algorithmic Bridge Between Hamming and Levenshtein Distances

An Algorithmic Bridge Between Hamming and Levenshtein Distances

Year: 2023
Media group: LIPIcs
Cover von Probabilistic vs Deterministic Gamblers

Probabilistic vs Deterministic Gamblers

Year: 2022
Media group: LIPIcs
Cover von Faster Algorithms for Longest Common Substring

Faster Algorithms for Longest Common Substring

Year: 2021
Media group: LIPIcs
OPEN V 11.1.0.0