default search action
Stefan Magureanu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [i4]Stefan Magureanu, Alexandre Proutière, Marcus Isaksson, Boxun Zhang:
Online Learning of Optimally Diverse Rankings. CoRR abs/2109.05899 (2021) - [i3]Alexandra Hotti, Riccardo Sven Risuleo, Stefan Magureanu, Aref Moradi, Jens Lagergren:
The Klarna Product Page Dataset: A Realistic Benchmark for Web Representation Learning. CoRR abs/2111.02168 (2021)
2010 – 2019
- 2018
- [b1]Stefan Magureanu:
Efficient Online Learning under Bandit Feedback. Royal Institute of Technology, Stockholm, Sweden, 2018 - [c6]Richard Combes, Stefan Magureanu, Alexandre Proutière:
Generic Asymptotically Optimal Algorithms for Multi-Armed Bandits. Allerton 2018: 152 - [c5]Stefan Magureanu, Alexandre Proutière, Marcus Isaksson, Boxun Zhang:
Online Learning of Optimally Diverse Rankings. SIGMETRICS (Abstracts) 2018: 47-49 - 2017
- [j2]Stefan Magureanu, Alexandre Proutière, Marcus Isaksson, Boxun Zhang:
Online Learning of Optimally Diverse Rankings. Proc. ACM Meas. Anal. Comput. Syst. 1(2): 32:1-32:26 (2017) - [c4]Richard Combes, Stefan Magureanu, Alexandre Proutière:
Minimal Exploration in Structured Stochastic Bandits. NIPS 2017: 1763-1771 - [i2]Richard Combes, Stefan Magureanu, Alexandre Proutière:
Minimal Exploration in Structured Stochastic Bandits. CoRR abs/1711.00400 (2017) - 2016
- [j1]Prasanna Chaporkar, Stefan Magureanu, Alexandre Proutière:
Optimal Distributed Scheduling in Wireless Networks Under the SINR Interference Model. IEEE/ACM Trans. Netw. 24(4): 2033-2045 (2016) - 2015
- [c3]Richard Combes, Stefan Magureanu, Alexandre Proutière, Cyrille Laroche:
Learning to Rank: Regret Lower Bounds and Efficient Algorithms. SIGMETRICS 2015: 231-244 - 2014
- [c2]Stefan Magureanu, Richard Combes, Alexandre Proutière:
Lipschitz Bandits: Regret Lower Bound and Optimal Algorithms. COLT 2014: 975-999 - [i1]Stefan Magureanu, Richard Combes, Alexandre Proutière:
Lipschitz Bandits: Regret Lower Bounds and Optimal Algorithms. CoRR abs/1405.4758 (2014) - 2012
- [c1]Stefan Magureanu, Nima Dokoohaki
, Shahab Mokarizadeh, Mihhail Matskin:
Epidemic Trust-Based Recommender Systems. SocialCom/PASSAT 2012: 461-470
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-04-25 05:53 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: