New Constructions and Bounds for 2-D Optical Orthogonal Codes. - Reza Omrani; Petros Elia; P. Vijay Kumar (SETA, 2004)

Explicit space-time codes that achieve the diversity-multiplexing gain tradeoff. - Petros Elia; K. Raj Kumar; Sameer A. Pawar; P. Vijay Kumar; Hsiao-feng Lu (ISIT, 2005)

Achieving the DMD tradeoff of the MIMO-ARQ channel. - Sameer A. Pawar; K. Raj Kumar; P. Vijay Kumar; Petros Elia; B. A. Sethuraman (ISIT, 2005)

Perfect Space-Time Codes with Minimum and Non-Minimum Delay for Any Number of Antennas - Petros Elia; B. A. Sethuraman; P. Vijay Kumar (CoRR, 2005)

Approximately universal optimality over several dynamic and non-dynamic cooperative diversity schemes for wireless networks - Petros Elia; P. Vijay Kumar (CoRR, 2005)

Constructions of Cooperative Diversity Schemes for Asynchronous Wireless Networks. - Petros Elia; P. Vijay Kumar (ISIT, 2006)

Asymptotically Optimal Cooperative Wireless Networks without Constellation Expansion. - Petros Elia; P. Vijay Kumar; Frédérique E. Oggier (ISIT, 2006)

Explicit Space-Time Codes Achieving the Diversity-Multiplexing Gain Tradeoff. - Petros Elia; K. Raj Kumar; Sameer A. Pawar; P. Vijay Kumar; Hsiao-feng Lu (IEEE Trans. Inf. Theory, 2006)

Cooperative Diversity in Wireless Networks with Stochastic and Bursty Traffic. - Petros Elia; Somsak Kittipiyakul; Tara Javidi (ISIT, 2007)

On the Responsiveness-Diversity-Multiplexing Tradeoff. - Petros Elia; Somsak Kittipiyakul; Tara Javidi (WiOpt, 2007)

Approximately-Universal Space-Time Codes for the Parallel, Multi-Block and Cooperative-Dynamic-Decode-and-Forward Channels - Petros Elia; P. Vijay Kumar (CoRR, 2007)

Asymptotically optimal cooperative wireless networks with reduced signaling complexity. - Petros Elia; Frédérique E. Oggier; P. Vijay Kumar (IEEE J. Sel. Areas Commun., 2007)

Perfect Space-Time Codes for Any Number of Antennas. - Petros Elia; B. A. Sethuraman; P. Vijay Kumar (IEEE Trans. Inf. Theory, 2007)

Cooperative diversity schemes for asynchronous wireless networks. - Petros Elia; Somsak Kittipiyakul; Tara Javidi (Wirel. Pers. Commun., 2007)

Construction criteria and existence results for approximately universal linear space-time codes with reduced decoding complexity. - Petros Elia; Joakim Jaldén (Allerton, 2008)

Space-time codes that are approximately universal for the parallel, multi-block and cooperative DDF channels. - Petros Elia; P. Vijay Kumar (ISIT, 2009)

LR-aided MMSE lattice decoding is DMT optimal for all approximately universal codes. - Joakim Jaldén; Petros Elia (ISIT, 2009)

Large Families of Optimal Two-Dimensional Optical Orthogonal Codes - Reza Omrani; Gagan Garg; P. Vijay Kumar; Petros Elia; Pankaj Bhambhani (CoRR, 2009)

D-MG tradeoff and optimal codes for a class of AF and DF cooperative communication protocols. - Petros Elia; K. Vinodh; M. Anand 001; P. Vijay Kumar (IEEE Trans. Inf. Theory, 2009)

High-SNR Analysis of Outage-Limited Communications With Bursty and Delay-Limited Information. - Somsak Kittipiyakul; Petros Elia; Tara Javidi (IEEE Trans. Inf. Theory, 2009)

Space-time codes achieving the DMD tradeoff of the MIMO-ARQ channel. - Sameer A. Pawar; K. Raj Kumar; Petros Elia; P. Vijay Kumar; B. A. Sethuraman (IEEE Trans. Inf. Theory, 2009)

Soft biometrics systems: Reliability and asymptotic bounds. - Antitza Dantcheva; Jean-Luc Dugelay; Petros Elia (BTAS, 2010)

Fundamental rate-reliability-complexity limits in outage limited MIMO communications. - Petros Elia; Joakim Jaldén (ISIT, 2010)

Rate-of-decay of probability of isolation in dense sensor networks with bounding constraints. - Arun Singh 002; Petros Elia; Dirk T. M. Slock (ISIT, 2010)

