| Combinatorial Bandits Revisited R Combes, M Lelarge, A Proutiere, MS Talebi NIPS 2015, 2015 | 325 | 2015 |
| Optimal control of wake up mechanisms of femtocells in heterogeneous networks L Saker, SE Elayoubi, R Combes, T Chahed IEEE journal on selected areas in communications 30 (3), 664-672, 2012 | 242 | 2012 |
| Lipschitz Bandits: Regret Lower Bounds and Optimal Algorithms S Magureanu, R Combes, A Proutiere COLT 2014, 2014 | 212 | 2014 |
| Unimodal bandits: Regret lower bounds and optimal algorithms R Combes, A Proutiere ICML 2014, 2014 | 203 | 2014 |
| Minimal exploration in structured stochastic bandits R Combes, S Magureanu, A Proutiere Advances in Neural Information Processing Systems 30, 2017 | 152 | 2017 |
| Learning to rank: Regret lower bounds and efficient algorithms R Combes, S Magureanu, A Proutiere, C Laroche Proceedings of the 2015 ACM SIGMETRICS international conference on …, 2015 | 103 | 2015 |
| Stochastic online shortest path routing: The value of feedback MS Talebi, Z Zou, R Combes, A Proutiere, M Johansson IEEE Transactions on Automatic Control 63 (4), 915-930, 2017 | 83 | 2017 |
| Optimal rate sampling in 802.11 systems: Theory, design, and implementation R Combes, J Ok, A Proutiere, D Yun, Y Yi IEEE Transactions on Mobile Computing 18 (5), 1145-1158, 2018 | 74 | 2018 |
| Bandits with budgets: Regret lower bounds and optimal algorithms R Combes, C Jiang, R Srikant ACM SIGMETRICS Performance Evaluation Review 43 (1), 245-257, 2015 | 70 | 2015 |
| Optimal Rate Sampling in 802.11 Systems R Combes, A Proutiere, D Yun, J Ok, Y Yi IEEE INFOCOM, 2013 | 59 | 2013 |
| A minimax optimal algorithm for crowdsourcing T Bonald, R Combes Advances in Neural Information Processing Systems 30, 2017 | 58 | 2017 |
| An extension of mcdiarmid's inequality R Combes 2024 IEEE International Symposium on Information Theory (ISIT), 79-84, 2024 | 55 | 2024 |
| Dynamic Rate and Channel Selection in Cognitive Radio Systems R Combes, A Proutiere Selected Areas in Communications, IEEE Journal on, 2014 | 55 | 2014 |
| Self-organization in wireless networks: A flow-level perspective R Combes, Z Altman, E Altman 2012 Proceedings IEEE INFOCOM, 2946-2950, 2012 | 43 | 2012 |
| Solving bernoulli rank-one bandits with unimodal thompson sampling C Trinh, E Kaufmann, C Vernade, R Combes Algorithmic Learning Theory, 862-889, 2020 | 41 | 2020 |
| Self-organizing relays: Dimensioning, self-optimization, and learning R Combes, Z Altman, E Altman IEEE Transactions on Network and Service Management 9 (4), 487-500, 2012 | 35 | 2012 |
| Optimal online control for sleep mode in green base stations R Combes, SE Elayoubi, A Ali, L Saker, T Chahed Computer Networks 78, 140-151, 2015 | 34 | 2015 |
| Distributed coordination of self-organizing mechanisms in communication networks A Tall, R Combes, Z Altman, E Altman Control of Network Systems, IEEE Transactions on 1 (4), 328 - 337, 2014 | 34 | 2014 |
| Self-optimizing strategies for interference coordination in OFDMA networks R Combes, Z Altman, M Haddad, E Altman 2011 IEEE International Conference on Communications Workshops (ICC), 1-5, 2011 | 33 | 2011 |
| Statistically efficient, polynomial-time algorithms for combinatorial semi-bandits T Cuvelier, R Combes, E Gourdin Proceedings of the ACM on Measurement and Analysis of Computing Systems 5 (1 …, 2021 | 32 | 2021 |
Alexandre ProutiereKTHVerified email at kth.se
