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
Hilfe
Suche: Author="Iliopoulos, C.S."
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
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
Two-dimensional prefix string matching and covering on square matrices
M. Crochemore
,
C.S. Iliopoulos
,
M. Korda
Algorithmica
20
(4), 1998, pp. 353-373
Covering a string
C.S. Iliopoulos
,
D.W.G. Moore
,
K. Park
Algorithmica
16
, 1996, pp. 288-297
Parallel RAM algorithms for factorizing words
J.W. Daykin
,
C.S. Iliopoulos
,
W.F. Smyth
Theoretical Computer Science
127
(1), 1994, pp. 53-67
On the computational complexity of the abelian permutation group structure, membership and intersection problems
C.S. Iliopoulos
Theoretical Computer Science
56
(2), 1988, February, pp. 211-222
Monte Carlo circuits for the abelian permutation group intersection problem
C.S. Iliopoulos
Acta Informatica
23
(6), 1986, pp. 697-705
Computing a basis for a finite abelian p-group
W.M. Beynon
,
C.S. Iliopoulos
Information Processing Letters
20
(3), 1985, April, pp. 161-163
Analysis of algorithms on problems in general abelian groups
C.S. Iliopoulos
Information Processing Letters
20
(4), 1985, May, pp. 215-220
Computing in general Abelian groups is hard
C.S. Iliopoulos
Theoretical Computer Science
41
(1), 1985, pp. 81-93
Gaussian elimination over a Euclidean ring
C.S. Iliopoulos
Lecture Notes in Computer Science
204
, 1985, pp. 29-30
Worst-case analysis of algorithms for computational problems on Abelian permutation groups
C.S. Iliopoulos
Lecture Notes in Computer Science
204
, 1985, pp. 225-228