|
|
|
Publications in Math-Net.Ru |
Citations |
|
2012 |
| 1. |
A. Gupta, S. Verdú, T. Weissman, “Achievable complexity-performance tradeoffs in lossy compression”, Probl. Peredachi Inf., 48:4 (2012), 62–87  ; Problems Inform. Transmission, 48:4 (2012), 352–375  |
1
|
|
1997 |
| 2. |
M. S. Pinsker, V. V. Prelov, S. Verdú, “Sensitivity of the $\varepsilon$-Entropy of Stationary Continuous-Time Gaussian Processes”, Probl. Peredachi Inf., 33:2 (1997), 3–25   ; Problems Inform. Transmission, 33:2 (1997), 95–113 |
4
|
|
1996 |
| 3. |
S. Verdú, “The Exponential Distribution in Information Theory”, Probl. Peredachi Inf., 32:1 (1996), 100–111 ; Problems Inform. Transmission, 32:1 (1996), 86–95 |
51
|
|
1994 |
| 4. |
M. V. Burnashev, S. Verdú, “Measures Separated in $L_1$ Metrics and ID-Codes”, Probl. Peredachi Inf., 30:3 (1994), 3–14 ; Problems Inform. Transmission, 30:3 (1994), 191–201 |
5
|
|
1993 |
| 5. |
T. S. Han, S. Verdú, “Spectrum Invariancy Under Output Approximation for Full-Rank Discrete Memoryless Channels”, Probl. Peredachi Inf., 29:2 (1993), 9–27 ; Problems Inform. Transmission, 29:2 (1993), 101–118 |
2
|
|
| Organisations |
|
| |
|
|
Contact us: