default search action
Philippe Duchon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i5]Arnaud Carayol, Philippe Duchon, Florent Koechlin, Cyril Nicaud:
Random DFA With One Added Transition. CoRR abs/2402.06591 (2024) - 2023
- [c21]Arnaud Carayol, Philippe Duchon, Florent Koechlin, Cyril Nicaud:
One Drop of Non-Determinism in a Random Deterministic Automaton. STACS 2023: 19:1-19:14 - 2022
- [c20]Olivier Beaumont, Philippe Duchon, Lionel Eyraud-Dubois, Julien Langou
, Mathieu Vérité:
Symmetric Block-Cyclic Distribution: Fewer Communications Leads to Faster Dense Cholesky Factorization. SC 2022: 29:1-29:15
2010 – 2019
- 2018
- [c19]Philippe Duchon, Cyril Nicaud:
On the Expected Number of Distinct Gapped Palindromic Factors. IWOCA 2018: 165-176 - [c18]Philippe Duchon, Cyril Nicaud:
On the Biased Partial Word Collector Problem. LATIN 2018: 413-426 - [i4]Olivier Devillers, Philippe Duchon, Marc Glisse, Xavier Goaoc:
On Order Types of Random Point Sets. CoRR abs/1812.08525 (2018) - 2017
- [c17]Philippe Duchon, Cyril Nicaud, Carine Pivoteau:
Gapped Pattern Statistics. CPM 2017: 21:1-21:12 - 2016
- [j8]Philippe Duchon, Romaric Duvignau
Preserving the Number of Cycles of Length k in a Growing Uniform Permutation. Electron. J. Comb. 23(4): 4 (2016) - 2014
- [c16]Philippe Duchon, Romaric Duvignau
Local Update Algorithms for Random Graphs. LATIN 2014: 367-378 - 2013
- [j7]Jean-Christophe Aval, Philippe Duchon:
Half-turn symmetric FPLs with rare couplings and tilings of hexagons. Theor. Comput. Sci. 502: 143-152 (2013) - [c15]Olivier Bodini, Philippe Duchon, Alice Jacquot, Ljuben R. Mutafchiev:
Asymptotic Analysis and Random Sampling of Digitally Convex Polyominoes. DGCI 2013: 95-106 - [c14]Olivier Beaumont
Approximation algorithms for energy minimization in Cloud service allocation under reliability constraints. HiPC 2013: 295-304 - [i3]Olivier Beaumont, Philippe Duchon, Paul Renaud-Goud:
Approximation Algorithms for Energy Minimization in Cloud Service Allocation under Reliability Constraints. CoRR abs/1302.4414 (2013) - [i2]Olivier Bodini, Alice Jacquot, Philippe Duchon, Ljuben R. Mutafchiev:
Asymptotic Analysis and Random Sampling of Digitally Convex Polyominoes. CoRR abs/1306.2108 (2013) - 2011
- [c13]Olivier Beaumont
Use of Internet Embedding Tools for Heterogeneous Resources Aggregation. IPDPS Workshops 2011: 114-124 - [c12]Philippe Duchon:
Random generation of combinatorial structures: Boltzmann samplers and beyond. WSC 2011: 120-132 - [i1]Philippe Duchon:
Random generation of combinatorial structures: Boltzmann samplers and beyond. CoRR abs/1112.5071 (2011) - 2010
- [j6]Jean-Christophe Aval, Philippe Duchon:
Enumeration of Alternating Sign Matrices of Even Size (Quasi-)Invariant under a Quarter-Turn Rotation. Electron. J. Comb. 17(1) (2010) - [c11]Philippe Duchon, Hubert Larchevêque:
On the Search Path Length of Random Binary Skip Graphs. ANALCO 2010: 1-8
2000 – 2009
- 2008
- [b1]Philippe Duchon:
Combinatoire des configurations de boucles compactes. (Combinatorics of fully-packed loop configurations). University of Bordeaux, France, 2008 - [c10]Olivier Beaumont
Heterogenous dating service with application to rumor spreading. IPDPS 2008: 1-10 - [c9]Olivier Beaumont
A Distributed Algorithm for Resource Clustering in Large Scale Platforms. OPODIS 2008: 564-567 - [c8]Olivier Beaumont
Distributed Approximation Algorithm for Resource Clustering. SIROCCO 2008: 61-73 - 2007
- [c7]Philippe Duchon, Nicole Eggemann, Nicolas Hanusse:
Non-Searchability of Random Power-Law Graphs. OPODIS 2007: 274-285 - [c6]Philippe Duchon, Nicole Eggemann, Nicolas Hanusse:
Non-searchability of random scale-free graphs. PODC 2007: 380-381 - 2006
- [j5]Philippe Duchon, Nicolas Hanusse, Nasser Saheb, Akka Zemmari
Broadcast in the rendezvous model. Inf. Comput. 204(5): 697-712 (2006) - [j4]Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel:
Could any graph be turned into a small-world? Theor. Comput. Sci. 355(1): 96-103 (2006) - [c5]Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel:
Towards small world emergence. SPAA 2006: 225-232 - 2005
- [c4]Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel:
Could any Graph be Turned into a Small-World?. DISC 2005: 511-513 - 2004
- [j3]Philippe Duchon, Philippe Flajolet, Guy Louchard, Gilles Schaeffer:
Boltzmann Samplers for the Random Generation of Combinatorial Structures. Comb. Probab. Comput. 13(4-5): 577-625 (2004) - [c3]Philippe Duchon, Nicolas Hanusse, Nasser Saheb, Akka Zemmari
Broadcast in the Rendezvous Model. STACS 2004: 559-570 - [c2]Philippe Duchon, Nicolas Hanusse, Sébastien Tixeuil:
Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous Rings. DISC 2004: 216-229 - 2002
- [c1]Philippe Duchon, Philippe Flajolet, Guy Louchard, Gilles Schaeffer:
Random Sampling from Boltzmann Principles. ICALP 2002: 501-513 - 2000
- [j2]Philippe Duchon:
On the enumeration and generation of generalized Dyck words. Discret. Math. 225(1-3): 121-135 (2000)
1990 – 1999
- 1998
- [j1]Philippe Duchon:
Right-cancellability of a family of operations on binary trees. Discret. Math. Theor. Comput. Sci. 2(1): 27-33 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: