default search action
Robert Mercas
Person information
- affiliation: Kiel University, Department of Computer Science, Germany
- affiliation: Rovira i Virgili University, Tarragona, Department of Romance Studies, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c26]Szilárd Zsolt Fazekas, Tore Koß, Florin Manea, Robert Mercas, Timo Specht:
Subsequence Matching and Analysis Problems for Formal Languages. ISAAC 2024: 28:1-28:23 - [i8]Szilárd Zsolt Fazekas, Tore Koß, Florin Manea, Robert Mercas, Timo Specht:
Subsequence Matching and Analysis Problems for Formal Languages. CoRR abs/2410.07992 (2024) - 2023
- [c25]Szilárd Zsolt Fazekas
, Robert Mercas
Sweep Complexity Revisited. CIAA 2023: 116-127 - [e2]Anna E. Frid, Robert Mercas
Combinatorics on Words - 14th International Conference, WORDS 2023, Umeå, Sweden, June 12-16, 2023, Proceedings. Lecture Notes in Computer Science 13899, Springer 2023, ISBN 978-3-031-33179-4 [contents] - [i7]Szilárd Zsolt Fazekas, Robert Mercas:
Sweep Complexity Revisited. CoRR abs/2308.06683 (2023) - 2022
- [j36]Szilárd Zsolt Fazekas, Robert Mercas, Olívia Wu:
Complexities for Jumps and Sweeps. J. Autom. Lang. Comb. 27(1-3): 131-149 (2022) - [c24]Szilárd Zsolt Fazekas, Robert Mercas:
Clusters of Repetition Roots Forming Prefix Chains. DCFS 2022: 43-56 - [c23]Laura K. Hutchinson, Robert Mercas
A Toolkit for Parikh Matrices. CIAA 2022: 116-127 - 2021
- [j35]Jeffery Dick
Reducing the ambiguity of Parikh matrices. Theor. Comput. Sci. 860: 23-40 (2021) - [c22]Szilárd Zsolt Fazekas
Clusters of Repetition Roots: Single Chains. SOFSEM 2021: 400-409 - 2020
- [j34]Szilárd Zsolt Fazekas
On the Prefix-Suffix Duplication Reduction. Int. J. Found. Comput. Sci. 31(1): 91-102 (2020) - [j33]Henning Fernau
Pattern Matching with Variables: Efficient Algorithms and Complexity Results. ACM Trans. Comput. Theory 12(1): 6:1-6:37 (2020) - [c21]Jeffery Dick, Laura K. Hutchinson, Robert Mercas, Daniel Reidenbach:
Reducing the Ambiguity of Parikh Matrices. LATA 2020: 397-411
2010 – 2019
- 2019
- [j32]Pawel Gawrychowski
Hide and seek with repetitions. J. Comput. Syst. Sci. 101: 42-67 (2019) - [e1]Robert Mercas, Daniel Reidenbach:
Combinatorics on Words - 12th International Conference, WORDS 2019, Loughborough, UK, September 9-13, 2019, Proceedings. Lecture Notes in Computer Science 11682, Springer 2019, ISBN 978-3-030-28795-5 [contents] - 2018
- [j31]Panagiotis Charalampopoulos
Alignment-free sequence comparison using absent words. Inf. Comput. 262: 57-68 (2018) - [j30]Karol Kosinski, Robert Mercas, Dirk Nowotka:
Corrigendum to "A note on Thue games" [Inf. Process. Lett. 118 (2017) 75-77]. Inf. Process. Lett. 130: 63-65 (2018) - [j29]Henning Fernau
Revisiting Shinohara's algorithm for computing descriptive patterns. Theor. Comput. Sci. 733: 44-54 (2018) - [i6]Panagiotis Charalampopoulos, Maxime Crochemore, Gabriele Fici, Robert Mercas, Solon P. Pissis:
Alignment-free sequence comparison using absent words. CoRR abs/1806.02718 (2018) - 2017
- [j28]Robert Mercas
A note on Thue games. Inf. Process. Lett. 118: 75-77 (2017) - [j27]Robert Mercas, Nadia Pisanti:
Preface. J. Discrete Algorithms 42: 1 (2017) - [j26]Golnaz Badkobeh, Maxime Crochemore
Counting maximal-exponent factors in words. Theor. Comput. Sci. 658: 27-35 (2017) - [j25]Robert Mercas
On the aperiodic avoidability of binary patterns with variables and reversals. Theor. Comput. Sci. 682: 180-189 (2017) - 2016
- [j24]Roberto Grossi, Costas S. Iliopoulos, Robert Mercas
Circular sequence comparison: algorithms and applications. Algorithms Mol. Biol. 11: 12 (2016) - [j23]Roberto Grossi, Costas S. Iliopoulos, Robert Mercas, Nadia Pisanti, Solon P. Pissis
Erratum to: Circular sequence comparison: algorithms and applications. Algorithms Mol. Biol. 11: 21 (2016) - [j22]Maxime Crochemore
On the density of Lyndon roots in factors. Theor. Comput. Sci. 656: 234-240 (2016) - [c20]Maxime Crochemore, Gabriele Fici
Linear-Time Sequence Comparison Using Minimal Absent Words & Applications. LATIN 2016: 334-346 - [i5]Robert Mercas, Dirk Nowotka:
A note on Thue games. CoRR abs/1601.02453 (2016) - 2015
- [j21]Thorsten Ehlers, Florin Manea, Robert Mercas
k-Abelian pattern matching. J. Discrete Algorithms 34: 37-48 (2015) - [c19]Henning Fernau
Pattern Matching with Variables: Fast Algorithms and New Hardness Results. STACS 2015: 302-315 - [c18]Roberto Grossi, Costas S. Iliopoulos, Robert Mercas
Circular Sequence Comparison with q-grams. WABI 2015: 203-216 - [i4]Maxime Crochemore, Gabriele Fici, Robert Mercas, Solon P. Pissis:
Linear-Time Sequence Comparison Using Minimal Absent Words & Applications. CoRR abs/1506.04917 (2015) - [i3]Robert Mercas:
A note on the avoidability of binary patterns with variables and reversals. CoRR abs/1508.04571 (2015) - 2014
- [j20]Florin Manea, Robert Mercas
An algorithmic toolbox for periodic partial words. Discret. Appl. Math. 179: 174-192 (2014) - [j19]Szilárd Zsolt Fazekas
The pseudopalindromic completion of regular languages. Inf. Comput. 239: 222-236 (2014) - [j18]Jürgen Dassow, Florin Manea, Robert Mercas
Inner Palindromic Closure. Int. J. Found. Comput. Sci. 25(8): 1049-1064 (2014) - [j17]Jürgen Dassow, Florin Manea, Robert Mercas
Regular languages of partial words. Inf. Sci. 268: 290-304 (2014) - [j16]Robert Mercas
Binary patterns in binary cube-free words: Avoidability and growth. RAIRO Theor. Informatics Appl. 48(4): 369-389 (2014) - [j15]Robert Mercas
5-Abelian cubes are avoidable on binary alphabets. RAIRO Theor. Informatics Appl. 48(4): 467-478 (2014) - [c17]Thorsten Ehlers, Florin Manea, Robert Mercas, Dirk Nowotka:
k-Abelian Pattern Matching. Developments in Language Theory 2014: 178-190 - [i2]Maxime Crochemore, Robert Mercas:
Fewer runs than word length. CoRR abs/1412.4646 (2014) - 2013
- [j14]Szilárd Zsolt Fazekas
A Note on the Decidability of subword inequalities. Int. J. Found. Comput. Sci. 24(4): 445-452 (2013) - [c16]Christian Choffrut, Robert Mercas:
The Lexicographic Cross-Section of the Plactic Monoid Is Regular. WORDS 2013: 83-94 - [c15]Jürgen Dassow, Florin Manea, Robert Mercas, Mike Müller:
Inner Palindromic Closure. Developments in Language Theory 2013: 155-166 - [c14]Robert Mercas, Aleksi Saarela
3-Abelian Cubes Are Avoidable on Binary Alphabets. Developments in Language Theory 2013: 374-383 - [c13]Pawel Gawrychowski, Florin Manea, Robert Mercas, Dirk Nowotka, Catalin Tiseanu:
Finding Pseudo-repetitions. STACS 2013: 257-268 - [i1]Robert Mercas, Pascal Ochem, Alexey V. Samsonov, Arseny M. Shur:
Binary Patterns in Binary Cube-Free Words: Avoidability and Growth. CoRR abs/1301.4682 (2013) - 2012
- [j13]Francine Blanchet-Sadri, Robert Mercas
Erratum to: Avoidable binary patterns in partial words. Acta Informatica 49(1): 53-54 (2012) - [j12]Francine Blanchet-Sadri, Jane I. Kim, Robert Mercas
Avoiding abelian squares in partial words. J. Comb. Theory A 119(1): 257-270 (2012) - [j11]Francine Blanchet-Sadri, Robert Mercas
The three-squares lemma for partial words with one hole. Theor. Comput. Sci. 428: 1-9 (2012) - [j10]Francine Blanchet-Sadri, Robert Mercas
Periodicity algorithms and a conjecture on overlaps in partial words. Theor. Comput. Sci. 443: 35-45 (2012) - [c12]Florin Manea, Robert Mercas, Victor Mitrana
Hairpin Lengthening and Shortening of Regular Languages. Languages Alive 2012: 145-159 - [c11]Jürgen Dassow, Florin Manea, Robert Mercas:
Connecting Partial Words and Regular Languages. CiE 2012: 151-161 - [c10]Szilárd Zsolt Fazekas
Hairpin Completion with Bounded Stem-Loop. Developments in Language Theory 2012: 428-439 - [c9]Florin Manea, Robert Mercas, Dirk Nowotka:
Fine and Wilf's Theorem and Pseudo-repetitions. MFCS 2012: 668-680 - 2011
- [j9]Francine Blanchet-Sadri, Robert Mercas
Avoidable binary patterns in partial words. Acta Informatica 48(1): 25-41 (2011) - [j8]Emily Allen, Francine Blanchet-Sadri, Cameron Byrum, Mihai Cucuringu, Robert Mercas:
Counting Bordered Partial Words by Critical Positions. Electron. J. Comb. 18(1) (2011) - [j7]Francine Blanchet-Sadri, Ilkyoo Choi
Avoiding large squares in partial words. Theor. Comput. Sci. 412(29): 3752-3758 (2011) - [c8]Florin Manea, Robert Mercas, Catalin Tiseanu:
Periodicity Algorithms for Partial Words. MFCS 2011: 472-484 - 2010
- [b1]Robert Mercas:
Repetitions in partial words. University of Rovira i Virgili, Spain, 2010 - [j6]Christian Choffrut, Robert George Mercas:
Contextual partial commutations. Discret. Math. Theor. Comput. Sci. 12(4): 59-72 (2010) - [c7]Francine Blanchet-Sadri, Jane I. Kim, Robert Mercas
Abelian Square-Free Partial Words. LATA 2010: 94-105 - [c6]Francine Blanchet-Sadri, Robert Mercas
Avoidable Binary Patterns in Partial Words. LATA 2010: 106-117
2000 – 2009
- 2009
- [j5]Francine Blanchet-Sadri, Robert Mercas, Geoffrey Scott:
Counting Distinct Squares in Partial Words. Acta Cybern. 19(2): 465-477 (2009) - [j4]Francine Blanchet-Sadri, C. D. Davis, Joel Dodge, Robert Mercas
Unbordered partial words. Discret. Appl. Math. 157(5): 890-900 (2009) - [j3]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): 767-774 (2009) - [j2]Francine Blanchet-Sadri, Robert Mercas
A generalization of Thue freeness for partial words. Theor. Comput. Sci. 410(8-10): 793-800 (2009) - [c5]Gemma Bel Enguix, María Dolores Jiménez-López, Robert Mercas, Alexander Perekrestenko:
Networks of Evolutionary Processors as Natural Parsers. ICAART 2009: 619-625 - [c4]Alfonso Ortega
PNEPs, NEPs for Context Free Parsing: Application to Natural Language Processing. IWANN (1) 2009: 472-479 - [c3]Francine Blanchet-Sadri, Emily Allen, Cameron Byrum, Robert Mercas
How Many Holes Can an Unbordered Partial Word Contain?. LATA 2009: 176-187 - [c2]Francine Blanchet-Sadri, Robert Mercas
An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms. LATA 2009: 188-199 - 2008
- [c1]Francine Blanchet-Sadri, Robert Mercas, Geoffrey Scott:
Counting Distinct Squares in Partial Words. AFL 2008: 122-133 - 2007
- [j1]Florin Manea, Robert Mercas
Freeness of partial words. Theor. Comput. Sci. 389(1-2): 265-277 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-05 21:43 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: