default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Robert Mercas
aka: Robert George Mercas
Kiel University, Department of Computer Science, Germany
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 71 matches
- 2023
- Szilárd Zsolt Fazekas
, Robert Mercas:
Sweep Complexity Revisited. CIAA 2023: 116-127 - 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] - Szilárd Zsolt Fazekas, Robert Mercas:
Sweep Complexity Revisited. CoRR abs/2308.06683 (2023) - 2022
- Szilárd Zsolt Fazekas, Robert Mercas, Olívia Wu:
Complexities for Jumps and Sweeps. J. Autom. Lang. Comb. 27(1-3): 131-149 (2022) - Szilárd Zsolt Fazekas, Robert Mercas:
Clusters of Repetition Roots Forming Prefix Chains. DCFS 2022: 43-56 - Laura K. Hutchinson, Robert Mercas, Daniel Reidenbach:
A Toolkit for Parikh Matrices. CIAA 2022: 116-127 - 2021
- Jeffery Dick, Laura K. Hutchinson, Robert Mercas, Daniel Reidenbach:
Reducing the ambiguity of Parikh matrices. Theor. Comput. Sci. 860: 23-40 (2021) - Szilárd Zsolt Fazekas, Robert Mercas:
Clusters of Repetition Roots: Single Chains. SOFSEM 2021: 400-409 - 2020
- Szilárd Zsolt Fazekas, Robert Mercas, Daniel Reidenbach:
On the Prefix-Suffix Duplication Reduction. Int. J. Found. Comput. Sci. 31(1): 91-102 (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): 6:1-6:37 (2020) - Jeffery Dick, Laura K. Hutchinson, Robert Mercas, Daniel Reidenbach:
Reducing the Ambiguity of Parikh Matrices. LATA 2020: 397-411 - 2019
- Pawel Gawrychowski, Florin Manea, Robert Mercas, Dirk Nowotka:
Hide and seek with repetitions. J. Comput. Syst. Sci. 101: 42-67 (2019) - 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
- Panagiotis Charalampopoulos, Maxime Crochemore, Gabriele Fici, Robert Mercas, Solon P. Pissis:
Alignment-free sequence comparison using absent words. Inf. Comput. 262: 57-68 (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: 63-65 (2018) - Henning Fernau, Florin Manea, Robert Mercas, Markus L. Schmid:
Revisiting Shinohara's algorithm for computing descriptive patterns. Theor. Comput. Sci. 733: 44-54 (2018) - Panagiotis Charalampopoulos, Maxime Crochemore, Gabriele Fici, Robert Mercas, Solon P. Pissis:
Alignment-free sequence comparison using absent words. CoRR abs/1806.02718 (2018) - 2017
- Robert Mercas, Dirk Nowotka:
A note on Thue games. Inf. Process. Lett. 118: 75-77 (2017) - Robert Mercas, Nadia Pisanti:
Preface. J. Discrete Algorithms 42: 1 (2017) - Golnaz Badkobeh, Maxime Crochemore, Robert Mercas:
Counting maximal-exponent factors in words. Theor. Comput. Sci. 658: 27-35 (2017) - Robert Mercas:
On the aperiodic avoidability of binary patterns with variables and reversals. Theor. Comput. Sci. 682: 180-189 (2017) - 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: 12 (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: 21 (2016) - Maxime Crochemore, Robert Mercas:
On the density of Lyndon roots in factors. Theor. Comput. Sci. 656: 234-240 (2016) - Maxime Crochemore, Gabriele Fici, Robert Mercas, Solon P. Pissis:
Linear-Time Sequence Comparison Using Minimal Absent Words & Applications. LATIN 2016: 334-346 - Robert Mercas, Dirk Nowotka:
A note on Thue games. CoRR abs/1601.02453 (2016) - 2015
- Thorsten Ehlers, Florin Manea, Robert Mercas, Dirk Nowotka:
k-Abelian pattern matching. J. Discrete Algorithms 34: 37-48 (2015) - Henning Fernau, Florin Manea, Robert Mercas, Markus L. Schmid:
Pattern Matching with Variables: Fast Algorithms and New Hardness Results. STACS 2015: 302-315 - Roberto Grossi, Costas S. Iliopoulos, Robert Mercas, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Fatima Vayani:
Circular Sequence Comparison with q-grams. WABI 2015: 203-216 - Maxime Crochemore, Gabriele Fici, Robert Mercas, Solon P. Pissis:
Linear-Time Sequence Comparison Using Minimal Absent Words & Applications. CoRR abs/1506.04917 (2015)
skipping 41 more matches
loading more results 
failed to load more results, please try again later
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.
retrieved on 2024-11-11 15:42 CET from data curated 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:
