Robert Mercas

Publication Activity (10 Years)

Years Active: 2007-2023
Publications (10 Years): 24

Top Topics

Binary Patterns

Top Venues

Theor. Comput. Sci.

Developments in Language Theory

Int. J. Found. Comput. Sci.

Publications

Szilárd Zsolt Fazekas, Robert Mercas
Sweep Complexity Revisited. CIAA (2023)
Szilárd Zsolt Fazekas, Robert Mercas
Sweep Complexity Revisited. CoRR (2023)
Laura K. Hutchinson, Robert Mercas, Daniel Reidenbach
A Toolkit for Parikh Matrices. CIAA (2022)
Szilárd Zsolt Fazekas, Robert Mercas
Clusters of Repetition Roots Forming Prefix Chains. DCFS (2022)
Szilárd Zsolt Fazekas, Robert Mercas, Olívia Wu
Complexities for Jumps and Sweeps. J. Autom. Lang. Comb. 27 (1-3) (2022)
Jeffery Dick, Laura K. Hutchinson, Robert Mercas, Daniel Reidenbach
Reducing the ambiguity of Parikh matrices. Theor. Comput. Sci. 860 (2021)
Szilárd Zsolt Fazekas, Robert Mercas
Clusters of Repetition Roots: Single Chains. SOFSEM (2021)
Szilárd Zsolt Fazekas, Robert Mercas, Daniel Reidenbach
On the Prefix-Suffix Duplication Reduction. Int. J. Found. Comput. Sci. 31 (1) (2020)
Henning Fernau, Florin Manea, Robert Mercas, Markus L. Schmid
Pattern Matching with Variables: Efficient Algorithms and Complexity Results. ACM Trans. Comput. Theory 12 (1) (2020)
Jeffery Dick, Laura K. Hutchinson, Robert Mercas, Daniel Reidenbach
Reducing the Ambiguity of Parikh Matrices. LATA (2020)
Pawel Gawrychowski, Florin Manea, Robert Mercas, Dirk Nowotka
Hide and seek with repetitions. J. Comput. Syst. Sci. 101 (2019)
Panagiotis Charalampopoulos, Maxime Crochemore, Gabriele Fici, Robert Mercas, Solon P. Pissis
Alignment-free sequence comparison using absent words. CoRR (2018)
Karol Kosinski, Robert Mercas, Dirk Nowotka
Corrigendum to "A note on Thue games" [Inf. Process. Lett. 118 (2017) 75-77]. Inf. Process. Lett. 130 (2018)
Henning Fernau, Florin Manea, Robert Mercas, Markus L. Schmid
Revisiting Shinohara's algorithm for computing descriptive patterns. Theor. Comput. Sci. 733 (2018)
Panagiotis Charalampopoulos, Maxime Crochemore, Gabriele Fici, Robert Mercas, Solon P. Pissis
Alignment-free sequence comparison using absent words. Inf. Comput. 262 (2018)
Robert Mercas
On the aperiodic avoidability of binary patterns with variables and reversals. Theor. Comput. Sci. 682 (2017)
Golnaz Badkobeh, Maxime Crochemore, Robert Mercas
Counting maximal-exponent factors in words. Theor. Comput. Sci. 658 (2017)
Robert Mercas, Nadia Pisanti
Preface. J. Discrete Algorithms 42 (2017)
Robert Mercas, Dirk Nowotka
A note on Thue games. Inf. Process. Lett. 118 (2017)
Maxime Crochemore, Robert Mercas
On the density of Lyndon roots in factors. Theor. Comput. Sci. 656 (2016)
Roberto Grossi, Costas S. Iliopoulos, Robert Mercas, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Fatima Vayani
Erratum to: Circular sequence comparison: algorithms and applications. Algorithms Mol. Biol. 11 (2016)
Robert Mercas, Dirk Nowotka
A note on Thue games. CoRR (2016)
Roberto Grossi, Costas S. Iliopoulos, Robert Mercas, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Fatima Vayani
Circular sequence comparison: algorithms and applications. Algorithms Mol. Biol. 11 (2016)
Maxime Crochemore, Gabriele Fici, Robert Mercas, Solon P. Pissis
Linear-Time Sequence Comparison Using Minimal Absent Words & Applications. LATIN (2016)
Maxime Crochemore, Gabriele Fici, Robert Mercas, Solon P. Pissis
Linear-Time Sequence Comparison Using Minimal Absent Words & Applications. CoRR (2015)
Roberto Grossi, Costas S. Iliopoulos, Robert Mercas, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Fatima Vayani
Circular Sequence Comparison with q-grams. WABI (2015)
Robert Mercas
A note on the avoidability of binary patterns with variables and reversals. CoRR (2015)
Thorsten Ehlers, Florin Manea, Robert Mercas, Dirk Nowotka
k-Abelian pattern matching. J. Discrete Algorithms 34 (2015)
Henning Fernau, Florin Manea, Robert Mercas, Markus L. Schmid
Pattern Matching with Variables: Fast Algorithms and New Hardness Results. STACS (2015)
Jürgen Dassow, Florin Manea, Robert Mercas, Mike Müller
Inner Palindromic Closure. Int. J. Found. Comput. Sci. 25 (8) (2014)
Florin Manea, Robert Mercas, Catalin Tiseanu
An algorithmic toolbox for periodic partial words. Discret. Appl. Math. 179 (2014)
Jürgen Dassow, Florin Manea, Robert Mercas
Regular languages of partial words. Inf. Sci. 268 (2014)
Szilárd Zsolt Fazekas, Florin Manea, Robert Mercas, Kayoko Shikishima-Tsuji
The pseudopalindromic completion of regular languages. Inf. Comput. 239 (2014)
Robert Mercas, Aleksi Saarela
5-Abelian cubes are avoidable on binary alphabets. RAIRO Theor. Informatics Appl. 48 (4) (2014)
Maxime Crochemore, Robert Mercas
Fewer runs than word length. CoRR (2014)
Thorsten Ehlers, Florin Manea, Robert Mercas, Dirk Nowotka
k-Abelian Pattern Matching. Developments in Language Theory (2014)
Robert Mercas, Pascal Ochem, Alexey V. Samsonov, Arseny M. Shur
Binary patterns in binary cube-free words: Avoidability and growth. RAIRO Theor. Informatics Appl. 48 (4) (2014)
Christian Choffrut, Robert Mercas
The Lexicographic Cross-Section of the Plactic Monoid Is Regular. WORDS (2013)
Robert Mercas, Aleksi Saarela
3-Abelian Cubes Are Avoidable on Binary Alphabets. Developments in Language Theory (2013)
Szilárd Zsolt Fazekas, Robert Mercas
A Note on the Decidability of subword inequalities. Int. J. Found. Comput. Sci. 24 (4) (2013)
Robert Mercas, Pascal Ochem, Alexey V. Samsonov, Arseny M. Shur
Binary Patterns in Binary Cube-Free Words: Avoidability and Growth CoRR (2013)
Jürgen Dassow, Florin Manea, Robert Mercas, Mike Müller
Inner Palindromic Closure. Developments in Language Theory (2013)
Pawel Gawrychowski, Florin Manea, Robert Mercas, Dirk Nowotka, Catalin Tiseanu
Finding Pseudo-repetitions. STACS (2013)
Francine Blanchet-Sadri, Robert Mercas, Abraham Rashin, Elara Willett
Periodicity algorithms and a conjecture on overlaps in partial words. Theor. Comput. Sci. 443 (2012)
Szilárd Zsolt Fazekas, Robert Mercas, Kayoko Shikishima-Tsuji
Hairpin Completion with Bounded Stem-Loop. Developments in Language Theory (2012)
Francine Blanchet-Sadri, Robert Mercas, Sean Simmons, Eric Weissenstein
Erratum to: Avoidable binary patterns in partial words. Acta Informatica 49 (1) (2012)
Francine Blanchet-Sadri, Jane I. Kim, Robert Mercas, William Severa, Sean Simmons, Dimin Xu
Avoiding abelian squares in partial words. J. Comb. Theory, Ser. A 119 (1) (2012)
Jürgen Dassow, Florin Manea, Robert Mercas
Connecting Partial Words and Regular Languages. CiE (2012)
Florin Manea, Robert Mercas, Dirk Nowotka
Fine and Wilf's Theorem and Pseudo-repetitions. MFCS (2012)
Francine Blanchet-Sadri, Robert Mercas
The three-squares lemma for partial words with one hole. Theor. Comput. Sci. 428 (2012)
Florin Manea, Robert Mercas, Victor Mitrana
Hairpin Lengthening and Shortening of Regular Languages. Languages Alive (2012)
Florin Manea, Robert Mercas, Catalin Tiseanu
Periodicity Algorithms for Partial Words. MFCS (2011)
Emily Allen, Francine Blanchet-Sadri, Cameron Byrum, Mihai Cucuringu, Robert Mercas
Counting Bordered Partial Words by Critical Positions. Electron. J. Comb. 18 (1) (2011)
Francine Blanchet-Sadri, Robert Mercas, Sean Simmons, Eric Weissenstein
Avoidable binary patterns in partial words. Acta Informatica 48 (1) (2011)
Francine Blanchet-Sadri, Ilkyoo Choi, Robert Mercas
Avoiding large squares in partial words. Theor. Comput. Sci. 412 (29) (2011)
Francine Blanchet-Sadri, Robert Mercas, Sean Simmons, Eric Weissenstein
Avoidable Binary Patterns in Partial Words. LATA (2010)
Francine Blanchet-Sadri, Jane I. Kim, Robert Mercas, William Severa, Sean Simmons
Abelian Square-Free Partial Words. LATA (2010)
Francine Blanchet-Sadri, Emily Allen, Cameron Byrum, Robert Mercas
How Many Holes Can an Unbordered Partial Word Contain?. LATA (2009)
Gemma Bel Enguix, Maria Dolores Jiménez-López, Robert Mercas, Alexander Perekrestenko
Networks of Evolutionary Processors as Natural Parsers. ICAART (2009)
Francine Blanchet-Sadri, Robert Mercas
A note on the number of squares in a partial word with one hole. RAIRO Theor. Informatics Appl. 43 (4) (2009)
Francine Blanchet-Sadri, Robert Mercas, Geoffrey Scott
Counting Distinct Squares in Partial Words. Acta Cybern. 19 (2) (2009)
Alfonso Ortega, Emilio del Rosal García, Diana Pérez, Robert Mercas, Alexander Perekrestenko, Manuel Alfonseca
PNEPs, NEPs for Context Free Parsing: Application to Natural Language Processing. IWANN (1) (2009)
Francine Blanchet-Sadri, Robert Mercas, Geoffrey Scott
A generalization of Thue freeness for partial words. Theor. Comput. Sci. 410 (8-10) (2009)
Francine Blanchet-Sadri, Robert Mercas, Abraham Rashin, Elara Willett
An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms. LATA (2009)
Francine Blanchet-Sadri, C. D. Davis, Joel Dodge, Robert Mercas, Margaret Moorefield
Unbordered partial words. Discret. Appl. Math. 157 (5) (2009)
Francine Blanchet-Sadri, Robert Mercas, Geoffrey Scott
Counting Distinct Squares in Partial Words. AFL (2008)
Florin Manea, Robert Mercas
Freeness of partial words. Theor. Comput. Sci. 389 (1-2) (2007)