Yuriy Tarannikov Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2002
7no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLClaude Carlet, Yuriy Tarannikov: Covering Sequences of Boolean Functions and Their Cryptographic Significance. Des. Codes Cryptography 25(3): 263-279 (2002)
2001
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYuriy Tarannikov, Peter Korolev, Anton Botev: Autocorrelation Coefficients and Correlation Immunity of Boolean Functions. ASIACRYPT 2001: 460-479
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYuriy Tarannikov: New Constructions of Resilient Boolean Functions with Maximal Nonlinearity. FSE 2001: 66-77
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaria Fedorova, Yuriy Tarannikov: On the Constructing of Highly Nonlinear Resilient Boolean Functions by Means of Special Matrices. INDOCRYPT 2001: 254-266
2000
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYuriy Tarannikov: On Resilient Boolean Functions with Maximal Possible Nonlinearity. INDOCRYPT 2000: 19-30
1999
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRoman M. Kolpakov, Gregory Kucherov, Yuriy Tarannikov: On Repetition-Free Binary Words of Minimal Density. Theor. Comput. Sci. 218(1): 161-175 (1999)
1998
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRoman M. Kolpakov, Gregory Kucherov, Yuriy Tarannikov: On Repetition-Free Binary Words of Minimal Density. MFCS 1998: 683-692

Coauthor Index

1Anton Botev [6]
2Claude Carlet [7]
3Maria Fedorova [4]
4Roman Kolpakov (Roman M. Kolpakov) [1] [2]
5Peter Korolev [6]
6Gregory Kucherov [1] [2]

Colors in the list of coauthors

Copyright © Fri Nov 27 15:43:12 2009 by Michael Ley (ley@uni-trier.de)