default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichalis Christou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j11]Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos:
Quasiperiodicities in Fibonacci strings. Ars Comb. 129: 211-225 (2016)- 2014
- [b1]Michalis Christou:
Characteristics and regularities of graphs and words. King's College London, UK, 2014 - [j10]Manolis Christodoulakis, Michalis Christou, Maxime Crochemore
, Costas S. Iliopoulos:
Abelian borders in binary words. Discret. Appl. Math. 171: 141-146 (2014) - [j9]Manolis Christodoulakis, Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos:
On the average number of regularities in a word. Theor. Comput. Sci. 525: 3-9 (2014) - 2013
- [j8]Manolis Christodoulakis, Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos:
Overlapping factors in words. Australas. J Comb. 57: 49-64 (2013) - [j7]Michalis Christou, Costas S. Iliopoulos, Mirka Miller:
Bipartite Ramsey numbers involving stars, stripes and trees. Electron. J. Graph Theory Appl. 1(2): 89-99 (2013) - [j6]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: 51-60 (2013) - [j5]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: 171-181 (2013) - 2012
- [j4]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): 1371-1384 (2012) - [j3]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): 958-962 (2012) - [j2]Michalis Christou, Maxime Crochemore, Ondrej Guth, Costas S. Iliopoulos, Solon P. Pissis:
On left and right seeds of a string. J. Discrete Algorithms 17: 31-44 (2012) - [i3]Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos:
Quasiperiodicities in Fibonacci strings. CoRR abs/1201.6162 (2012) - [i2]Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos:
Identifying all abelian periods of a string in quadratic time and relevant problems. CoRR abs/1207.1307 (2012) - 2011
- [c3]Michalis Christou, Maxime Crochemore, Ondrej Guth, Costas S. Iliopoulos, Solon P. Pissis:
On the Right-Seed Array of a String. COCOON 2011: 492-502 - [c2]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: 350-363 - [c1]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: 338-343 - [i1]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 abs/1104.3153 (2011)
2000 – 2009
- 2005
- [j1]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): 238-246 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