Person recognition using a bag of facial soft biometrics (BoFSB). - Antitza Dantcheva; Jean-Luc Dugelay; Petros Elia (MMSP, 2010)

DMT optimality of LR-aided linear decoders for a general class of channels, lattice designs, and system models. - Joakim Jaldén; Petros Elia (IEEE Trans. Inf. Theory, 2010)

Vanishing the gap to exact lattice search at a subexponential complexity: LR-aided regularized decoding. - Arun Singh 002; Petros Elia; Joakim Jaldén (Allerton, 2011)

Search pruning in video surveillance systems: Efficiency-reliability tradeoff. - Antitza Dantcheva; Arun Singh 002; Petros Elia; Jean-Luc Dugelay (ICCV Workshops, 2011)

Relay-aided interference neutralization for the multiuser uplink-downlink asymmetric setting. - Jinyuan Chen; Petros Elia; Raymond Knopp (ISIT, 2011)

The complexity of sphere decoding perfect codes under a vanishing gap to ML performance. - Joakim Jaldén; Petros Elia (ISIT, 2011)

Interference neutralization for separated multiuser uplink-downlink with distributed relays. - Jinyuan Chen; Arun Singh 002; Petros Elia; Raymond Knopp (ITA, 2011)

Can imperfect delayed CSIT be as useful as perfect delayed CSIT? DoF analysis and constructions for the BC. - Jinyuan Chen; Petros Elia (Allerton Conference, 2012)

Interference alignment for achieving both full DoF and full diversity in the broadcast channel with delayed CSIT. - Jinyuan Chen; Raymond Knopp; Petros Elia (ISIT, 2012)

Feedback-aided complexity reductions in ML and lattice decoding. - Arun Singh 002; Petros Elia (ISIT, 2012)

Degrees-of-Freedom Region of the MISO Broadcast Channel with General Mixed-CSIT - Jinyuan Chen; Petros Elia (CoRR, 2012)

Imperfect Delayed CSIT can be as Useful as Perfect Delayed CSIT: DoF Analysis and Constructions for the BC - Jinyuan Chen; Petros Elia (CoRR, 2012)

Sphere Decoding Complexity Exponent for Decoding Full-Rate Codes Over the Quasi-Static MIMO Channel. - Joakim Jaldén; Petros Elia (IEEE Trans. Inf. Theory, 2012)

Large Families of Asymptotically Optimal Two-Dimensional Optical Orthogonal Codes. - Reza Omrani; Gagan Garg; P. Vijay Kumar; Petros Elia; Pankaj Bhambhani (IEEE Trans. Inf. Theory, 2012)

Achieving a Vanishing SNR Gap to Exact Lattice Decoding at a Subexponential Complexity. - Arun Kumar Singh 002; Petros Elia; Joakim Jaldén (IEEE Trans. Inf. Theory, 2012)

Optimal DoF region of the two-user MISO-BC with general alternating CSIT. - Jinyuan Chen; Petros Elia (ACSSC, 2013)

MISO broadcast channel with delayed and evolving CSIT. - Jinyuan Chen; Petros Elia (ISIT, 2013)

On the fundamental feedback-vs-performance tradeoff over the MISO-BC with imperfect and delayed CSIT. - Jinyuan Chen; Sheng Yang 001; Petros Elia (ISIT, 2013)

Rate-reliability-complexity tradeoff for ML and lattice decoding of full-rate codes. - Arun Singh 002; Petros Elia; Joakim Jaldén (ISIT, 2013)

MIMO BC with imperfect and delayed channel state information at the transmitter and receivers. - Jinyuan Chen; Petros Elia (SPAWC, 2013)

Toward the Performance vs. Feedback Tradeoff for the Two-User MISO Broadcast Channel. - Jinyuan Chen; Petros Elia (CoRR, 2013)

Symmetric Two-User MIMO BC and IC with Evolving Feedback. - Jinyuan Chen; Petros Elia (CoRR, 2013)

Toward the Performance Versus Feedback Tradeoff for the Two-User MISO Broadcast Channel. - Jinyuan Chen; Petros Elia (IEEE Trans. Inf. Theory, 2013)

An outer bound on the MIMO BC with evolving current CSIT and perfect delayed CSIT. - Jinyuan Chen; Petros Elia (ISCCSP, 2014)

On the vector broadcast channel with alternating CSIT: A topological perspective. - Jinyuan Chen; Petros Elia; Syed Ali Jafar (ISIT, 2014)

Symmetric two-user MIMO BC with evolving feedback. - Jinyuan Chen; Petros Elia (ITA, 2014)

