Skip to Main content Skip to Navigation


...
inria-00475863v1  Conference papers
Nicolas HanusseDavid IlcinkasAdrian KosowskiNicolas Nisse. Comment battre la marche aléatoire en comptant ?
12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2010, Belle Dune, France
...
hal-00402218v1  Journal articles
Cyril GavoilleNicolas Hanusse. On Compact Encoding of Pagenumber $k$ Graphs
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2008, 10 (3), pp.23-34
...
hal-02102237v1  Reports
Philippe DuchonNicolas HanusseEmmanuelle LebharNicolas Schabanel. A fully distributed scheme to run a network into a small world
[Research Report] LIP RR-2006-03, Laboratoire de l'informatique du parallélisme. 2006, 2+13p
...
hal-02101877v1  Reports
Philippe DuchonNicolas HanusseEmmanuelle LebharNicolas Schabanel. Could any graph be turned into a small-world?
[Research Report] LIP RR-2004-61, Laboratoire de l'informatique du parallélisme. 2004, 2+7p
...
inria-00476151v1  Conference papers
Nicolas BonichonCyril GavoilleNicolas HanusseDavid IlcinkasLjubomir Perkovic. Comment résumer le plan
12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2010, Belle Dune, France
...
hal-02486218v3  Conference papers
Olivier BeaumontTobias CastanetNicolas HanusseCorentin Travers. Approximation Algorithm for Estimating Distances in Distributed Virtual Environments
Euro-Par 2020 - 26th International European Conference on Parallel and Distributed Computing, Aug 2020, Warsaw / Virtual, Poland. ⟨10.1007/978-3-030-57675-2_23⟩