Skip to Main content Skip to Navigation


hal-00940779v1  Conference papers
Eve GarnaudNicolas HanusseSofian MaaboutNoël Novelli. Calcul parallèle de dépendances
Bases de Données Avancées, Oct 2013, Nantes, France. pp.1-20
hal-00644517v1  Conference papers
Nicolas HanusseSofian Maabout. A parallel Algorithm for Computing Borders
International Conference on Information and Knowledge Managment (CIKM), Oct 2011, Glasgow, United Kingdom. pp.1639-1648
hal-00548847v1  Conference papers
Nicolas HanusseSofian Maabout. Un algorithme parallèle pour l'extraction des bordures
BDA'10 : Actes des 26èmes Journées Bases de Données Avancées, Oct 2010, France. 11 p
hal-00375595v1  Conference papers
Nicolas HanusseSofian MaaboutRadu Tofan. Algorithmes pour la sélection de vues à matérialiser avec garantie de performance
5ème journées francophones sur les entrepôts de données et l'analyse en ligne (EDA'09), Jun 2009, Montpellier, France. pp.1-15
...
hal-00985637v1  Conference papers
Christian GlacetNicolas HanusseDavid Ilcinkas. Impact de la dynamique sur la fiabilité d'informations de routage
ALGOTEL 2014 -- 16èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2014, Le Bois-Plage-en-Ré, France. pp.1-4
...
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
...
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-00649898v1  Book sections
Nicolas BonichonCyril GavoilleNicolas Hanusse. An Information-Theoretic Upper Bound on Planar Graphs Using Well-Orderly Maps
Dehmer, Matthias and Emmert-Streib, Frank and Mehler, Alexander. Towards an Information Theory of Complex Networks, Birkhäuser Boston, pp.17-46, 2011, 978-0-8176-4904-3
hal-00644526v1  Conference papers
Nicolas HanusseSofian MaaboutRadu Tofan. Revisiting the Partial Data Cube Materialization
Conference on Advances in Data Bases and Information Systems (ADBIS), Sep 2011, Vienne, Austria. pp.70-83
...
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-00307538v1  Conference papers
A. DonNicolas Hanusse. Content-based image retrieval using greedy routing
Electronic Imaging - Multimedia Content Access Track, 2008, San José, United States. pp.68200I1-6820I11
hal-00307148v1  Conference papers
Philippe DuchonNicole EggemannNicolas Hanusse. Non-searchability of random power-law graphs
11th International Conference On Principles Of Distributed Systems (OPODIS 2007), 2007, France. pp.274--285
hal-00341468v1  Journal articles
Nicolas HanusseDimitris KavvadiasEvangelos KranakisDanny Krizanc. Memoryless search algorithms in a network with faulty advice
Theoretical Computer Science, Elsevier, 2008, 402 (2-3), pp.190-198
hal-00341475v1  Conference papers
Nicolas HanusseSofian MaaboutRadu Tofan. A view selection algorithm with performance guarantee
International Conference on Extending Database Technology, 2009, St Petersburg, Russia. pp.électronique
...
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⟩
...
hal-00818445v2  Conference papers
Cyril GavoilleChristian GlacetNicolas HanusseDavid Ilcinkas. Algorithme distribué de routage compact en temps optimal
15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), May 2013, Pornic, France. pp.117-120
hal-00725844v1  Conference papers
Nicolas BonichonCyril GavoilleNicolas HanusseLjubomir Perkovic. The Stretch Factor of ${L}_1$- and ${L}_\infty$-{D}elaunay Triangulations
20th Annual European Symposium on Algorithms (ESA), Sep 2012, Ljubljana, Slovenia. pp.205-216
hal-00307150v1  Journal articles
Philippe DuchonNicolas HanusseEmmanuelle LebharNicolas Schabanel. Could any graph be turned into a small-world?
Theoretical Computer Science, Elsevier, 2006, 355, pp.96--103
hal-00307149v1  Conference papers
Philippe DuchonNicolas HanusseEmmanuelle LebharNicolas Schabanel. Towards Small World Emergence
SPAA2006 - 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Jul 2006, United States. pp.225-232