default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaya Stoyanova
Person information
- affiliation: St. Clement of Ohrid University of Sofia, Bulgaria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j15]Alexander Barg
, Peter G. Boyvalenkov, Maya Stoyanova:
Bounds for the sum of distances of spherical sets of small size. Discret. Math. 346(5): 113346 (2023)- 2022
- [c7]Silvia P. Boumova, Peter G. Boyvalenkov, Maya Stoyanova:
Bounds for the Minimum Distance and Covering Radius of Orthogonal Arrays Via Their Distance Distributions. IWSDA 2022: 1-5 - 2021
- [j14]Peter G. Boyvalenkov, Peter D. Dragnev, Douglas P. Hardin, Edward B. Saff, Maya Stoyanova:
Bounds for spherical codes: The Levenshtein framework lifted. Math. Comput. 90(329): 1323-1356 (2021) - [j13]Peter G. Boyvalenkov, Peter D. Dragnev, Douglas P. Hardin, Edward B. Saff, Maya Stoyanova:
Universal Bounds for Size and Energy of Codes of Given Minimum and Maximum Distances. IEEE Trans. Inf. Theory 67(6): 3569-3584 (2021) - [i4]Alexander Barg, Peter G. Boyvalenkov, Maya Stoyanova:
Bounds for the sum of distances of spherical sets of small size. CoRR abs/2105.03511 (2021) - 2020
- [j12]Peter G. Boyvalenkov, Peter D. Dragnev, Douglas P. Hardin, Edward B. Saff, Maya Stoyanova:
Upper bounds for energies of spherical codes of given cardinality and separation. Des. Codes Cryptogr. 88(9): 1811-1826 (2020) - [c6]Silvia P. Boumova, Tedis Ramaj, Maya Stoyanova:
On Covering Radius of Orthogonal Arrays. ACCT 2020: 1-6
2010 – 2019
- 2019
- [j11]Peter G. Boyvalenkov, Peter D. Dragnev, Douglas P. Hardin, Edward B. Saff, Maya Stoyanova:
On spherical codes with inner products in a prescribed interval. Des. Codes Cryptogr. 87(2-3): 299-315 (2019) - [c5]Peter G. Boyvalenkov, Peter Dragnev, Douglas P. Hardin, Edward B. Saff, Maya Stoyanova:
Linear Programming Bounds for Cardinality and Energy of Codes of Given Min and Max Distances. ISIT 2019: 1747-1751 - [c4]Peter G. Boyvalenkov, Peter Dragnev, Douglas P. Hardin, Edward B. Saff, Maya Stoyanova:
On Two Problems Concerning Universal Bounds for Codes. REDUNDANCY 2019: 58-63 - [i3]Peter G. Boyvalenkov, Peter Dragnev, Douglas P. Hardin, Edward B. Saff, Maya Stoyanova:
Universal Bounds for Size and Energy of Codes of Given Minimum and Maximum Distances. CoRR abs/1910.07274 (2019) - 2018
- [j10]Peter G. Boyvalenkov, Danyo Danev, Maya Stoyanova:
Refinements of Levenshtein Bounds in q-ary Hamming Spaces. Probl. Inf. Transm. 54(4): 329-342 (2018) - [c3]Georgi Tuparov, Delyan Keremedchiev, Daniela Tuparova, Maya Stoyanova:
Gamification and educational computer games in open source learning management systems as a part of assessment. ITHET 2018: 1-5 - [i2]Peter G. Boyvalenkov, Danyo Danev, Maya Stoyanova:
Refinements of Levenshtein bounds in q-ary Hamming spaces. CoRR abs/1801.01982 (2018) - 2017
- [j9]Peter G. Boyvalenkov, Tanya Marinova, Maya Stoyanova:
Nonexistence of a few binary orthogonal arrays. Discret. Appl. Math. 217: 144-150 (2017) - [j8]Peter G. Boyvalenkov, Peter D. Dragnev, Douglas P. Hardin, Edward B. Saff, Maya Stoyanova:
Energy bounds for codes and designs in Hamming spaces. Des. Codes Cryptogr. 82(1-2): 411-433 (2017) - [j7]Peter G. Boyvalenkov, Peter D. Dragnev, Douglas P. Hardin, Edward B. Saff, Maya Stoyanova:
Universal Lower Bounds on Energy and LP-Extremal Polynomials for (4, 24)-Codes. Electron. Notes Discret. Math. 57: 91-96 (2017) - [j6]Tanya Marinova, Maya Stoyanova:
Nonexistence of (9, 112, 4) and (10, 224, 5) binary orthogonal arrays. Electron. Notes Discret. Math. 57: 153-159 (2017) - [c2]Maya Stoyanova, Daniela Tuparova, Kostadin Samardzhiev:
Impact of Motivation, Gamification and Learning Style on Students' Interest in Maths Classes - A Study in 11 High School Grade. ICL (2) 2017: 133-142 - 2016
- [c1]Maya Stoyanova, Daniela Tuparova, Kostadin Samardzhiev:
Gamification in 11th Grade Mathematics Lessons - One Possible Interactive Approach. ICL (2) 2016: 41-53 - [i1]Peter G. Boyvalenkov, Tanya Marinova, Maya Stoyanova:
Nonexistence of a few binary orthogonal arrays. CoRR abs/1604.06117 (2016) - 2015
- [j5]Peter G. Boyvalenkov, Hristina N. Kulina, Tanya Marinova, Maya Stoyanova:
Nonexistence of binary orthogonal arrays via their distance distributions. Probl. Inf. Transm. 51(4): 326-334 (2015) - 2013
- [j4]Peter G. Boyvalenkov, Maya Stoyanova:
New nonexistence results for spherical designs. Adv. Math. Commun. 7(3): 279-292 (2013) - 2010
- [j3]Peter G. Boyvalenkov, Maya Stoyanova:
A new asymptotic bound of the minimum possible odd cardinality of spherical (2k-1)-designs. Discret. Math. 310(15-16): 2170-2175 (2010)
2000 – 2009
- 2009
- [j2]Silvia P. Boumova, Peter G. Boyvalenkov, Hristina N. Kulina, Maya Stoyanova:
Polynomial techniques for investigation of spherical designs. Des. Codes Cryptogr. 51(3): 275-288 (2009) - [j1]Silvia P. Boumova, Peter G. Boyvalenkov, Maya Stoyanova:
A method for proving nonexistence of spherical designs of odd strength and odd cardinality. Probl. Inf. Transm. 45(2): 110-123 (2009)
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:14 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:
