Computing the Hit Rate of Similarity Caching. - Younes Ben Mazziane; Sara Alouf; Giovanni Neglia; Daniel Sadoc Menasché (GLOBECOM, 2022)

A Formal Analysis of the Count-Min Sketch with Conservative Updates. - Younes Ben Mazziane; Sara Alouf; Giovanni Neglia (INFOCOM Workshops, 2022)

Analyzing Count Min Sketch with Conservative Updates. - Younes Ben Mazziane; Sara Alouf; Giovanni Neglia (Comput. Networks, 2022)

No- Regret Caching with Noisy Request Estimates. - Younes Ben Mazziane; Francescomaria Faticanti; Giovanni Neglia; Sara Alouf (VCC, 2023)

Performance Model for Similarity Caching. - Younes Ben Mazziane; Sara Alouf; Giovanni Neglia; Daniel S. Menasché (CoRR, 2023)

TTL model for an LRU-based similarity caching policy. - Younes Ben Mazziane; Sara Alouf; Giovanni Neglia; Daniel Sadoc Menasché (Comput. Networks, 2024)

Count-Min Sketch with Conservative Updates: Worst-Case Analysis. - Younes Ben Mazziane; Othmane Marfoq (CoRR, 2024)

Probabilistic analysis for caching. (Analyse probabiliste pour le caching). - Younes Ben Mazziane (2024)

Learning to Bid in Proportional Allocation Auctions with Budget Constraints. - Younes Ben Mazziane; Cleque-marlain Mboulou-Moutoubi; Francesco De Pellegrini; Eitan Altman (WiOpt, 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)

Efficient and Optimal No-Regret Caching under Partial Observation. - Younes Ben Mazziane; Francescomaria Faticanti; Sara Alouf; Giovanni Neglia (CoRR, 2025)