default search action
Alexander Kolpakov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [i8]Alexander Kolpakov, Aidan Rocke:
Optimality and Renormalization imply Statistical Laws. CoRR abs/2502.16314 (2025) - [i7]Alexander Kolpakov, Igor Rivin:
DiRe-JAX: A JAX based Dimensionality Reduction Algorithm for Large-scale Data. CoRR abs/2503.03156 (2025) - 2024
- [j9]Alexander Kolpakov
, Michael Werman:
Robust affine point matching via quadratic assignment on Grassmannians. Pattern Recognit. Lett. 186: 265-271 (2024) - [c2]Alexander Kolpakov, Igor Rivin:
Discovering temporal and personality aspects in meager and highly variable text samples. NLPIR 2024: 75-81 - [i6]Alexander Kolpakov, Aidan Rocke:
Machine Learning of the Prime Distribution. CoRR abs/2403.12588 (2024) - 2023
- [j8]Nikolay Bogachev, Alexander Kolpakov, Alex Kontorovich:
Kleinian sphere packings, reflection groups, and arithmeticity. Math. Comput. 93(345): 505-521 (2023) - [j7]Alexander Kolpakov
An Approach to Robust ICP Initialization. IEEE Trans. Pattern Anal. Mach. Intell. 45(10): 12685-12691 (2023) - [i5]Alexander Kolpakov, Michael Werman:
Robust affine feature matching via quadratic assignment on Grassmannians. CoRR abs/2303.02698 (2023) - [i4]Alexander Kolpakov, Aidan Rocke:
On the impossibility of discovering a formula for primes using AI. CoRR abs/2308.10817 (2023) - [i3]Alexander Kolpakov, Aidan Rocke:
The Information Geometry of UMAP. CoRR abs/2309.01237 (2023) - [i2]Alexander Kolpakov, Igor Rivin:
A ripple in time: a discontinuity in American history. CoRR abs/2312.01185 (2023) - 2022
- [c1]Liudmila Prokhorenkova, Dmitry Baranchuk, Nikolay Bogachev, Yury Demidovich, Alexander Kolpakov:
Graph-based Nearest Neighbor Search in Hyperbolic Spaces. ICLR 2022 - [i1]Alexander Kolpakov, Michael Werman:
An approach to robust ICP initialization. CoRR abs/2212.05332 (2022) - 2021
- [j6]Maria Dostert
Kissing number in non-Euclidean spaces of constant sectional curvature. Math. Comput. 90(331): 2507-2525 (2021) - 2020
- [j5]Alexander Kolpakov, Alexey L. Talambutsa:
Spherical and geodesic growth rates of right-angled Coxeter and Artin groups are Perron numbers. Discret. Math. 343(3): 111763 (2020) - [j4]Alexander Kolpakov, Sinai Robins:
Spherical tetrahedra with rational volume, and spherical Pythagorean triples. Math. Comput. 89(324): 2031-2046 (2020)
2010 – 2019
- 2019
- [j3]Laura Ciobanu, Alexander Kolpakov
Free subgroups of free products and combinatorial hypermaps. Discret. Math. 342(5): 1415-1433 (2019) - 2018
- [j2]Alexander Kolpakov
Combinatorial Decompositions, Kirillov-Reshetikhin Invariants, and the Volume Conjecture for Hyperbolic Polyhedra. Exp. Math. 27(2): 193-207 (2018) - 2012
- [j1]Alexander Kolpakov
Deformation of finite-volume hyperbolic Coxeter polyhedra, limiting growth rates and Pisot numbers. Eur. J. Comb. 33(8): 1709-1724 (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 2025-04-23 21:08 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: