Maximilian Egger

Orcid: 0000-0003-2677-4074

According to our database1, Maximilian Egger authored at least 24 papers between 2022 and 2025.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Perfect Privacy for Discriminator-Based Byzantine-Resilient Federated Learning.
CoRR, June, 2025

Private Aggregation for Byzantine-Resilient Heterogeneous Federated Learning.
CoRR, June, 2025

Efficient Machine Unlearning by Model Splitting and Core Sample Selection.
CoRR, May, 2025

Multi-Terminal Remote Generation and Estimation Over a Broadcast Channel With Correlated Priors.
CoRR, May, 2025

Source Anonymity for Private Random Walk Decentralized Learning.
CoRR, May, 2025

Maximal-Capacity Discrete Memoryless Channel Identification.
IEEE Trans. Inf. Theory, February, 2025

BICompFL: Stochastic Federated Learning with Bi-Directional Compression.
CoRR, February, 2025

Byzantine-Resilient Zero-Order Optimization for Communication-Efficient Heterogeneous Federated Learning.
CoRR, February, 2025

Federated One-Shot Learning With Data Privacy and Objective-Hiding.
IEEE Trans. Inf. Forensics Secur., 2025

2024
Sparsity and Privacy in Secret Sharing: A Fundamental Trade-Off.
IEEE Trans. Inf. Forensics Secur., 2024

Communication-Efficient Byzantine-Resilient Federated Zero-Order Optimization.
CoRR, 2024

LoByITFL: Low Communication Secure and Private Federated Learning.
CoRR, 2024

Byzantine-Resilient Secure Aggregation for Federated Learning Without Privacy Compromises.
Proceedings of the IEEE Information Theory Workshop, 2024

Capacity-Maximizing Input Symbol Selection for Discrete Memoryless Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2024

Scalable and Reliable Over-the-Air Federated Edge Learning.
Proceedings of the 2024 IEEE Global Communications Conference, 2024

Self-Duplicating Random Walks for Resilient Decentralized Learning on Graphs.
Proceedings of the 2024 IEEE Global Communications Conference, 2024

2023
Sparse and Private Distributed Matrix Multiplication with Straggler Tolerance.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Private Aggregation in Wireless Federated Learning with Heterogeneous Clusters.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Fast and Straggler-Tolerant Distributed SGD with Reduced Computation Load.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Hide and Seek: Using Occlusion Techniques for Side-Channel Leakage Attribution in CNNs - An Evaluation of the ASCAD Databases.
Proceedings of the Applied Cryptography and Network Security Workshops, 2023

2022
Nested Gradient Codes for Straggler Mitigation in Distributed Machine Learning.
CoRR, 2022

Efficient Private Storage of Sparse Machine Learning Data.
Proceedings of the IEEE Information Theory Workshop, 2022

Efficient Distributed Machine Learning via Combinatorial Multi-Armed Bandits.
Proceedings of the IEEE International Symposium on Information Theory, 2022

A Second Look at the ASCAD Databases.
Proceedings of the Constructive Side-Channel Analysis and Secure Design, 2022


  Loading...