default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYuriy V. Tarannikov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Vladimir N. Potapov
, Anna A. Taranenko, Yuriy V. Tarannikov:
An asymptotic lower bound on the number of bent functions. Des. Codes Cryptogr. 92(3): 639-651 (2024)- [i7]Yuriy V. Tarannikov:
On the number of partitions of the hypercube Zqn into large subcubes. CoRR abs/2411.04479 (2024)
2010 – 2019
- 2014
- [i6]Yuriy V. Tarannikov:
Generalized proper matrices and constructing of m-resilient Boolean functions with maximal nonlinearity for expanded range of parameters. IACR Cryptol. ePrint Arch. 2014: 164 (2014)
2000 – 2009
- 2005
- [i5]Yuriy V. Tarannikov:
On affine rank of spectrum support for plateaued function. IACR Cryptol. ePrint Arch. 2005: 399 (2005) - 2002
- [j2]Claude Carlet, Yuriy V. Tarannikov:
Covering Sequences of Boolean Functions and Their Cryptographic Significance. Des. Codes Cryptogr. 25(3): 263-279 (2002) - 2001
- [c5]Yuriy V. Tarannikov, Peter Korolev, Anton Botev:
Autocorrelation Coefficients and Correlation Immunity of Boolean Functions. ASIACRYPT 2001: 460-479 - [c4]Yuriy V. Tarannikov:
New Constructions of Resilient Boolean Functions with Maximal Nonlinearity. FSE 2001: 66-77 - [c3]Maria Fedorova, Yuriy V. Tarannikov:
On the Constructing of Highly Nonlinear Resilient Boolean Functions by Means of Special Matrices. INDOCRYPT 2001: 254-266 - [i4]Maria Fedorova, Yuriy V. Tarannikov:
On the Constructing of Highly Nonlinear Resilient Boolean Functions by Means of Special Matrices. IACR Cryptol. ePrint Arch. 2001: 83 (2001) - 2000
- [c2]Yuriy V. Tarannikov:
On Resilient Boolean Functions with Maximal Possible Nonlinearity. INDOCRYPT 2000: 19-30 - [i3]Yuriy V. Tarannikov:
On Resilient Boolean Functions with Maximal Possible Nonlinearity. IACR Cryptol. ePrint Arch. 2000: 5 (2000) - [i2]Yuriy V. Tarannikov, Denis Kirienko:
Spectral Analysis of High Order Correlation Immune Functions. IACR Cryptol. ePrint Arch. 2000: 50 (2000) - [i1]Yuriy V. Tarannikov:
New constructions of resilient Boolean functions with maximal nonlinearity. IACR Cryptol. ePrint Arch. 2000: 69 (2000)
1990 – 1999
- 1999
- [j1]Roman M. Kolpakov, Gregory Kucherov, Yuriy V. Tarannikov:
On Repetition-Free Binary Words of Minimal Density. Theor. Comput. Sci. 218(1): 161-175 (1999) - 1998
- [c1]Roman M. Kolpakov, Gregory Kucherov, Yuriy V. Tarannikov:
On Repetition-Free Binary Words of Minimal Density. MFCS 1998: 683-692
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-01-09 13:14 CET 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:
