Petros Elia

IEEE Trans. Inf. Theory, April, 2024

Perfect Multi-User Distributed Computing.

[BibT_eX]

[DOI]

Ali Khalesi

CoRR, 2024

Exact SINR Analysis of Matched-filter Precoder.

[BibT_eX]

[DOI]

Dirk Slock

CoRR, 2024

2023

Coded Caching in Networks With Heterogeneous User Activity.

[BibT_eX]

[DOI]

Adeel Malik

IEEE/ACM Trans. Netw., December, 2023

Multi-User Linearly-Separable Distributed Computing.

[BibT_eX]

[DOI]

Ali Khalesi

IEEE Trans. Inf. Theory, October, 2023

Multi-Transmitter Coded Caching Networks With Transmitter-Side Knowledge of File Popularity.

[BibT_eX]

[DOI]

Thrasyvoulos Spyropoulos

Giuseppe Caire

IEEE/ACM Trans. Netw., June, 2023

Vector Coded Caching Multiplicatively Increases the Throughput of Realistic Downlink Systems.

[BibT_eX]

[DOI]

IEEE Trans. Wirel. Commun., April, 2023

Fundamental Limits of Combinatorial Multi-Access Caching.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, February, 2023

Coded Caching Schemes for Multiaccess Topologies via Combinatorial Design.

[BibT_eX]

[DOI]

CoRR, 2023

Multi-User Distributed Computing Via Compressed Sensing.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2023

Coded Distributed Computing for Sparse Functions With Structured Support.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2023

Coded Caching Schemes for Multi-Access Topologies via Combinatorial Design Theory.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

2022

Low-Complexity High-Performance Cyclic Caching for Large MISO Systems.

[BibT_eX]

[DOI]

Mohammad Javad Salehi

Seyed Pooya Shariatpanahi

Antti Tölli

IEEE Trans. Wirel. Commun., 2022

Wireless Coded Caching Can Overcome the Worst-User Bottleneck by Exploiting Finite File Sizes.

[BibT_eX]

[DOI]

IEEE Trans. Wirel. Commun., 2022

Resolving the Feedback Bottleneck of Multi-Antenna Coded Caching.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Unselfish Coded Caching Can Yield Unbounded Gains Over Selfish Caching.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Multi-Access Distributed Computing.

[BibT_eX]

[DOI]

CoRR, 2022

Vector Coded Caching Multiplicatively Boosts the Throughput of Realistic Downlink Systems.

[BibT_eX]

[DOI]

CoRR, 2022

Resolving Cache-Load Imbalance Bottleneck of Stochastic Shared-Cache Networks.

[BibT_eX]

[DOI]

Adeel Malik

Proceedings of the IEEE Wireless Communications and Networking Conference, 2022

Vector Coded Caching Greatly Enhances Massive MIMO.

[BibT_eX]

[DOI]

Proceedings of the 23rd IEEE International Workshop on Signal Processing Advances in Wireless Communication, 2022

Multi-User Linearly Separable Computation: A Coding Theoretic Approach.

[BibT_eX]

[DOI]

Ali Khalesi

Proceedings of the IEEE Information Theory Workshop, 2022

On the Optimality of Coded Caching With Heterogeneous User Profiles.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2022

The Exact Load-Memory Tradeoff of Multi-Access Coded Caching With Combinatorial Topology.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

Coded Caching Does Not Generally Benefit From Selfish Caching.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

Stochastic Coded Caching with Optimized Shared-Cache Sizes and Reduced Subpacketization.

[BibT_eX]

[DOI]

Adeel Malik

Proceedings of the IEEE International Conference on Communications, 2022

Coded Caching in Land Mobile Satellite Systems.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Communications, 2022

2021

Fundamental Limits of Wireless Caching Under Mixed Cacheable and Uncacheable Traffic.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Fundamental Limits of Stochastic Shared-Cache Networks.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2021

Unselfish Coded Caching can Yield Unbounded Gains over Symmetrically Selfish Caching.

[BibT_eX]

[DOI]

CoRR, 2021

Multi-Antenna Coded Caching Analysis in Finite SNR and Finite Subpacketization.

[BibT_eX]

[DOI]

Proceedings of the 25th International ITG Workshop on Smart Antennas, 2021

