Articles with public access mandates - Sergio VerduLearn more
Not available anywhere: 7
Compressing data on graphs with clusters
AR Asadi, E Abbe, S Verdú
2017 IEEE International Symposium on Information Theory (ISIT), 1583-1587, 2017
Mandates: US National Science Foundation, US Department of Defense
Estimation of entropy rate and Rényi entropy rate for Markov chains
S Kamath, S Verdú
2016 IEEE International Symposium on Information Theory (ISIT), 685-689, 2016
Mandates: US National Science Foundation
Rejection sampling and noncausal sampling under moment constraints
J Liu, S Verdu
2018 IEEE International Symposium on Information Theory (ISIT), 1565-1569, 2018
Mandates: US National Science Foundation, US Department of Defense
Fixed-length-parsing universal compression with side information
Y Im, S Verdú
2017 IEEE International Symposium on Information Theory (ISIT), 2563-2567, 2017
Mandates: US National Science Foundation
Key generation with limited interaction
J Liu, P Cuff, S Verdú
2016 IEEE International Symposium on Information Theory (ISIT), 2918-2922, 2016
Mandates: US National Science Foundation
Universal compression, list decoding, and logarithmic loss
Y Shkel, M Raginsky, S Verdu
2018 IEEE International Symposium on Information Theory (ISIT), 206-210, 2018
Mandates: US National Science Foundation
Energy efficiency of wireless cooperation
A Jain, SR Kulkarni, S Verdú
2016 54th Annual Allerton Conference on Communication, Control, and …, 2016
Mandates: US National Science Foundation
Available somewhere: 31
-Divergence Inequalities
I Sason, S Verdú
IEEE Transactions on Information Theory 62 (11), 5973-6006, 2016
Mandates: US National Science Foundation
Chaining mutual information and tightening generalization bounds
A Asadi, E Abbe, S Verdú
Advances in Neural Information Processing Systems 31, 2018
Mandates: US National Science Foundation
Arimoto–Rényi Conditional Entropy and Bayesian -Ary Hypothesis Testing
I Sason, S Verdú
IEEE Transactions on Information theory 64 (1), 4-25, 2017
Mandates: US National Science Foundation, US Department of Defense
Empirical estimation of information measures: A literature guide
S Verdú
Entropy 21 (8), 720, 2019
Mandates: US National Science Foundation
-Resolvability
J Liu, P Cuff, S Verdú
IEEE Transactions on Information Theory 63 (5), 2629-2658, 2016
Mandates: US National Science Foundation
Improved bounds on lossless source coding and guessing moments via Rényi measures
I Sason, S Verdú
IEEE Transactions on Information Theory 64 (6), 4323-4346, 2018
Mandates: US National Science Foundation, US Department of Defense
Energy-distortion tradeoffs in Gaussian joint source-channel coding problems
A Jain, D Gunduz, SR Kulkarni, HV Poor, S Verdú
IEEE Transactions on Information Theory 58 (5), 3153-3168, 2012
Mandates: Government of Spain
Secret key generation with limited interaction
J Liu, P Cuff, S Verdú
IEEE Transactions on Information Theory 63 (11), 7358-7381, 2017
Mandates: US National Science Foundation, US Department of Defense
Joint source-channel coding with feedback
V Kostina, Y Polyanskiy, S Verd
IEEE Transactions on Information Theory 63 (6), 3502-3515, 2017
Mandates: US National Science Foundation
Beyond the blowing-up lemma: Sharp converses via reverse hypercontractivity
J Liu, R Van Handel, S Verdú
2017 IEEE International Symposium on Information Theory (ISIT), 943-947, 2017
Mandates: US National Science Foundation, US Department of Defense
Brascamp-Lieb inequality and its reverse: An information theoretic view
J Liu, TA Courtade, P Cuff, S Verdú
2016 IEEE International Symposium on Information Theory (ISIT), 1048-1052, 2016
Mandates: US National Science Foundation
Nonasymptotic noisy lossy source coding
V Kostina, S Verdú
IEEE Transactions on Information Theory 62 (11), 6111-6123, 2016
Mandates: US National Science Foundation
Smoothing Brascamp-Lieb inequalities and strong converses for common randomness generation
J Liu, TA Courtade, P Cuff, S Verdu
2016 IEEE International Symposium on Information Theory (ISIT), 1043-1047, 2016
Mandates: US National Science Foundation
Publication and funding information is determined automatically by a computer program