default search action
Search 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
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 19 matches
- 2024
- Romain Azaïs, Florian Ingels:
Detection of common subtrees with identical label distribution. Theor. Comput. Sci. 988: 114366 (2024) - 2023
- 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) - Romain Azaïs, Florian Ingels:
Detection of Common Subtrees with Identical Label Distribution. CoRR abs/2307.13068 (2023) - 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
- 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 - Florian Ingels, Romain Azaïs:
Enumeration of irredundant forests. Theor. Comput. Sci. 922: 312-334 (2022) - 2021
- Florian Ingels, Romain Azaïs:
Isomorphic Unordered Labeled Trees up to Substitution Ciphering. IWOCA 2021: 385-399 - Florian Ingels, Romain Azaïs:
Isomorphic unordered labeled trees up to substitution ciphering. CoRR abs/2105.05685 (2021) - 2020
- Romain Azaïs, Florian Ingels:
The weight function in the subtree kernel is decisive. J. Mach. Learn. Res. 21: 67:1-67:36 (2020) - Florian Ingels, Romain Azaïs:
Enumeration of Unordered Forests. CoRR abs/2003.08144 (2020) - 2019
- Romain Azaïs:
Nearest Embedded and Embedding Self-Nested Trees. Algorithms 12(9): 180 (2019) - 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) - Romain Azaïs, Jean-Baptiste Durand, Christophe Godin:
Approximation of trees by self-nested trees. ALENEX 2019: 39-53 - 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 - Romain Azaïs, Florian Ingels:
The Weight Function in the Subtree Kernel is Decisive. CoRR abs/1904.05421 (2019) - 2018
- Romain Azaïs, Jean-Baptiste Durand, Christophe Godin:
Approximation of trees by self-nested trees. CoRR abs/1810.10860 (2018) - 2017
- Romain Azaïs:
Nearest Embedded and Embedding Self-Nested Trees. CoRR abs/1709.02334 (2017) - 2016
- Romain Azaïs, Jean-Baptiste Durand, Christophe Godin:
Lossy Compression of Unordered Rooted Trees. DCC 2016: 581 - 2004
- D. Martin, Romain Desplats, Gérald Haller, Pascal Nouet, Florence Azaïs:
Automated Diagnosis and Probing Flow for Fast Fault Localization in IC. Microelectron. Reliab. 44(9-11): 1553-1558 (2004)
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-09-17 03:32 CEST 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