Michalis Christou

Publication Activity (10 Years)

Years Active: 2005-2016
Publications (10 Years): 1

Top Venues

CoRR

J. Discrete Algorithms

Theor. Comput. Sci.

Ars Comb.

King's College London, UK (PHD)

Education History

King's College London, UK

PHD

Publications

Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos
Quasiperiodicities in Fibonacci strings. Ars Comb. 129 (2016)
Manolis Christodoulakis, Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos
Abelian borders in binary words. Discret. Appl. Math. 171 (2014)
Manolis Christodoulakis, Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos
On the average number of regularities in a word. Theor. Comput. Sci. 525 (2014)
Michalis Christou, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis, Jan Zdárek
Tree template matching in unranked ordered trees. J. Discrete Algorithms 20 (2013)
Manolis Christodoulakis, Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos
Overlapping factors in words. Australas. J Comb. 57 (2013)
Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen
Efficient seed computation revisited. Theor. Comput. Sci. 483 (2013)
Michalis Christou, Costas S. Iliopoulos, Mirka Miller
Bipartite Ramsey numbers involving stars, stripes and trees. Electron. J. Graph Theory Appl. 1 (2) (2013)
Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos
Quasiperiodicities in Fibonacci strings CoRR (2012)
Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos
Identifying all abelian periods of a string in quadratic time and relevant problems CoRR (2012)
Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos
Identifying All Abelian Periods of a String in quadratic Time and Relevant Problems. Int. J. Found. Comput. Sci. 23 (6) (2012)
Michalis Christou, Maxime Crochemore, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis
Computing all subtree repeats in ordered trees. Inf. Process. Lett. 112 (24) (2012)
Michalis Christou, Maxime Crochemore, Ondrej Guth, Costas S. Iliopoulos, Solon P. Pissis
On left and right seeds of a string. J. Discrete Algorithms 17 (2012)
Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen
Efficient Seeds Computation Revisited CoRR (2011)
Michalis Christou, Maxime Crochemore, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis
Computing All Subtree Repeats in Ordered Ranked Trees. SPIRE (2011)
Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen
Efficient Seeds Computation Revisited. CPM (2011)
Michalis Christou, Maxime Crochemore, Ondrej Guth, Costas S. Iliopoulos, Solon P. Pissis
On the Right-Seed Array of a String. COCOON (2011)
Christian Delvosalle, Cécile Fiévez, Aurore Pipart, Joaquim Casal Fabrega, Eulàlia Planas, Michalis Christou, Fesil Mushtaq
Identification of reference accident scenarios in SEVESO establishments. Reliab. Eng. Syst. Saf. 90 (2-3) (2005)

Michalis Christou.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Michalis Christou