BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × France
1 × Germany
1 × Hungary
1 × Russia
1 × Spain
1 × Taiwan
Collaborated with:
F.Blanchet-Sadri F.Manea J.Dassow M.Müller A.Saarela S.Simmons S.Z.Fazekas K.Shikishima-Tsuji G.Scott T.Ehlers D.Nowotka E.Weissenstein E.Allen C.Byrum A.Rashin E.Willett J.I.Kim W.Severa
Talks about:
partial (5) word (5) abelian (3) palindrom (2) pattern (2) closur (2) binari (2) squar (2) inner (2) avoid (2)

Person: Robert Mercas

DBLP DBLP: Mercas:Robert

Contributed to:

DLT 20142014
DLT 20132013
DLT 20132014
DLT 20122012
LATA 20102010
LATA 20092009
AFL 20082008

Wrote 10 papers:

DLT-2014-EhlersMMN #pattern matching
k-Abelian Pattern Matching (TE, FM, RM, DN), pp. 178–190.
Inner Palindromic Closure (JD, FM, RM, MM), pp. 155–166.
3-Abelian Cubes Are Avoidable on Binary Alphabets (RM, AS), pp. 374–383.
Inner Palindromic Closure (JD, FM, RM, MM), pp. 1049–1064.
DLT-2012-FazekasMS #bound
Hairpin Completion with Bounded Stem-Loop (SZF, RM, KST), pp. 428–439.
LATA-2010-Blanchet-SadriKMSS #word
Abelian Square-Free Partial Words (FBS, JIK, RM, WS, SS), pp. 94–105.
LATA-2010-Blanchet-SadriMSW #word
Avoidable Binary Patterns in Partial Words (FBS, RM, SS, EW), pp. 106–117.
LATA-2009-Blanchet-SadriABM #how #question #word
How Many Holes Can an Unbordered Partial Word Contain? (FBS, EA, CB, RM), pp. 176–187.
LATA-2009-Blanchet-SadriMRW #algorithm #using #word
An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms (FBS, RM, AR, EW), pp. 188–199.
AFL-2008-Blanchet-SadriMS #word
Counting Distinct Squares in Partial Words (FBS, RM, GS), pp. 122–133.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.