default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOleg R. Musin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j15]Oleg R. Musin
:
Majorization and Minimal Energy on Spheres. SIAM J. Discret. Math. 35(3): 1578-1591 (2021)- 2020
- [i3]Oleg R. Musin:
Majorization and minimal energy on spheres. CoRR abs/2001.04067 (2020)
2010 – 2019
- 2019
- [j14]Oleg R. Musin:
Graphs and spherical two-distance sets. Eur. J. Comb. 80: 311-325 (2019) - 2017
- [j13]Herbert Edelsbrunner, Alexey A. Glazyrin, Oleg R. Musin, Anton V. Nikitenko:
The Voronoi functional is maximized by the Delaunay triangulation in the plane. Comb. 37(5): 887-910 (2017) - 2016
- [j12]Oleg R. Musin, Anton V. Nikitenko:
Optimal Packings of Congruent Circles on a Square Flat Torus. Discret. Comput. Geom. 55(1): 1-20 (2016) - 2015
- [j11]Oleg R. Musin, Alexey S. Tarasov:
The Tammes Problem for N = 14. Exp. Math. 24(4): 460-468 (2015) - [j10]Oleg R. Musin:
Extensions of Sperner and Tucker's lemma for manifolds. J. Comb. Theory A 132: 172-187 (2015) - 2014
- [e1]Alexander Barg, Oleg R. Musin:
Discrete Geometry and Algebraic Combinatorics. Contemporary Mathematics 625, American Mathematical Society 2014, ISBN 978-1-4704-0905-0 [contents] - 2013
- [c4]Oleg R. Musin:
Multivariate positive definite functions on spheres. Discrete Geometry and Algebraic Combinatorics 2013 - 2012
- [j9]Oleg R. Musin, Alexey S. Tarasov:
The Strong Thirteen Spheres Problem. Discret. Comput. Geom. 48(1): 128-141 (2012) - 2011
- [j8]Arseniy V. Akopyan, Alexey A. Glazyrin, Oleg R. Musin, Alexey S. Tarasov:
The extremal spheres theorem. Discret. Math. 311(2-3): 171-177 (2011) - [j7]Oleg R. Musin, Hiroshi Nozaki:
Bounds on three- and higher-distance sets. Eur. J. Comb. 32(8): 1182-1190 (2011) - [j6]Alexander Barg, Oleg R. Musin:
Bounds on sets with few distances. J. Comb. Theory A 118(4): 1465-1474 (2011) - 2010
- [c3]Alexander Barg, Oleg R. Musin:
Bounds on codes with few distances. ISIT 2010: 1115-1119
2000 – 2009
- 2009
- [j5]Oleg R. Musin:
Spherical two-distance sets. J. Comb. Theory A 116(4): 988-995 (2009) - [i2]Alexander Barg, Oleg R. Musin:
Bounds on sets with few distances. CoRR abs/0905.2423 (2009) - 2007
- [j4]Alexander Barg, Oleg R. Musin:
Codes in spherical caps. Adv. Math. Commun. 1(1): 131-149 (2007) - 2006
- [j3]Oleg R. Musin:
The Kissing Problem in Three Dimensions. Discret. Comput. Geom. 35(3): 375-384 (2006) - [j2]Oleg R. Musin:
The one-sided kissing number in four dimensions. Period. Math. Hung. 53(1-2): 209-225 (2006) - [i1]Alexander Barg, Oleg R. Musin:
Codes in spherical caps. CoRR abs/math/0606734 (2006)
1990 – 1999
- 1997
- [c2]Oleg R. Musin:
Properties of the Delaunay Triangulation. SCG 1997: 424-426 - 1993
- [c1]Oleg R. Musin:
Topographic Structure of Image. CAIP 1993: 24-30 - 1991
- [j1]Oleg R. Musin:
Fast geometric transformations for image processing. Int. J. Imaging Syst. Technol. 3(3): 257-261 (1991)
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:24 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:
