| Analyzing count min sketch with conservative updates YB Mazziane, S Alouf, G Neglia Computer Networks 217, 109315, 2022 | 11 | 2022 |
| A formal analysis of the count-min sketch with conservative updates YB Mazziane, S Alouf, G Neglia IEEE INFOCOM 2022-IEEE Conference on Computer Communications Workshops …, 2022 | 6 | 2022 |
| Computing the hit rate of similarity caching YB Mazziane, S Alouf, G Neglia, DS Menasche GLOBECOM 2022-2022 IEEE Global Communications Conference, 141-146, 2022 | 5 | 2022 |
| TTL model for an LRU-based similarity caching policy YB Mazziane, S Alouf, G Neglia, DS Menasche Computer Networks 241, 110206, 2024 | 4 | 2024 |
| No-regret caching with noisy request estimates YB Mazziane, F Faticanti, G Neglia, S Alouf 2023 IEEE Virtual Conference on Communications (VCC), 341-346, 2023 | 2 | 2023 |
| Count-Min Sketch with Conservative Updates: Worst-Case Analysis YB Mazziane, O Marfoq arXiv preprint arXiv:2405.12034, 2024 | | 2024 |
| Probabilistic analysis for caching YB Mazziane Université Côte d'Azur, 2024 | | 2024 |
Sara AloufInriaVerified email at inria.fr