Philippe Duchon

According to our database1, Philippe Duchon authored at least 27 papers between 1998 and 2018.

Collaborative distances:



In proceedings 
PhD thesis 




On Order Types of Random Point Sets.
CoRR, 2018

On the Biased Partial Word Collector Problem.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

On the Expected Number of Distinct Gapped Palindromic Factors.
Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

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

Preserving the Number of Cycles of Length k in a Growing Uniform Permutation.
Electron. J. Comb., 2016

Local Update Algorithms for Random Graphs.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Half-turn symmetric FPLs with rare couplings and tilings of hexagons.
Theor. Comput. Sci., 2013

Approximation algorithms for energy minimization in Cloud service allocation under reliability constraints.
Proceedings of the 20th Annual International Conference on High Performance Computing, 2013

Asymptotic Analysis and Random Sampling of Digitally Convex Polyominoes.
Proceedings of the Discrete Geometry for Computer Imagery, 2013

Random generation of combinatorial structures: Boltzmann samplers and beyond.
Proceedings of the Winter Simulation Conference 2011, 2011

Use of Internet Embedding Tools for Heterogeneous Resources Aggregation.
Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

Enumeration of Alternating Sign Matrices of Even Size (Quasi-)Invariant under a Quarter-Turn Rotation.
Electron. J. Comb., 2010

On the Search Path Length of Random Binary Skip Graphs.
Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics, 2010

Distributed Approximation Algorithm for Resource Clustering.
Proceedings of the Structural Information and Communication Complexity, 2008

A Distributed Algorithm for Resource Clustering in Large Scale Platforms.
Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008

Heterogenous dating service with application to rumor spreading.
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).
, 2008

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

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

Broadcast in the rendezvous model.
Inf. Comput., 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

Boltzmann Samplers for the Random Generation of Combinatorial Structures.
Comb. Probab. Comput., 2004

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

Random Sampling from Boltzmann Principles.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

On the enumeration and generation of generalized Dyck words.
Discret. Math., 2000

Right-cancellability of a family of operations on binary trees.
Discret. Math. Theor. Comput. Sci., 1998