default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander V. Gnedin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j16]Alexander V. Gnedin, Dudley Stark
:
Random permutations and queues. Adv. Appl. Math. 149: 102549 (2023)- 2020
- [c1]Alexander V. Gnedin, Amirlan Seksenbayev:
Diffusion Limits in the Online Subsequence Selection Problems. AofA 2020: 14:1-14:15
2010 – 2019
- 2019
- [j15]Alexander V. Gnedin, Vadim Gorin:
Spherically symmetric random permutations. Random Struct. Algorithms 55(2): 342-355 (2019) - 2015
- [j14]Alexander V. Gnedin, Vadim Gorin:
Record-dependent measures on the symmetric groups. Random Struct. Algorithms 46(4): 688-706 (2015) - 2014
- [j13]Alexander V. Gnedin, Alexander Iksanov, Alexander Marynych:
Λ-coalescents: a survey. J. Appl. Probab. 51(A): 23-40 (2014) - 2012
- [j12]Alexander V. Gnedin, Grigori Olshanski:
The two-sided infinite extension of the Mallows model for random permutations. Adv. Appl. Math. 48(5): 615-639 (2012) - [j11]Alexander V. Gnedin, Alexander Iksanov, Alexander Marynych:
A Generalization of the Erdős-Turán Law for the Order of Random Permutation. Comb. Probab. Comput. 21(5): 715-733 (2012) - 2011
- [j10]Alexander V. Gnedin:
Coherent random permutations with biased record statistics. Discret. Math. 311(1): 80-91 (2011) - [i4]Alexander V. Gnedin:
The Monty Hall Problem: Switching is Forced by the Strategic Thinking. CoRR abs/1103.3890 (2011) - [i3]Alexander V. Gnedin:
Dominance in the Monty Hall Problem. CoRR abs/1106.0833 (2011) - [i2]Alexander V. Gnedin:
The Monty Hall Problem in the Game Theory Class. CoRR abs/1107.0326 (2011) - [i1]Alexander V. Gnedin:
The Unlucky Door. CoRR abs/1107.0848 (2011)
2000 – 2009
- 2009
- [j9]Alexander V. Gnedin, Grigori Olshanski:
A q-Analogue of de Finetti's Theorem. Electron. J. Comb. 16(1) (2009) - 2008
- [j8]Leonid V. Bogachev, Alexander V. Gnedin, Yuri V. Yakubovich:
On the variance of the number of occupied boxes. Adv. Appl. Math. 40(4): 401-432 (2008) - 2007
- [j7]Alexander V. Gnedin, Jim Pitman:
Poisson Representation of a Ewens Fragmentation Process. Comb. Probab. Comput. 16(6): 819-827 (2007) - 2005
- [j6]Alexander V. Gnedin, Jim Pitman:
Regenerative Partition Structures. Electron. J. Comb. 11(2) (2005) - 2004
- [j5]Alexander V. Gnedin:
Three Sampling Formulas. Comb. Probab. Comput. 13(2): 185-193 (2004) - 2002
- [j4]Alexander V. Gnedin, Sergei V. Kerov:
Fibonacci solitaire. Random Struct. Algorithms 20(1): 71-88 (2002) - 2001
- [j3]Alexander V. Gnedin, Sergei V. Kerov:
A Characterization of GEM Distributions. Comb. Probab. Comput. 10(3): 213-217 (2001) - 2000
- [j2]Alexander V. Gnedin:
A Note On Sequential Selection From Permutations. Comb. Probab. Comput. 9(1): 13-17 (2000)
1980 – 1989
- 1986
- [j1]Boris A. Berezovskiy, Yuliy M. Baryshnikov, Alexander V. Gnedin:
On a class of best-choice problems. Inf. Sci. 39(1): 111-127 (1986)
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-24 22:49 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:
