Juliusz Straszynski

According to our database, Juliusz Straszynski authored at least 17 papers between 2018 and 2022.

Collaborative distances:

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

2022

Efficient representation and counting of antipower factors in words.

Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba

Inf. Comput., 2022

Efficient Computation of Sequence Mappability.

Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Juliusz Straszynski

Algorithmica, 2022

Rectangular Tile Covers of 2D-Strings.

Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba

Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

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

Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba

Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

2021

Shortest covers of all cyclic shifts of a string.

Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba

Theor. Comput. Sci., 2021

Circular pattern matching with <i>k</i> mismatches.

Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba

J. Comput. Syst. Sci., 2021

A lower bound for the coverability problem in acyclic pushdown VAS.

Matthias Englert, Piotr Hofman, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Juliusz Straszynski

Inf. Process. Lett., 2021

String Covers of a Tree.

Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba

Proceedings of the String Processing and Information Retrieval, 2021

Hardness of Detecting Abelian and Additive Square Factors in Strings.

Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020

Internal Quasiperiod Queries.

Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba

Proceedings of the String Processing and Information Retrieval, 2020

Efficient Computation of 2-Covers of a String.

Jakub Radoszewski, Juliusz Straszynski

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

Counting Distinct Patterns in Internal Dictionary Matching.

Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba

Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

2019

Weighted Shortest Common Supersequence Problem Revisited.

Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba

Proceedings of the String Processing and Information Retrieval, 2019

Circular Pattern Matching with k Mismatches.

Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba

Proceedings of the Fundamentals of Computation Theory - 22nd International Symposium, 2019

Quasi-Linear-Time Algorithm for Longest Common Circular Factor.

Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba

Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2018

Faster Recovery of Approximate Periods over Edit Distance.

Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba

Proceedings of the String Processing and Information Retrieval, 2018

Efficient Computation of Sequence Mappability.

Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Juliusz Straszynski

Proceedings of the String Processing and Information Retrieval, 2018