Countries citing papers authored by Yevgeny Seldin
Since
Specialization
Citations
This map shows the geographic impact of Yevgeny Seldin's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Yevgeny Seldin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Yevgeny Seldin more than expected).
This network shows the impact of papers produced by Yevgeny Seldin. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Yevgeny Seldin. The network helps show where Yevgeny Seldin may publish in the future.
Co-authorship network of co-authors of Yevgeny Seldin
This figure shows the co-authorship network connecting the top 25 collaborators of Yevgeny Seldin.
A scholar is included among the top collaborators of Yevgeny Seldin based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Yevgeny Seldin. Yevgeny Seldin is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Seldin, Yevgeny, et al.. (2019). An Optimal Algorithm for Adversarial Bandits with Arbitrary Delays. Research at the University of Copenhagen (University of Copenhagen). 3285–3294.1 indexed citations
2.
Seldin, Yevgeny, et al.. (2018). An Optimal Algorithm for Stochastic and Adversarial Bandits. Research at the University of Copenhagen (University of Copenhagen). 467–475.7 indexed citations
3.
Seldin, Yevgeny, et al.. (2018). Factored Bandits. Neural Information Processing Systems. 31. 2840–2849.1 indexed citations
Seldin, Yevgeny & Gábor Lugosi. (2017). An Improved Parametrization and Analysis of the EXP3++ Algorithm for Stochastic and Adversarial Bandits. Research at the University of Copenhagen (University of Copenhagen).8 indexed citations
6.
Seldin, Yevgeny, Peter L. Bartlett, Koby Crammer, & Yasin Abbasi-Yadkori. (2014). Prediction with Limited Advice and Multiarmed Bandits with Paid Observations. QUT ePrints (Queensland University of Technology). 280–287.19 indexed citations
7.
Seldin, Yevgeny & Aleksandrs Slivkins. (2014). One Practical Algorithm for Both Stochastic and Adversarial Bandits. QUT ePrints (Queensland University of Technology). 1287–1295.27 indexed citations
8.
Tolstikhin, Ilya & Yevgeny Seldin. (2013). PAC-Bayes-empirical-Bernstein inequality. QUT ePrints (Queensland University of Technology).15 indexed citations
9.
Seldin, Yevgeny, Csaba Szepesvári, Peter Auer, & Yasin Abbasi-Yadkori. (2013). Evaluation and Analysis of the Performance of the EXP3 Algorithm in Stochastic Environments. Max Planck Digital Library. 103–116.17 indexed citations
10.
Seldin, Yevgeny, Koby Crammer, & Peter L. Bartlett. (2013). Open Problem: Adversarial Multiarmed Bandits with Limited Advice. QUT ePrints (Queensland University of Technology). 1067–1072.1 indexed citations
11.
Bartlett, Peter L., et al.. (2013). Online Learning in Markov Decision Processes with Adversarially Chosen Transition Probability Distributions. arXiv (Cornell University). 26. 2508–2516.19 indexed citations
12.
Seldin, Yevgeny, Peter Auer, John Shawe‐Taylor, Ronald Ortner, & François Laviolette. (2011). PAC-Bayesian Analysis of Contextual Bandits. MPG.PuRe (Max Planck Society). 24. 1683–1691.19 indexed citations
13.
Seldin, Yevgeny, François Laviolette, Nicolò Cesa‐Bianchi, John Shawe‐Taylor, & Peter Auer. (2011). PAC-Bayesian Inequalities for Martingales. arXiv (Cornell University). 12–12.1 indexed citations
14.
Seldin, Yevgeny & Naftali Tishby. (2010). PAC-Bayesian Analysis of Co-clustering and Beyond. Journal of Machine Learning Research. 11(117). 3595–3646.36 indexed citations
15.
Seldin, Yevgeny. (2010). A PAC-Bayesian Analysis of Co-clustering, Graph Clustering, and Pairwise Clustering. MPG.PuRe (Max Planck Society). 1–5.1 indexed citations
16.
Seldin, Yevgeny & Naftali Tishby. (2009). PAC-Bayesian Generalization Bound for Density Estimation with Application to Co-clustering. MPG.PuRe (Max Planck Society). 472–479.8 indexed citations
17.
Bejerano, Gill, et al.. (2001). Extraction of Protein Domains and Signatures through Unsupervised Statistical Sequence Segmentation.
18.
Seldin, Yevgeny, Gill Bejerano, & Naftali Tishby. (2001). Unsupervised Segmentation and Classification of Mixtures of Markovian Sources. MPG.PuRe (Max Planck Society). 1–15.1 indexed citations
19.
Seldin, Yevgeny, Gill Bejerano, & Naftali Tishby. (2001). Unsupervised Sequence Segmentation by a Mixture of Switching Variable Memory Markov Sources. MPG.PuRe (Max Planck Society). 513–520.9 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.