default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZakhar Kabluchko
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j15]Zakhar Kabluchko, David Albert Steigenberger:
r-Lah distribution: Properties, limit theorems and an application to compressed sensing. Adv. Appl. Math. 150: 102575 (2023)- [j14]Zakhar Kabluchko
:
An Identity for the Coefficients of Characteristic Polynomials of Hyperplane Arrangements. Discret. Comput. Geom. 70(4): 1476-1498 (2023) - [j13]Jeremy G. Hoskins, Zakhar Kabluchko:
Dynamics of Zeroes Under Repeated Differentiation. Exp. Math. 32(4): 573-599 (2023) - 2022
- [j12]Thomas Godland, Zakhar Kabluchko:
Angle Sums of Schläfli Orthoschemes. Discret. Comput. Geom. 68(1): 125-164 (2022) - [j11]Anastas Baci, Zakhar Kabluchko, Joscha Prochno, Mathias Sonnleitner, Christoph Thäle:
Limit theorems for random points in a simplex. J. Appl. Probab. 59(3): 685-701 (2022) - 2021
- [j10]Zakhar Kabluchko:
Recursive Scheme for Angles of Random Simplices, and Applications to Random Polytopes. Discret. Comput. Geom. 66(3): 902-937 (2021) - [j9]Zakhar Kabluchko, Christoph Thäle:
The Typical Cell of a Voronoi Tessellation on the Sphere. Discret. Comput. Geom. 66(4): 1330-1350 (2021) - [j8]Gilles Bonnet, Zakhar Kabluchko, Nicola Turchi:
Phase transition for the volume of high-dimensional random polytopes. Random Struct. Algorithms 58(4): 648-663 (2021) - 2020
- [j7]Zakhar Kabluchko, Joscha Prochno, Christoph Thäle:
Exact asymptotic volume and volume ratio of Schatten unit balls. J. Approx. Theory 257: 105457 (2020)
2010 – 2019
- 2018
- [j6]Alexander Iksanov, Zakhar Kabluchko:
Weak convergence of the number of vertices at intermediate levels of random recursive trees. J. Appl. Probab. 55(4): 1131-1142 (2018) - 2017
- [j5]Zakhar Kabluchko, Günter Last, Dmitry Zaporozhets:
Inclusion-Exclusion Principles for Convex Hulls and the Euler Relation. Discret. Comput. Geom. 58(2): 417-434 (2017) - 2016
- [j4]Alexander Iksanov, Zakhar Kabluchko:
A central limit theorem and a law of the iterated logarithm for the Biggins martingale of the supercritical branching random walk. J. Appl. Probab. 53(4): 1178-1192 (2016) - [j3]Zakhar Kabluchko, Alexander Marynych, Henning Sulzbach:
Mode and Edgeworth Expansion for the Ewens Distribution and the Stirling Numbers. J. Integer Seq. 19(8): 16.8.8 (2016) - 2012
- [j2]Thomas Hotz, Philipp Marnitz, Rahel Stichtenoth, Laurie Davies, Zakhar Kabluchko, Axel Munk:
Locally adaptive image denoising by a statistical multiresolution criterion. Comput. Stat. Data Anal. 56(3): 543-558 (2012) - [j1]Zakhar Kabluchko:
Persistence and Equilibria of Branching Populations with Exponential Intensity. J. Appl. Probab. 49(1): 226-244 (2012)
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-06-10 21:21 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:
