default search action
Olivier Raynaud
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j10]Diyé Dia, Giacomo Kahn, Fabien Labernia, Yannick Loiseau
, Olivier Raynaud
A closed sets based learning classifier for implicit authentication in web browsing. Discret. Appl. Math. 273: 65-80 (2020) - [c17]Farah Dernaika, Nora Cuppens-Boulahia, Frédéric Cuppens, Olivier Raynaud:
A Posteriori Analysis of Policy Temporal Compliance. CRiSIS 2020: 133-148 - [c16]Farah Dernaika, Nora Cuppens-Boulahia, Frédéric Cuppens, Olivier Raynaud:
Accountability in the A Posteriori Access Control: A Requirement and a Mechanism. QUATIC 2020: 332-342
2010 – 2019
- 2019
- [c15]Farah Dernaika, Nora Cuppens-Boulahia, Frédéric Cuppens, Olivier Raynaud:
Semantic Mediation for A Posteriori Log Analysis. ARES 2019: 88:1-88:10 - 2018
- [j9]Laurent Beaudou, Kaoutar Ghazi, Giacomo Kahn, Olivier Raynaud, Eric Thierry:
Encoding partial orders through modular decomposition. J. Comput. Sci. 25: 446-455 (2018) - [c14]Kaoutar Ghazi, Laurent Beaudou, Olivier Raynaud:
Algorithms for a Bit-Vector Encoding of Trees. ICO 2018: 418-427 - 2016
- [c13]Giacomo Kahn, Yannick Loiseau, Olivier Raynaud:
A Tool for Classification of Sequential Data. FCA4AI@ECAI 2016: 97-104 - 2015
- [c12]Olivier Coupelon, Diyé Dia, Yannick Loiseau
Am I Really Who I Claim to Be? WorldCIST (1) 2015: 613-616 - 2014
- [j8]Pierre Colomb, Alexis Irlande, Olivier Raynaud, Yoan Renaud:
Recursive decomposition tree of a Moore co-family and closure algorithm. Ann. Math. Artif. Intell. 70(1-2): 107-122 (2014) - [c11]Olivier Coupelon, Diyé Dia, Fabien Labernia, Yannick Loiseau, Olivier Raynaud:
Using Closed Itemsets for Implicit User Authentication in Web Browsing. CLA 2014: 131-144 - [c10]Diyé Dia, Olivier Coupelon, Yannick Loiseau, Olivier Raynaud:
Suis-je celui que je prétends être ? IC 2014: 271-274 - 2013
- [j7]Pierre Colomb, Alexis Irlande, Olivier Raynaud, Yoan Renaud:
Recursive decomposition and bounds of the lattice of Moore co-families. Ann. Math. Artif. Intell. 67(2): 109-122 (2013) - 2012
- [c9]Stéphanie Chollet, Vincent Lestideau, Yoann Maurel, Etienne Gandrille, Philippe Lalanda, Olivier Raynaud:
Practical Use of Formal Concept Analysis in Service-Oriented Computing. ICFCA 2012: 61-76 - 2011
- [c8]Stéphanie Chollet, Vincent Lestideau, Philippe Lalanda, Yoann Maurel, Pierre Colomb, Olivier Raynaud:
Building FCA-Based Decision Trees for the Selection of Heterogeneous Services. IEEE SCC 2011: 616-623 - [c7]Pierre Colomb, Alexis Irlande, Olivier Raynaud, Yoan Renaud:
A Closure Algorithm Using a Recursive Decomposition of the Set of Moore Co-families. CLA 2011: 131-141 - 2010
- [j6]Olivier Raynaud, Eric Thierry:
The Complexity of Embedding Orders into Small Products of Chains. Order 27(3): 365-381 (2010) - [c6]Pierre Colomb, Alexis Irlande, Olivier Raynaud:
Counting of Moore Families for n=7. ICFCA 2010: 72-87
2000 – 2009
- 2008
- [c5]Pierre Colomb, Olivier Raynaud, Eric Thierry:
Generalized Polychotomic Encoding: A Very Short Bit-Vector Encoding of Tree Hierarchies. MCO 2008: 77-86 - 2006
- [j5]Olivier Raynaud, Raoul Medina, Caroline Noyer:
Twin Vertices in Hypergraphs. Electron. Notes Discret. Math. 27: 87-89 (2006) - [c4]Raoul Medina, Lhouari Nourine, Olivier Raynaud:
Interactive Association Rules Discovery. ICFCA 2006: 177-190 - 2005
- [c3]Raoul Medina, Caroline Noyer, Olivier Raynaud:
Efficient algorithms for clone items detection. CLA 2005 - 2004
- [j4]Michel Habib
Computational aspects of the 2-dimension of partially ordered sets. Theor. Comput. Sci. 312(2-3): 401-431 (2004) - 2002
- [j3]Lhouari Nourine, Olivier Raynaud:
A fast incremental algorithm for building lattices. J. Exp. Theor. Artif. Intell. 14(2-3): 217-227 (2002) - 2001
- [c2]Olivier Raynaud, Eric Thierry:
A Quasi Optimal Bit-Vector Encoding of Tree Hierarchies. Application to Efficient Type Inclusion Tests. ECOOP 2001: 165-180 - 2000
- [c1]Jean-Marc Lanlignel, Olivier Raynaud, Eric Thierry:
Pruning Graphs with Digital Search Trees. Application to Distance Hereditary Graphs. STACS 2000: 529-541
1990 – 1999
- 1999
- [j2]Yves Caseau, Michel Habib
Encoding of Multiple Inheritance Hierarchies and Partial Orders. Comput. Intell. 15: 50-62 (1999) - [j1]Lhouari Nourine, Olivier Raynaud:
A Fast Algorithm for Building Lattices. Inf. Process. Lett. 71(5-6): 199-204 (1999)
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-24 23:16 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: