Nicolas Hanusse

According to our database1, Nicolas Hanusse authored at least 50 papers between 1999 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Freeze-Tag in L<sub>1</sub> has Wake-up Time Five.
CoRR, 2024

2021
An Energy Efficient and Scalable Node Architecture for Sensor Network.
Proceedings of the 19th IEEE International New Circuits and Systems Conference, 2021

2020
The negative skycube.
Inf. Syst., 2020

Approximation Algorithm for Estimating Distances in Distributed Virtual Environments.
Proceedings of the Euro-Par 2020: Parallel Processing, 2020

Framing Algorithms for Approximate Multicriteria Shortest Paths.
Proceedings of the 20th Symposium on Algorithmic Approaches for Transportation Modelling, 2020

2019
Disconnected components detection and rooted shortest-path tree maintenance in networks.
J. Parallel Distributed Comput., 2019

2017
Calculer et compresser le skycube négatif.
Ingénierie des Systèmes d Inf., 2017

Robustness of the Rotor-Router Mechanism.
Algorithmica, 2017

A Fully Asynchronous and Fault Tolerant Distributed Algorithm to Compute a Minimum Graph Orientation.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2017

HeatPipe: High Throughput, Low Latency Big Data Heatmap with Spark Streaming.
Proceedings of the 21st International Conference Information Visualisation, 2017

2016
Skycube Materialization Using the Topmost Skyline or Functional Dependencies.
ACM Trans. Database Syst., 2016

The impact of dynamic events on the number of errors in networks.
Theor. Comput. Sci., 2016

Approches basées sur la distribution pour l'estimation de la taille du skyline.
Ingénierie des Systèmes d Inf., 2016

Using Histograms for Skyline Size Estimation.
Proceedings of the 20th International Database Engineering & Applications Symposium, 2016

Computing and Summarizing the Negative Skycube.
Proceedings of the 25th ACM International Conference on Information and Knowledge Management, 2016

2015
Dépendances fonctionnelles et requêtes skyline multidimensionnelles.
Ingénierie des Systèmes d Inf., 2015

Tight stretch factors for L<sub>1</sub>- and L<sub>∞</sub>-Delaunay triangulations.
Comput. Geom., 2015

Brief Announcement: Routing the Internet with Very Few Entries.
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

Large interactive visualization of density functions on big data infrastructure.
Proceedings of the 5th IEEE Symposium on Large Data Analysis and Visualization, 2015

2014
Parallel mining of dependencies.
Proceedings of the International Conference on High Performance Computing & Simulation, 2014

2013
On the Communication Complexity of Distributed Name-Independent Routing Schemes.
Proceedings of the Distributed Computing - 27th International Symposium, 2013

2012
The Stretch Factor of L<sub>1</sub>- and L<sub>∞</sub>-Delaunay Triangulations
CoRR, 2012

The Stretch Factor of L 1- and L ∞ -Delaunay Triangulations.
Proceedings of the Algorithms - ESA 2012, 2012

2011
The Impact of Edge Deletions on the Number of Errors in Networks.
Proceedings of the Principles of Distributed Systems - 15th International Conference, 2011

On Power-Law Distributed Balls in Bins and Its Applications to View Size Estimation.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

A parallel algorithm for computing borders.
Proceedings of the 20th ACM Conference on Information and Knowledge Management, 2011

Revisiting the Partial Data Cube Materialization.
Proceedings of the Advances in Databases and Information Systems, 2011

An Information-Theoretic Upper Bound on Planar Graphs Using Well-Orderly Maps.
Proceedings of the Towards an Information Theory of Complex Networks, 2011

2010
Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces.
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Locating a target with an agent guided by unreliable local advice: how to beat the random walk when you have a clock?
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Plane Spanners of Maximum Degree Six.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009
Euler Tour Lock-In Problem in the Rotor-Router Model.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

A view selection algorithm with performance guarantee.
Proceedings of the EDBT 2009, 2009

Algorithmes pour la sélection de vues à matérialiser avec garantie de performance.
Proceedings of the Actes des 5èmes journées francophones sur les Entrepôts de Données et l'Analyse en ligne, 2009

Navigation dans les grands graphes.
, 2009

2008
Memoryless search algorithms in a network with faulty advice.
Theor. Comput. Sci., 2008

On Compact Encoding of Pagenumber.
Discret. Math. Theor. Comput. Sci., 2008

2007
Non-searchability of random scale-free graphs.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Non-Searchability of Random Power-Law Graphs.
Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007

2006
Could any graph be turned into a small-world?
Theor. Comput. Sci., 2006

Broadcast in the rendezvous model.
Inf. Comput., 2006

Planar Graphs, via Well-Orderly Maps and Trees.
Graphs Comb., 2006

Towards small world emergence.
Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 2006

A Deterministic Multidimensional Scaling Algorithm for Data Visualisation.
Proceedings of the 10th International Conference on Information Visualisation, 2006

2005
Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation.
J. Graph Algorithms Appl., 2005

2004
Searching with mobile agents in networks with liars.
Discret. Appl. Math., 2004

Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous Rings.
Proceedings of the Distributed Computing, 18th International Conference, 2004

2003
An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation.
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

2000
Flipping your Lid.
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

1999
Compact Routing Tables for Graphs of Bounded Genus.
Proceedings of the Automata, 1999


  Loading...