Publications

Preprints

• [i1] Elastic Sketch under Random Stationary Streams: Limiting Behavior and Near-Optimal Configuration
• [i2] Learning in Proportional Allocation Auctions Games

Journals

• [J4] Efficient and Optimal No-Regret Caching under Partial Observation
  Younes Ben Mazziane, Francescomaria Faticanti, Sara Alouf, Giovanni Neglia
  IEEE/ACM Transactions on Networking ,Volume 34, 2026
• [J3] 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., Volume 9, 2025
• [J2] TTL Model for an LRU-based Similarity Caching Policy
  Younes Ben Mazziane, Sara Alouf, Giovanni Neglia, Daniel S. Menasche
  Computer Networks, Volume 241, 2024
• [J1] Analyzing Count Min Sketch with Conservative Updates
  Younes Ben Mazziane, Sara Alouf, Giovanni Neglia
  Computer Networks, Volume 217, 2022

Conferences

• [C6]Best-Response Learning in Budgeted alpha-Fair Kelly Mechanisms
  Cleque-Marlain Mboulou-Moutoubi, Younes Ben Mazziane, Francesco De Pellegrini, Eitan Altman
  Netgcoop, 2025
• [C5] Universal and Tight Bounds on Counting Errors of Count-Min Sketch with Conservative Updates
  Younes Ben Mazziane, Othmane Marfoq
  ACM SIGMETRICS 2025
• [C4] Learning to Bid in Proportional Allocation Auctions with Budget Constraints
  Younes Ben Mazziane, Cleque-Marlain Mboulou-Moutoubi, Francesco De Pellegrini, Eitan Altman
  IEEE WiOpt 2025
• [C3] No-Regret Caching with Noisy Request Estimates
  Younes Ben Mazziane, Francescomaria Faticanti, Giovanni Neglia, Sara Alouf
  IEEE VCC 2023
• [C2] Computing the Hit Rate of Similarity Caching
  Younes Ben Mazziane, Sara Alouf, Giovanni Neglia, Daniel S. Menasche
  IEEE GLOBECOM 2022
• [C1] A Formal Analysis of the Count-Min Sketch with Conservative Updates
  Younes Ben Mazziane, Sara Alouf, Giovanni Neglia
  IEEE INFOCOM Workshops 2022