Robert Mercas

Citeras av

	Alla	Sedan 2018
Citat	534	212
h-index	14	7
i10-index	18	5

20082009201020112012201320142015201620172018201920202021202220236 13 30 26 35 35 43 24 32 65 37 48 31 37 31 27

Offentlig åtkomst

Visa alla

20 artiklar

0 artiklar

tillgänglig

inte tillgänglig

Enligt krav från finansiärer

Medförfattare

Florin ManeaUniversity of GöttingenVerifierad e-postadress på informatik.uni-goettingen.de
Francine Blanchet-SadriProfessor, University of North Carolina-GreensboroVerifierad e-postadress på uncg.edu
Dirk NowotkaProfessor für Informatik, Christian-Albrechts-Universität zu KielVerifierad e-postadress på zs.uni-kiel.de
Henning FernauProfessor für Informatik, Universität TrierVerifierad e-postadress på uni-trier.de
Markus L. SchmidPost-Doc Researcher, Theoretical Computer Science, Humboldt University BerlinVerifierad e-postadress på mlschmid.de
Szilárd Zsolt FazekasAssociate Professor, Akita UniversityVerifierad e-postadress på ie.akita-u.ac.jp
Maxime CrochemoreKCLVerifierad e-postadress på kcl.ac.uk
Sean SimmonsComputational biologist, Broad InstituteVerifierad e-postadress på broadinstitute.org
Gabriele FiciAssociate Professor, Università di Palermo, ItalyVerifierad e-postadress på unipa.it
Catalin Stefan TiseanuIn the past University of Bucharest, University of Maryland College Park, IBM Research ZurichVerifierad e-postadress på alien.ai
Nadia PisantiUniversity of Pisa & Erable Team INRIAVerifierad e-postadress på di.unipi.it
Roberto GrossiProfessor of Computer Science, University of Pisa, ItalyVerifierad e-postadress på unipi.it
Fatima VayaniKing's College LondonVerifierad e-postadress på kcl.ac.uk
Costas IliopoulosProfessor in Algorithm Design & BioinformaticsVerifierad e-postadress på kcl.ac.uk
Daniel ReidenbachSchool of Computing and Mathematics, Keele University, UKVerifierad e-postadress på keele.ac.uk
Paweł GawrychowskiUniversity of WrocławVerifierad e-postadress på cs.uni.wroc.pl
christian choffrutprofessor université Paris DiderotVerifierad e-postadress på irif.fr
Kayoko Shikishima-TsujiVerifierad e-postadress på sta.tenri-u.ac.jp
Thorsten EhlersGerman Aerospace CenterVerifierad e-postadress på dlr.de
Panagiotis CharalampopoulosBirkbeck, University of LondonVerifierad e-postadress på bbk.ac.uk

Följ

Robert Mercas

Loughborough University

Verifierad e-postadress på lboro.ac.uk - Startsida

Combinatorics on words Formal languages Algorithms


Titel Sortera efter citat Sortera efter år Sortera efter titel	Citeras av Citeras av	År
Alignment-free sequence comparison using absent words P Charalampopoulos, M Crochemore, G Fici, R Mercaş, SP Pissis Information and Computation 262, 57-68, 2018	47*	2018
Pattern matching with variables: Efficient algorithms and complexity results H Fernau, F Manea, R Mercaş, ML Schmid ACM Transactions on Computation Theory (TOCT) 12 (1), 1-37, 2020	46*	2020
Freeness of partial words F Manea, R Mercaş Theoretical Computer Science 389 (1-2), 265-277, 2007	44	2007
Circular sequence comparison: algorithms and applications R Grossi, CS Iliopoulos, R Mercas, N Pisanti, SP Pissis, A Retha, F Vayani Algorithms for Molecular Biology 11 (1), 1-14, 2016	35*	2016
A generalization of Thue freeness for partial words F Blanchet-Sadri, R Mercaş, G Scott Theoretical Computer Science 410 (8-10), 793-800, 2009	31	2009
Counting distinct squares in partial words F Blanchet-Sadri, R Mercas, G Scott Acta Cybernetica 19 (2), 465-477, 2008	29	2008
Avoiding abelian squares in partial words F Blanchet-Sadri, JI Kim, R Mercaş, W Severa, S Simmons, D Xu Journal of Combinatorial Theory, Series A 119 (1), 257-270, 2012	27*	2012
Hide and seek with repetitions P Gawrychowski, F Manea, R Mercaş, D Nowotka Journal of Computer and System Sciences 101, 42-67, 2019	24*	2019
Fine and Wilf’s theorem and pseudo-repetitions F Manea, R Mercaş, D Nowotka International Symposium on Mathematical Foundations of Computer Science, 668-680, 2012	22	2012
Periodicity algorithms and a conjecture on overlaps in partial words F Blanchet-Sadri, R Mercaş, A Rashin, E Willett Theoretical Computer Science 443, 35-45, 2012	22*	2012
Avoidable binary patterns in partial words F Blanchet-Sadri, R Mercaş, S Simmons, E Weissenstein Acta Informatica 48 (1), 25-41, 2011	20*	2011
Revisiting Shinohara's algorithm for computing descriptive patterns H Fernau, F Manea, R Mercaş, ML Schmid Theoretical Computer Science 733, 44-54, 2018	16	2018
Regular Languages of Partial Words J Dassow, F Manea, R Mercas	15*	2014
3-abelian cubes are avoidable on binary alphabets AS Robert Mercaş Proceedings of the 17th Developments of Language Theory 7907, 374-383, 2013	15*	2013
k-Abelian pattern matching T Ehlers, F Manea, R Mercaş, D Nowotka Journal of Discrete Algorithms 34, 37-48, 2015	14	2015
Unbordered partial words F Blanchet-Sadri, CD Davis, J Dodge, R Mercaş, M Moorefield Discrete Applied Mathematics 157 (5), 890-900, 2009	14	2009
A note on the number of squares in a partial word with one hole F Blanchet-Sadri, R Mercaş RAIRO-Theoretical Informatics and Applications-Informatique Théorique et …, 2009	13	2009
Networks of evolutionary processors as natural language parsers G Bel Enguix, MD Jiménez-López, R Mercas, A Perekrestenko proc. ICAART, 2009	11	2009
An algorithmic toolbox for periodic partial words F Manea, R Mercaş, C Tiseanu Discrete Applied Mathematics 179, 174-192, 2014	8*	2014
The pseudopalindromic completion of regular languages SZ Fazekas, F Manea, R Mercaş, K Shikishima-Tsuji Information and Computation 239, 222-236, 2014	8*	2014

Systemet kan inte utföra åtgärden just nu. Försök igen senare.

Artiklar 1–20

Citat per år

Dubblettcitat

Sammanfogade citat

Lägg till medförfattareMedförfattare

Följ

Citeras av

Medförfattare