Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Radoszewski, J."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Extracting powers and periods in a word from its runs structure
M. Crochemore
,
C.S. Iliopoulos
,
M. Kubica
,
J. Radoszewski
,
W. Rytter
,
T. Waleń
Theoretical Computer Science
521
, 2014, pp. 29-41
Efficient seed computation revisited
M. Christou
,
M. Crochemore
,
C.S. Iliopoulos
,
M. Kubica
,
S.P. Pissis
,
J. Radoszewski
,
W. Rytter
,
B. Szreder
,
T. Waleń
Theoretical Computer Science
483
, 2013, pp. 171-181
A note on efficient computation of all Abelian periods in a string
M. Crochemore
,
C.S. Iliopoulos
,
T. Kociumaka
,
M. Kubica
,
J. Pachocki
,
J. Radoszewski
,
W. Rytter
,
W. Tyczyński
,
T. Waleń
Information Processing Letters
113
(3), 2013, pp. 74-77
A linear time algorithm for consecutive permutation pattern matching
M. Kubica
,
T. Kulczyński
,
J. Radoszewski
,
W. Rytter
,
T. Waleń
Information Processing Letters
113
(12), 2013, pp. 430-433
The maximal number of cubic runs in a word
M. Crochemore
,
C.S. Iliopoulos
,
M. Kubica
,
J. Radoszewski
,
W. Rytter
,
T. Waleń
Journal of Computer and System Sciences
78
(6), 2012, pp. 1828-1836