default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPetros Elia
Person information
SPARQL queries 
🛈 Please note that only 70% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j34]Derya Malak
, Mohammad Reza Deylam Salehi, Berksan Serbetci, Petros Elia:
Multi-Server Multi-Function Distributed Computation. Entropy 26(6): 448 (2024)- [j33]Emanuele Parrinello, Antonio Bazco Nogueras, Petros Elia:
Fundamental Limits of Topology-Aware Shared-Cache Networks. IEEE Trans. Inf. Theory 70(4): 2538-2565 (2024) - [j32]Federico Brunero, Petros Elia:
Multi-Access Distributed Computing. IEEE Trans. Inf. Theory 70(5): 3385-3398 (2024) - [c76]Derya Malak, Mohammad Reza Deylam Salehi, Berksan Serbetci, Petros Elia:
Multi-Functional Distributed Computing. Allerton 2024: 1-8 - [c75]Ali Khalesi, Petros Elia:
Perfect Multi-User Distributed Computing. ISIT 2024: 1349-1354 - [c74]Hui Zhao, Dirk Slock, Petros Elia:
Exact SINR Analysis of Matched-filter Precoder. SPAWC 2024: 901-905 - [i57]Hui Zhao, Dirk Slock, Petros Elia:
Exact SINR Analysis of Matched-filter Precoder. CoRR abs/2401.16958 (2024) - [i56]Ali Khalesi, Petros Elia:
Perfect Multi-User Distributed Computing. CoRR abs/2402.02621 (2024) - [i55]Ali Khalesi, Petros Elia:
Tessellated Distributed Computing. CoRR abs/2404.14203 (2024) - [i54]Derya Malak, Mohammad Reza Deylam Salehi, Berksan Serbetci, Petros Elia:
Multi-Server Multi-Function Distributed Computation. CoRR abs/2405.08732 (2024) - 2023
- [j31]Federico Brunero, Petros Elia:
Fundamental Limits of Combinatorial Multi-Access Caching. IEEE Trans. Inf. Theory 69(2): 1037-1056 (2023) - [j30]Ali Khalesi, Petros Elia:
Multi-User Linearly-Separable Distributed Computing. IEEE Trans. Inf. Theory 69(10): 6314-6339 (2023) - [j29]Berksan Serbetci, Eleftherios Lampiris, Thrasyvoulos Spyropoulos, Giuseppe Caire, Petros Elia:
Multi-Transmitter Coded Caching Networks With Transmitter-Side Knowledge of File Popularity. IEEE/ACM Trans. Netw. 31(3): 1277-1292 (2023) - [j28]Adeel Malik, Berksan Serbetci, Petros Elia:
Coded Caching in Networks With Heterogeneous User Activity. IEEE/ACM Trans. Netw. 31(6): 2886-2901 (2023) - [j27]Hui Zhao, Antonio Bazco Nogueras, Petros Elia:
Vector Coded Caching Multiplicatively Increases the Throughput of Realistic Downlink Systems. IEEE Trans. Wirel. Commun. 22(4): 2683-2698 (2023) - [c73]Minquan Cheng, Kai Wan, Petros Elia, Giuseppe Caire:
Coded Caching Schemes for Multi-Access Topologies via Combinatorial Design Theory. ISIT 2023: 144-149 - [c72]Federico Brunero, Kai Wan, Giuseppe Caire, Petros Elia:
Coded Distributed Computing for Sparse Functions With Structured Support. ITW 2023: 474-479 - [c71]Ali Khalesi, Sajad Daei, Marios Kountouris, Petros Elia:
Multi-User Distributed Computing Via Compressed Sensing. ITW 2023: 509-514 - [i53]Ali Khalesi, Sajad Daei, Marios Kountouris, Petros Elia:
Multi-User Distributed Computing Via Compressed Sensing. CoRR abs/2301.03448 (2023) - [i52]Emanuele Parrinello, Antonio Bazco Nogueras, Petros Elia:
Fundamental Limits of Topology-Aware Shared-Cache Networks. CoRR abs/2302.10036 (2023) - [i51]Minquan Cheng, Kai Wan, Petros Elia, Giuseppe Caire:
Coded Caching Schemes for Multiaccess Topologies via Combinatorial Design. CoRR abs/2310.20239 (2023) - 2022
- [j26]Eleftherios Lampiris, Antonio Bazco Nogueras, Petros Elia:
Resolving the Feedback Bottleneck of Multi-Antenna Coded Caching. IEEE Trans. Inf. Theory 68(4): 2331-2348 (2022) - [j25]Federico Brunero, Petros Elia:
Unselfish Coded Caching Can Yield Unbounded Gains Over Selfish Caching. IEEE Trans. Inf. Theory 68(12): 7871-7891 (2022) - [j24]Mohammad Javad Salehi, Emanuele Parrinello, Seyed Pooya Shariatpanahi, Petros Elia, Antti Tölli:
Low-Complexity High-Performance Cyclic Caching for Large MISO Systems. IEEE Trans. Wirel. Commun. 21(5): 3263-3278 (2022) - [j23]Hui Zhao, Antonio Bazco Nogueras, Petros Elia:
Wireless Coded Caching Can Overcome the Worst-User Bottleneck by Exploiting Finite File Sizes. IEEE Trans. Wirel. Commun. 21(7): 5450-5466 (2022) - [c70]Adeel Malik, Berksan Serbetci, Petros Elia:
Stochastic Coded Caching with Optimized Shared-Cache Sizes and Reduced Subpacketization. ICC 2022: 2918-2923 - [c69]Hui Zhao, Antonio Bazco Nogueras, Petros Elia:
Coded Caching in Land Mobile Satellite Systems. ICC 2022: 4571-4576 - [c68]Federico Brunero, Petros Elia:
Coded Caching Does Not Generally Benefit From Selfish Caching. ISIT 2022: 1139-1144 - [c67]Federico Brunero, Petros Elia:
The Exact Load-Memory Tradeoff of Multi-Access Coded Caching With Combinatorial Topology. ISIT 2022: 1701-1706 - [c66]Federico Brunero, Petros Elia:
On the Optimality of Coded Caching With Heterogeneous User Profiles. ITW 2022: 166-171 - [c65]Ali Khalesi, Petros Elia:
Multi-User Linearly Separable Computation: A Coding Theoretic Approach. ITW 2022: 428-433 - [c64]Hui Zhao, Antonio Bazco Nogueras, Petros Elia:
Vector Coded Caching Greatly Enhances Massive MIMO. SPAWC 2022: 1-5 - [c63]Adeel Malik, Berksan Serbetci, Petros Elia:
Resolving Cache-Load Imbalance Bottleneck of Stochastic Shared-Cache Networks. WCNC 2022: 304-309 - [i50]Adeel Malik, Berksan Serbetci, Petros Elia:
Coded Caching in Networks with Heterogeneous User Activity. CoRR abs/2201.10250 (2022) - [i49]Federico Brunero, Petros Elia:
Coded Caching Does Not Generally Benefit From Selfish Caching. CoRR abs/2202.03032 (2022) - [i48]Federico Brunero, Petros Elia:
The Exact Load-Memory Tradeoff of Multi-Access Coded Caching With Combinatorial Topology. CoRR abs/2202.03039 (2022) - [i47]Hui Zhao, Antonio Bazco Nogueras, Petros Elia:
Vector Coded Caching Multiplicatively Boosts the Throughput of Realistic Downlink Systems. CoRR abs/2202.07047 (2022) - [i46]Ali Khalesi, Petros Elia:
Multi-User Linearly-Separable Distributed Computing. CoRR abs/2206.11119 (2022) - [i45]Federico Brunero, Petros Elia:
Multi-Access Distributed Computing. CoRR abs/2206.12851 (2022) - [i44]Federico Brunero, Petros Elia:
On the Optimality of Coded Caching With Heterogeneous User Profiles. CoRR abs/2210.06066 (2022) - 2021
- [j22]Adeel Malik, Berksan Serbetci, Emanuele Parrinello, Petros Elia:
Fundamental Limits of Stochastic Shared-Cache Networks. IEEE Trans. Commun. 69(7): 4433-4447 (2021) - [j21]Hamdi Joudeh, Eleftherios Lampiris, Petros Elia, Giuseppe Caire:
Fundamental Limits of Wireless Caching Under Mixed Cacheable and Uncacheable Traffic. IEEE Trans. Inf. Theory 67(7): 4747-4767 (2021) - [c62]Hui Zhao, Antonio Bazco Nogueras, Petros Elia:
Coded Caching Gains at Low SNR Over Nakagami Fading Channels. ACSCC 2021: 26-32 - [c61]Hui Zhao, Antonio Bazco Nogueras, Petros Elia:
Wireless Coded Caching With Shared Caches Can Overcome the Near-Far Bottleneck. ISIT 2021: 350-355 - [c60]Eleftherios Lampiris, Hamdi Joudeh, Giuseppe Caire, Petros Elia:
Coded Caching under Asynchronous Demands. ISIT 2021: 718-723 - [c59]Hui Zhao, Eleftherios Lampiris, Giuseppe Caire, Petros Elia:
Multi-Antenna Coded Caching Analysis in Finite SNR and Finite Subpacketization. WSA 2021: 1-6 - [i43]Hui Zhao, Antonio Bazco Nogueras, Petros Elia:
Wireless Coded Caching Can Overcome the Worst-User Bottleneck by Exploiting Finite File Sizes. CoRR abs/2103.02967 (2021) - [i42]Eleftherios Lampiris, Berksan Serbetci, Thrasyvoulos Spyropoulos, Giuseppe Caire, Petros Elia:
Multi-Transmitter Coded Caching Networks with Transmitter-side Knowledge of File Popularity. CoRR abs/2103.11623 (2021) - [i41]Federico Brunero, Petros Elia:
Unselfish Coded Caching can Yield Unbounded Gains over Symmetrically Selfish Caching. CoRR abs/2109.04807 (2021) - [i40]Federico Brunero, Petros Elia:
Fundamental Limits of Combinatorial Multi-Access Caching. CoRR abs/2110.07426 (2021) - [i39]Adeel Malik, Berksan Serbetci, Petros Elia:
Stochastic Coded Caching with Optimized Shared-Cache Sizes and Reduced Subpacketization. CoRR abs/2112.14114 (2021) - 2020
- [j20]Emanuele Parrinello, Ayse Ünsal, Petros Elia:
Fundamental Limits of Coded Caching With Multiple Antennas, Shared Caches and Uncoded Prefetching. IEEE Trans. Inf. Theory 66(4): 2252-2268 (2020) - [j19]Paul de Kerret, David Gesbert, Jingjing Zhang, Petros Elia:
Optimal DoF of the K-User Broadcast Channel With Delayed and Imperfect Current CSIT. IEEE Trans. Inf. Theory 66(11): 7056-7066 (2020) - [j18]Eleftherios Lampiris, Petros Elia:
Full Coded Caching Gains for Cache-Less Users. IEEE Trans. Inf. Theory 66(12): 7635-7651 (2020) - [c58]Adeel Malik, Berksan Serbetci, Emanuele Parrinello, Petros Elia:
Stochastic Analysis of Coded Multicasting for Shared Caches Networks. GLOBECOM 2020: 1-6 - [c57]Emanuele Parrinello, Petros Elia, Eleftherios Lampiris:
Extending the Optimality Range of Multi-Antenna Coded Caching with Shared Caches. ISIT 2020: 1675-1680 - [c56]Hamdi Joudeh, Eleftherios Lampiris, Petros Elia, Giuseppe Caire:
Fundamental Limits of Wireless Caching Under Mixed Cacheable and Uncacheable Traffic. ISIT 2020: 1693-1698 - [c55]Antonio Bazco Nogueras, Petros Elia:
Rate-Memory Trade-Off for the Cache-Aided MISO Broadcast Channel with Hybrid CSIT. ITW 2020: 1-5 - [c54]Hui Zhao, Antonio Bazco Nogueras, Petros Elia:
Resolving the Worst-User Bottleneck of Coded Caching: Exploiting Finite File Sizes. ITW 2020: 1-5 - [c53]Berksan Serbetci, Eleftherios Lampiris, Thrasyvoulos Spyropoulos, Petros Elia:
Augmenting Multiple-Transmitter Coded Caching using Popularity Knowledge at the Transmitters. WiOpt 2020: 9-16 - [i38]Hamdi Joudeh, Eleftherios Lampiris, Petros Elia, Giuseppe Caire:
Fundamental Limits of Wireless Caching Under Mixed Cacheable and Uncacheable Traffic. CoRR abs/2002.07691 (2020) - [i37]Adeel Malik, Berksan Serbetci, Emanuele Parrinello, Petros Elia:
Fundamental Limits of Stochastic Caching Networks. CoRR abs/2005.13847 (2020) - [i36]Mohammad Javad Salehi, Emanuele Parrinello, Seyed Pooya Shariatpanahi, Petros Elia, Antti Tölli:
Low-Complexity High-Performance Cyclic Caching for Large MISO Systems. CoRR abs/2009.12231 (2020) - [i35]Antonio Bazco Nogueras, Petros Elia:
Rate-Memory Trade-Off for the Cache-Aided MISO Broadcast Channel with Hybrid CSIT. CoRR abs/2010.13109 (2020)
2010 – 2019
- 2019
- [c52]Eleftherios Lampiris, Petros Elia, Giuseppe Caire:
Bridging the Gap between Multiplexing and Diversity in Finite SNR Multiple Antenna Coded Caching. ACSSC 2019: 1272-1277 - [c51]Eleftherios Lampiris, Daniel Jiménez Zorrilla, Petros Elia:
Mapping Heterogeneity Does Not Affect Wireless Coded MapReduce. ISIT 2019: 1422-1426 - [c50]Eleftherios Lampiris, Aly El Gamal, Petros Elia:
Wyner's Network on Caches: Combining Receiver Caching with a Flexible Backhaul. ISIT 2019: 2014-2018 - [c49]Emanuele Parrinello, Ayse Ünsal, Petros Elia:
Optimal Coded Caching under Statistical QoS Information. ISIT 2019: 2987-2991 - [c48]Emanuele Parrinello, Petros Elia:
Coded Caching with Optimized Shared-Cache Sizes. ITW 2019: 1-5 - [c47]Berksan Serbetci, Emanuele Parrinello, Petros Elia:
Multi-access coded caching: gains beyond cache-redundancy. ITW 2019: 1-5 - [c46]Eleftherios Lampiris, Petros Elia:
Bridging two extremes: Multi-antenna Coded Caching with Reduced Subpacketization and CSIT. SPAWC 2019: 1-5 - [i34]Eleftherios Lampiris, Aly El Gamal, Petros Elia:
Wyner's Network on Caches: Combining Receiver Caching with a Flexible Backhaul. CoRR abs/1903.06515 (2019) - [i33]Eleftherios Lampiris, Jingjing Zhang, Osvaldo Simeone, Petros Elia:
Fundamental Limits of Wireless Caching under Uneven-Capacity Channels. CoRR abs/1908.04036 (2019) - 2018
- [j17]Eleftherios Lampiris, Petros Elia:
Adding Transmitters Dramatically Boosts Coded-Caching Gains for Finite File Sizes. IEEE J. Sel. Areas Commun. 36(6): 1176-1188 (2018) - [c45]Emanuele Parrinello, Eleftherios Lampiris, Petros Elia:
Coded Distributed Computing with Node Cooperation Substantially Increases Speedup Factors. ISIT 2018: 1291-1295 - [c44]Eleftherios Lampiris, Petros Elia:
Adding Transmitters Allows Unbounded Coded-Caching Gains with Bounded File Sizes. ISIT 2018: 1435-1439 - [c43]Eleftherios Lampiris, Petros Elia:
Achieving Full Multiplexing and Unbounded Caching Gains with Bounded Feedback Resources. ISIT 2018: 1440-1444 - [c42]Eleftherios Lampiris, Petros Elia:
Full Coded Caching Gains for Cache-less Users. ITW 2018: 1-5 - [c41]Emanuele Parrinello, Ayse Ünsal, Petros Elia:
Optimal coded caching in heterogeneous networks with uncoded prefetching. ITW 2018: 1-5 - [i32]Eleftherios Lampiris, Petros Elia:
Adding transmitters dramatically boosts coded-caching gains for finite file sizes. CoRR abs/1802.03389 (2018) - [i31]Emanuele Parrinello, Eleftherios Lampiris, Petros Elia:
Coded Distributed Computing with Node Cooperation Substantially Increases Speedup Factors. CoRR abs/1802.04172 (2018) - [i30]Eleftherios Lampiris, Petros Elia:
Full Coded Caching Gains for Cache-less Users. CoRR abs/1806.07800 (2018) - [i29]Emanuele Parrinello, Ayse Ünsal, Petros Elia:
Coded Caching with Shared Caches: Fundamental Limits with Uncoded Prefetching. CoRR abs/1809.09422 (2018) - [i28]Eleftherios Lampiris, Petros Elia:
Resolving a Feedback Bottleneck of Multi-Antenna Coded Caching. CoRR abs/1811.03935 (2018) - [i27]Emanuele Parrinello, Ayse Ünsal, Petros Elia:
Fundamental Limits of Caching in Heterogeneous Networks with Uncoded Prefetching. CoRR abs/1811.06247 (2018) - 2017
- [j16]Jingjing Zhang, Petros Elia:
Fundamental Limits of Cache-Aided Wireless BC: Interplay of Coded-Caching and CSIT Feedback. IEEE Trans. Inf. Theory 63(5): 3142-3160 (2017) - [c40]Jingjing Zhang, Petros Elia:
Feedback-aided coded caching for the MISO BC with small caches. ICC 2017: 1-6 - [c39]Petros Elia:
Wireless coded caching: A paradigm shift in wireless communications. ICT 2017: 1-97 - [c38]Jingjing Zhang, Petros Elia:
Wireless coded caching: A topological perspective. ISIT 2017: 401-405 - [c37]Eleftherios Lampiris, Jingjing Zhang, Petros Elia:
Cache-aided cooperation with no CSIT. ISIT 2017: 2960-2964 - [c36]Felix Engelmann, Petros Elia:
A content-delivery protocol, exploiting the privacy benefits of coded caching. WiOpt 2017: 1-6 - 2016
- [j15]Antitza Dantcheva, Petros Elia, Arun Ross:
What Else Does Your Biometric Data Reveal? A Survey on Soft Biometrics. IEEE Trans. Inf. Forensics Secur. 11(3): 441-467 (2016) - [j14]Hsiao-feng Lu, Petros Elia, Arun Kumar Singh:
Performance-Complexity Analysis for MAC ML-Based Decoding With User Selection. IEEE Trans. Signal Process. 64(7): 1867-1880 (2016) - [c35]Jingjing Zhang, Petros Elia:
Fundamental limits of cache-aided wireless BC: Interplay of coded-caching and CSIT feedback. Allerton 2016: 924-932 - [c34]Paul de Kerret, David Gesbert, Jingjing Zhang, Petros Elia:
Optimally bridging the gap from delayed to perfect CSIT in the K-user MISO BC. ITW 2016: 300-304 - [i26]Paul de Kerret, David Gesbert, Jingjing Zhang, Petros Elia:
Optimal Sum-DoF of the K-user MISO BC with Current and Delayed Feedback. CoRR abs/1604.01653 (2016) - [i25]Jingjing Zhang, Petros Elia:
The Synergistic Gains of Coded Caching and Delayed Feedback. CoRR abs/1604.06531 (2016) - [i24]Jingjing Zhang, Petros Elia:
Feedback-Aided Coded Caching for the MISO BC with Small Caches. CoRR abs/1606.05396 (2016) - [i23]Jingjing Zhang, Petros Elia:
Wireless Coded Caching: A Topological Perspective. CoRR abs/1606.08253 (2016) - 2015
- [j13]Jinyuan Chen, Petros Elia, Syed Ali Jafar:
On the Two-User MISO Broadcast Channel With Alternating CSIT: A Topological Perspective. IEEE Trans. Inf. Theory 61(8): 4345-4366 (2015) - [c33]Jingjing Zhang, Felix Engelmann, Petros Elia:
Coded caching for reducing CSIT-feedback in wireless communications. Allerton 2015: 1099-1105 - [c32]Jingjing Zhang, Dirk T. M. Slock, Petros Elia:
Achieving the DoF limits of the SISO X channel with imperfect-quality CSIT. ISIT 2015: 626-630 - [i22]Hsiao-feng Lu, Petros Elia, Arun Kumar Singh:
Performance-Complexity Analysis for MAC ML-based Decoding with User Selection. CoRR abs/1505.07725 (2015) - [i21]Jingjing Zhang, Petros Elia:
Fundamental Limits of Cache-Aided Wireless BC: Interplay of Coded-Caching and CSIT Feedback. CoRR abs/1511.03961 (2015) - 2014
- [c31]Jinyuan Chen, Petros Elia:
An outer bound on the MIMO BC with evolving current CSIT and perfect delayed CSIT. ISCCSP 2014: 169-172 - [c30]Jinyuan Chen, Petros Elia, Syed Ali Jafar:
On the vector broadcast channel with alternating CSIT: A topological perspective. ISIT 2014: 2579-2583 - [c29]Jinyuan Chen, Petros Elia:
Symmetric two-user MIMO BC with evolving feedback. ITA 2014: 1-5 - [i20]Jinyuan Chen, Petros Elia, Syed Ali Jafar:
On the Vector Broadcast Channel with Alternating CSIT: A Topological Perspective. CoRR abs/1402.5912 (2014) - 2013
- [j12]Jinyuan Chen, Petros Elia:
Toward the Performance Versus Feedback Tradeoff for the Two-User MISO Broadcast Channel. IEEE Trans. Inf. Theory 59(12): 8336-8356 (2013) - [c28]Jinyuan Chen, Petros Elia:
Optimal DoF region of the two-user MISO-BC with general alternating CSIT. ACSSC 2013: 1860-1864 - [c27]Jinyuan Chen, Petros Elia:
MISO broadcast channel with delayed and evolving CSIT. ISIT 2013: 992-996 - [c26]Jinyuan Chen, Sheng Yang, Petros Elia:
On the fundamental feedback-vs-performance tradeoff over the MISO-BC with imperfect and delayed CSIT. ISIT 2013: 997-1001 - [c25]Arun Kumar Singh, Petros Elia, Joakim Jaldén:
Rate-reliability-complexity tradeoff for ML and lattice decoding of full-rate codes. ISIT 2013: 1267-1271 - [c24]Jinyuan Chen, Petros Elia:
MIMO BC with imperfect and delayed channel state information at the transmitter and receivers. SPAWC 2013: 195-199 - [i19]Jinyuan Chen, Sheng Yang, Petros Elia:
On the Fundamental Feedback-vs-Performance Tradeoff over the MISO-BC with Imperfect and Delayed CSIT. CoRR abs/1302.0806 (2013) - [i18]Jinyuan Chen, Petros Elia:
Optimal DoF Region of the Two-User MISO-BC with General Alternating CSIT. CoRR abs/1303.4352 (2013) - [i17]Jinyuan Chen, Petros Elia:
Toward the Performance vs. Feedback Tradeoff for the Two-User MISO Broadcast Channel. CoRR abs/1306.1751 (2013) - [i16]Jinyuan Chen, Petros Elia:
Symmetric Two-User MIMO BC and IC with Evolving Feedback. CoRR abs/1306.3710 (2013) - 2012
- [j11]Reza Omrani, Gagan Garg, P. Vijay Kumar, Petros Elia, Pankaj Bhambhani:
Large Families of Asymptotically Optimal Two-Dimensional Optical Orthogonal Codes. IEEE Trans. Inf. Theory 58(2): 1163-1185 (2012) - [j10]Arun Kumar Singh, Petros Elia, Joakim Jaldén:
Achieving a Vanishing SNR Gap to Exact Lattice Decoding at a Subexponential Complexity. IEEE Trans. Inf. Theory 58(6): 3692-3707 (2012) - [j9]Joakim Jaldén, Petros Elia:
Sphere Decoding Complexity Exponent for Decoding Full-Rate Codes Over the Quasi-Static MIMO Channel. IEEE Trans. Inf. Theory 58(9): 5785-5803 (2012) - [c23]Jinyuan Chen, Petros Elia:
Can imperfect delayed CSIT be as useful as perfect delayed CSIT? DoF analysis and constructions for the BC. Allerton Conference 2012: 1254-1261 - [c22]Jinyuan Chen, Raymond Knopp, Petros Elia:
Interference alignment for achieving both full DoF and full diversity in the broadcast channel with delayed CSIT. ISIT 2012: 1887-1891 - [c21]Arun Kumar Singh, Petros Elia:
Feedback-aided complexity reductions in ML and lattice decoding. ISIT 2012: 2816-2820 - [i15]Jinyuan Chen, Petros Elia:
Degrees-of-Freedom Region of the MISO Broadcast Channel with General Mixed-CSIT. CoRR abs/1205.3474 (2012) - [i14]Jinyuan Chen, Petros Elia:
Imperfect Delayed CSIT can be as Useful as Perfect Delayed CSIT: DoF Analysis and Constructions for the BC. CoRR abs/1206.5426 (2012) - [i13]Jinyuan Chen, Petros Elia:
MISO Broadcast Channel with Delayed and Evolving CSIT. CoRR abs/1211.1622 (2012) - 2011
- [c20]Arun Kumar Singh, Petros Elia, Joakim Jaldén:
Vanishing the gap to exact lattice search at a subexponential complexity: LR-aided regularized decoding. Allerton 2011: 531-538 - [c19]Antitza Dantcheva, Arun Kumar Singh, Petros Elia, Jean-Luc Dugelay:
Search pruning in video surveillance systems: Efficiency-reliability tradeoff. ICCV Workshops 2011: 1356-1363 - [c18]Jinyuan Chen, Petros Elia, Raymond Knopp:
Relay-aided interference neutralization for the multiuser uplink-downlink asymmetric setting. ISIT 2011: 264-268 - [c17]Joakim Jaldén, Petros Elia:
The complexity of sphere decoding perfect codes under a vanishing gap to ML performance. ISIT 2011: 2836-2840 - [c16]Jinyuan Chen, Arun Kumar Singh, Petros Elia, Raymond Knopp:
Interference neutralization for separated multiuser uplink-downlink with distributed relays. ITA 2011: 524-532 - [i12]Joakim Jaldén, Petros Elia:
Sphere decoding complexity exponent for decoding full rate codes over the quasi-static MIMO channel. CoRR abs/1102.1265 (2011) - [i11]Arun Kumar Singh, Petros Elia, Joakim Jaldén:
Achieving a vanishing SNR-gap to exact lattice decoding at a subexponential complexity. CoRR abs/1107.4021 (2011) - 2010
- [j8]Joakim Jaldén, Petros Elia:
DMT optimality of LR-aided linear decoders for a general class of channels, lattice designs, and system models. IEEE Trans. Inf. Theory 56(10): 4765-4780 (2010) - [c15]Antitza Dantcheva, Jean-Luc Dugelay, Petros Elia:
Soft biometrics systems: Reliability and asymptotic bounds. BTAS 2010: 1-6 - [c14]Arun Kumar Singh, Petros Elia, Dirk T. M. Slock:
Rate-of-decay of probability of isolation in dense sensor networks with bounding constraints. ISIT 2010: 1898-1902 - [c13]Petros Elia, Joakim Jaldén:
Fundamental rate-reliability-complexity limits in outage limited MIMO communications. ISIT 2010: 2203-2207 - [c12]Antitza Dantcheva, Jean-Luc Dugelay, Petros Elia:
Person recognition using a bag of facial soft biometrics (BoFSB). MMSP 2010: 511-516 - [i10]Petros Elia, Joakim Jaldén:
Fundamental Rate-Reliability-Complexity Limits in Outage Limited MIMO Communications. CoRR abs/1006.4524 (2010)
2000 – 2009
- 2009
- [j7]Somsak Kittipiyakul, Petros Elia, Tara Javidi:
High-SNR Analysis of Outage-Limited Communications With Bursty and Delay-Limited Information. IEEE Trans. Inf. Theory 55(2): 746-763 (2009) - [j6]Sameer A. Pawar, K. Raj Kumar, Petros Elia, P. Vijay Kumar, B. A. Sethuraman:
Space-time codes achieving the DMD tradeoff of the MIMO-ARQ channel. IEEE Trans. Inf. Theory 55(7): 3101-3114 (2009) - [j5]Petros Elia, K. Vinodh, M. Anand, P. Vijay Kumar:
D-MG tradeoff and optimal codes for a class of AF and DF cooperative communication protocols. IEEE Trans. Inf. Theory 55(7): 3161-3185 (2009) - [c11]Joakim Jaldén, Petros Elia:
LR-aided MMSE lattice decoding is DMT optimal for all approximately universal codes. ISIT 2009: 1263-1267 - [c10]Petros Elia, P. Vijay Kumar:
Space-time codes that are approximately universal for the parallel, multi-block and cooperative DDF channels. ISIT 2009: 2813-2817 - [i9]Joakim Jaldén, Petros Elia:
LR-aided MMSE lattice decoding is DMT optimal for all approximately universal codes. CoRR abs/0901.4267 (2009) - [i8]Joakim Jaldén, Petros Elia:
DMT Optimality of LR-Aided Linear Decoders for a General Class of Channels, Lattice Designs, and System Models. CoRR abs/0905.4023 (2009) - [i7]Reza Omrani, Gagan Garg, P. Vijay Kumar, Petros Elia, Pankaj Bhambhani:
Large Families of Optimal Two-Dimensional Optical Orthogonal Codes. CoRR abs/0911.0143 (2009) - 2008
- [c9]Petros Elia, Joakim Jaldén:
Construction criteria and existence results for approximately universal linear space-time codes with reduced decoding complexity. Allerton 2008: 1359-1364 - [i6]Somsak Kittipiyakul, Petros Elia, Tara Javidi:
High-SNR Analysis of Outage-Limited Communications with Bursty and Delay-Limited Information. CoRR abs/0809.1039 (2008) - 2007
- [j4]Petros Elia, Frédérique E. Oggier, P. Vijay Kumar:
Asymptotically optimal cooperative wireless networks with reduced signaling complexity. IEEE J. Sel. Areas Commun. 25(2): 258-267 (2007) - [j3]Petros Elia, B. A. Sethuraman, P. Vijay Kumar:
Perfect Space-Time Codes for Any Number of Antennas. IEEE Trans. Inf. Theory 53(11): 3853-3868 (2007) - [j2]Petros Elia, Somsak Kittipiyakul, Tara Javidi:
Cooperative diversity schemes for asynchronous wireless networks. Wirel. Pers. Commun. 43(1): 3-12 (2007) - [c8]Petros Elia, Somsak Kittipiyakul, Tara Javidi:
Cooperative Diversity in Wireless Networks with Stochastic and Bursty Traffic. ISIT 2007: 361-365 - [c7]Petros Elia, K. Vinodh, M. Anand, P. Vijay Kumar:
D-MG Tradeoff and Optimal Codes for a Class of AF and DF Cooperative Communication Protocols. ISIT 2007: 681-685 - [c6]Petros Elia, Somsak Kittipiyakul, Tara Javidi:
On the Responsiveness-Diversity-Multiplexing Tradeoff. WiOpt 2007: 1-8 - [i5]Petros Elia, P. Vijay Kumar:
Approximately-Universal Space-Time Codes for the Parallel, Multi-Block and Cooperative-Dynamic-Decode-and-Forward Channels. CoRR abs/0706.3502 (2007) - 2006
- [j1]Petros Elia, K. Raj Kumar, Sameer A. Pawar, P. Vijay Kumar, Hsiao-feng Lu:
Explicit Space-Time Codes Achieving the Diversity-Multiplexing Gain Tradeoff. IEEE Trans. Inf. Theory 52(9): 3869-3884 (2006) - [c5]Petros Elia, P. Vijay Kumar:
Constructions of Cooperative Diversity Schemes for Asynchronous Wireless Networks. ISIT 2006: 2724-2728 - [c4]Petros Elia, P. Vijay Kumar, Frédérique E. Oggier:
Asymptotically Optimal Cooperative Wireless Networks without Constellation Expansion. ISIT 2006: 2729-2733 - [i4]Petros Elia, K. Raj Kumar, Sameer A. Pawar, P. Vijay Kumar, Hsiao-feng Lu:
Explicit Space-Time Codes Achieving The Diversity-Multiplexing Gain Tradeoff. CoRR abs/cs/0602054 (2006) - [i3]Petros Elia, K. Vinodh, M. Anand, P. Vijay Kumar:
D-MG Tradeoff and Optimal Codes for a Class of AF and DF Cooperative Communication Protocols. CoRR abs/cs/0611156 (2006) - 2005
- [c3]Petros Elia, K. Raj Kumar, Sameer A. Pawar, P. Vijay Kumar, Hsiao-feng Lu:
Explicit space-time codes that achieve the diversity-multiplexing gain tradeoff. ISIT 2005: 896-900 - [c2]Sameer A. Pawar, K. Raj Kumar, P. Vijay Kumar, Petros Elia, B. A. Sethuraman:
Achieving the DMD tradeoff of the MIMO-ARQ channel. ISIT 2005: 901-905 - [i2]Petros Elia, B. A. Sethuraman, P. Vijay Kumar:
Perfect Space-Time Codes with Minimum and Non-Minimum Delay for Any Number of Antennas. CoRR abs/cs/0512023 (2005) - [i1]Petros Elia, P. Vijay Kumar:
Approximately universal optimality over several dynamic and non-dynamic cooperative diversity schemes for wireless networks. CoRR abs/cs/0512028 (2005) - 2004
- [c1]Reza Omrani, Petros Elia, P. Vijay Kumar:
New Constructions and Bounds for 2-D Optical Orthogonal Codes. SETA 2004: 389-395
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-30 01:11 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
