Juliusz Straszyński

Available identifiers

Publication	Date of Publication	Type
Linear-time computation of shortest covers of all rotations of a string	2024-05-06	Paper
Rectangular tile covers of 2D-strings	2024-05-06	Paper
Weighted shortest common supersequence problem revisited	2024-04-19	Paper
https://portal.mardi4nfdi.de/entity/Q6075975	2023-09-20	Paper
Faster recovery of approximate periods over edit distance	2023-07-28	Paper
Efficient computation of sequence mappability	2023-07-28	Paper
https://portal.mardi4nfdi.de/entity/Q5874434	2023-02-07	Paper
Efficient Computation of 2-Covers of a String.	2023-02-07	Paper
Internal Quasiperiod Queries	2022-12-22	Paper
Quasi-Linear-Time Algorithm for Longest Common Circular Factor	2022-07-18	Paper
String covers of a tree	2022-06-15	Paper
Efficient representation and counting of antipower factors in words	2022-06-13	Paper
Efficient computation of sequence mappability	2022-05-03	Paper
Shortest covers of all cyclic shifts of a string	2021-04-14	Paper
A lower bound for the coverability problem in acyclic pushdown VAS	2021-03-11	Paper
Circular pattern matching with \(k\) mismatches	2020-10-23	Paper
Shortest covers of all cyclic shifts of a string	2020-07-22	Paper
Circular pattern matching with \(k\) mismatches	2020-01-30	Paper
Efficient representation and counting of antipower factors in words	2019-12-04	Paper

This page was built for person: Juliusz Straszyński