About: Michaël Rao

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Michaël Rao Goto Sponge NotDistinct Permalink

An Entity of Type : foaf:Person, within Data Space : data.idref.fr associated with source document(s)

Attributes	Values
type	Person
sameAs	Rao, Michaël (1979-... ; informaticien) Rao, Michaël (1979-... ; informaticien)
Life Event	http://www.idref.fr/109474562/birth
preferred label	Rao, Michaël (1979-... ; informaticien)
name	Michaël Rao
dbpedia-owl:citizenship	http://sws.geonames.org/3017382/
Language	http://lexvo.org/id/iso639-3/fra
Given name	Michaël
familyName	Rao
has biographical i...tion (Deprecated)	Titulaire d'un doctorat en informatique à l'Université Paul Verlaine de Metz (2006) Directeur de recherche CNRS en informatique. Membre du Laboratoire de l'informatique du parallélisme (LIP) à l’ENS de Lyon (en 2024)
gender	male
org:hasMembership	http://www.idref.fr/109474562/affiliation/1
org:memberOf	Laboratoire de l'informatique du parallélisme (Lyon ; 1988-....)
Scopus ID	56316087200
is sameAs of	Rao, Michaël (1979-... ; informaticien)
is Thesis advisor of	http://www.sudoc.fr/203108973/id http://www.sudoc.fr/242737897/id
is Author of	http://www.sudoc.fr/147316855/id http://www.sudoc.fr/109476581/id Décompositions de graphes et algorithmes efficaces How many square occurrences must a binary sequence contain? Representation theorems for two set families and applications to combinatorial decompositions The Domination Number of Grids On cardinalities of k-abelian equivalence classes Avoidability of long $k$-abelian repetitions Odd Perfect Numbers are Greater than 10^1500 Testing Balanced Splitting Cycles in Complete Triangulations Finite repetition threshold for large alphabets Diamond-Free Circle Graphs are Helly Circle Another remark on the radical of an ODD perfect number Décompositions de graphes et algorithmes efficaces Tree-representation of set families and applications to combinatorial decompositions Solving Some NP-Complete Problems using Split Decomposition http://www.numdam.org/articles/10.1051/ita/2014017#id A Note on Computing Set Overlap Classes Avoiding 2-binomial squares and cubes On Shuffling of Infinite Square-Free Words On some generalizations of abelian power avoidability On algorithms for (P_5,gem)-free graphs Clique-Width and the Speed of Hereditary Properties Clique-width of graphs defined by one-vertex extensions On the number of prime factors of an odd perfect number Representing Partitive Crossing Families and Union-Difference Families, with Application to Sesquimodular Decomposition Preuves aidées par ordinateur en combinatoire des mots http://www.sudoc.fr/24691324X/id An aperiodic set of 11 Wang tiles A Note On Computing Set Overlap Classes Avoiding or limiting regularities in words How many square occurrences must a binary sequence contain Well-Quasi-Order of Relabel Functions Finite repetition threshold for large alphabets Avoiding Two Consecutive Blocks of Same Size and Same Sum over $\mathbb{Z}^2$ https://orbi.uliege.be/handle/2268/178702#id
is primary topic of	http://www.idref.fr/109474562
is Opponent of	http://www.sudoc.fr/244457751/id http://www.sudoc.fr/231520379/id http://www.sudoc.fr/250512467/id
is Thesis referee of	http://www.sudoc.fr/254636624/id http://www.sudoc.fr/277152437/id

Faceted Search & Find service v1.13.91 as of Aug 16 2018

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3229 as of May 14 2019, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (70 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software