Movatterモバイル変換

[0]ホーム
URL:

×

zbMATH Open — the first resource for mathematics

from until
Reset all

Examples

Simon Donald*Search inall parts of an author's name (results containSimon, Donald M. andDonaldson,Simon Kirwan).
ln: Donald* fn: SimonSearch for specified family (ln) and given (fn) name.
au: Stefan Müller cc:49Combine name search (au) with main MSC fields (cc).
au: Helga BunkeSearch results includename variations, in particularname changes, differenttransliterations andpseudonyms. Names of collectives will be displayed as a separate entity.
(st:r & b) | (st:o)Search results include allreviewers withbiographic information orcollectives.
(en:MGP | wikidata) ln:a*Search results include all authors having either anentry in theMath Genealogy Project or inWikidata and whose family name starts with''A''.
aw: Fields AbelSearch for allFields Medalaward winners who also received anAbel Prize. The& operator is default and ommitted here.

Fields

ai zbMATH author ID
any Includes ai, au, aw, cc
au Author name
aw Name of an award (to find laureates)
cc Main Fields of the author (given by first two MSC digits)
cm Name of a collective (to find members of this collective)
co Name of an author (to find collectives the author is a member of)
en External author ID: ORCID, MGP, Wikidata object number and others
fn First name
ln Last name
py Year(s) in which the author has published. Interval search with “-”
rv Reviewer ID
st State: has biographic references (st:b), is cited (st:c), is collective (st:o), has references (st:r)

Operators

a & bLogical and (default)
a | bLogical or
!abLogical not
abc*Right wildcard
ab cPhrase
(ab c)Term grouping

See also ourGeneral Help.



Waleń, Tomasz

Co-Author Distance
Author ID:
walen.tomasz Recent zbMATH articles by "Waleń, Tomasz"
Published as:
Waleń, Tomasz;Waleń, T.;Walen, Tomasz
External Links:
ORCID
Documents Indexed:

90 Publications since 2006

Publications by Year

Citations contained in zbMATH Open

81 Publications have been cited 543 times in305 DocumentsCited by ▼Year ▼
Internal pattern matching queries in a text and applications. Zbl 1371.68340
Kociumaka, Tomasz;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2015
Extracting powers and periods in a word from its runs structure. Zbl 1295.68174
Crochemore, M.;Iliopoulos, C. S.;Kubica, M.;Radoszewski, J.;Rytter, W.;Waleń, T.
2014
A linear time algorithm for consecutive permutation pattern matching. Zbl 1370.68341
Kubica, M.;Kulczyński, T.;Radoszewski, J.;Rytter, W.;Waleń, T.
2013
Improved algorithms for the range next value problem and applications. Zbl 1259.68226
Iliopoulos, Costas S.;Crochemore, Maxime;Kubica, Marcin;Rahman, M. Sohel;Waleń, Tomasz
2008
A linear time algorithm for seeds computation. Zbl 1423.68619
Kociumaka, Tomasz;Kubica, Marcin;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2012
Order-preserving indexing. Zbl 1345.68300
Crochemore, Maxime;Iliopoulos, Costas S.;Kociumaka, Tomasz;Kubica, Marcin;Langiu, Alessio;Pissis, Solon P.;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2016
Reversal distance for strings with duplicates: Linear time approximation using hitting set. Zbl 1129.68431
Kolman, Petr;Waleń, Tomasz
2007
The maximum number of squares in a tree. Zbl 1358.68226
Crochemore, Maxime;Iliopoulos, Costas S.;Kociumaka, Tomasz;Kubica, Marcin;Radoszewski, Jakub;Rytter, Wojciech;Tyczyński, Wojciech;Waleń, Tomasz
2012
Fast algorithm for partial covers in words. Zbl 1337.68307
Kociumaka, Tomasz;Pissis, Solon P.;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2015
A note on efficient computation of all abelian periods in a string. Zbl 1259.68248
Crochemore, M.;Iliopoulos, C. S.;Kociumaka, T.;Kubica, M.;Pachocki, J.;Radoszewski, J.;Rytter, W.;Tyczyński, W.;Waleń, T.
2013
Faster longest common extension queries in strings over general alphabets. Zbl 1380.68474
Gawrychowski, Pawel;Kociumaka, Tomasz;Rytter, Wojciech;Walen, Tomasz
2016
Improved induced matchings in sparse graphs. Zbl 1215.05129
Erman, Rok;Kowalik, Łukasz;Krnc, Matjaž;Waleń, Tomasz
2010
Efficient algorithms for two extensions of LPF table: the power of suffix arrays. Zbl 1274.68670
Crochemore, Maxime;Iliopoulos, Costas S.;Kubica, Marcin;Rytter, Wojciech;Waleń, Tomasz
2010
LPF computation revisited. Zbl 1267.68170
Crochemore, Maxime;Ilie, Lucian;Iliopoulos, Costas S.;Kubica, Marcin;Rytter, Wojciech;Waleń, Tomasz
2009
Improved algorithms for the range next value problem and applications. Zbl 1244.68031
Crochemore, Maxime;Iliopoulos, Costas S.;Kubica, Marcin;Rahman, M. Sohel;Tischler, German;Waleń, Tomasz
2012
Covering problems for partial words and for indeterminate strings. Zbl 1380.68468
Crochemore, Maxime;Iliopoulos, Costas S.;Kociumaka, Tomasz;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2017
Efficient seeds computation revisited. Zbl 1339.68328
Christou, Michalis;Crochemore, Maxime;Iliopoulos, Costas S.;Kubica, Marcin;Pissis, Solon P.;Radoszewski, Jakub;Rytter, Wojciech;Szreder, Bartosz;Waleń, Tomasz
2011
The maximal number of cubic runs in a word. Zbl 1250.68217
Crochemore, M.;Iliopoulos, C. S.;Kubica, M.;Radoszewski, J.;Rytter, W.;Waleń, T.
2012
On the maximal sum of exponents of runs in a string. Zbl 1247.68335
Crochemore, Maxime;Kubica, Marcin;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2012
Efficient algorithms for three variants of the LPF table. Zbl 1252.68358
Crochemore, Maxime;Iliopoulos, Costas S.;Kubica, Marcin;Rytter, Wojciech;Waleń, Tomasz
2012
On the maximum number of cubic subwords in a word. Zbl 1253.68275
Kubica, M.;Radoszewski, J.;Rytter, W.;Waleń, T.
2013
Efficient algorithms for shortest partial seeds in words. Zbl 1387.68313
Kociumaka, Tomasz;Pissis, Solon P.;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2018
A linear-time algorithm for seeds computation. Zbl 1484.68347
Kociumaka, Tomasz;Kubica, Marcin;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2020
Approximating reversal distance for strings with bounded number of duplicates. Zbl 1108.68127
Kolman, Petr;Waleń, Tomasz
2007
New simple efficient algorithms computing powers and runs in strings. Zbl 1329.68310
Crochemore, M.;Iliopoulos, C. S.;Kubica, M.;Radoszewski, J.;Rytter, W.;Stencel, K.;Waleń, T.
2014
Efficient counting of square substrings in a tree. Zbl 1418.68250
Kociumaka, Tomasz;Pachocki, Jakub;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2014
Algorithms for computing the longest parameterized common subsequence. Zbl 1138.68660
Iliopoulos, Costas S.;Kubica, Marcin;Rahman, M. Sohel;Waleń, Tomasz
2007
On the maximal number of cubic runs in a string. Zbl 1284.68484
Crochemore, Maxime;Iliopoulos, Costas;Kubica, Marcin;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2010
Maximum number of distinct and nonequivalent nonstandard squares in a word. Zbl 1350.68216
Kociumaka, Tomasz;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2014
Computing the longest previous factor. Zbl 1253.68272
Crochemore, Maxime;Ilie, Lucian;Iliopoulos, Costas S.;Kubica, Marcin;Rytter, Wojciech;Waleń, Tomasz
2013
Linear-time algorithm for long LCF with \(k\) mismatches. Zbl 1497.68598
Charalampopoulos, Panagiotis;Crochemore, Maxime;Iliopoulos, Costas S.;Kociumaka, Tomasz;Pissis, Solon P.;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2018
String powers in trees. Zbl 1380.68323
Kociumaka, Tomasz;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2017
Efficient seed computation revisited. Zbl 1292.68179
Christou, M.;Crochemore, M.;Iliopoulos, C. S.;Kubica, M.;Pissis, S. P.;Radoszewski, J.;Rytter, W.;Szreder, B.;Waleń, T.
2013
Efficient representation and counting of antipower factors in words. Zbl 1425.68468
Kociumaka, Tomasz;Radoszewski, Jakub;Rytter, Wojciech;Straszyński, Juliusz;Waleń, Tomasz;Zuba, Wiktor
2019
Near-optimal computation of runs over general alphabet via non-crossing LCE queries. Zbl 1397.68238
Crochemore, Maxime;Iliopoulos, Costas S.;Kociumaka, Tomasz;Kundu, Ritu;Pissis, Solon P.;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2016
Universal reconstruction of a string. Zbl 1435.68398
Gawrychowski, Paweł;Kociumaka, Tomasz;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2020
Algorithms for three versions of the shortest common superstring problem. Zbl 1286.68523
Crochemore, Maxime;Cygan, Marek;Iliopoulos, Costas;Kubica, Marcin;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2010
Quasi-linear-time algorithm for longest common circular factor. Zbl 1550.68303
Alzamel, Mai;Crochemore, Maxime;Iliopoulos, Costas S.;Kociumaka, Tomasz;Radoszewski, Jakub;Rytter, Wojciech;Straszyński, Juliusz;Waleń, Tomasz;Zuba, Wiktor
2019
On the maximal number of cubic subwords in a string. Zbl 1267.68171
Kubica, Marcin;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2009
Finding patterns in given intervals. Zbl 1216.68353
Crochemore, Maxime;Kubica, Marcin;Waleń, Tomasz;Iliopoulos, Costas S.;Rahman, M. Sohel
2010
Reversal distance for strings with duplicates: linear time approximation using hitting set. Zbl 1184.68641
Kolman, Petr;Walen, Tomasz
2007
Linear-time version of Holub’s algorithm for morphic imprimitivity testing. Zbl 1329.68199
Kociumaka, T.;Radoszewski, J.;Rytter, W.;Waleń, T.
2015
Covering problems for partial words and for indeterminate strings. Zbl 1380.68467
Crochemore, Maxime;Iliopoulos, Costas S.;Kociumaka, Tomasz;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2014
Counting distinct patterns in internal dictionary matching. Zbl 1534.68275
Charalampopoulos, Panagiotis;Kociumaka, Tomasz;Mohamed, Manal;Radoszewski, Jakub;Rytter, Wojciech;Straszyński, Juliusz;Waleń, Tomasz;Zuba, Wiktor
2020
Internal dictionary matching. Zbl 1515.68099
Charalampopoulos, Panagiotis;Kociumaka, Tomasz;Mohamed, Manal;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2021
On the greedy algorithm for the shortest common superstring problem with reversals. Zbl 1347.68376
Fici, Gabriele;Kociumaka, Tomasz;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2016
Maximum number of distinct and nonequivalent nonstandard squares in a word. Zbl 1350.68217
Kociumaka, Tomasz;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2016
Polynomial-time approximation algorithms for weighted LCS problem. Zbl 1335.68304
Cygan, M.;Kubica, M.;Radoszewski, J.;Rytter, W.;Waleń, T.
2016
Polynomial-time approximation algorithms for weighted LCS problem. Zbl 1339.68314
Cygan, Marek;Kubica, Marcin;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2011
String periods in the order-preserving model. Zbl 1487.68260
Gourdel, Garance;Kociumaka, Tomasz;Radoszewski, Jakub;Rytter, Wojciech;Shur, Arseny;Waleń, Tomasz
2018
Efficient enumeration of non-equivalent squares in partial words with few holes. Zbl 1434.68729
Charalampopoulos, Panagiotis;Crochemore, Maxime;Iliopoulos, Costas S.;Kociumaka, Tomasz;Pissis, Solon P.;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2017
A note on the longest common compatible prefix problem for partial words. Zbl 1336.68312
Crochemore, M.;Iliopoulos, C. S.;Kociumaka, T.;Kubica, M.;Langiu, A.;Radoszewski, J.;Rytter, W.;Szreder, B.;Waleń, T.
2015
Universal reconstruction of a string. Zbl 1435.68397
Gawrychowski, Paweł;Kociumaka, Tomasz;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2015
Internal dictionary matching. Zbl 1534.68276
Charalampopoulos, Panagiotis;Kociumaka, Tomasz;Mohamed, Manal;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2019
The number of repetitions in 2D-strings. Zbl 1524.68247
Charalampopoulos, Panagiotis;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz;Zuba, Wiktor
2020
Fast algorithm for partial covers in words. Zbl 1381.68318
Kociumaka, Tomasz;Pissis, Solon P.;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2013
Shortest covers of all cyclic shifts of a string. Zbl 1495.68252
Crochemore, Maxime;Iliopoulos, Costas S.;Radoszewski, Jakub;Rytter, Wojciech;Straszyński, Juliusz;Waleń, Tomasz;Zuba, Wiktor
2021
Approximation of RNA multiple structural alignment. Zbl 1196.68174
Kubica, Marcin;Rizzi, Romeo;Vialette, Stéphane;Waleń, Tomasz
2006
String covers of a tree. Zbl 1551.68397
Radoszewski, Jakub;Rytter, Wojciech;Straszyński, Juliusz;Waleń, Tomasz;Zuba, Wiktor
2021
Tight bound for the number of distinct palindromes in a tree. Zbl 1523.68050
Gawrychowski, Paweł;Kociumaka, Tomasz;Rytter, Wojciech;Waleń, Tomasz
2023
Linear-time version of Holub’s algorithm for morphic imprimitivity testing. Zbl 1329.68200
Kociumaka, Tomasz;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2013
Efficient algorithms for shortest partial seeds in words. Zbl 1387.68312
Kociumaka, Tomasz;Pissis, Solon P.;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2014
Internal quasiperiod queries. Zbl 1511.68100
Crochemore, Maxime;Iliopoulos, Costas S.;Radoszewski, Jakub;Rytter, Wojciech;Straszyński, Juliusz;Waleń, Tomasz;Zuba, Wiktor
2020
Computing covers of 2D-strings. Zbl 07695998
Charalampopoulos, Panagiotis;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz;Zuba, Wiktor
2021
A periodicity lemma for partial words. Zbl 1537.68161
Kociumaka, Tomasz;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2022
Shortest covers of all cyclic shifts of a string. Zbl 1495.68251
Crochemore, Maxime;Iliopoulos, Costas S.;Radoszewski, Jakub;Rytter, Wojciech;Straszyński, Juliusz;Waleń, Tomasz;Zuba, Wiktor
2020
Linear-time computation of cyclic roots and cyclic covers of a string. Zbl 07929278
Iliopoulos, Costas S.;Kociumaka, Tomasz;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz;Zuba, Wiktor
2023
Faster recovery of approximate periods over edit distance. Zbl 1517.68435
Kociumaka, Tomasz;Radoszewski, Jakub;Rytter, Wojciech;Straszyński, Juliusz;Waleń, Tomasz;Zuba, Wiktor
2018
Subsequence covers of words. Zbl 1525.68202
Charalampopoulos, Panagiotis;Pissis, Solon P.;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz;Zuba, Wiktor
2022
Hardness of detecting abelian and additive square factors in strings. Zbl 07740932
Radoszewski, Jakub;Rytter, Wojciech;Straszyński, Juliusz;Waleń, Tomasz;Zuba, Wiktor
2021
String powers in trees. Zbl 1380.68322
Kociumaka, Tomasz;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2015
Efficient representation and counting of antipower factors in words. Zbl 1501.68005
Kociumaka, Tomasz;Radoszewski, Jakub;Rytter, Wojciech;Straszyński, Juliusz;Waleń, Tomasz;Zuba, Wiktor
2022
On the string consensus problem and the Manhattan sequence consensus problem. Zbl 1387.68310
Kociumaka, Tomasz;Pachocki, Jakub W.;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2014
Efficient enumeration of distinct factors using package representations. Zbl 1511.68098
Charalampopoulos, Panagiotis;Kociumaka, Tomasz;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz;Zuba, Wiktor
2020
Efficient counting of square substrings in a tree. Zbl 1260.68490
Kociumaka, Tomasz;Pachocki, Jakub;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2012
On the maximal sum of exponents of runs in a string. Zbl 1295.68175
Crochemore, Maxime;Kubica, Marcin;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2011
On periodicity lemma for partial words. Zbl 1504.68185
Kociumaka, Tomasz;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2018
Circular pattern matching with \(k\) mismatches. Zbl 1467.68236
Charalampopoulos, Panagiotis;Kociumaka, Tomasz;Pissis, Solon P.;Radoszewski, Jakub;Rytter, Wojciech;Straszyński, Juliusz;Waleń, Tomasz;Zuba, Wiktor
2021
Circular pattern matching with \(k\) mismatches. Zbl 1467.68235
Charalampopoulos, Panagiotis;Kociumaka, Tomasz;Pissis, Solon P.;Radoszewski, Jakub;Rytter, Wojciech;Straszyński, Juliusz;Waleń, Tomasz;Zuba, Wiktor
2019
Linear-time computation of shortest covers of all rotations of a string. Zbl 07842483
Crochemore, Maxime;Iliopoulos, Costas S.;Radoszewski, Jakub;Rytter, Wojciech;Straszyński, Juliusz;Waleń, Tomasz;Zuba, Wiktor
2022
Rectangular tile covers of 2D-strings. Zbl 07842484
Radoszewski, Jakub;Rytter, Wojciech;Straszyński, Juliusz;Waleń, Tomasz;Zuba, Wiktor
2022
Tight bound for the number of distinct palindromes in a tree. Zbl 1523.68050
Gawrychowski, Paweł;Kociumaka, Tomasz;Rytter, Wojciech;Waleń, Tomasz
2023
Linear-time computation of cyclic roots and cyclic covers of a string. Zbl 07929278
Iliopoulos, Costas S.;Kociumaka, Tomasz;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz;Zuba, Wiktor
2023
A periodicity lemma for partial words. Zbl 1537.68161
Kociumaka, Tomasz;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2022
Subsequence covers of words. Zbl 1525.68202
Charalampopoulos, Panagiotis;Pissis, Solon P.;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz;Zuba, Wiktor
2022
Efficient representation and counting of antipower factors in words. Zbl 1501.68005
Kociumaka, Tomasz;Radoszewski, Jakub;Rytter, Wojciech;Straszyński, Juliusz;Waleń, Tomasz;Zuba, Wiktor
2022
Linear-time computation of shortest covers of all rotations of a string. Zbl 07842483
Crochemore, Maxime;Iliopoulos, Costas S.;Radoszewski, Jakub;Rytter, Wojciech;Straszyński, Juliusz;Waleń, Tomasz;Zuba, Wiktor
2022
Rectangular tile covers of 2D-strings. Zbl 07842484
Radoszewski, Jakub;Rytter, Wojciech;Straszyński, Juliusz;Waleń, Tomasz;Zuba, Wiktor
2022
Internal dictionary matching. Zbl 1515.68099
Charalampopoulos, Panagiotis;Kociumaka, Tomasz;Mohamed, Manal;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2021
Shortest covers of all cyclic shifts of a string. Zbl 1495.68252
Crochemore, Maxime;Iliopoulos, Costas S.;Radoszewski, Jakub;Rytter, Wojciech;Straszyński, Juliusz;Waleń, Tomasz;Zuba, Wiktor
2021
String covers of a tree. Zbl 1551.68397
Radoszewski, Jakub;Rytter, Wojciech;Straszyński, Juliusz;Waleń, Tomasz;Zuba, Wiktor
2021
Computing covers of 2D-strings. Zbl 07695998
Charalampopoulos, Panagiotis;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz;Zuba, Wiktor
2021
Hardness of detecting abelian and additive square factors in strings. Zbl 07740932
Radoszewski, Jakub;Rytter, Wojciech;Straszyński, Juliusz;Waleń, Tomasz;Zuba, Wiktor
2021
Circular pattern matching with \(k\) mismatches. Zbl 1467.68236
Charalampopoulos, Panagiotis;Kociumaka, Tomasz;Pissis, Solon P.;Radoszewski, Jakub;Rytter, Wojciech;Straszyński, Juliusz;Waleń, Tomasz;Zuba, Wiktor
2021
A linear-time algorithm for seeds computation. Zbl 1484.68347
Kociumaka, Tomasz;Kubica, Marcin;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2020
Universal reconstruction of a string. Zbl 1435.68398
Gawrychowski, Paweł;Kociumaka, Tomasz;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2020
Counting distinct patterns in internal dictionary matching. Zbl 1534.68275
Charalampopoulos, Panagiotis;Kociumaka, Tomasz;Mohamed, Manal;Radoszewski, Jakub;Rytter, Wojciech;Straszyński, Juliusz;Waleń, Tomasz;Zuba, Wiktor
2020
The number of repetitions in 2D-strings. Zbl 1524.68247
Charalampopoulos, Panagiotis;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz;Zuba, Wiktor
2020
Internal quasiperiod queries. Zbl 1511.68100
Crochemore, Maxime;Iliopoulos, Costas S.;Radoszewski, Jakub;Rytter, Wojciech;Straszyński, Juliusz;Waleń, Tomasz;Zuba, Wiktor
2020
Shortest covers of all cyclic shifts of a string. Zbl 1495.68251
Crochemore, Maxime;Iliopoulos, Costas S.;Radoszewski, Jakub;Rytter, Wojciech;Straszyński, Juliusz;Waleń, Tomasz;Zuba, Wiktor
2020
Efficient enumeration of distinct factors using package representations. Zbl 1511.68098
Charalampopoulos, Panagiotis;Kociumaka, Tomasz;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz;Zuba, Wiktor
2020
Efficient representation and counting of antipower factors in words. Zbl 1425.68468
Kociumaka, Tomasz;Radoszewski, Jakub;Rytter, Wojciech;Straszyński, Juliusz;Waleń, Tomasz;Zuba, Wiktor
2019
Quasi-linear-time algorithm for longest common circular factor. Zbl 1550.68303
Alzamel, Mai;Crochemore, Maxime;Iliopoulos, Costas S.;Kociumaka, Tomasz;Radoszewski, Jakub;Rytter, Wojciech;Straszyński, Juliusz;Waleń, Tomasz;Zuba, Wiktor
2019
Internal dictionary matching. Zbl 1534.68276
Charalampopoulos, Panagiotis;Kociumaka, Tomasz;Mohamed, Manal;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2019
Circular pattern matching with \(k\) mismatches. Zbl 1467.68235
Charalampopoulos, Panagiotis;Kociumaka, Tomasz;Pissis, Solon P.;Radoszewski, Jakub;Rytter, Wojciech;Straszyński, Juliusz;Waleń, Tomasz;Zuba, Wiktor
2019
Efficient algorithms for shortest partial seeds in words. Zbl 1387.68313
Kociumaka, Tomasz;Pissis, Solon P.;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2018
Linear-time algorithm for long LCF with \(k\) mismatches. Zbl 1497.68598
Charalampopoulos, Panagiotis;Crochemore, Maxime;Iliopoulos, Costas S.;Kociumaka, Tomasz;Pissis, Solon P.;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2018
String periods in the order-preserving model. Zbl 1487.68260
Gourdel, Garance;Kociumaka, Tomasz;Radoszewski, Jakub;Rytter, Wojciech;Shur, Arseny;Waleń, Tomasz
2018
Faster recovery of approximate periods over edit distance. Zbl 1517.68435
Kociumaka, Tomasz;Radoszewski, Jakub;Rytter, Wojciech;Straszyński, Juliusz;Waleń, Tomasz;Zuba, Wiktor
2018
On periodicity lemma for partial words. Zbl 1504.68185
Kociumaka, Tomasz;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2018
Covering problems for partial words and for indeterminate strings. Zbl 1380.68468
Crochemore, Maxime;Iliopoulos, Costas S.;Kociumaka, Tomasz;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2017
String powers in trees. Zbl 1380.68323
Kociumaka, Tomasz;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2017
Efficient enumeration of non-equivalent squares in partial words with few holes. Zbl 1434.68729
Charalampopoulos, Panagiotis;Crochemore, Maxime;Iliopoulos, Costas S.;Kociumaka, Tomasz;Pissis, Solon P.;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2017
Order-preserving indexing. Zbl 1345.68300
Crochemore, Maxime;Iliopoulos, Costas S.;Kociumaka, Tomasz;Kubica, Marcin;Langiu, Alessio;Pissis, Solon P.;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2016
Faster longest common extension queries in strings over general alphabets. Zbl 1380.68474
Gawrychowski, Pawel;Kociumaka, Tomasz;Rytter, Wojciech;Walen, Tomasz
2016
Near-optimal computation of runs over general alphabet via non-crossing LCE queries. Zbl 1397.68238
Crochemore, Maxime;Iliopoulos, Costas S.;Kociumaka, Tomasz;Kundu, Ritu;Pissis, Solon P.;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2016
On the greedy algorithm for the shortest common superstring problem with reversals. Zbl 1347.68376
Fici, Gabriele;Kociumaka, Tomasz;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2016
Maximum number of distinct and nonequivalent nonstandard squares in a word. Zbl 1350.68217
Kociumaka, Tomasz;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2016
Polynomial-time approximation algorithms for weighted LCS problem. Zbl 1335.68304
Cygan, M.;Kubica, M.;Radoszewski, J.;Rytter, W.;Waleń, T.
2016
Internal pattern matching queries in a text and applications. Zbl 1371.68340
Kociumaka, Tomasz;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2015
Fast algorithm for partial covers in words. Zbl 1337.68307
Kociumaka, Tomasz;Pissis, Solon P.;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2015
Linear-time version of Holub’s algorithm for morphic imprimitivity testing. Zbl 1329.68199
Kociumaka, T.;Radoszewski, J.;Rytter, W.;Waleń, T.
2015
A note on the longest common compatible prefix problem for partial words. Zbl 1336.68312
Crochemore, M.;Iliopoulos, C. S.;Kociumaka, T.;Kubica, M.;Langiu, A.;Radoszewski, J.;Rytter, W.;Szreder, B.;Waleń, T.
2015
Universal reconstruction of a string. Zbl 1435.68397
Gawrychowski, Paweł;Kociumaka, Tomasz;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2015
String powers in trees. Zbl 1380.68322
Kociumaka, Tomasz;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2015
Extracting powers and periods in a word from its runs structure. Zbl 1295.68174
Crochemore, M.;Iliopoulos, C. S.;Kubica, M.;Radoszewski, J.;Rytter, W.;Waleń, T.
2014
New simple efficient algorithms computing powers and runs in strings. Zbl 1329.68310
Crochemore, M.;Iliopoulos, C. S.;Kubica, M.;Radoszewski, J.;Rytter, W.;Stencel, K.;Waleń, T.
2014
Efficient counting of square substrings in a tree. Zbl 1418.68250
Kociumaka, Tomasz;Pachocki, Jakub;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2014
Maximum number of distinct and nonequivalent nonstandard squares in a word. Zbl 1350.68216
Kociumaka, Tomasz;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2014
Covering problems for partial words and for indeterminate strings. Zbl 1380.68467
Crochemore, Maxime;Iliopoulos, Costas S.;Kociumaka, Tomasz;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2014
Efficient algorithms for shortest partial seeds in words. Zbl 1387.68312
Kociumaka, Tomasz;Pissis, Solon P.;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2014
On the string consensus problem and the Manhattan sequence consensus problem. Zbl 1387.68310
Kociumaka, Tomasz;Pachocki, Jakub W.;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2014
A linear time algorithm for consecutive permutation pattern matching. Zbl 1370.68341
Kubica, M.;Kulczyński, T.;Radoszewski, J.;Rytter, W.;Waleń, T.
2013
A note on efficient computation of all abelian periods in a string. Zbl 1259.68248
Crochemore, M.;Iliopoulos, C. S.;Kociumaka, T.;Kubica, M.;Pachocki, J.;Radoszewski, J.;Rytter, W.;Tyczyński, W.;Waleń, T.
2013
On the maximum number of cubic subwords in a word. Zbl 1253.68275
Kubica, M.;Radoszewski, J.;Rytter, W.;Waleń, T.
2013
Computing the longest previous factor. Zbl 1253.68272
Crochemore, Maxime;Ilie, Lucian;Iliopoulos, Costas S.;Kubica, Marcin;Rytter, Wojciech;Waleń, Tomasz
2013
Efficient seed computation revisited. Zbl 1292.68179
Christou, M.;Crochemore, M.;Iliopoulos, C. S.;Kubica, M.;Pissis, S. P.;Radoszewski, J.;Rytter, W.;Szreder, B.;Waleń, T.
2013
Fast algorithm for partial covers in words. Zbl 1381.68318
Kociumaka, Tomasz;Pissis, Solon P.;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2013
Linear-time version of Holub’s algorithm for morphic imprimitivity testing. Zbl 1329.68200
Kociumaka, Tomasz;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2013
A linear time algorithm for seeds computation. Zbl 1423.68619
Kociumaka, Tomasz;Kubica, Marcin;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2012
The maximum number of squares in a tree. Zbl 1358.68226
Crochemore, Maxime;Iliopoulos, Costas S.;Kociumaka, Tomasz;Kubica, Marcin;Radoszewski, Jakub;Rytter, Wojciech;Tyczyński, Wojciech;Waleń, Tomasz
2012
Improved algorithms for the range next value problem and applications. Zbl 1244.68031
Crochemore, Maxime;Iliopoulos, Costas S.;Kubica, Marcin;Rahman, M. Sohel;Tischler, German;Waleń, Tomasz
2012
The maximal number of cubic runs in a word. Zbl 1250.68217
Crochemore, M.;Iliopoulos, C. S.;Kubica, M.;Radoszewski, J.;Rytter, W.;Waleń, T.
2012
On the maximal sum of exponents of runs in a string. Zbl 1247.68335
Crochemore, Maxime;Kubica, Marcin;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2012
Efficient algorithms for three variants of the LPF table. Zbl 1252.68358
Crochemore, Maxime;Iliopoulos, Costas S.;Kubica, Marcin;Rytter, Wojciech;Waleń, Tomasz
2012
Efficient counting of square substrings in a tree. Zbl 1260.68490
Kociumaka, Tomasz;Pachocki, Jakub;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2012
Efficient seeds computation revisited. Zbl 1339.68328
Christou, Michalis;Crochemore, Maxime;Iliopoulos, Costas S.;Kubica, Marcin;Pissis, Solon P.;Radoszewski, Jakub;Rytter, Wojciech;Szreder, Bartosz;Waleń, Tomasz
2011
Polynomial-time approximation algorithms for weighted LCS problem. Zbl 1339.68314
Cygan, Marek;Kubica, Marcin;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2011
On the maximal sum of exponents of runs in a string. Zbl 1295.68175
Crochemore, Maxime;Kubica, Marcin;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2011
Improved induced matchings in sparse graphs. Zbl 1215.05129
Erman, Rok;Kowalik, Łukasz;Krnc, Matjaž;Waleń, Tomasz
2010
Efficient algorithms for two extensions of LPF table: the power of suffix arrays. Zbl 1274.68670
Crochemore, Maxime;Iliopoulos, Costas S.;Kubica, Marcin;Rytter, Wojciech;Waleń, Tomasz
2010
On the maximal number of cubic runs in a string. Zbl 1284.68484
Crochemore, Maxime;Iliopoulos, Costas;Kubica, Marcin;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2010
Algorithms for three versions of the shortest common superstring problem. Zbl 1286.68523
Crochemore, Maxime;Cygan, Marek;Iliopoulos, Costas;Kubica, Marcin;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2010
Finding patterns in given intervals. Zbl 1216.68353
Crochemore, Maxime;Kubica, Marcin;Waleń, Tomasz;Iliopoulos, Costas S.;Rahman, M. Sohel
2010
LPF computation revisited. Zbl 1267.68170
Crochemore, Maxime;Ilie, Lucian;Iliopoulos, Costas S.;Kubica, Marcin;Rytter, Wojciech;Waleń, Tomasz
2009
On the maximal number of cubic subwords in a string. Zbl 1267.68171
Kubica, Marcin;Radoszewski, Jakub;Rytter, Wojciech;Waleń, Tomasz
2009
Improved algorithms for the range next value problem and applications. Zbl 1259.68226
Iliopoulos, Costas S.;Crochemore, Maxime;Kubica, Marcin;Rahman, M. Sohel;Waleń, Tomasz
2008
Reversal distance for strings with duplicates: Linear time approximation using hitting set. Zbl 1129.68431
Kolman, Petr;Waleń, Tomasz
2007
Approximating reversal distance for strings with bounded number of duplicates. Zbl 1108.68127
Kolman, Petr;Waleń, Tomasz
2007
Algorithms for computing the longest parameterized common subsequence. Zbl 1138.68660
Iliopoulos, Costas S.;Kubica, Marcin;Rahman, M. Sohel;Waleń, Tomasz
2007
Reversal distance for strings with duplicates: linear time approximation using hitting set. Zbl 1184.68641
Kolman, Petr;Walen, Tomasz
2007
Approximation of RNA multiple structural alignment. Zbl 1196.68174
Kubica, Marcin;Rizzi, Romeo;Vialette, Stéphane;Waleń, Tomasz
2006
alltop 5

Cited by 377 Authors

52 Radoszewski, Jakub
44 Rytter, Wojciech
43 Waleń, Tomasz
39 Kociumaka, Tomasz
33 Pissis, Solon P.
32 Iliopoulos, Costas S.
28 Crochemore, Maxime
20 Amir, Amihood
18 Inenaga, Shunsuke
17 Charalampopoulos, Panagiotis
16 Bannai, Hideo
14 Kubica, Marcin
12 Gawrychowski, Paweł
11 Takeda, Masayuki
10 Thankachan, Sharma V.
10 Zuba, Wiktor
9 Landau, Gad M.
9 Nakashima, Yuto
9 Straszyński, Juliusz
8 Fici, Gabriele
8 Navarro, Gonzalo
8 Park, Kunsoo
8 Rosone, Giovanna
7 Bernardini, Giulia
7 Kondratovsky, Eitan
7 Manea, Florin
7 Pisanti, Nadia
7 Smyth, William F.
6 Alzamel, Mai
6 Badkobeh, Golnaz
6 Kolpakov, Roman M.
6 Levy, Avivit
6 Na, Joong Chae
6 Shah, Rahul
6 Shur, Arseny M.
6 Sim, Jeong Seop
6 Sokol, Dina
5 Lewenstein, Moshe
5 Mieno, Takuya
5 Puglisi, Simon J.
5 Shinohara, Ayumi
4 Ayad, Lorraine A. K.
4 Blanchet-Sadri, Francine
4 Blum, Christian
4 Cho, Sukhyeun
4 Christou, Michalis
4 Faro, Simone
4 Fertin, Guillaume
4 Fischer, Johannes
4 Gagie, Travis
4 Grossi, Roberto
4 I, Tomohiro
4 Külekci, Muhammed Oğuzhan
4 Langiu, Alessio
4 Lecroq, Thierry
4 Liu, Chang
4 Mignosi, Filippo
4 Prezza, Nicola
4 Rahman, Mohammad Sohel
4 Reidenbach, Daniel
4 Starikovskaya, Tatiana A.
3 Adjeroh, Donald A.
3 Amit, Mika
3 Barton, Carl
3 Beal, Richard
3 Cazaux, Bastien
3 Ganguly, Arnab
3 Hendrian, Diptarama
3 Hon, Wing-Kai
3 Kempa, Dominik
3 Koana, Tomohiro
3 Komusiewicz, Christian
3 Kosolobov, Dmitry
3 Kucherov, Gregory
3 Li, Shuo
3 Lin, Guohui
3 Łopaciuk, Szymon
3 Marcus, Shoshana
3 Mercaş, Robert George
3 Merkurev, Oleg
3 Mhaskar, Neerja
3 Pachocki, Jakub W.
3 Park, Sung Gwan
3 Puzynina, Svetlana
3 Rivals, Eric
3 Russo, Luís M. S.
3 Sommer, Frank
3 Xu, Yao
3 Yoshinaka, Ryo
3 Zhang, Peng
2 Barbay, Jérémy
2 Bataa, Magsarjav
2 Bille, Philip
2 Boneh, Itai
2 Bulteau, Laurent
2 Chaudhary, Juhi
2 Chen, Kun
2 Chen, Yong
2 Davoodi, Pooya
2 Deza, Antoine
...and 277 more Authors
alltop 5

