Philippe Duchon

According to our database, Philippe Duchon authored at least 30 papers between 1998 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Random DFA With One Added Transition.

Arnaud Carayol, Philippe Duchon, Florent Koechlin, Cyril Nicaud

CoRR, 2024

2023

One Drop of Non-Determinism in a Random Deterministic Automaton.

Arnaud Carayol, Philippe Duchon, Florent Koechlin, Cyril Nicaud

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

2022

Symmetric Block-Cyclic Distribution: Fewer Communications Leads to Faster Dense Cholesky Factorization.

Olivier Beaumont, Philippe Duchon, Lionel Eyraud-Dubois, Julien Langou, Mathieu Vérité

Proceedings of the SC22: International Conference for High Performance Computing, 2022

2018

On Order Types of Random Point Sets.

Olivier Devillers, Philippe Duchon, Marc Glisse, Xavier Goaoc

CoRR, 2018

On the Biased Partial Word Collector Problem.

Philippe Duchon, Cyril Nicaud

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

On the Expected Number of Distinct Gapped Palindromic Factors.

Philippe Duchon, Cyril Nicaud

Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

2017

Gapped Pattern Statistics.

Philippe Duchon, Cyril Nicaud, Carine Pivoteau

Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

2016

Preserving the Number of Cycles of Length k in a Growing Uniform Permutation.

Philippe Duchon, Romaric Duvignau

Electron. J. Comb., 2016

2014

Local Update Algorithms for Random Graphs.

Philippe Duchon, Romaric Duvignau

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

2013

Half-turn symmetric FPLs with rare couplings and tilings of hexagons.

Jean-Christophe Aval, Philippe Duchon

Theor. Comput. Sci., 2013

Approximation algorithms for energy minimization in Cloud service allocation under reliability constraints.

Olivier Beaumont, Philippe Duchon, Paul Renaud-Goud

Proceedings of the 20th Annual International Conference on High Performance Computing, 2013

Asymptotic Analysis and Random Sampling of Digitally Convex Polyominoes.

Olivier Bodini, Philippe Duchon, Alice Jacquot, Ljuben R. Mutafchiev

Proceedings of the Discrete Geometry for Computer Imagery, 2013

2011

Random generation of combinatorial structures: Boltzmann samplers and beyond.

Philippe Duchon

Proceedings of the Winter Simulation Conference 2011, 2011

Use of Internet Embedding Tools for Heterogeneous Resources Aggregation.

Olivier Beaumont, Nicolas Bonichon, Philippe Duchon, Hubert Larchevêque

Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

2010

Enumeration of Alternating Sign Matrices of Even Size (Quasi-)Invariant under a Quarter-Turn Rotation.

Jean-Christophe Aval, Philippe Duchon

Electron. J. Comb., 2010

On the Search Path Length of Random Binary Skip Graphs.

Philippe Duchon, Hubert Larchevêque

Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics, 2010

2008

Distributed Approximation Algorithm for Resource Clustering.

Olivier Beaumont, Nicolas Bonichon, Philippe Duchon, Hubert Larchevêque

Proceedings of the Structural Information and Communication Complexity, 2008

A Distributed Algorithm for Resource Clustering in Large Scale Platforms.

Olivier Beaumont, Nicolas Bonichon, Philippe Duchon, Lionel Eyraud-Dubois, Hubert Larchevêque

Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008

Heterogenous dating service with application to rumor spreading.

Olivier Beaumont, Philippe Duchon, Miroslaw Korzeniowski

Proceedings of the 22nd IEEE International Symposium on Parallel and Distributed Processing, 2008

Combinatoire des configurations de boucles compactes. (Combinatorics of fully-packed loop configurations).

Philippe Duchon

, 2008

2007

Non-searchability of random scale-free graphs.

Philippe Duchon, Nicole Eggemann, Nicolas Hanusse

Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Non-Searchability of Random Power-Law Graphs.

Philippe Duchon, Nicole Eggemann, Nicolas Hanusse

Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007

2006

Could any graph be turned into a small-world?

Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel

Theor. Comput. Sci., 2006

Broadcast in the rendezvous model.

Philippe Duchon, Nicolas Hanusse, Nasser Saheb, Akka Zemmari

Inf. Comput., 2006

Towards small world emergence.

Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel

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

2004

Boltzmann Samplers for the Random Generation of Combinatorial Structures.

Philippe Duchon, Philippe Flajolet, Guy Louchard, Gilles Schaeffer

Comb. Probab. Comput., 2004

Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous Rings.

Philippe Duchon, Nicolas Hanusse, Sébastien Tixeuil

Proceedings of the Distributed Computing, 18th International Conference, 2004

2002

Random Sampling from Boltzmann Principles.

Philippe Duchon, Philippe Flajolet, Guy Louchard, Gilles Schaeffer

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2000

On the enumeration and generation of generalized Dyck words.

Philippe Duchon

Discret. Math., 2000

1998

Right-cancellability of a family of operations on binary trees.

Philippe Duchon

Discret. Math. Theor. Comput. Sci., 1998