Petros Elia

Petros Elia

Eurecom

H-index: 27

Europe-France

About Petros Elia

Petros Elia, With an exceptional h-index of 27 and a recent h-index of 17 (since 2020), a distinguished researcher at Eurecom, specializes in the field of Caching, Wireless Communications, Information Theory.

His recent articles reflect a diverse array of research interests and contributions to the field:

Tessellated Distributed Computing

Multi-access distributed computing

Perfect Multi-User Distributed Computing

Exact SINR Analysis of Matched-filter Precoder

Coded Caching Schemes for Multiaccess Topologies via Combinatorial Design

Fundamental limits of topology-aware shared-cache networks

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

Multi-user linearly-separable distributed computing

Petros Elia Information

University

Position

Professor Communication Systems Department

Citations(all)

3193

Citations(since 2020)

1290

Cited By

2442

hIndex(all)

27

hIndex(since 2020)

17

i10Index(all)

63

i10Index(since 2020)

33

Email

University Profile Page

Google Scholar

Petros Elia Skills & Research Interests

Caching

Wireless Communications

Information Theory

Top articles of Petros Elia

Tessellated Distributed Computing

arXiv preprint arXiv:2404.14203

2024/4/22

Ali Khalesi
Ali Khalesi

H-Index: 0

Petros Elia
Petros Elia

H-Index: 15

Multi-access distributed computing

IEEE Transactions on Information Theory

2024/3/4

Federico Brunero
Federico Brunero

H-Index: 1

Petros Elia
Petros Elia

H-Index: 15

Perfect Multi-User Distributed Computing

arXiv preprint arXiv:2402.02621

2024/2/4

Ali Khalesi
Ali Khalesi

H-Index: 0

Petros Elia
Petros Elia

H-Index: 15

Exact SINR Analysis of Matched-filter Precoder

arXiv preprint arXiv:2401.16958

2024/1/30

Coded Caching Schemes for Multiaccess Topologies via Combinatorial Design

arXiv preprint arXiv:2310.20239

2023/10/31

Fundamental limits of topology-aware shared-cache networks

IEEE Transactions on Information Theory

2023/10/4

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

2023/6/25

Multi-user linearly-separable distributed computing

IEEE Transactions on Information Theory

2023/6/8

Ali Khalesi
Ali Khalesi

H-Index: 0

Petros Elia
Petros Elia

H-Index: 15

Coded caching in networks with heterogeneous user activity

IEEE/ACM Transactions on Networking

2023/5/1

Coded distributed computing for sparse functions with structured support

2023/4/23

Multi-User Distributed Computing Via Compressed Sensing

2023/5/11

Vector coded caching substantially boosts MU-MIMO: Pathloss, CSI and power-allocation considerations

2023/2/27

Hui Zhao
Hui Zhao

H-Index: 32

Petros Elia
Petros Elia

H-Index: 15

Multi-transmitter coded caching networks with transmitter-side knowledge of file popularity

IEEE/ACM Transactions on Networking

2022/11/10

Multi-user linearly separable computation: A coding theoretic approach

2022/11/1

Ali Khalesi
Ali Khalesi

H-Index: 0

Petros Elia
Petros Elia

H-Index: 15

On the Optimality of Coded Caching With Heterogeneous User Profiles

2022/11/1

Federico Brunero
Federico Brunero

H-Index: 1

Petros Elia
Petros Elia

H-Index: 15

Vector coded caching multiplicatively increases the throughput of realistic downlink systems

IEEE Transactions on Wireless Communications

2022/10/18

Unselfish coded caching can yield unbounded gains over selfish caching

IEEE Transactions on Information Theory

2022/8/1

Federico Brunero
Federico Brunero

H-Index: 1

Petros Elia
Petros Elia

H-Index: 15

Fundamental limits of combinatorial multi-access caching

IEEE Transactions on Information Theory

2022/7/25

Federico Brunero
Federico Brunero

H-Index: 1

Petros Elia
Petros Elia

H-Index: 15

Vector coded caching greatly enhances massive MIMO

2022/7/4

Coded Caching Does Not Generally Benefit From Selfish Caching

2022/6/26

Federico Brunero
Federico Brunero

H-Index: 1

Petros Elia
Petros Elia

H-Index: 15

See List of Professors in Petros Elia University(Eurecom)

Co-Authors

academic-engine