Nicolas Hanusse
77
Documents
Publications
The negative skycubeInformation Systems, 2020, 88, pp.101443. ⟨10.1016/j.is.2019.101443⟩
Journal articles
hal-02326458v1
|
|
|
|
Disconnected components detection and rooted shortest-path tree maintenance in networksJournal of Parallel and Distributed Computing, 2019, 132, pp.299-309. ⟨10.1016/j.jpdc.2019.05.006⟩
Journal articles
hal-02283167v1
|
Calculer et compresser le skycube négatifRevue des Sciences et Technologies de l'Information - Série ISI : Ingénierie des Systèmes d'Information, 2017
Journal articles
hal-01664248v1
|
|
|
|
Robustness of the Rotor–Router MechanismAlgorithmica, 2017, 78 (3), pp.869-895. ⟨10.1007/s00453-016-0179-y⟩
Journal articles
hal-01416012v1
|
|
|
The impact of dynamic events on the number of errors in networksTheoretical Computer Science, 2016, 627, pp.1-12. ⟨10.1016/j.tcs.2016.02.012⟩
Journal articles
hal-01325664v1
|
Skycube Materialization Using the Topmost Skyline or Functional DependenciesACM Transactions on Database Systems, 2016, 41 (4), pp.1-40. ⟨10.1145/2955092⟩
Journal articles
hal-01407518v1
|
|
Tight Stretch Factors for $L_1$- and $L_\infty$-Delaunay TriangulationsComputational Geometry, 2015, 48, pp.237-250
Journal articles
hal-00964470v1
|
|
Dépendances fonctionnelles et requêtes skyline multidimensionnellesRevue des Sciences et Technologies de l'Information - Série ISI : Ingénierie des Systèmes d'Information, 2015, ISI : Ingénierie des Systèmes d'Information, 20 (5), pp.9-26
Journal articles
hal-01274388v1
|
|
|
|
On Compact Encoding of Pagenumber $k$ GraphsDiscrete Mathematics and Theoretical Computer Science, 2008, Vol. 10 no. 3 (3), pp.23-34. ⟨10.46298/dmtcs.436⟩
Journal articles
hal-00402218v1
|
Memoryless search algorithms in a network with faulty adviceTheoretical Computer Science, 2008, 402 (2-3), pp.190-198
Journal articles
hal-00341468v1
|
|
Broadcast in the rendezvous modelInformation and Computation, 2006, pp.697-712
Journal articles
hal-00307147v1
|
|
Planar graphs, via well-orderly maps and treesGraphs and Combinatorics, 2006, 22 (2), pp.185-202
Journal articles
hal-00159296v1
|
|
Could any graph be turned into a small-world?Theoretical Computer Science, 2006, 355, pp.96--103
Journal articles
hal-00307150v1
|
|
Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and GenerationJournal of Graph Algorithms and Applications, 2005, 9, pp.185--204
Journal articles
hal-00307594v1
|
|
Searching with mobile agents in networks with liarsDiscrete Applied Mathematics, 2004, 137, pp.69--85
Journal articles
hal-00307259v1
|
An Energy Efficient and Scalable Node Architecture for Sensor Network2021 19th IEEE International New Circuits and Systems Conference (NEWCAS), Jun 2021, Toulon, France. pp.1-4, ⟨10.1109/NEWCAS50681.2021.9462760⟩
Conference papers
hal-03327800v1
|
|
|
|
Architecture de Nœud basse Consommation et Intelligent pour des Réseaux de CapteurColloque sur les Objets et systèmes Connectés - COC'2021, IUT d'Aix-Marseille, Mar 2021, MARSEILLE, France
Conference papers
hal-03593064v1
|
|
|
Approximation Algorithm for Estimating Distances in Distributed Virtual EnvironmentsEuro-Par 2020 - 26th International European Conference on Parallel and Distributed Computing, Aug 2020, Warsaw / Virtual, Poland. ⟨10.1007/978-3-030-57675-2_23⟩
Conference papers
hal-02486218v3
|
|
|
Framing Algorithms for Approximate Multicriteria Shortest Paths20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020), Sep 2020, Pisa (virtual), Italy. pp.11:1-11:19, ⟨10.4230/OASIcs.ATMOS.2020.11⟩
Conference papers
hal-03034585v1
|
|
|
Impact de la réplication sur la latence dans les bases de données distribuées et application à CassandraALGOTEL 2017 - 19èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2017, Quiberon, France
Conference papers
hal-01517186v1
|
|
|
Algorithme distribué d'orientation de graphes dans un environnement asynchrone et avec pannesALGOTEL 2017 - 19èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2017, Quiberon, France
Conference papers
hal-01517177v1
|
|
|
HeatPipe: High Throughput, Low Latency Big Data Heatmap with Spark StreamingIV2017 - 21st International Conference on Information Visualisation, Jul 2017, Londres, United Kingdom
Conference papers
hal-01516888v1
|
Computing and Summarizing the Negative SkycubeCIKM (Int. Conference on Information and Knowledge Management), Oct 2016, Indianapolis, United States. pp.1-10
Conference papers
hal-01347960v1
|
|
Using Histograms for Skyline Size Estimation 20th International Database Engineering & Applications Symposium (IDEAS'16), Jul 2016, Montreal, Canada
Conference papers
hal-01316242v1
|
|
|
|
Router dans Internet avec quinze entréesALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2015, Beaune, France
Conference papers
hal-01149335v2
|
Approches basées sur la distribution pour l’estimation de la taille du skylineBDA: Bases de données Avancées, 2015, Ile de Proquerolles, France
Conference papers
hal-01274393v1
|
|
|
|
Brief Announcement: Routing the Internet with very few entriesPODC 2015, Jul 2015, Donostia-San Sebastián, Spain. pp.33-35, ⟨10.1145/2767386.2767449⟩
Conference papers
hal-01195778v1
|
|
|
Large Interactive Visualization of Density Functions on Big Data Infrastructure5th IEEE Symposium on Large Data Analysis and Visualization, IEEE, Oct 2015, Chicago, United States
Conference papers
hal-01188721v1
|
|
|
Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in NetworksProceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2014), Sep 2014, Paderborn, Germany. pp.120 - 134, ⟨10.1007/978-3-319-11764-5_9⟩
Conference papers
hal-01111188v1
|
Les Dépendances Fonctionnelles pour l’Optimisation des Requêtes Skyline Multi-dimensionnelleBDA: Bases de Données Avancées, 2014, Autrans, France
Conference papers
hal-01274391v1
|
|
|
|
Impact de la dynamique sur la fiabilité d'informations de routageALGOTEL 2014 -- 16èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2014, Le Bois-Plage-en-Ré, France. pp.1-4
Conference papers
hal-00985637v1
|
Parallel Mining of DependenciesThe 2014 International Conference on High Performance Computing & Simulation (HPCS 2014, Jul 2014, Bologne, Italy. pp.1-8
Conference papers
hal-01010968v1
|
|
|
|
Algorithme distribué de routage compact en temps optimal15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), May 2013, Pornic, France. pp.117-120
Conference papers
hal-00818445v2
|
|
|
On the Communication Complexity of Distributed Name-Independent Routing SchemesDISC 2013, Oct 2013, Jérusalem, Israel. pp.418-432
Conference papers
hal-00851217v1
|
Calcul parallèle de dépendancesBases de Données Avancées, Oct 2013, Nantes, France. pp.1-20
Conference papers
hal-00940779v1
|
|
The Stretch Factor of ${L}_1$- and ${L}_\infty$-{D}elaunay Triangulations20th Annual European Symposium on Algorithms (ESA), Sep 2012, Ljubljana, Slovenia. pp.205-216
Conference papers
hal-00725844v1
|
|
Revisiting the Partial Data Cube MaterializationConference on Advances in Data Bases and Information Systems (ADBIS), Sep 2011, Vienne, Austria. pp.70-83
Conference papers
hal-00644526v1
|
|
|
|
On Power-Law Distributed Balls in Bins and its Applications to View Size EstimationISAAC, Dec 2011, Yokohama, Japan
Conference papers
inria-00618785v1
|
A parallel Algorithm for Computing BordersInternational Conference on Information and Knowledge Managment (CIKM), Oct 2011, Glasgow, United Kingdom. pp.1639-1648
Conference papers
hal-00644517v1
|
|
|
|
The Impact of Edge Deletions on the Number of Errors in NetworksOPODIS 2011, Dec 2011, Toulouse, France. pp.378-391, ⟨10.1007/978-3-642-25873-2_26⟩
Conference papers
hal-00652051v1
|
|
|
Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal SurfacesWG 2010, Jun 2010, Greece. pp.266--278, ⟨10.1007/978-3-642-16926-7_25⟩
Conference papers
hal-00536710v1
|
Plane Spanners of Maximum Degree SixICALP, 2010, France. pp.19-30, ⟨10.1007/978-3-642-14165-2_3⟩
Conference papers
hal-00534212v1
|
|
|
|
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
Conference papers
inria-00475863v1
|
|
|
Locating a Target with an Agent Guided by Unreliable Local AdvicePODC 2010, Jul 2010, Zurich, Switzerland. pp.355-364, ⟨10.1145/1835698.1835781⟩
Conference papers
hal-00516695v1
|
|
|
Comment résumer le plan12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2010, Belle Dune, France
Conference papers
inria-00476151v1
|
Un algorithme parallèle pour l'extraction des borduresBDA'10 : Actes des 26èmes Journées Bases de Données Avancées, Oct 2010, France. 11 p
Conference papers
hal-00548847v1
|
|
|
|
Algorithme distribué pour l'extraction des fréquents maximauxAlgotel, 2009, Carry-Le-Rouet, France
Conference papers
inria-00385104v1
|
Matérialisation Partielle des Cubes de Données25èmes journées "Bases de Données Avancées" BDA'09, Oct 2009, Namur, Belgique. pp.1-20
Conference papers
hal-00403358v1
|
|
A view selection algorithm with performance guaranteeInternational Conference on Extending Database Technology, 2009, St Petersburg, Russia. pp.électronique
Conference papers
hal-00341475v1
|
|
Algorithmes pour la sélection de vues à matérialiser avec garantie de performance5è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
Conference papers
hal-00375595v1
|
|
|
|
Euler Tour Lock-in Problem in the Rotor-Router ModelDISC 2009, Sep 2009, Spain. pp.421--433
Conference papers
hal-00402749v1
|
Content-based image retrieval using greedy routingElectronic Imaging - Multimedia Content Access Track, 2008, San José, United States. pp.68200I1-6820I11
Conference papers
hal-00307538v1
|
|
|
|
Non-Searchability of Random Scale-Free Graphs9ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2007, Ile d'Oléron, France. pp.27-30
Conference papers
inria-00176940v1
|
Non-searchability of random power-law graphs11th International Conference On Principles Of Distributed Systems (OPODIS 2007), 2007, Unknown, France. pp.274--285
Conference papers
hal-00307148v1
|
|
Non-searchability of random scale-free graphsPODC'2007, 2007, France. pp.380-381, ⟨10.1145/1281100.1281183⟩
Conference papers
hal-00341490v1
|
|
A Deterministic Multidimensional Scaling Algorithm for Data VisualizationIEEE IV2006 - International Conference on Information Visualization, Jul 2006, Japan. pp.511-520
Conference papers
hal-00307537v1
|
|
Towards Small World EmergenceSPAA2006 - 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Jul 2006, United States. pp.225-232
Conference papers
hal-00307149v1
|
|
Could any graph be turned into a small world ?International Symposium on Distributed Computing (DISC), 2005, France. pp.511-513
Conference papers
hal-00307531v1
|
|
Could any graph be turned into a small-world ?Actes d'AlgoTel'2005 (conférence francophone sur les algorithmes de communications), May 2005, France. pp.511-513
Conference papers
hal-00307532v1
|
|
Broadcast in the Rendezvous ModelProceedings of STACS 2004, 2004, France. pp.559--570
Conference papers
hal-00307528v1
|
|
Protocoles auto-stabilisants synchrones d'exclusion mutuelle pour les anneaux anonymes et uniformesActes d'AlgoTel 2004, May 2004, France. pp.135--140
Conference papers
hal-00307529v1
|
|
Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous RingsProceedings of DISC'2004, Oct 2004, Netherlands. pp.216--229
Conference papers
hal-00307527v1
|
|
Planar Graphs, via Well-Orderly Maps and Trees$30^{th}$ International Workshop, Graph - Theoretic Concepts in Computer Science (WG), 2004, Germany. pp.270-284
Conference papers
hal-00307603v1
|
|
Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation$29^{th}$ International Workshop, Graph - Theoretic Concepts in Computer Science (WG), 2003, Netherlands. pp.81-92
Conference papers
hal-00307598v1
|
|
An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation$20^{th}$ Annual Symposium on Theoretical Aspects of Computer Science (STACS), 2003, Germany. pp.499-510
Conference papers
hal-00307599v1
|
|
Memoryless Search Algorithm in Networks with Faulty AdviceIFIP-WCC'2002 (World Computer Congress); Track - International Conference on Theoretical Computer Science, 2002, Canada. pp.206-216
Conference papers
hal-00307260v1
|
An Information-Theoretic Upper Bound on Planar Graphs Using Well-Orderly MapsDehmer, 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
Book sections
hal-00649898v1
|
The Stretch Factor of ${L}_1$- and ${L}_\infty$-{D}elaunay Triangulations2012
Other publications
hal-00725842v1
|
|
Simulations de routage du schéma AGMaNT2011
Other publications
hal-00998994v1
|
|
Planar Graphs, via Well-Orderly Maps and Trees2004
Other publications
hal-00400503v1
|
|
|
Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces2010
Preprints, Working Papers, ...
hal-00454565v1
|
|
|
Disconnected components detection and rooted shortest-path tree maintenance in networks - extended version[Research Report] LaBRI, CNRS UMR 5800. 2016
Reports
hal-01352245v1
|
|
|
The Stretch Factor of $L_1$- and $L_\infty$-Delaunay Triangulations2012
Reports
hal-00673187v2
|
|
|
How to beat the random walk when you have a clock?[Research Report] RR-7210, INRIA. 2010, pp.19
Reports
inria-00458808v1
|
|
|
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
Reports
hal-02102237v1
|
|
|
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
Reports
hal-02101877v1
|
|
|
Navigation dans les grands graphesAlgorithme et structure de données [cs.DS]. Université Sciences et Technologies - Bordeaux I, 2009
Habilitation à diriger des recherches
tel-00717765v1
|