Wireless Coded Caching With Shared Caches Can Overcome the Near-Far Bottleneck.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Coded Caching under Asynchronous Demands.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Coded Caching Gains at Low SNR Over Nakagami Fading Channels.

[BibT_eX]

[DOI]

Proceedings of the 55th Asilomar Conference on Signals, Systems, and Computers, 2021

2020

Fundamental Limits of Coded Caching With Multiple Antennas, Shared Caches and Uncoded Prefetching.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Full Coded Caching Gains for Cache-Less Users.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Optimal DoF of the K-User Broadcast Channel With Delayed and Imperfect Current CSIT.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Fundamental Limits of Stochastic Caching Networks.

[BibT_eX]

[DOI]

CoRR, 2020

Augmenting Multiple-Transmitter Coded Caching using Popularity Knowledge at the Transmitters.

[BibT_eX]

[DOI]

Thrasyvoulos Spyropoulos

Proceedings of the 18th International Symposium on Modeling and Optimization in Mobile, 2020

Resolving the Worst-User Bottleneck of Coded Caching: Exploiting Finite File Sizes.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2020

Rate-Memory Trade-Off for the Cache-Aided MISO Broadcast Channel with Hybrid CSIT.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2020

Extending the Optimality Range of Multi-Antenna Coded Caching with Shared Caches.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Stochastic Analysis of Coded Multicasting for Shared Caches Networks.

[BibT_eX]

[DOI]

Proceedings of the IEEE Global Communications Conference, 2020

2019

Fundamental Limits of Wireless Caching under Uneven-Capacity Channels.

[BibT_eX]

[DOI]

CoRR, 2019

Bridging two extremes: Multi-antenna Coded Caching with Reduced Subpacketization and CSIT.

[BibT_eX]

[DOI]

Proceedings of the 20th IEEE International Workshop on Signal Processing Advances in Wireless Communications, 2019

Multi-access coded caching: gains beyond cache-redundancy.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Coded Caching with Optimized Shared-Cache Sizes.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Optimal Coded Caching under Statistical QoS Information.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

Mapping Heterogeneity Does Not Affect Wireless Coded MapReduce.

[BibT_eX]

[DOI]

Daniel Jiménez Zorrilla

Proceedings of the IEEE International Symposium on Information Theory, 2019

Wyner's Network on Caches: Combining Receiver Caching with a Flexible Backhaul.

[BibT_eX]

[DOI]

Aly El Gamal

Proceedings of the IEEE International Symposium on Information Theory, 2019

Bridging the Gap between Multiplexing and Diversity in Finite SNR Multiple Antenna Coded Caching.

[BibT_eX]

[DOI]

Giuseppe Caire

Proceedings of the 53rd Asilomar Conference on Signals, Systems, and Computers, 2019

2018

Adding Transmitters Dramatically Boosts Coded-Caching Gains for Finite File Sizes.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2018

Fundamental Limits of Caching in Heterogeneous Networks with Uncoded Prefetching.

[BibT_eX]

[DOI]

CoRR, 2018

Resolving a Feedback Bottleneck of Multi-Antenna Coded Caching.

[BibT_eX]

[DOI]

CoRR, 2018

Coded Caching with Shared Caches: Fundamental Limits with Uncoded Prefetching.

[BibT_eX]

[DOI]

CoRR, 2018

Optimal coded caching in heterogeneous networks with uncoded prefetching.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2018

Coded Distributed Computing with Node Cooperation Substantially Increases Speedup Factors.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Achieving Full Multiplexing and Unbounded Caching Gains with Bounded Feedback Resources.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Adding Transmitters Allows Unbounded Coded-Caching Gains with Bounded File Sizes.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017

Fundamental Limits of Cache-Aided Wireless BC: Interplay of Coded-Caching and CSIT Feedback.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

A content-delivery protocol, exploiting the privacy benefits of coded caching.

[BibT_eX]

[DOI]

Felix Engelmann

Proceedings of the 15th International Symposium on Modeling and Optimization in Mobile, 2017

Wireless coded caching: A topological perspective.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Cache-aided cooperation with no CSIT.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Wireless coded caching: A paradigm shift in wireless communications.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Telecommunications, 2017

Feedback-aided coded caching for the MISO BC with small caches.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Communications, 2017

