Younes Ben Mazziane

According to our database, Younes Ben Mazziane authored at least 11 papers between 2022 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2025

Efficient and Optimal No-Regret Caching under Partial Observation.

Younes Ben Mazziane, Francescomaria Faticanti, Sara Alouf, Giovanni Neglia

CoRR, March, 2025

Universal and Tight Bounds on Counting Errors of Count-Min Sketch with Conservative Updates.

Younes Ben Mazziane, Othmane Marfoq

Proc. ACM Meas. Anal. Comput. Syst., 2025

Learning to Bid in Proportional Allocation Auctions with Budget Constraints.

Younes Ben Mazziane, Cleque-marlain Mboulou-Moutoubi, Francesco De Pellegrini, Eitan Altman

Proceedings of the 23rd International Symposium on Modeling and Optimization in Mobile, 2025

2024

Probabilistic analysis for caching. (Analyse probabiliste pour le caching).

Younes Ben Mazziane

PhD thesis, 2024

Count-Min Sketch with Conservative Updates: Worst-Case Analysis.

Younes Ben Mazziane, Othmane Marfoq

CoRR, 2024

TTL model for an LRU-based similarity caching policy.

Younes Ben Mazziane, Sara Alouf, Giovanni Neglia, Daniel Sadoc Menasché

Comput. Networks, 2024

2023

Performance Model for Similarity Caching.

Younes Ben Mazziane, Sara Alouf, Giovanni Neglia, Daniel S. Menasché

CoRR, 2023

No- Regret Caching with Noisy Request Estimates.

Younes Ben Mazziane, Francescomaria Faticanti, Giovanni Neglia, Sara Alouf

Proceedings of the 2023 IEEE Virtual Conference on Communications (VCC), 2023

2022

Analyzing Count Min Sketch with Conservative Updates.

Younes Ben Mazziane, Sara Alouf, Giovanni Neglia

Comput. Networks, 2022

A Formal Analysis of the Count-Min Sketch with Conservative Updates.

Younes Ben Mazziane, Sara Alouf, Giovanni Neglia

Proceedings of the IEEE INFOCOM 2022, 2022

Computing the Hit Rate of Similarity Caching.

Younes Ben Mazziane, Sara Alouf, Giovanni Neglia, Daniel Sadoc Menasché

Proceedings of the IEEE Global Communications Conference, 2022