The following pages link to Michalis Christou (Q1941701):
Displayed 16 items.
- (Q390902) (redirect page) (← links)
- Efficient seed computation revisited (Q390905) (← links)
- Tree template matching in unranked ordered trees (Q396647) (← links)
- Computing all subtree repeats in ordered trees (Q1941702) (← links)
- On left and right seeds of a string (Q2376787) (← links)
- On the average number of regularities in a word (Q2437740) (← links)
- Degree/diameter problem for trees and pseudotrees (Q2447515) (← links)
- Abelian borders in binary words (Q2449116) (← links)
- (Q2809942) (← links)
- (Q2866603) (← links)
- (Q2875897) (← links)
- (Q2978301) (← links)
- Efficient Seeds Computation Revisited (Q3011867) (← links)
- On the Right-Seed Array of a String (Q3087974) (← links)
- IDENTIFYING ALL ABELIAN PERIODS OF A STRING IN QUADRATIC TIME AND RELEVANT PROBLEMS (Q4923285) (← links)
- Bipartite Ramsey numbers involving stars, stripes and trees (Q5177024) (← links)