Robert Mercas

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