Cited in 31 Serials

68 Theoretical Computer Science
19 Discrete Applied Mathematics
18 Algorithmica
11 Information and Computation
11 Journal of Discrete Algorithms
10 Information Processing Letters
6 International Journal of Foundations of Computer Science
6 Journal of Combinatorial Optimization
5 Journal of Computer and System Sciences
4 European Journal of Combinatorics
4 Advances in Applied Mathematics
3 SIAM Journal on Computing
3 Theory of Computing Systems
3 Fundamenta Informaticae
3 ACM Journal of Experimental Algorithmics
2 Discrete Mathematics
2 SIAM Journal on Discrete Mathematics
2 The Electronic Journal of Combinatorics
2 Mathematics in Computer Science
2 Optimization Letters
1 Acta Informatica
1 Mathematics of Computation
1 Computers & Operations Research
1 Computational Geometry
1 European Journal of Operational Research
1 International Transactions in Operational Research
1 AKCE International Journal of Graphs and Combinatorics
1 Discrete Mathematics, Algorithms and Applications
1 ACM Transactions on Algorithms
1 Palestine Journal of Mathematics
1 Computer Science Review

Citations by Year

© 2025FIZ Karlsruhe GmbHPrivacy PolicyLegal NoticesTerms & Conditions
  • Mastodon logo
 (opens in new tab)
[8]ページ先頭
©2009-2025 Movatter.jp