default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRomain Azaïs
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Romain Azaïs
, Florian Ingels:
Detection of common subtrees with identical label distribution. Theor. Comput. Sci. 988: 114366 (2024)- 2023
- [j5]Farah Ben-Naoum, Christophe Godin, Romain Azaïs:
Characterization of random walks on space of unordered trees using efficient metric simulation. Discret. Appl. Math. 341: 290-307 (2023) - [i7]Romain Azaïs, Florian Ingels:
Detection of Common Subtrees with Identical Label Distribution. CoRR abs/2307.13068 (2023) - [i6]Farah Ben-Naoum, Christophe Godin, Romain Azaïs:
Characterization of random walks on space of unordered trees using efficient metric simulation. CoRR abs/2308.10861 (2023) - 2022
- [b1]Romain Azaïs:
Approches algorithmiques pour la statistique : processus déterministes par morceaux et arbres aléatoires. (Algorithmic approach to statistics: piecewise-deterministic processes and random trees). ENS de Lyon, France, 2022 - [j4]Florian Ingels, Romain Azaïs:
Enumeration of irredundant forests. Theor. Comput. Sci. 922: 312-334 (2022) - 2021
- [c4]Florian Ingels, Romain Azaïs:
Isomorphic Unordered Labeled Trees up to Substitution Ciphering. IWOCA 2021: 385-399 - [i5]Florian Ingels, Romain Azaïs:
Isomorphic unordered labeled trees up to substitution ciphering. CoRR abs/2105.05685 (2021) - 2020
- [j3]Romain Azaïs, Florian Ingels:
The weight function in the subtree kernel is decisive. J. Mach. Learn. Res. 21: 67:1-67:36 (2020) - [i4]Florian Ingels, Romain Azaïs:
Enumeration of Unordered Forests. CoRR abs/2003.08144 (2020)
2010 – 2019
- 2019
- [j2]Romain Azaïs:
Nearest Embedded and Embedding Self-Nested Trees. Algorithms 12(9): 180 (2019) - [j1]Romain Azaïs, Guillaume Cerutti, Didier Gemmerlé, Florian Ingels:
treex: a Python package for manipulating rooted trees. J. Open Source Softw. 4(38): 1351 (2019) - [c3]Romain Azaïs, Jean-Baptiste Durand, Christophe Godin:
Approximation of trees by self-nested trees. ALENEX 2019: 39-53 - [c2]Benoit Henry, Shihabur Rahman Chowdhury, Abdelkader Lahmadi, Romain Azaïs, Jérôme François, Raouf Boutaba:
SPONGE: Software-Defined Traffic Engineering to Absorb Influx of Network Traffic. LCN 2019: 193-201 - [i3]Romain Azaïs, Florian Ingels:
The Weight Function in the Subtree Kernel is Decisive. CoRR abs/1904.05421 (2019) - 2018
- [i2]Romain Azaïs, Jean-Baptiste Durand, Christophe Godin:
Approximation of trees by self-nested trees. CoRR abs/1810.10860 (2018) - 2017
- [i1]Romain Azaïs:
Nearest Embedded and Embedding Self-Nested Trees. CoRR abs/1709.02334 (2017) - 2016
- [c1]Romain Azaïs, Jean-Baptiste Durand, Christophe Godin:
Lossy Compression of Unordered Rooted Trees. DCC 2016: 581
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-09-13 01: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:
