Name
Affiliation
Papers
ALEXANDRE PROUTIERE
KTH Royal Inst Technol, Stockholm, Sweden
61
Collaborators
Citations 
PageRank 
73
558
40.94
Referers 
Referees 
References 
1147
770
548
Search Limit
1001000
Title
Citations
PageRank
Year
Learning Optimal Antenna Tilt Control Policies: A Contextual Linear Bandit Approach00.342022
Distributed Online Optimization With Long-Term Constraints10.352022
Minimal Expected Regret in Linear Quadratic Control00.342022
Distributed Online Linear Regressions10.352021
Distributedly Solving Boolean Equations over Networks00.342020
Off-Policy Learning For Remote Electrical Tilt Optimization00.342020
Optimal Rate Sampling in 802.11 systems: Theory, Design, and Implementation10.362019
Optimal Sampling and Clustering in the Stochastic Block Model00.342019
Learning Proportionally Fair Allocations with Low Regret.10.362018
Generic Asymptotically Optimal Algorithms for Multi-Armed Bandits.00.342018
Online Learning of Optimally Diverse Rankings.10.352018
Consistent Change Point Detection for Piecewise Constant Signals With Normalized Fused LASSO.00.342017
Collaborative Clustering: Sample Complexity and Efficient Algorithms.00.342017
Minimal Exploration in Structured Stochastic Bandits10.372017
Strategic Arrivals to Queues Offering Priority Service.00.342017
Viral initialization for spectral clustering.00.342017
Optimal Distributed Scheduling in Wireless Networks under the SINR interference model20.392016
Optimal Cluster Recovery in the Labeled Stochastic Block Model60.442016
Stochastic and Adversarial Combinatorial Bandits.20.402015
Dynamic Rate and Channel Selection in Cognitive Radio Systems110.612015
Mobility Prediction Using Non-Parametric Bayesian Model00.342015
Optimality of Spectral Algorithms for Community Detection in the Labeled Stochastic Block Model00.342015
Combinatorial Bandits Revisited200.862015
Distributed load balancing in heterogenous systems30.402014
Lipschitz Bandits: Regret Lower Bounds and Optimal Algorithms.150.792014
Streaming, Memory Limited Algorithms for Community Detection.10.362014
Community Detection via Random and Adaptive Sampling.10.362014
Unimodal Bandits: Regret Lower Bounds and Optimal Algorithms.190.872014
Spectrum Bandit Optimization10.412013
Online shortest path routing: The value of information00.342013
Optimal Rate Sampling in 802.11 systems60.532013
Emergent Behaviors over Signed Random Networks in Dynamical Environments.10.382013
The Evolution of Beliefs over Signed Social Networks230.842013
On downlink capacity of cellular data networks with WLAN/WPAN relays10.372013
Continuous-time distributed optimization of homogenous dynamics00.342013
Distributed Optimization: Convergence Conditions from a Dynamical System Perspective10.432012
Asymptotic Stability Region of Slotted Aloha201.532012
Efficient and fair MAC for wireless networks with self-interference cancellation.70.502011
Scoop: decentralized and opportunistic multicasting of information streams180.802011
Hop limited flooding over dynamic networks160.602011
Dynamic channel, rate selection and scheduling for white spaces140.672011
Optimal bidding strategies in dynamic auctions with budget constraints.100.642011
Backlog-based random access in wireless networks: fluid limits and delay issues60.502011
Rate adaptation games in wireless LANs: nash equilibrium and price of anarchy100.722010
Towards utility-optimal random access without message passing522.062010
Load balancing via random local search in closed and open systems100.762010
Resource allocation over network dynamics without timescale separation321.232010
Scheduling with limited information in wireless systems281.242009
Flow-level performance and capacity of wireless networks with user mobility361.922009
Routing games with elastic traffic40.782009
  • 1
  • 2