Wiktor Zuba

Orcid: 0000-0002-1988-3507

According to our database1, Wiktor Zuba authored at least 26 papers between 2018 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Approximate Circular Pattern Matching Under Edit Distance.
Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

2023
Finding the Cyclic Covers of a String.
Proceedings of the WALCOM: Algorithms and Computation, 2023

Suffix-Prefix Queries on a Dictionary.
Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

Linear-Time Computation of Cyclic Roots and Cyclic Covers of a String.
Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

Comparing Elastic-Degenerate Strings: Algorithms, Lower Bounds, and Applications.
Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

2022
Efficient representation and counting of antipower factors in words.
Inf. Comput., 2022

Subsequence Covers of Words.
Proceedings of the String Processing and Information Retrieval, 2022

Elastic-Degenerate String Matching with 1 Error.
Proceedings of the LATIN 2022: Theoretical Informatics, 2022

Approximate Circular Pattern Matching.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Rectangular Tile Covers of 2D-Strings.
Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

Linear-Time Computation of Shortest Covers of All Rotations of a String.
Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

2021
Syntactic view of sigma-tau generation of permutations.
Theor. Comput. Sci., 2021

Shortest covers of all cyclic shifts of a string.
Theor. Comput. Sci., 2021

Circular pattern matching with <i>k</i> mismatches.
J. Comput. Syst. Sci., 2021

String Covers of a Tree.
Proceedings of the String Processing and Information Retrieval, 2021

Hardness of Detecting Abelian and Additive Square Factors in Strings.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021

Computing Covers of 2D-Strings.
Proceedings of the 32nd Annual Symposium on Combinatorial Pattern Matching, 2021

2020
Internal Quasiperiod Queries.
Proceedings of the String Processing and Information Retrieval, 2020

Efficient Enumeration of Distinct Factors Using Package Representations.
Proceedings of the String Processing and Information Retrieval, 2020

The Number of Repetitions in 2D-Strings.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

Unary Words Have the Smallest Levenshtein k-Neighbourhoods.
Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

Counting Distinct Patterns in Internal Dictionary Matching.
Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

2019
Weighted Shortest Common Supersequence Problem Revisited.
Proceedings of the String Processing and Information Retrieval, 2019

Circular Pattern Matching with k Mismatches.
Proceedings of the Fundamentals of Computation Theory - 22nd International Symposium, 2019

Quasi-Linear-Time Algorithm for Longest Common Circular Factor.
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2018
Faster Recovery of Approximate Periods over Edit Distance.
Proceedings of the String Processing and Information Retrieval, 2018


  Loading...