Coded caching for reducing CSIT-feedback in wireless communications. - Jingjing Zhang 002; Felix Engelmann; Petros Elia (Allerton, 2015)

Achieving the DoF limits of the SISO X channel with imperfect-quality CSIT. - Jingjing Zhang 002; Dirk T. M. Slock; Petros Elia (ISIT, 2015)

On the Two-User MISO Broadcast Channel With Alternating CSIT: A Topological Perspective. - Jinyuan Chen; Petros Elia; Syed Ali Jafar (IEEE Trans. Inf. Theory, 2015)

Optimally bridging the gap from delayed to perfect CSIT in the K-user MISO BC. - Paul de Kerret; David Gesbert; Jingjing Zhang 002; Petros Elia (ITW, 2016)

Optimal Sum-DoF of the K-user MISO BC with Current and Delayed Feedback. - Paul de Kerret; David Gesbert; Jingjing Zhang 002; Petros Elia (CoRR, 2016)

The Synergistic Gains of Coded Caching and Delayed Feedback. - Jingjing Zhang 002; Petros Elia (CoRR, 2016)

What Else Does Your Biometric Data Reveal? A Survey on Soft Biometrics. - Antitza Dantcheva; Petros Elia; Arun Ross (IEEE Trans. Inf. Forensics Secur., 2016)

Performance-Complexity Analysis for MAC ML-Based Decoding With User Selection. - Hsiao-feng Lu; Petros Elia; Arun Kumar Singh 002 (IEEE Trans. Signal Process., 2016)

Feedback-aided coded caching for the MISO BC with small caches. - Jingjing Zhang 002; Petros Elia (ICC, 2017)

Wireless coded caching: A paradigm shift in wireless communications. - Petros Elia (ICT, 2017)

Cache-aided cooperation with no CSIT. - Eleftherios Lampiris; Jingjing Zhang 002; Petros Elia (ISIT, 2017)

Wireless coded caching: A topological perspective. - Jingjing Zhang 002; Petros Elia (ISIT, 2017)

A content-delivery protocol, exploiting the privacy benefits of coded caching. - Felix Engelmann; Petros Elia (WiOpt, 2017)

Fundamental Limits of Cache-Aided Wireless BC: Interplay of Coded-Caching and CSIT Feedback. - Jingjing Zhang 002; Petros Elia (IEEE Trans. Inf. Theory, 2017)

Adding Transmitters Allows Unbounded Coded-Caching Gains with Bounded File Sizes. - Eleftherios Lampiris; Petros Elia (ISIT, 2018)

Achieving Full Multiplexing and Unbounded Caching Gains with Bounded Feedback Resources. - Eleftherios Lampiris; Petros Elia (ISIT, 2018)

Coded Distributed Computing with Node Cooperation Substantially Increases Speedup Factors. - Emanuele Parrinello; Eleftherios Lampiris; Petros Elia (ISIT, 2018)

Optimal coded caching in heterogeneous networks with uncoded prefetching. - Emanuele Parrinello; Ayse Ünsal; Petros Elia (ITW, 2018)

Coded Caching with Shared Caches: Fundamental Limits with Uncoded Prefetching. - Emanuele Parrinello; Ayse Ünsal; Petros Elia (CoRR, 2018)

Resolving a Feedback Bottleneck of Multi-Antenna Coded Caching. - Eleftherios Lampiris; Petros Elia (CoRR, 2018)

Fundamental Limits of Caching in Heterogeneous Networks with Uncoded Prefetching. - Emanuele Parrinello; Ayse Ünsal; Petros Elia (CoRR, 2018)

Adding Transmitters Dramatically Boosts Coded-Caching Gains for Finite File Sizes. - Eleftherios Lampiris; Petros Elia (IEEE J. Sel. Areas Commun., 2018)

Bridging the Gap between Multiplexing and Diversity in Finite SNR Multiple Antenna Coded Caching. - Eleftherios Lampiris; Petros Elia; Giuseppe Caire (ACSSC, 2019)

Wyner's Network on Caches: Combining Receiver Caching with a Flexible Backhaul. - Eleftherios Lampiris; Aly El Gamal; Petros Elia (ISIT, 2019)

Mapping Heterogeneity Does Not Affect Wireless Coded MapReduce. - Eleftherios Lampiris; Daniel Jiménez Zorrilla; Petros Elia (ISIT, 2019)

Optimal Coded Caching under Statistical QoS Information. - Emanuele Parrinello; Ayse Ünsal; Petros Elia (ISIT, 2019)

Coded Caching with Optimized Shared-Cache Sizes. - Emanuele Parrinello; Petros Elia (ITW, 2019)

