Robert Mercas

According to our database1, Robert Mercas
  • authored at least 53 papers between 2007 and 2017.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
On the aperiodic avoidability of binary patterns with variables and reversals.
Theor. Comput. Sci., 2017

Counting maximal-exponent factors in words.
Theor. Comput. Sci., 2017

Preface.
J. Discrete Algorithms, 2017

A note on Thue games.
Inf. Process. Lett., 2017

2016
On the density of Lyndon roots in factors.
Theor. Comput. Sci., 2016

A note on Thue games.
CoRR, 2016

Erratum to: Circular sequence comparison: algorithms and applications.
Algorithms for Molecular Biology, 2016

Circular sequence comparison: algorithms and applications.
Algorithms for Molecular Biology, 2016

Linear-Time Sequence Comparison Using Minimal Absent Words & Applications.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2015
k-Abelian pattern matching.
J. Discrete Algorithms, 2015

A note on the avoidability of binary patterns with variables and reversals.
CoRR, 2015

Linear-Time Sequence Comparison Using Minimal Absent Words & Applications.
CoRR, 2015

Circular Sequence Comparison with q-grams.
Proceedings of the Algorithms in Bioinformatics - 15th International Workshop, 2015

Pattern Matching with Variables: Fast Algorithms and New Hardness Results.
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

2014
5-Abelian cubes are avoidable on binary alphabets.
RAIRO - Theor. Inf. and Applic., 2014

Binary patterns in binary cube-free words: Avoidability and growth.
RAIRO - Theor. Inf. and Applic., 2014

Regular languages of partial words.
Inf. Sci., 2014

Inner Palindromic Closure.
Int. J. Found. Comput. Sci., 2014

The pseudopalindromic completion of regular languages.
Inf. Comput., 2014

An algorithmic toolbox for periodic partial words.
Discrete Applied Mathematics, 2014

Fewer runs than word length.
CoRR, 2014

k-Abelian Pattern Matching.
Proceedings of the Developments in Language Theory - 18th International Conference, 2014

2013
A Note on the Decidability of subword inequalities.
Int. J. Found. Comput. Sci., 2013

Binary Patterns in Binary Cube-Free Words: Avoidability and Growth
CoRR, 2013

Finding Pseudo-repetitions.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

3-Abelian Cubes Are Avoidable on Binary Alphabets.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013

Inner Palindromic Closure.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013

The Lexicographic Cross-Section of the Plactic Monoid Is Regular.
Proceedings of the Combinatorics on Words - 9th International Conference, 2013

2012
Periodicity algorithms and a conjecture on overlaps in partial words.
Theor. Comput. Sci., 2012

The three-squares lemma for partial words with one hole.
Theor. Comput. Sci., 2012

Avoiding abelian squares in partial words.
J. Comb. Theory, Ser. A, 2012

Erratum to: Avoidable binary patterns in partial words.
Acta Inf., 2012

Fine and Wilf's Theorem and Pseudo-repetitions.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Hairpin Completion with Bounded Stem-Loop.
Proceedings of the Developments in Language Theory - 16th International Conference, 2012

Connecting Partial Words and Regular Languages.
Proceedings of the How the World Computes, 2012

Hairpin Lengthening and Shortening of Regular Languages.
Proceedings of the Languages Alive, 2012

2011
Avoiding large squares in partial words.
Theor. Comput. Sci., 2011

Counting Bordered Partial Words by Critical Positions.
Electr. J. Comb., 2011

Avoidable binary patterns in partial words.
Acta Inf., 2011

Periodicity Algorithms for Partial Words.
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

2010
Contextual partial commutations.
Discrete Mathematics & Theoretical Computer Science, 2010

Avoidable Binary Patterns in Partial Words.
Proceedings of the Language and Automata Theory and Applications, 2010

Abelian Square-Free Partial Words.
Proceedings of the Language and Automata Theory and Applications, 2010

2009
A generalization of Thue freeness for partial words.
Theor. Comput. Sci., 2009

A note on the number of squares in a partial word with one hole.
ITA, 2009

Unbordered partial words.
Discrete Applied Mathematics, 2009

Counting Distinct Squares in Partial Words.
Acta Cybern., 2009

An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms.
Proceedings of the Language and Automata Theory and Applications, 2009

How Many Holes Can an Unbordered Partial Word Contain?.
Proceedings of the Language and Automata Theory and Applications, 2009

PNEPs, NEPs for Context Free Parsing: Application to Natural Language Processing.
Proceedings of the Bio-Inspired Systems: Computational and Ambient Intelligence, 2009

Networks of Evolutionary Processors as Natural Parsers.
Proceedings of the ICAART 2009 - Proceedings of the International Conference on Agents and Artificial Intelligence, Porto, Portugal, January 19, 2009

2008
Counting Distinct Squares in Partial Words.
Proceedings of the Automata and Formal Languages, 12th International Conference, 2008

2007
Freeness of partial words.
Theor. Comput. Sci., 2007


  Loading...