# jemdoc: menu{MENU}{research.html}, showsource
= Publications

== 2017
S. Magureanu, [https://dl.dropboxusercontent.com/u/19365883/site/index.html R. Combes], [http://people.kth.se/~alepro/ A. Proutiere], "Minimal Exploration in Structured Stochastic Bandits", NIPS 2017 (accepted as spotlight, to appear), Long Beach, California.[https://arxiv.org/pdf/1711.00400.pdf \[pdf\]]

S. Magureanu, [http://people.kth.se/~alepro/ A. Proutiere], Marcus Isaksson, Boxun Zhang, "Online Learning of Optimally Diverse Rankings", SIGMETRICS 2018 (accepted, to appear December 2018), Irvine, California.

== 2016
S. Magureanu, "Structured Stochastic Bandits", Licentiate Thesis. [https://www.diva-portal.org/smash/get/diva2:905873/FULLTEXT01.pdf \[pdf\]]

[https://www.ee.iitb.ac.in/wiki/faculty/chaporkar P. Chaporkar], S. Magureanu, [http://people.kth.se/~alepro/ A. Proutiere], "Optimal Distributed Scheduling in Wireless Networks under the SINR Interference Model", IEEE/ACM Transactions on Networking, Vol. 24, No. 4, [http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=7145489 \[pdf\]].

== 2015
[https://dl.dropboxusercontent.com/u/19365883/site/index.html R. Combes], S. Magureanu, [http://people.kth.se/~alepro/ A. Proutiere], C. Laroche, "Learning to Rank: Regret Lower Bounds and Efficient Algorithms", ACM SIGMETRICS 2015, Portland, Oregon. [http://dl.acm.org/citation.cfm?id=2745847 \[pdf\]]


== 2014
S. Magureanu, [https://dl.dropboxusercontent.com/u/19365883/site/index.html R. Combes], [http://people.kth.se/~alepro/ A. Proutiere], "Lipschitz Bandits: Regret Lower Bounds and Optimal Algorithms", COLT 2014, Barcelona. [papers/magureanu14.pdf \[pdf\]]