Multi-access coded caching: gains beyond cache-redundancy. - Berksan Serbetci; Emanuele Parrinello; Petros Elia (ITW, 2019)

Bridging two extremes: Multi-antenna Coded Caching with Reduced Subpacketization and CSIT. - Eleftherios Lampiris; Petros Elia (SPAWC, 2019)

Fundamental Limits of Wireless Caching under Uneven-Capacity Channels. - Eleftherios Lampiris; Jingjing Zhang 002; Osvaldo Simeone; Petros Elia (CoRR, 2019)

Stochastic Analysis of Coded Multicasting for Shared Caches Networks. - Adeel Malik; Berksan Serbetci; Emanuele Parrinello; Petros Elia (GLOBECOM, 2020)

Extending the Optimality Range of Multi-Antenna Coded Caching with Shared Caches. - Emanuele Parrinello; Petros Elia; Eleftherios Lampiris (ISIT, 2020)

Rate-Memory Trade-Off for the Cache-Aided MISO Broadcast Channel with Hybrid CSIT. - Antonio Bazco Nogueras; Petros Elia (ITW, 2020)

Resolving the Worst-User Bottleneck of Coded Caching: Exploiting Finite File Sizes. - Hui Zhao 010; Antonio Bazco Nogueras; Petros Elia (ITW, 2020)

Augmenting Multiple-Transmitter Coded Caching using Popularity Knowledge at the Transmitters. - Berksan Serbetci; Eleftherios Lampiris; Thrasyvoulos Spyropoulos; Petros Elia (WiOpt, 2020)

Fundamental Limits of Stochastic Caching Networks. - Adeel Malik; Berksan Serbetci; Emanuele Parrinello; Petros Elia (CoRR, 2020)

Optimal DoF of the K-User Broadcast Channel With Delayed and Imperfect Current CSIT. - Paul de Kerret; David Gesbert; Jingjing Zhang 002; Petros Elia (IEEE Trans. Inf. Theory, 2020)

Full Coded Caching Gains for Cache-Less Users. - Eleftherios Lampiris; Petros Elia (IEEE Trans. Inf. Theory, 2020)

Fundamental Limits of Coded Caching With Multiple Antennas, Shared Caches and Uncoded Prefetching. - Emanuele Parrinello; Ayse Ünsal; Petros Elia (IEEE Trans. Inf. Theory, 2020)

Coded Caching Gains at Low SNR Over Nakagami Fading Channels. - Hui Zhao 010; Antonio Bazco Nogueras; Petros Elia (ACSCC, 2021)

Coded Caching under Asynchronous Demands. - Eleftherios Lampiris; Hamdi Joudeh; Giuseppe Caire; Petros Elia (ISIT, 2021)

Wireless Coded Caching With Shared Caches Can Overcome the Near-Far Bottleneck. - Hui Zhao 010; Antonio Bazco Nogueras; Petros Elia (ISIT, 2021)

Multi-Antenna Coded Caching Analysis in Finite SNR and Finite Subpacketization. - Hui Zhao 010; Eleftherios Lampiris; Giuseppe Caire; Petros Elia (WSA, 2021)

Unselfish Coded Caching can Yield Unbounded Gains over Symmetrically Selfish Caching. - Federico Brunero; Petros Elia (CoRR, 2021)

Fundamental Limits of Stochastic Shared-Cache Networks. - Adeel Malik; Berksan Serbetci; Emanuele Parrinello; Petros Elia (IEEE Trans. Commun., 2021)

Fundamental Limits of Wireless Caching Under Mixed Cacheable and Uncacheable Traffic. - Hamdi Joudeh; Eleftherios Lampiris; Petros Elia; Giuseppe Caire (IEEE Trans. Inf. Theory, 2021)

Coded Caching in Land Mobile Satellite Systems. - Hui Zhao 010; Antonio Bazco Nogueras; Petros Elia (ICC, 2022)

Stochastic Coded Caching with Optimized Shared-Cache Sizes and Reduced Subpacketization. - Adeel Malik; Berksan Serbetci; Petros Elia (ICC, 2022)

Coded Caching Does Not Generally Benefit From Selfish Caching. - Federico Brunero; Petros Elia (ISIT, 2022)

The Exact Load-Memory Tradeoff of Multi-Access Coded Caching With Combinatorial Topology. - Federico Brunero; Petros Elia (ISIT, 2022)

On the Optimality of Coded Caching With Heterogeneous User Profiles. - Federico Brunero; Petros Elia (ITW, 2022)

Multi-User Linearly Separable Computation: A Coding Theoretic Approach. - Ali Khalesi; Petros Elia (ITW, 2022)

