Robert Mercas
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
20
Venues
11
Active years
2009–2024
Best venue rank
C
Where they publish
Papers
20 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2024 | ISAAC | Subsequence Matching and Analysis Problems for Formal Languages. | Szilrd Zsolt Fazekas, Tore Ko, Florin Manea, Robert Mercas, Timo Specht |
| 2021 | SOFSEM | Clusters of Repetition Roots: Single Chains. | Szilrd Zsolt Fazekas, Robert Mercas |
| 2020 | LATA | Reducing the Ambiguity of Parikh Matrices. | Jeffery Dick, Laura K. Hutchinson, Robert Mercas, Daniel Reidenbach |
| 2016 | LATIN | Linear-Time Sequence Comparison Using Minimal Absent Words & Applications. | Maxime Crochemore, Gabriele Fici, Robert Mercas, Solon P. Pissis |
| 2015 | STACS | Pattern Matching with Variables: Fast Algorithms and New Hardness Results. | Henning Fernau, Florin Manea, Robert Mercas, Markus L. Schmid |
| 2015 | WABI | Circular Sequence Comparison with q-grams. | Roberto Grossi, Costas S. Iliopoulos, Robert Mercas, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Fatima Vayani |
| 2014 | DLT | k-Abelian Pattern Matching. | Thorsten Ehlers, Florin Manea, Robert Mercas, Dirk Nowotka |
| 2013 | DLT | Inner Palindromic Closure. | Jrgen Dassow, Florin Manea, Robert Mercas, Mike Mller |
| 2013 | DLT | 3-Abelian Cubes Are Avoidable on Binary Alphabets. | Robert Mercas, Aleksi Saarela |
| 2013 | STACS | Finding Pseudo-repetitions. | Pawel Gawrychowski, Florin Manea, Robert Mercas, Dirk Nowotka, Catalin Tiseanu |
| 2012 | CiE | Connecting Partial Words and Regular Languages. | Jrgen Dassow, Florin Manea, Robert Mercas |
| 2012 | DLT | Hairpin Completion with Bounded Stem-Loop. | Szilrd Zsolt Fazekas, Robert Mercas, Kayoko Shikishima-Tsuji |
| 2012 | MFCS | Fine and Wilf's Theorem and Pseudo-repetitions. | Florin Manea, Robert Mercas, Dirk Nowotka |
| 2011 | MFCS | Periodicity Algorithms for Partial Words. | Florin Manea, Robert Mercas, Catalin Tiseanu |
| 2010 | LATA | Abelian Square-Free Partial Words. | Francine Blanchet-Sadri, Jane I. Kim, Robert Mercas, William Severa, Sean Simmons |
| 2010 | LATA | Avoidable Binary Patterns in Partial Words. | Francine Blanchet-Sadri, Robert Mercas, Sean Simmons, Eric Weissenstein |
| 2009 | ICAART | Networks of Evolutionary Processors as Natural Parsers. | Gemma Bel Enguix, Mara Dolores Jimnez-Lpez, Robert Mercas, Alexander Perekrestenko |
| 2009 | IWANN | PNEPs, NEPs for Context Free Parsing: Application to Natural Language Processing. | Alfonso Ortega, Emilio del Rosal Garca, Diana Prez, Robert Mercas, Alexander Perekrestenko, Manuel Alfonseca |
| 2009 | LATA | How Many Holes Can an Unbordered Partial Word Contain?. | Francine Blanchet-Sadri, Emily Allen, Cameron Byrum, Robert Mercas |
| 2009 | LATA | An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms. | Francine Blanchet-Sadri, Robert Mercas, Abraham Rashin, Elara Willett |