On the fly detection of the top-k items in the distributed sliding window model, Proc. of the 17th IEEE International Symposium on Network Computing and Applications (NCA 2018), pp.1-8, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01888298
Identifying global icebergs in distributed streams, Proc. of the 34th IEEE Symposium on Reliable Distributed Systems (SRDS), pp.266-275, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01141829
New results on a generalized coupon collector problem using markov chains, Journal of Applied Probability, vol.52, issue.2, pp.405-418, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-00950161
Survivors in leader election algorithms, Statistics & Probability Letters, vol.83, issue.12, pp.2743-2749, 2013. ,
Efficient computation of frequent and top-k elements in data streams, Proc. of the 10th International Conference on Database Theory (ICDT), 2005. ,
Top-k frequent items and item frequency tracking over sliding windows of any sizes, Proc. of the 2017 IEEE 33rd International Conference on Data Engineering, 2017. ,
Persistent data sketching, Proc. of the 2015 ACM International Conference on Management of Data (SIGMOD), 2015. ,