default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRichard Groult
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c12]Vanessa Nina Borsan, Mathieu Giraud, Richard Groult, Thierry Lecroq:
Adding Descriptors to Melodies Improves Pattern Matching: A Study on Slovenian Folk Songs. ISMIR 2023: 474-481- [c11]Vanessa Nina Borsan, Mathieu Giraud, Richard Groult:
The Games We Play: Exploring the Impact of ISMIR on Musicology. ISMIR 2023: 545-552 - [c10]Bastien Auvray, Julien David, Richard Groult, Thierry Lecroq:
Approximate Cartesian Tree Matching: An Approach Using Swaps. SPIRE 2023: 49-61 - [i2]Bastien Auvray, Julien David, Richard Groult, Thierry Lecroq:
Approximate Cartesian Tree Matching: an Approach Using Swaps. CoRR abs/2306.16065 (2023) - 2021
- [j10]Gianluca Micchi, Louis Bigo, Mathieu Giraud
, Richard Groult, Florence Levé:
I Keep Counting: An Experiment in Human/AI Co-creative Songwriting. Trans. Int. Soc. Music. Inf. Retr. 4(1): 263 (2021)
2010 – 2019
- 2019
- [j9]Jacqueline W. Daykin, Richard Groult, Yannick Guesnet, Thierry Lecroq, Arnaud Lefebvre, Martine Léonard, Laurent Mouchard, Élise Prieur, Bruce W. Watson:
Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform. Inf. Process. Lett. 147: 82-87 (2019) - [j8]Pierre Allegraud, Louis Bigo, Laurent Feisthauer, Mathieu Giraud, Richard Groult, Emmanuel Leguy, Florence Levé:
Learning Sonata Form Structure on Mozart's String Quartets. Trans. Int. Soc. Music. Inf. Retr. 2(1): 82-96 (2019) - 2018
- [j7]Jacqueline W. Daykin, Richard Groult, Yannick Guesnet, Thierry Lecroq, Arnaud Lefebvre, Martine Léonard, Élise Prieur-Gaston:
A survey of string orderings and their application to the Burrows-Wheeler transform. Theor. Comput. Sci. 710: 52-65 (2018) - [c9]Jacqueline W. Daykin, Richard Groult, Yannick Guesnet, Thierry Lecroq, Arnaud Lefebvre, Martine Léonard, Laurent Mouchard, Élise Prieur-Gaston, Bruce W. Watson:
Three Strategies for the Dead-Zone String Matching Algorithm. Stringology 2018: 117-128 - 2017
- [c8]Louis Bigo, Mathieu Giraud, Richard Groult, Nicolas Guiomard-Kagan, Florence Levé:
Sketching Sonata Form Structure in Selected Classical String Quartets. ISMIR 2017: 752-759 - [i1]Jacqueline W. Daykin, Richard Groult, Yannick Guesnet, Thierry Lecroq, Arnaud Lefebvre, Martine Léonard, Laurent Mouchard, Élise Prieur-Gaston, Bruce W. Watson:
Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform. CoRR abs/1708.01130 (2017) - 2016
- [j6]Jacqueline W. Daykin, Richard Groult, Yannick Guesnet, Thierry Lecroq, Arnaud Lefebvre, Martine Léonard, Élise Prieur-Gaston:
Binary block order Rouen Transform. Theor. Comput. Sci. 656: 118-134 (2016) - [c7]Nicolas Guiomard-Kagan, Mathieu Giraud, Richard Groult, Florence Levé:
Improving Voice Separation by Better Connecting Contigs. ISMIR 2016: 164-170 - [p1]Mathieu Giraud, Richard Groult, Florence Levé:
Computational Analysis of Musical Form. Computational Music Analysis 2016: 113-136 - 2015
- [j5]Mathieu Giraud, Richard Groult, Emmanuel Leguy, Florence Levé:
Computational Fugue Analysis. Comput. Music. J. 39(2): 77-96 (2015) - [c6]Nicolas Guiomard-Kagan, Mathieu Giraud, Richard Groult, Florence Levé:
Comparing Voice and Stream Segmentation Algorithms. ISMIR 2015: 493-499 - 2012
- [c5]Mathieu Giraud, Richard Groult, Florence Levé:
Subject and Counter-Subject Detection for Analysis of the Well-Tempered Clavier Fugues. CMMR 2012: 422-438 - [c4]Mathieu Giraud, Richard Groult, Florence Levé:
Detecting Episodes with Harmonic Sequences for Fugue Analysis. ISMIR 2012: 457-462 - 2011
- [c3]Florence Levé, Richard Groult, Guillaume Arnaud, Cyril Séguin, Rémi Gaymay, Mathieu Giraud:
Rhythm Extraction from Polyphony Symbolic Music. ISMIR 2011: 375-380 - 2010
- [j4]Richard Groult, Élise Prieur, Gwénaël Richomme:
Counting distinct palindromes in a word in linear time. Inf. Process. Lett. 110(20): 908-912 (2010) - [j3]Richard Groult, Gwénaël Richomme:
Optimality of some algorithms to detect quasiperiodicities. Theor. Comput. Sci. 411(34-36): 3110-3122 (2010)
2000 – 2009
- 2005
- [j2]Richard Groult, Martine Léonard, Laurent Mouchard:
A Linear Algorithm for the Detection of Evolutive Tandem Repeats. J. Autom. Lang. Comb. 10(5/6): 671-685 (2005) - 2004
- [j1]Richard Groult, Martine Léonard, Laurent Mouchard:
Speeding up the detection of evolutive tandem repeats. Theor. Comput. Sci. 310(1-3): 309-328 (2004) - 2003
- [c2]Richard Groult, Martine Léonard, Laurent Mouchard:
A Linear Algorithm for the Detection of Evolutive Tandem Repeats. Stringology 2003: 77-90 - 2002
- [c1]Richard Groult, Martine Léonard, Laurent Mouchard:
Evolutive Tandem Repeats Using Hamming Distance. MFCS 2002: 292-304
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-04-25 05:42 CEST 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:
