Thomas A. Courtade

According to our database1, Thomas A. Courtade authored at least 77 papers between 2009 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Smoothing Brascamp-Lieb Inequalities and Strong Converses of Coding Theorems.
IEEE Trans. Inf. Theory, 2020

Utility-based Resource Allocation and Pricing for Serverless Computing.
CoRR, 2020

Serverless Straggler Mitigation using Local Error-Correcting Codes.
CoRR, 2020

Linear Models are Most Favorable among Generalized Linear Models.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
Euclidean Forward-Reverse Brascamp-Lieb Inequalities: Finiteness, Structure and Extremals.
CoRR, 2019

OverSketched Newton: Fast Convex Optimization for Serverless Systems.
CoRR, 2019

Transportation Proof of an inequality by Anantharam, Jog and Nair.
CoRR, 2019

A Family of Bayesian Cramér-Rao Bounds, and Consequences for Log-Concave Priors.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Linear Regression With Shuffled Data: Statistical and Computational Limits of Permutation Recovery.
IEEE Trans. Inf. Theory, 2018

The Effect of Local Decodability Constraints on Variable-Length Compression.
IEEE Trans. Inf. Theory, 2018

Counterexample to the Vector Generalization of Costa's Entropy Power Inequality, and Partial Resolution.
IEEE Trans. Inf. Theory, 2018

Quantitative Stability of the Entropy Power Inequality.
IEEE Trans. Inf. Theory, 2018

A Strong Entropy Power Inequality.
IEEE Trans. Inf. Theory, 2018

A Forward-Reverse Brascamp-Lieb Inequality: Entropic Duality and Gaussian Optimality.
Entropy, 2018

Bounds on the Poincaré constant for convolution measures.
CoRR, 2018

A Quantitative Entropic CLT for Radially Symmetric Random Vectors.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

OverSketch: Approximate Matrix Multiplication for the Cloud.
Proceedings of the IEEE International Conference on Big Data, 2018

2017
Principles and Applications of Science of Information.
Proc. IEEE, 2017

Worst-case vs Average-case Design for Estimation from Fixed Pairwise Comparisons.
CoRR, 2017

Information-Theoretic Perspectives on Brascamp-Lieb Inequality and Its Reverse.
CoRR, 2017

A Counterexample to the Vector Generalization of Costa's EPI, and Partial Resolution.
CoRR, 2017

Existence of Stein Kernels under a Spectral Gap, and Discrepancy Bound.
CoRR, 2017

Novel probabilistic models of spatial genetic ancestry with applications to stratification correction in genome-wide association studies.
Bioinform., 2017

Denoising linear models with permuted data.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Wasserstein stability of the entropy power inequality for log-concave random vectors.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Concavity of entropy power: Equivalent formulations and generalizations.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Fundamental Limits of Genome Assembly Under an Adversarial Erasure Model.
IEEE Trans. Mol. Biol. Multi Scale Commun., 2016

Coded Cooperative Data Exchange for a Secret Key.
IEEE Trans. Inf. Theory, 2016

Design of Energy- and Cost-Efficient Massive MIMO Arrays.
Proc. IEEE, 2016

Wasserstein Stability of the Entropy Power Inequality for Log-Concave Densities.
CoRR, 2016

Links between the Logarithmic Sobolev Inequality and the convolution inequalities for Entropy and Fisher Information.
CoRR, 2016

Entropy Jumps for Radially Symmetric Random Vectors.
CoRR, 2016

Monotonicity of entropy and Fisher information: a quick proof via maximal correlation.
Commun. Inf. Syst., 2016

Information-optimal genome assembly via sparse read-overlap graphs.
Bioinform., 2016

Partial DNA assembly: A rate-distortion perspective.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Brascamp-Lieb inequality and its reverse: An information theoretic view.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Smoothing Brascamp-Lieb inequalities and strong converses for common randomness generation.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Overlap-based genome assembly from variable-length reads.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Strengthening the entropy power inequality.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Linear regression with an unknown permutation: Statistical and computational limits.
Proceedings of the 54th Annual Allerton Conference on Communication, 2016

2015
Energy-Efficient Group Key Agreement for Wireless Networks.
IEEE Trans. Wirel. Commun., 2015

Justification of Logarithmic Loss via the Benefit of Side Information.
IEEE Trans. Inf. Theory, 2015

Compression for Quadratic Similarity Queries.
IEEE Trans. Inf. Theory, 2015

CommentsComments on "Canalizing Boolean Functions Maximize Mutual Information".
IEEE Trans. Inf. Theory, 2015

Do read errors matter for genome assembly?
Proceedings of the IEEE International Symposium on Information Theory, 2015

Compressing sparse sequences under local decodability constraints.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Approximate capacity of Gaussian relay networks: Is a sublinear gap to the cutset bound plausible?
Proceedings of the IEEE International Symposium on Information Theory, 2015

A scalable massive MIMO array architecture based on common modules.
Proceedings of the IEEE International Conference on Communication, 2015

2014
Information Measures: The Curious Case of the Binary Alphabet.
IEEE Trans. Inf. Theory, 2014

Coded Cooperative Data Exchange in Multihop Networks.
IEEE Trans. Inf. Theory, 2014

Multiterminal Source Coding Under Logarithmic Loss.
IEEE Trans. Inf. Theory, 2014

Which Boolean Functions Maximize Mutual Information on Noisy Inputs?
IEEE Trans. Inf. Theory, 2014

Enhanced Precision Through Multiple Reads for LDPC Decoding in Flash Memories.
IEEE J. Sel. Areas Commun., 2014

Information divergences and the curious case of the binary alphabet.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Variable-length lossy compression and channel coding: Non-asymptotic converses via cumulant generating functions.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Cumulant generating function of codeword lengths in optimal lossless compression.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

An extremal inequality for long Markov chains.
Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

2013
Optimal Encoding for Discrete Degraded Broadcast Channels.
IEEE Trans. Inf. Theory, 2013

Outer Bounds for Multiterminal Source Coding based on Maximal Correlation
CoRR, 2013

Which Boolean functions are most informative?
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Compression for exact match identification.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Outer bounds for multiterminal source coding via a strong data processing inequality.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Quadratic Similarity Queries on Compressed Data.
Proceedings of the 2013 Data Compression Conference, 2013

Energy-efficient, secure group key agreement for ad hoc networks.
Proceedings of the IEEE Conference on Communications and Network Security, 2013

2012
Two Problems in Multiterminal Information Theory.
PhD thesis, 2012

LDPC Decoding with Limited-Precision Soft Information in Flash Memories
CoRR, 2012

The user capacity of barrage relay networks.
Proceedings of the 31st IEEE Military Communications Conference, 2012

Information masking and amplification: The source coding setting.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
Optimal Allocation of Redundancy Between Packet-Level Erasure Coding and Physical-Layer Channel Coding in Fading Channels.
IEEE Trans. Commun., 2011

Designing Nonlinear Turbo Codes with a Target Ones Density
CoRR, 2011

Superposition coding to support multiple streams, priorities, and channel capacities in the context of GMSK.
Proceedings of the MILCOM 2011, 2011

Multiterminal source coding with an entropy-based distortion measure.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Soft Information for LDPC Decoding in Flash: Mutual-Information Optimized Quantization.
Proceedings of the Global Communications Conference, 2011

Minimizing weighted sum finish time for one-to-many file transfer in peer-to-peer networks.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011

Weighted universal recovery, practical secrecy, and an efficient algorithm for solving both.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010
A deterministic approach to rate-compatible fountain communication.
Proceedings of the Information Theory and Applications Workshop, 2010

2009
A Cross-Layer Perspective on Rateless Coding for Wireless Channels.
Proceedings of IEEE International Conference on Communications, 2009


  Loading...