Vector Coded Caching Greatly Enhances Massive MIMO. - Hui Zhao 010; Antonio Bazco Nogueras; Petros Elia (SPAWC, 2022)

Resolving Cache-Load Imbalance Bottleneck of Stochastic Shared-Cache Networks. - Adeel Malik; Berksan Serbetci; Petros Elia (WCNC, 2022)

Vector Coded Caching Multiplicatively Boosts the Throughput of Realistic Downlink Systems. - Hui Zhao 010; Antonio Bazco Nogueras; Petros Elia (CoRR, 2022)

Unselfish Coded Caching Can Yield Unbounded Gains Over Selfish Caching. - Federico Brunero; Petros Elia (IEEE Trans. Inf. Theory, 2022)

Resolving the Feedback Bottleneck of Multi-Antenna Coded Caching. - Eleftherios Lampiris; Antonio Bazco Nogueras; Petros Elia (IEEE Trans. Inf. Theory, 2022)

Wireless Coded Caching Can Overcome the Worst-User Bottleneck by Exploiting Finite File Sizes. - Hui Zhao 010; Antonio Bazco Nogueras; Petros Elia (IEEE Trans. Wirel. Commun., 2022)

Low-Complexity High-Performance Cyclic Caching for Large MISO Systems. - Mohammad Javad Salehi; Emanuele Parrinello; Seyed Pooya Shariatpanahi; Petros Elia; Antti Tölli (IEEE Trans. Wirel. Commun., 2022)

Coded Caching Schemes for Multi-Access Topologies via Combinatorial Design Theory. - Minquan Cheng; Kai Wan; Petros Elia; Giuseppe Caire (ISIT, 2023)

Coded Distributed Computing for Sparse Functions With Structured Support. - Federico Brunero; Kai Wan; Giuseppe Caire; Petros Elia (ITW, 2023)

Multi-User Distributed Computing Via Compressed Sensing. - Ali Khalesi; Sajad Daei; Marios Kountouris; Petros Elia (ITW, 2023)

Fundamental Limits of Combinatorial Multi-Access Caching. - Federico Brunero; Petros Elia (IEEE Trans. Inf. Theory, 2023)

Vector Coded Caching Multiplicatively Increases the Throughput of Realistic Downlink Systems. - Hui Zhao 010; Antonio Bazco Nogueras; Petros Elia (IEEE Trans. Wirel. Commun., 2023)

Multi-Transmitter Coded Caching Networks With Transmitter-Side Knowledge of File Popularity. - Berksan Serbetci; Eleftherios Lampiris; Thrasyvoulos Spyropoulos; Giuseppe Caire; Petros Elia (IEEE/ACM Trans. Netw., 2023)

Multi-User Linearly-Separable Distributed Computing. - Ali Khalesi; Petros Elia (IEEE Trans. Inf. Theory, 2023)

Coded Caching in Networks With Heterogeneous User Activity. - Adeel Malik; Berksan Serbetci; Petros Elia (IEEE/ACM Trans. Netw., 2023)

Multi-Functional Distributed Computing. - Derya Malak; Mohammad Reza Deylam Salehi; Berksan Serbetci; Petros Elia (Allerton, 2024)

Perfect Multi-User Distributed Computing. - Ali Khalesi; Petros Elia (ISIT, 2024)

Exact SINR Analysis of Matched-filter Precoder. - Hui Zhao 010; Dirk Slock; Petros Elia (SPAWC, 2024)

Fundamental Limits of Topology-Aware Shared-Cache Networks. - Emanuele Parrinello; Antonio Bazco Nogueras; Petros Elia (IEEE Trans. Inf. Theory, 2024)

Multi-Access Distributed Computing. - Federico Brunero; Petros Elia (IEEE Trans. Inf. Theory, 2024)

Multi-Server Multi-Function Distributed Computation. - Derya Malak; Mohammad Reza Deylam Salehi; Berksan Serbetci; Petros Elia (Entropy, 2024)

NOMA-Aided Aggregated Coded Caching. - Hui Zhao 010; Dirk Slock; Petros Elia (WCNC, 2025)

Constructing Hamiltonian Decompositions of Complete k-Uniform Hypergraphs. - Javad Maheri; Petros Elia (CoRR, 2025)

Tessellated Distributed Computing. - Ali Khalesi; Petros Elia (IEEE Trans. Inf. Theory, 2025)

Coded Caching Schemes for Multiaccess Topologies via Combinatorial Design. - Minquan Cheng; Kai Wan; Petros Elia; Giuseppe Caire (IEEE Trans. Inf. Theory, 2025)