default search action
Richard Combes
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j20]Khodor Safa
, Richard Combes
Data Detection in 1-bit Quantized MIMO Systems. IEEE Trans. Commun. 72(9): 5396-5410 (2024) - [c39]Richard Combes:
An Extension of Mcdiarmid's Inequality. ISIT 2024: 79-84 - [c38]Sheng Yang, Richard Combes:
Asymptotic Capacity of Non-Coherent One-Bit MIMO Channels with Block Fading. ISIT 2024: 2359-2364 - [i30]Sheng Yang, Richard Combes:
Asymptotic Capacity of 1-Bit MIMO Fading Channels. CoRR abs/2407.16242 (2024) - 2023
- [c37]Jung-Hun Kim, Se-Young Yun, Minchan Jeong, Junhyun Nam, Jinwoo Shin, Richard Combes:
Contextual Linear Bandits under Noisy Features: Towards Bayesian Oracles. AISTATS 2023: 1624-1645 - [c36]Richard Combes, Raymond Zhang:
Curse of Dimension of Thompson Sampling for Combinatorial Bandits : (Invited presentation). Allerton 2023: 1 - 2022
- [c35]Wei Huang
Towards Optimal Algorithms for Multi-Player Bandits without Collision Sensing Information. COLT 2022: 1990-2012 - 2021
- [j19]Thibaut Cuvelier
Statistically Efficient, Polynomial-Time Algorithms for Combinatorial Semi-Bandits. Proc. ACM Meas. Anal. Comput. Syst. 5(1): 09:1-09:31 (2021) - [c34]Thibaut Cuvelier, Richard Combes, Eric Gourdin:
Asymptotically Optimal Strategies For Combinatorial Semi-Bandits in Polynomial Time. ALT 2021: 505-528 - [c33]Raymond Zhang, Richard Combes:
On the Suboptimality of Thompson Sampling in High Dimensions. NeurIPS 2021: 8345-8354 - [c32]Thibaut Cuvelier, Richard Combes, Eric Gourdin:
Statistically Efficient, Polynomial-Time Algorithms for Combinatorial Semi-Bandits. SIGMETRICS (Abstracts) 2021: 5-6 - [i29]Raymond Zhang, Richard Combes:
On the Suboptimality of Thompson Sampling in High Dimensions. CoRR abs/2102.05502 (2021) - [i28]Thibaut Cuvelier
Asymptotically Optimal Strategies For Combinatorial Semi-Bandits in Polynomial Time. CoRR abs/2102.07254 (2021) - [i27]Cindy Trinh, Richard Combes:
A High Performance, Low Complexity Algorithm for Multi-Player Bandits Without Collision Sensing Information. CoRR abs/2102.10200 (2021) - [i26]Wei Huang, Richard Combes, Cindy Trinh:
Towards Optimal Algorithms for Multi-Player Bandits without Collision Sensing Information. CoRR abs/2103.13059 (2021) - 2020
- [j18]Richard Combes, Alexandre Proutière, Alexandre Fauquette:
Unimodal Bandits with Continuous Arms: Order-optimal Regret without Smoothness. Proc. ACM Meas. Anal. Comput. Syst. 4(1): 14:1-14:28 (2020) - [j17]Thomas Varela Santana, Richard Combes
Performance Analysis of Device-to-Device Aided Multicasting in General Network Topologies. IEEE Trans. Commun. 68(1): 137-149 (2020) - [c31]Cindy Trinh, Emilie Kaufmann, Claire Vernade, Richard Combes:
Solving Bernoulli Rank-One Bandits with Unimodal Thompson Sampling. ALT 2020: 862-889 - [c30]Richard Combes, Alexandre Proutière, Alexandre Fauquette:
Unimodal Bandits with Continuous Arms: Order-optimal Regret without Smoothness. SIGMETRICS (Abstracts) 2020: 107-108 - [i25]Thibaut Cuvelier
Statistically Efficient, Polynomial Time Algorithms for Combinatorial Semi Bandits. CoRR abs/2002.07258 (2020) - [i24]Richard Combes, Mikael Touati:
Solving Random Parity Games in Polynomial Time. CoRR abs/2007.08387 (2020)
2010 – 2019
- 2019
- [j16]Richard Combes, Mikael Touati:
Computationally Efficient Estimation of the Spectral Gap of a Markov Chain. Proc. ACM Meas. Anal. Comput. Syst. 3(1): 7:1-7:21 (2019) - [j15]Richard Combes
Optimal Rate Sampling in 802.11 Systems: Theory, Design, and Implementation. IEEE Trans. Mob. Comput. 18(5): 1145-1158 (2019) - [c29]Richard Combes, Salah-Eddine Elayoubi, Thomas Varela Santana:
Optimal Retransmission Policies for Ultra-Reliable Low Latency Communications with Delayed Feedback. GLOBECOM 2019: 1-6 - [c28]Richard Combes, Mikael Touati:
Computationally Efficient Estimation of the Spectral Gap of a Markov Chain. SIGMETRICS (Abstracts) 2019: 99-100 - [i23]Cindy Trinh, Emilie Kaufmann, Claire Vernade, Richard Combes:
Solving Bernoulli Rank-One Bandits with Unimodal Thompson Sampling. CoRR abs/1912.03074 (2019) - 2018
- [j14]Richard Combes
Utility Optimal Scheduling for Coded Caching in General Topologies. IEEE J. Sel. Areas Commun. 36(8): 1692-1705 (2018) - [j13]Julien Floquet, Richard Combes
Hierarchical beamforming: Resource allocation, fairness and flow level performance. Perform. Evaluation 127-128: 36-55 (2018) - [j12]Julien Floquet, Richard Combes, Zwi Altman:
Hierarchical Beamforming: Resource Allocation, Fairness and Flow Level Performance. SIGMETRICS Perform. Evaluation Rev. 46(3): 70-71 (2018) - [j11]Mohammad Sadegh Talebi
Stochastic Online Shortest Path Routing: The Value of Feedback. IEEE Trans. Autom. Control. 63(4): 915-930 (2018) - [j10]Richard Combes
An Approximate ML Detector for MIMO Channels Corrupted by Phase Noise. IEEE Trans. Commun. 66(3): 1176-1189 (2018) - [c27]Richard Combes, Stefan Magureanu, Alexandre Proutière:
Generic Asymptotically Optimal Algorithms for Multi-Armed Bandits. Allerton 2018: 152 - [c26]Thomas Varela Santana, Richard Combes, Mari Kobayashi:
Device-to-Device Aided Multicasting. ISIT 2018: 771-775 - [c25]Richard Combes, Asma Ghorbel, Mari Kobayashi, Sheng Yang:
Utility Optimal Scheduling for Coded Caching in General Topologies. ISIT 2018: 1919-1923 - [i22]Richard Combes, Asma Ghorbel, Mari Kobayashi, Sheng Yang:
Utility Optimal Scheduling for Coded Caching in General Topologies. CoRR abs/1801.02594 (2018) - [i21]Thomas Varela Santana, Richard Combes, Mari Kobayashi:
Device-to-Device Aided Multicasting. CoRR abs/1801.05224 (2018) - [i20]Julien Floquet, Richard Combes, Zwi Altman:
Hierarchical Beamforming: Resource Allocation, Fairness and Flow Level Performance. CoRR abs/1805.06693 (2018) - [i19]Richard Combes, Mikael Touati:
Computationally Efficient Estimation of the Spectral Gap of a Markov Chain. CoRR abs/1806.06047 (2018) - 2017
- [j9]Richard Combes
Multipath Streaming: Fundamental Limits and Efficient Algorithms. IEEE J. Sel. Areas Commun. 35(1): 188-199 (2017) - [c24]Asma Ghorbel, Khac-Hoang Ngo
Opportunistic Content Delivery in Fading Broadcast Channels. GLOBECOM 2017: 1-6 - [c23]Richard Combes, Stefan Magureanu, Alexandre Proutière:
Minimal Exploration in Structured Stochastic Bandits. NIPS 2017: 1763-1771 - [c22]Thomas Bonald, Richard Combes:
A Minimax Optimal Algorithm for Crowdsourcing. NIPS 2017: 4352-4360 - [i18]Asma Ghorbel, Khac-Hoang Ngo, Richard Combes, Mari Kobayashi, Sheng Yang:
Opportunistic Content Delivery in Fading Broadcast Channels. CoRR abs/1702.02179 (2017) - [i17]Richard Combes, Sheng Yang:
An Approximate ML Detector for MIMO Channels Corrupted by Phase Noise. CoRR abs/1708.02321 (2017) - [i16]Richard Combes, Stefan Magureanu, Alexandre Proutière:
Minimal Exploration in Structured Stochastic Bandits. CoRR abs/1711.00400 (2017) - 2016
- [c21]Richard Combes, Habib Sidi, Salah-Eddine Elayoubi:
Multipath Streaming: Fundamental Limits and Efficient Algorithms. SIGMETRICS 2016: 391-392 - [i15]Thomas Bonald, Richard Combes:
A Streaming Algorithm for Crowdsourced Data Classification. CoRR abs/1602.07107 (2016) - [i14]Richard Combes, Habib Sidi, Salah-Eddine Elayoubi:
Multipath streaming: fundamental limits and efficient algorithms. CoRR abs/1602.07112 (2016) - [i13]Thomas Bonald, Richard Combes:
Crowdsourcing: Low complexity, Minimax Optimal Algorithms. CoRR abs/1606.00226 (2016) - 2015
- [j8]Richard Combes, Salah-Eddine Elayoubi, Arshad Ali
Optimal online control for sleep mode in green base stations. Comput. Networks 78: 140-151 (2015) - [j7]Richard Combes, Alexandre Proutière:
Dynamic Rate and Channel Selection in Cognitive Radio Systems. IEEE J. Sel. Areas Commun. 33(5): 910-921 (2015) - [c20]Richard Combes, Mohammad Sadegh Talebi, Alexandre Proutière, Marc Lelarge:
Combinatorial Bandits Revisited. NIPS 2015: 2116-2124 - [c19]Richard Combes, Stefan Magureanu, Alexandre Proutière, Cyrille Laroche:
Learning to Rank: Regret Lower Bounds and Efficient Algorithms. SIGMETRICS 2015: 231-244 - [c18]Richard Combes, Chong Jiang, Rayadurgam Srikant:
Bandits with Budgets: Regret Lower Bounds and Optimal Algorithms. SIGMETRICS 2015: 245-257 - [i12]Richard Combes, Marc Lelarge, Alexandre Proutière, M. Sadegh Talebi:
Stochastic and Adversarial Combinatorial Bandits. CoRR abs/1502.03475 (2015) - [i11]Richard Combes:
An extension of McDiarmid's inequality. CoRR abs/1511.05240 (2015) - 2014
- [j6]Abdoulaye Tall, Richard Combes, Zwi Altman, Eitan Altman:
Distributed Coordination of Self-Organizing Mechanisms in Communication Networks. IEEE Trans. Control. Netw. Syst. 1(4): 328-337 (2014) - [c17]Stefan Magureanu, Richard Combes, Alexandre Proutière:
Lipschitz Bandits: Regret Lower Bound and Optimal Algorithms. COLT 2014: 975-999 - [c16]Richard Combes, Alexandre Proutière:
Unimodal Bandits: Regret Lower Bounds and Optimal Algorithms. ICML 2014: 521-529 - [c15]Richard Combes, Alexandre Proutière, Donggyu Yun, Jungseul Ok, Yung Yi:
Optimal Rate Sampling in 802.11 systems. INFOCOM 2014: 2760-2767 - [i10]Richard Combes, Alexandre Proutière:
Dynamic Rate and Channel Selection in Cognitive Radio Systems. CoRR abs/1402.5666 (2014) - [i9]Stefan Magureanu, Richard Combes, Alexandre Proutière:
Lipschitz Bandits: Regret Lower Bounds and Optimal Algorithms. CoRR abs/1405.4758 (2014) - [i8]Richard Combes, Alexandre Proutière:
Unimodal Bandits: Regret Lower Bounds and Optimal Algorithms. CoRR abs/1405.5096 (2014) - [i7]Richard Combes, Alexandre Proutière:
Unimodal Bandits without Smoothness. CoRR abs/1406.7447 (2014) - 2013
- [j5]Sara Akbarzadeh, Richard Combes, Zwi Altman:
Self-organizing femtocell offloading at the flow level. Int. J. Netw. Manag. 23(4): 259-271 (2013) - [j4]Veeraruna Kavitha, Richard Combes:
Mixed polling with rerouting and applications. Perform. Evaluation 70(11): 1001-1027 (2013) - [c14]Richard Combes, Jean-Marc Kelif:
A justification of the fluid network model using stochastic geometry. ICC 2013: 6174-6178 - [c13]Nikolaos Koutsouris, Kostas Tsagkaris, Panagiotis Demestichas, Zwi Altman, Richard Combes, Pierre Peloso, Laurent Ciavaglia, Lefteris Mamatas, Stuart Clayman, Alex Galis:
Conflict free coordination of SON functions in a Unified Management Framework: Demonstration of a proof of concept prototyping platform. IM 2013: 1092-1093 - [c12]Richard Combes, Zwi Altman, Eitan Altman:
Interference coordination in wireless networks: A flow-level perspective. INFOCOM 2013: 2841-2849 - [c11]Kostas Tsagkaris
SON Coordination in a Unified Management Framework. VTC Spring 2013: 1-5 - [c10]Richard Combes, Zwi Altman, Eitan Altman:
Coordination of autonomic functionalities in communications networks. WiOpt 2013: 364-371 - [i6]Richard Combes, Ilham El Bouloumi, Stéphane Sénécal, Zwi Altman:
The association problem in wireless networks: a Policy Gradient Reinforcement Learning approach. CoRR abs/1306.2554 (2013) - [i5]Richard Combes, Alexandre Proutière, Donggyu Yun, Jungseul Ok, Yung Yi:
Optimal Rate Sampling in 802.11 Systems. CoRR abs/1307.7309 (2013) - [i4]Richard Combes, Eitan Altman:
Flow-level performance of random wireless networks. CoRR abs/1307.7375 (2013) - [i3]Veeraruna Kavitha, Richard Combes:
Mixed Polling with Rerouting and Applications. CoRR abs/1309.1365 (2013) - [i2]Abdoulaye Tall, Richard Combes, Zwi Altman, Eitan Altman:
Distributed coordination of self-organizing mechanisms in communication networks. CoRR abs/1309.5067 (2013) - 2012
- [j3]Louai Saker
Optimal Control of Wake Up Mechanisms of Femtocells in Heterogeneous Networks. IEEE J. Sel. Areas Commun. 30(3): 664-672 (2012) - [j2]Richard Combes, Zwi Altman, Eitan Altman:
Self-Organizing Relays: Dimensioning, Self-Optimization, and Learning. IEEE Trans. Netw. Serv. Manag. 9(4): 487-500 (2012) - [c9]Panagiotis Spapis, Rouzbeh Razavi, Stylianos Georgoulas, Zwi Altman, Richard Combes, Aimilia Bantouna:
On the role of learning in autonomic network management: The UniverSelf project approach. Future Network & Mobile Summit 2012: 1-8 - [c8]Richard Combes, Zwi Altman, Eitan Altman:
Self-organization in wireless networks: A flow-level perspective. INFOCOM 2012: 2946-2950 - [c7]Sara Akbarzadeh, Richard Combes, Zwi Altman:
Network capacity enhancement of OFDMA system using self-organized femtocell off-load. WCNC 2012: 1234-1238 - [i1]Richard Combes, Zwi Altman, Eitan Altman:
Coordination of autonomic functionalities in communications networks. CoRR abs/1209.1236 (2012) - 2011
- [j1]Richard Combes, Zwi Altman, Eitan Altman:
Scheduling gain for frequency-selective Rayleigh-fading channels with application to self-organizing packet scheduling. Perform. Evaluation 68(8): 690-709 (2011) - [c6]Richard Combes, Zwi Altman, Eitan Altman:
Self-organizing relays in LTE networks: Queuing analysis and algorithms. CNSM 2011: 1-8 - [c5]Richard Combes, Zwi Altman, Eitan Altman:
Self-Organizing Fractional Power Control for Interference Coordination in OFDMA Networks. ICC 2011: 1-5 - [c4]Richard Combes, Zwi Altman, Eitan Altman:
A self-optimization method for coverage-capacity optimization in OFDMA networks with MIMO. VALUETOOLS 2011: 37-46 - [c3]Eitan Altman, Richard Combes, Zwi Altman, Sylvain Sorin:
Routing games in the many players regime. VALUETOOLS 2011: 525-527 - [c2]Richard Combes, Salah-Eddine Elayoubi, Zwi Altman:
Cross-layer analysis of scheduling gains: Application to LMMSE receivers in frequency-selective Rayleigh-fading channels. WiOpt 2011: 133-139 - 2010
- [c1]Richard Combes, Zwi Altman, Eitan Altman:
On the use of packet scheduling in self-optimization processes: Application to coverage-capacity optimization. WiOpt 2010: 98-107
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-13 17:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: