Facets (new session)
Description
Metadata
Settings
owl:sameAs
Inference Rule:
b3s
b3sifp
facets
http://www.w3.org/2002/07/owl#
ldp
oplweb
skos-trans
virtrdf-label
None
About:
Julien Sopena
Goto
Sponge
NotDistinct
Permalink
An Entity of Type :
foaf:Person
, within Data Space :
data.idref.fr
associated with source
document(s)
Type:
Person
New Facet based on Instances of this Class
Attributes
Values
type
Person
sameAs
Sopena, Julien (1976-.... ; chercheur en informatique)
Sopena, Julien (1976-.... ; chercheur en informatique)
Sopena, Julien (1976-.... ; chercheur en informatique)
Sopena, Julien (1976-.... ; chercheur en informatique)
Sopena, Julien (1976-.... ; chercheur en informatique)
Life Event
http://www.idref.fr/139161465/birth
preferred label
Sopena, Julien (1976-.... ; chercheur en informatique)
name
Julien Sopena
dbpedia-owl:citizenship
http://sws.geonames.org/3017382/
Language
http://lexvo.org/id/iso639-3/fra
isni:identifierValid
0000000358888252
Given name
Julien
familyName
Sopena
note
Maître de Conférences au sein de Sorbonne Université, membre de l'équipe \"DistributEd aLgorithms and sYstems\" (DELYS) du laboratoire LIP6 (UMR CNRS 7606)
Titulaire d'un doctorat en Informatique (Paris 6, 2008)
gender
male
ORCID iD
0009-0006-6597-0704
Scopus ID
8844068200
is
sameAs
of
Sopena, Julien (1976-.... ; chercheur en informatique)
Sopena, Julien (1976-.... ; chercheur en informatique)
is
Thesis advisor
of
http://www.sudoc.fr/272803979/id
is
Author
of
http://www.sudoc.fr/139161147/id
Community and LBD-Based Clause Sharing Policy for Parallel SAT Solving
Improving Prediction Accuracy of Memory Interferences for Multicore Platforms
Towards Proving Optimistic Multicore Schedulers
Provable Multicore Schedulers with Ipanema: Application to Work Conservation
MERCi-MIsS: Should I Turn off My Servers?
Reducing synchronization cost in distributed multi-resource allocation problem
Fork/Wait and Multicore Frequency Scaling: a Generational Clash
Modular and Efficient Divide-and-Conquer SAT Solver on Top of the Painless Framework
PaInleSS: a Framework for Parallel SAT Solving
Un nouvel algorithme efficace de Split & Merge pour