2016

Performance-Complexity Analysis for MAC ML-Based Decoding With User Selection.

[BibT_eX]

[DOI]

Hsiao-feng Lu

IEEE Trans. Signal Process., 2016

What Else Does Your Biometric Data Reveal? A Survey on Soft Biometrics.

[BibT_eX]

[DOI]

Antitza Dantcheva

Arun Ross

IEEE Trans. Inf. Forensics Secur., 2016

The Synergistic Gains of Coded Caching and Delayed Feedback.

[BibT_eX]

[DOI]

CoRR, 2016

Optimal Sum-DoF of the K-user MISO BC with Current and Delayed Feedback.

[BibT_eX]

[DOI]

CoRR, 2016

Optimally bridging the gap from delayed to perfect CSIT in the K-user MISO BC.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE Information Theory Workshop, 2016

2015

On the Two-User MISO Broadcast Channel With Alternating CSIT: A Topological Perspective.

[BibT_eX]

[DOI]

Syed Ali Jafar

IEEE Trans. Inf. Theory, 2015

Achieving the DoF limits of the SISO X channel with imperfect-quality CSIT.

[BibT_eX]

[DOI]

Dirk T. M. Slock

Proceedings of the IEEE International Symposium on Information Theory, 2015

Coded caching for reducing CSIT-feedback in wireless communications.

[BibT_eX]

[DOI]

Felix Engelmann

Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

2014

Symmetric two-user MIMO BC with evolving feedback.

[BibT_eX]

[DOI]

Proceedings of the 2014 Information Theory and Applications Workshop, 2014

On the vector broadcast channel with alternating CSIT: A topological perspective.

[BibT_eX]

[DOI]

Syed Ali Jafar

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

An outer bound on the MIMO BC with evolving current CSIT and perfect delayed CSIT.

[BibT_eX]

[DOI]

Proceedings of the 6th International Symposium on Communications, 2014

2013

Toward the Performance Versus Feedback Tradeoff for the Two-User MISO Broadcast Channel.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Symmetric Two-User MIMO BC and IC with Evolving Feedback.

[BibT_eX]

[DOI]

CoRR, 2013

Toward the Performance vs. Feedback Tradeoff for the Two-User MISO Broadcast Channel.

[BibT_eX]

[DOI]

CoRR, 2013

MIMO BC with imperfect and delayed channel state information at the transmitter and receivers.

[BibT_eX]

[DOI]

Proceedings of the 14th IEEE Workshop on Signal Processing Advances in Wireless Communications, 2013

Rate-reliability-complexity tradeoff for ML and lattice decoding of full-rate codes.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

On the fundamental feedback-vs-performance tradeoff over the MISO-BC with imperfect and delayed CSIT.

[BibT_eX]

[DOI]

Sheng Yang

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

MISO broadcast channel with delayed and evolving CSIT.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Optimal DoF region of the two-user MISO-BC with general alternating CSIT.

[BibT_eX]

[DOI]

Proceedings of the 2013 Asilomar Conference on Signals, 2013

2012

Achieving a Vanishing SNR Gap to Exact Lattice Decoding at a Subexponential Complexity.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Large Families of Asymptotically Optimal Two-Dimensional Optical Orthogonal Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Sphere Decoding Complexity Exponent for Decoding Full-Rate Codes Over the Quasi-Static MIMO Channel.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Imperfect Delayed CSIT can be as Useful as Perfect Delayed CSIT: DoF Analysis and Constructions for the BC

[BibT_eX]

[DOI]

CoRR, 2012

Degrees-of-Freedom Region of the MISO Broadcast Channel with General Mixed-CSIT

[BibT_eX]

[DOI]

CoRR, 2012

Feedback-aided complexity reductions in ML and lattice decoding.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Interference alignment for achieving both full DoF and full diversity in the broadcast channel with delayed CSIT.

[BibT_eX]

[DOI]

Raymond Knopp

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Can imperfect delayed CSIT be as useful as perfect delayed CSIT? DoF analysis and constructions for the BC.

[BibT_eX]

[DOI]

Proceedings of the 50th Annual Allerton Conference on Communication, 2012

2011

Interference neutralization for separated multiuser uplink-downlink with distributed relays.

[BibT_eX]

[DOI]

Proceedings of the Information Theory and Applications Workshop, 2011

The complexity of sphere decoding perfect codes under a vanishing gap to ML performance.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Relay-aided interference neutralization for the multiuser uplink-downlink asymmetric setting.

[BibT_eX]

[DOI]

Raymond Knopp

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Search pruning in video surveillance systems: Efficiency-reliability tradeoff.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Computer Vision Workshops, 2011

Vanishing the gap to exact lattice search at a subexponential complexity: LR-aided regularized decoding.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010

DMT optimality of LR-aided linear decoders for a general class of channels, lattice designs, and system models.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Person recognition using a bag of facial soft biometrics (BoFSB).

[BibT_eX]

[DOI]

Antitza Dantcheva

Jean-Luc Dugelay

Proceedings of the 2010 IEEE International Workshop on Multimedia Signal Processing, 2010

Rate-of-decay of probability of isolation in dense sensor networks with bounding constraints.

[BibT_eX]

[DOI]

Dirk T. M. Slock

Proceedings of the IEEE International Symposium on Information Theory, 2010

Fundamental rate-reliability-complexity limits in outage limited MIMO communications.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

Soft biometrics systems: Reliability and asymptotic bounds.

[BibT_eX]

[DOI]

Antitza Dantcheva

Jean-Luc Dugelay

Proceedings of the Fourth IEEE International Conference on Biometrics: Theory Applications and Systems, 2010

2009

Space-time codes achieving the DMD tradeoff of the MIMO-ARQ channel.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

High-SNR Analysis of Outage-Limited Communications With Bursty and Delay-Limited Information.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

D-MG tradeoff and optimal codes for a class of AF and DF cooperative communication protocols.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

Large Families of Optimal Two-Dimensional Optical Orthogonal Codes

[BibT_eX]

[DOI]

CoRR, 2009

LR-aided MMSE lattice decoding is DMT optimal for all approximately universal codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

Space-time codes that are approximately universal for the parallel, multi-block and cooperative DDF channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

2008

Construction criteria and existence results for approximately universal linear space-time codes with reduced decoding complexity.

[BibT_eX]

[DOI]

Proceedings of the 46th Annual Allerton Conference on Communication, 2008

2007

Cooperative diversity schemes for asynchronous wireless networks.

[BibT_eX]

[DOI]

Wirel. Pers. Commun., 2007

Perfect Space-Time Codes for Any Number of Antennas.

[BibT_eX]

[DOI]

B. A. Sethuraman

IEEE Trans. Inf. Theory, 2007

Asymptotically optimal cooperative wireless networks with reduced signaling complexity.

[BibT_eX]

[DOI]

Frédérique E. Oggier

IEEE J. Sel. Areas Commun., 2007

Approximately-Universal Space-Time Codes for the Parallel, Multi-Block and Cooperative-Dynamic-Decode-and-Forward Channels

[BibT_eX]

[DOI]

CoRR, 2007

On the Responsiveness-Diversity-Multiplexing Tradeoff.

[BibT_eX]

[DOI]

Proceedings of the 5th International Symposium on Modeling and Optimization in Mobile, 2007

Cooperative Diversity in Wireless Networks with Stochastic and Bursty Traffic.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

Explicit Space-Time Codes Achieving the Diversity-Multiplexing Gain Tradeoff.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

Asymptotically Optimal Cooperative Wireless Networks without Constellation Expansion.

[BibT_eX]

[DOI]

Frédérique E. Oggier

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Constructions of Cooperative Diversity Schemes for Asynchronous Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005

Approximately universal optimality over several dynamic and non-dynamic cooperative diversity schemes for wireless networks

[BibT_eX]

[DOI]

CoRR, 2005

Perfect Space-Time Codes with Minimum and Non-Minimum Delay for Any Number of Antennas

[BibT_eX]

[DOI]

B. A. Sethuraman

CoRR, 2005

Achieving the DMD tradeoff of the MIMO-ARQ channel.

[BibT_eX]

[DOI]

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Explicit space-time codes that achieve the diversity-multiplexing gain tradeoff.

[BibT_eX]

[DOI]

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004

New Constructions and Bounds for 2-D Optical Orthogonal Codes.

[BibT_eX]

[DOI]

Reza Omrani