Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Aleksandrs Slivkins
2010 – today
- 2013
[c21]Moshe Babaioff, Robert Kleinberg, Aleksandrs Slivkins: Multi-parameter mechanisms with implicit payment computation. ACM Conference on Electronic Commerce 2013: 35-52- [c20]David Kempe, Jon M. Kleinberg, Sigal Oren, Aleksandrs Slivkins: Selection and influence in cultural dynamics. ACM Conference on Electronic Commerce 2013: 585-586
- [c19]Ittai Abraham, Shiri Chechik, David Kempe, Aleksandrs Slivkins: Low-distortion Inference of Latent Similarities from a Multiplex Social Network. SODA 2013: 1853-1872
- [i15]Ittai Abraham, Omar Alonso, Vasilis Kandylas, Aleksandrs Slivkins: Adaptive Crowdsourcing Algorithms for the Bandit Survey Problem. CoRR abs/1302.3268 (2013)
- [i14]Moshe Babaioff, Robert Kleinberg, Aleksandrs Slivkins: Multi-parameter Mechanisms with Implicit Payment Computation. CoRR abs/1302.4138 (2013)
- [i13]David Kempe, Jon M. Kleinberg, Sigal Oren, Aleksandrs Slivkins: Selection and Influence in Cultural Dynamics. CoRR abs/1304.7468 (2013)
- [i12]Ashwinkumar Badanidiyuru, Robert Kleinberg, Aleksandrs Slivkins: Bandits with Knapsacks. CoRR abs/1305.2545 (2013)
- 2012
- [j9]Sébastien Bubeck, Aleksandrs Slivkins: The Best of Both Worlds: Stochastic and Adversarial Bandits. Journal of Machine Learning Research - Proceedings Track 23: 42.1-42.23 (2012)
- [c18]Moshe Babaioff, Shaddin Dughmi, Robert Kleinberg, Aleksandrs Slivkins: Dynamic pricing with limited supply. ACM Conference on Electronic Commerce 2012: 74-91
- [i11]Ittai Abraham, Shiri Chechik, David Kempe, Aleksandrs Slivkins: Low-distortion Inference of Latent Similarities from a Multiplex Social Network. CoRR abs/1202.0922 (2012)
- [i10]Sébastien Bubeck, Aleksandrs Slivkins: The best of both worlds: stochastic and adversarial bandits. CoRR abs/1202.4473 (2012)
- 2011
- [j8]Aleksandrs Slivkins: Contextual Bandits with Similarity Information. Journal of Machine Learning Research - Proceedings Track 19: 679-702 (2011)
- [j7]Aleksandrs Slivkins: Monotone multi-armed bandit allocations. Journal of Machine Learning Research - Proceedings Track 19: 829-834 (2011)
- [c17]
- [i9]Moshe Babaioff, Shaddin Dughmi, Robert Kleinberg, Aleksandrs Slivkins: Dynamic Pricing with Limited Supply. CoRR abs/1108.4142 (2011)
- 2010
- [j6]Aleksandrs Slivkins: Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs. SIAM J. Discrete Math. 24(1): 146-157 (2010)
- [c16]Aleksandrs Slivkins, Filip Radlinski, Sreenivas Gollapudi: Learning optimally diverse rankings over large document collections. ICML 2010: 983-990
- [c15]Moshe Babaioff, Robert D. Kleinberg, Aleksandrs Slivkins: Truthful mechanisms with implicit payment computation. ACM Conference on Electronic Commerce 2010: 43-52
- [c14]Robert Kleinberg, Aleksandrs Slivkins: Sharp Dichotomies for Regret Minimization in Metric Spaces. SODA 2010: 827-846
- [i8]Moshe Babaioff, Robert D. Kleinberg, Aleksandrs Slivkins: Truthful Mechanisms with Implicit Payment Computation. CoRR abs/1004.3630 (2010)
- [i7]Aleksandrs Slivkins, Filip Radlinski, Sreenivas Gollapudi: Learning optimally diverse rankings over large document collections. CoRR abs/1005.5197 (2010)
- [i6]Umar Syed, Aleksandrs Slivkins, Nina Mishra: Adapting to the Shifting Intent of Search Queries. CoRR abs/1007.3799 (2010)
2000 – 2009
- 2009
- [j5]Aleksandrs Slivkins, Jehoshua Bruck: Interleaving schemes on circulant graphs with two offsets. Discrete Mathematics 309(13): 4384-4398 (2009)
- [j4]Jon M. Kleinberg, Aleksandrs Slivkins, Tom Wexler: Triangulation and embedding using small sets of beacons. J. ACM 56(6) (2009)
- [j3]T.-H. Hubert Chan, Kedar Dhamdhere, Anupam Gupta, Jon M. Kleinberg, Aleksandrs Slivkins: Metric Embeddings with Relaxed Guarantees. SIAM J. Comput. 38(6): 2303-2329 (2009)
- [c13]Umar Syed, Aleksandrs Slivkins, Nina Mishra: Adapting to the Shifting Intent of Search Queries. NIPS 2009: 1829-1837
- [c12]Moshe Babaioff, Yogeshwer Sharma, Aleksandrs Slivkins: Characterizing truthful multi-armed bandit mechanisms: extended abstract. ACM Conference on Electronic Commerce 2009: 79-88
- [i5]
- [i4]Robert D. Kleinberg, Aleksandrs Slivkins: Sharp Dichotomies for Regret Minimization in Metric Spaces. CoRR abs/0911.1174 (2009)
- 2008
- [j2]Jon M. Kleinberg, Mark Sandler, Aleksandrs Slivkins: Network Failure Detection and Graph Connectivity. SIAM J. Comput. 38(4): 1330-1346 (2008)
- [c11]
- [c10]Robert Kleinberg, Aleksandrs Slivkins, Eli Upfal: Multi-armed bandits in metric spaces. STOC 2008: 681-690
- [i3]Robert Kleinberg, Aleksandrs Slivkins, Eli Upfal: Multi-Armed Bandits in Metric Spaces. CoRR abs/0809.4882 (2008)
- [i2]Matthew Andrews, Aleksandrs Slivkins: Oscillations with TCP-like Flow Control in Networks of Queues. CoRR abs/0812.1321 (2008)
- [i1]Moshe Babaioff, Yogeshwer Sharma, Aleksandrs Slivkins: Characterizing Truthful Multi-Armed Bandit Mechanisms. CoRR abs/0812.2291 (2008)
- 2007
- [j1]Aleksandrs Slivkins: Distance estimation and object location via rings of neighbors. Distributed Computing 19(4): 313-333 (2007)
- [c9]Aleksandrs Slivkins: Towards fast decentralized construction of locality-aware overlay networks. PODC 2007: 89-98
- 2006
- [c8]Matthew Andrews, Aleksandrs Slivkins: Oscillations with TCP-Like Flow Control in Networks of Queues. INFOCOM 2006
- 2005
- [c7]Ittai Abraham, Yair Bartal, Hubert T.-H. Chan, Kedar Dhamdhere, Anupam Gupta, Jon M. Kleinberg, Ofer Neiman, Aleksandrs Slivkins: Metric Embeddings with Relaxed Guarantees. FOCS 2005: 83-100
- [c6]Aleksandrs Slivkins: Distance estimation and object location via rings of neighbors. PODC 2005: 41-50
- [c5]Bernard Wong, Aleksandrs Slivkins, Emin Gün Sirer: Meridian: a lightweight network location service without virtual coordinates. SIGCOMM 2005: 85-96
- [c4]
- 2004
- [c3]Jon M. Kleinberg, Aleksandrs Slivkins, Tom Wexler: Triangulation and Embedding Using Small Sets of Beacons. FOCS 2004: 444-453
- [c2]Jon M. Kleinberg, Mark Sandler, Aleksandrs Slivkins: Network failure detection and graph connectivity. SODA 2004: 76-85
- 2003
- [c1]Aleksandrs Slivkins: Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs. ESA 2003: 482-493
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-11 10:01 CEST by the dblp team