The SCEAS System
| |||||||

## Search the dblp DataBase
Nicholas Kalouptsidis:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Nicholas Kolokotronis, Konstantinos Limniotis, Nicholas Kalouptsidis
**Lower Bounds on Sequence Complexity Via Generalised Vandermonde Determinants.**[Citation Graph (0, 0)][DBLP] SETA, 2006, pp:271-284 [Conf] - Konstantinos Limniotis, Nicholas Kolokotronis, Nicholas Kalouptsidis
**Nonlinear Complexity of Binary Sequences and Connections with Lempel-Ziv Compression.**[Citation Graph (0, 0)][DBLP] SETA, 2006, pp:168-179 [Conf] - R. Sweet, I. Viehoff, D. Linardatos, Nicholas Kalouptsidis
**Marginal value-based pricing of additional spectrum assigned to cellular telephony operators.**[Citation Graph (0, 0)][DBLP] Information Economics and Policy, 2002, v:14, n:3, pp:371-384 [Journal] - Nicholas Kalouptsidis
**Prolongations and Lyapunov Functions in Control Systems.**[Citation Graph (0, 0)][DBLP] Mathematical Systems Theory, 1983, v:16, n:3, pp:233-249 [Journal] - Nicholas Kalouptsidis, David L. Elliott
**Stability Analysis of the Orbits of Control Systems.**[Citation Graph (0, 0)][DBLP] Mathematical Systems Theory, 1982, v:15, n:4, pp:323-342 [Journal] - J. Tsinias, Nicholas Kalouptsidis
**Prolongations and Stability Analysis via Lyapunov Functions of Dynamical Polysystems.**[Citation Graph (0, 0)][DBLP] Mathematical Systems Theory, 1987, v:20, n:2-3, pp:215-233 [Journal] - J. Tsinias, Nicholas Kalouptsidis, A. Bacciotti
**Lyapunov Functions and Stability of Dynamical Polysystems.**[Citation Graph (0, 0)][DBLP] Mathematical Systems Theory, 1987, v:19, n:4, pp:333-354 [Journal] - Konstantinos Koutroumbas, Nicholas Kalouptsidis
**Generalized hamming networks and applications.**[Citation Graph (0, 0)][DBLP] Neural Networks, 2005, v:18, n:7, pp:896-913 [Journal] - Nicholas Kolokotronis, Nicholas Kalouptsidis
**On the linear complexity of nonlinearly filtered PN-sequences.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2003, v:49, n:11, pp:3047-3059 [Journal] - Nicholas Kolokotronis, Panagiotis Rizomiliotis, Nicholas Kalouptsidis
**Minimum linear span approximation of binary sequences.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2002, v:48, n:10, pp:2758-2764 [Journal] - Panagiotis Rizomiliotis, Nicholas Kalouptsidis
**Results on the nonlinear span of binary sequences.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2005, v:51, n:4, pp:1555-1563 [Journal] - Panagiotis Rizomiliotis, Nicholas Kolokotronis, Nicholas Kalouptsidis
**On the quadratic span of binary sequences.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2005, v:51, n:5, pp:1840-1848 [Journal] - D. Linardatos, Nicholas Kalouptsidis
**Synthesis of minimal cost nonlinear feedback shift registers.**[Citation Graph (0, 0)][DBLP] Signal Processing, 2002, v:82, n:2, pp:157-176 [Journal] - P. Koukoulas, Nicholas Kalouptsidis
**Blind identification of second order Hammerstein series.**[Citation Graph (0, 0)][DBLP] Signal Processing, 2003, v:83, n:1, pp:213-234 [Journal] - Nicholas Kolokotronis, G. Gatt, Nicholas Kalouptsidis
**On the generation of sequences simulating higher order white noise for system identification.**[Citation Graph (0, 0)][DBLP] Signal Processing, 2004, v:84, n:5, pp:833-852 [Journal] - Nicholas Kalouptsidis, Konstantinos Koutroumbas, V. Psaraki
**Classification methods for random utility models with i.i.d. disturbances under the most probable alternative rule.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2007, v:176, n:3, pp:1778-1794 [Journal] **Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators.**[Citation Graph (, )][DBLP]**New Constructions of Low-Complexity Convolutional Codes.**[Citation Graph (, )][DBLP]**Efficient Computation of the Best Quadratic Approximations of Cubic Boolean Functions.**[Citation Graph (, )][DBLP]**Input-output identification of nonlinear channels using PSK, QAM and OFDM inputs.**[Citation Graph (, )][DBLP]**SPARLS: A Low Complexity Recursive $\mathcal{L}_1$-Regularized Least Squares Algorithm**[Citation Graph (, )][DBLP]
Search in 0.010secs, Finished in 0.012secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |