default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPhilippe Chassaing
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j9]Elahe Zohoorian Azad, Philippe Chassaing:
Asymptotic behavior of some factorizations of random words. Random Struct. Algorithms 61(3): 543-572 (2022)
2010 – 2019
- 2019
- [i4]Anis Amri, Philippe Chassaing:
The impatient collector. CoRR abs/1906.11012 (2019) - 2010
- [i3]Philippe Chassaing, Jean Mairesse:
A non-ergodic PCA with a unique invariant measure. CoRR abs/1009.0143 (2010)
2000 – 2009
- 2009
- [j8]Olivier Bournez
, Philippe Chassaing, Johanne Cohen, Lucas Gerin, Xavier Koegler:
On the convergence of population protocols when population goes to infinity. Appl. Math. Comput. 215(4): 1340-1350 (2009) - [i2]Olivier Bournez, Philippe Chassaing, Johanne Cohen, Lucas Gerin, Xavier Koegler:
On the Convergence of Population Protocols When Population Goes to Infinity. CoRR abs/0907.3118 (2009) - 2004
- [j7]Laurent Alonso, Philippe Chassaing, Florent Gillet, Svante Janson, Edward M. Reingold, René Schott:
Quicksort with Unreliable Comparisons: A Probabilistic Analysis. Comb. Probab. Comput. 13(4-5): 419-449 (2004) - [j6]Laurent Alonso, Philippe Chassaing, Edward M. Reingold, René Schott:
The worst-case chip problem. Inf. Process. Lett. 89(6): 303-308 (2004) - [i1]Philippe Chassaing, Régine Marchand:
Merging costs for the additive Marcus-Lushnikov process, and Union-Find algorithms. CoRR math.PR/0406094 (2004) - 2003
- [j5]Shlomo Zilberstein, François Charpillet, Philippe Chassaing:
Optimal Sequencing of Contract Algorithms. Ann. Math. Artif. Intell. 39(1-2): 1-18 (2003) - 2002
- [j4]Philippe Chassaing, Guy Louchard:
Reflected Brownian Bridge area conditioned on its local time at the origin. J. Algorithms 44(1): 29-51 (2002) - [j3]Philippe Chassaing, Guy Louchard:
Phase transition for Parking blocks, Brownian excursion and coalescence. Random Struct. Algorithms 21(1): 76-119 (2002) - 2001
- [j2]Philippe Chassaing, Jean-François Marckert:
Parking Functions, Empirical Processes, and the Width of Rooted Labeled Trees. Electron. J. Comb. 8(1) (2001)
1990 – 1999
- 1999
- [c1]Shlomo Zilberstein, François Charpillet, Philippe Chassaing:
Real-Time Problem-Solving with Contract Algorithms. IJCAI 1999: 1008-1015 - 1996
- [j1]Laurent Alonso, Philippe Chassaing, René Schott:
The average complexity of a coin-weighing problem. Random Struct. Algorithms 9(1-2): 1-14 (1996)
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 2025-01-09 13:10 CET 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:
