Konstantinos Limniotis 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 keys2008
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKonstantinos Limniotis, Nicholas Kolokotronis, Nicholas Kalouptsidis: On the Linear Complexity of Sequences Obtained by State Space Generators. IEEE Transactions on Information Theory 54(4): 1786-1793 (2008)
2007
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNicholas Kolokotronis, Konstantinos Limniotis, Nicholas Kalouptsidis: Efficient Computation of the Best Quadratic Approximations of Cubic Boolean Functions. IMA Int. Conf. 2007: 73-91
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNicholas Kolokotronis, Konstantinos Limniotis, Nicholas Kalouptsidis: Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators. Inscrypt 2007: 246-255
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKonstantinos Limniotis, Nicholas Kolokotronis, Nicholas Kalouptsidis: On the Nonlinear Complexity and Lempel-Ziv Complexity of Finite Length Sequences. IEEE Transactions on Information Theory 53(11): 4293-4302 (2007)
2006
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKonstantinos Limniotis, Nicholas Kolokotronis, Nicholas Kalouptsidis: Nonlinear Complexity of Binary Sequences and Connections with Lempel-Ziv Compression. SETA 2006: 168-179
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNicholas Kolokotronis, Konstantinos Limniotis, Nicholas Kalouptsidis: Lower Bounds on Sequence Complexity Via Generalised Vandermonde Determinants. SETA 2006: 271-284

Coauthor Index

1Nicholas Kalouptsidis [1] [2] [3] [4] [5] [6]
2Nicholas Kolokotronis [1] [2] [3] [4] [5] [6]

Copyright © Fri Dec 4 16:04:45 2009 by Michael Ley (ley@uni-trier.de)