default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJim Pitman
Person information
- affiliation: University of California, Berkeley, Departments of Statistics and Mathematics
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Yassine El Maazouz
, Jim Pitman:
The Bernoulli clock: probabilistic and combinatorial interpretations of the Bernoulli polynomials by circular convolution. Comb. Probab. Comput. 33(2): 210-237 (2024)
2010 – 2019
- 2014
- [c3]Bela Gipp, Norman Meuschke, Corinna Breitinger, Jim Pitman, Andreas Nürnberger:
Web-based Demonstration of Semantic Similarity Detection Using Citation Pattern Visualization for a Cross Language Plagiarism Case. ICEIS (2) 2014: 677-683 - 2011
- [j16]Josh Abramson, Jim Pitman:
Concave Majorants of Random Walks and Related Poisson Processes. Comb. Probab. Comput. 20(5): 651-682 (2011) - [j15]Richard Jones, Mark MacGillivray, Peter Murray-Rust, Jim Pitman, Peter Sefton, Ben O'Steen, William Waites:
Open Bibliography for Science, Technology, and Medicine. J. Cheminformatics 3: 47 (2011) - [c2]Jöran Beel, Bela Gipp, Stefan Langer, Marcel Genzmehr, Erik Wilde, Andreas Nürnberger, Jim Pitman:
Introducing Mr. DLib, : a machine-readable digital library. JCDL 2011: 463-464
2000 – 2009
- 2008
- [j14]Jomy Alappattu, Jim Pitman:
Coloured Loop-Erased Random Walk on the Complete Graph. Comb. Probab. Comput. 17(6): 727-740 (2008) - 2007
- [j13]Alexander V. Gnedin, Jim Pitman:
Poisson Representation of a Ewens Fragmentation Process. Comb. Probab. Comput. 16(6): 819-827 (2007) - 2005
- [j12]Alexander V. Gnedin, Jim Pitman:
Regenerative Partition Structures. Electron. J. Comb. 11(2) (2005) - 2002
- [j11]Jim Pitman:
Poisson-Dirichlet And Gem Invariant Distributions For Split-And-Merge Transformations Of An Interval Partition. Comb. Probab. Comput. 11(5): 501-514 (2002) - [j10]Richard P. Stanley, Jim Pitman:
A Polytope Related to Empirical Distributions, Plane Trees, Parking Functions, and the Associahedron. Discret. Comput. Geom. 27(4): 603-602 (2002) - [j9]Jim Pitman:
Forest Volume Decompositions and Abel - Cayley - Hurwitz Multinomial Expansions. J. Comb. Theory A 98(1): 175-191 (2002) - 2001
- [j8]Jürgen Bennies, Jim Pitman:
Asymptotics of the Hurwitz Binomial Distribution Related to Mixed Poisson Galton-Watson Trees. Comb. Probab. Comput. 10(3): 203-211 (2001)
1990 – 1999
- 1999
- [j7]Jim Pitman:
escent Random Forests. J. Comb. Theory A 85(2): 165-193 (1999) - [j6]David J. Aldous, Jim Pitman:
A family of random trees with random edge lengths. Random Struct. Algorithms 15(2): 176-195 (1999) - 1997
- [j5]Jim Pitman:
Probabilistic Bounds on the Coefficients of Polynomials with Only Real Zeros. J. Comb. Theory A 77(2): 279-303 (1997) - [c1]Jim Pitman:
Enumerations of trees and forests related to branching processes and random walks. Microsurveys in Discrete Probability 1997: 163-180 - 1995
- [j4]Persi Diaconis, Michael McGrath, Jim Pitman:
Riffle Shuffles, Cycles, and Descents. Comb. 15(1): 11-29 (1995) - 1994
- [j3]David J. Aldous, Jim Pitman:
Brownian Bridge Asymptotics for Random Mappings. Random Struct. Algorithms 5(4): 487-512 (1994) - 1993
- [j2]Jim Pitman:
Continuous Martingales and Brownian Motion (Daniel Revuz and Mare Yor). SIAM Rev. 35(3): 532-533 (1993) - 1992
- [j1]Persi Diaconis, James Allen Fill, Jim Pitman:
Analysis of Top To Random Shuffles. Comb. Probab. Comput. 1: 135-155 (1992)
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-10-07 22:23 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:
