The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Robert D. Kleinberg: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Baruch Awerbuch, Robert D. Kleinberg
    Competitive Collaborative Learning. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:233-248 [Conf]
  2. Henry Cohn, Robert D. Kleinberg, Balázs Szegedy, Christopher Umans
    Group-theoretic Algorithms for Matrix Multiplication. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:379-388 [Conf]
  3. Robert D. Kleinberg, Frank Thomson Leighton
    The Value of Knowing a Demand Curve: Bounds on Regret for Online Posted-Price Auctions. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:594-605 [Conf]
  4. Noam Berger, Christian Borgs, Jennifer T. Chayes, R. M. D'Souza, Robert D. Kleinberg
    Competition-Induced Preferential Attachment. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:208-221 [Conf]
  5. Baruch Awerbuch, David Holmer, Herbert Rubens, Robert D. Kleinberg
    Provably competitive adaptive routing. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2005, pp:631-641 [Conf]
  6. Robert D. Kleinberg
    Nearly Tight Bounds for the Continuum-Armed Bandit Problem. [Citation Graph (0, 0)][DBLP]
    NIPS, 2004, pp:- [Conf]
  7. Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Mohammad Mahdian, David C. Parkes
    Online auctions with re-usable goods. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2005, pp:165-174 [Conf]
  8. Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, David C. Parkes
    Adaptive limited-supply online auctions. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2004, pp:71-80 [Conf]
  9. Micah Adler, Nicholas J. A. Harvey, Kamal Jain, Robert D. Kleinberg, April Rasala Lehman
    On the capacity of information networks. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:241-250 [Conf]
  10. Baruch Awerbuch, Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton
    Online client-server load balancing without global information. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:197-206 [Conf]
  11. Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Frank Thomson Leighton
    Improved lower and upper bounds for universal TSP in planar metrics. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:649-658 [Conf]
  12. Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton, Harald Räcke
    Oblivious routing on node-capacitated and directed graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:782-790 [Conf]
  13. Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Frank Thomson Leighton, Harald Räcke
    New lower bounds for oblivious routing in undirected graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:918-927 [Conf]
  14. Robert D. Kleinberg
    A multiple-choice secretary algorithm with applications to online auctions. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:630-631 [Conf]
  15. Robert D. Kleinberg
    Anytime algorithms for multi-armed bandit problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:928-936 [Conf]
  16. Robert D. Kleinberg, Jon M. Kleinberg
    Isomorphism and embedding problems for infinite limits of scale-free graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:277-286 [Conf]
  17. Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton
    Semi-oblivious routing. [Citation Graph (0, 0)][DBLP]
    SPAA, 2006, pp:234- [Conf]
  18. Baruch Awerbuch, Robert D. Kleinberg
    Adaptive routing with end-to-end feedback: distributed learning and geometric approaches. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:45-53 [Conf]
  19. Jiangzhuo Chen, Robert D. Kleinberg, László Lovász, Rajmohan Rajaraman, Ravi Sundaram, Adrian Vetta
    (Almost) tight bounds and existence theorems for confluent flows. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:529-538 [Conf]
  20. Robert D. Kleinberg, Frank Thomson Leighton
    Consistent load balancing via spread minimization. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:565-574 [Conf]
  21. Nicole Immorlica, Robert D. Kleinberg, Mohammad Mahdian
    Secretary Problems with Competing Employers. [Citation Graph (0, 0)][DBLP]
    WINE, 2006, pp:389-400 [Conf]
  22. Uriel Feige, Abraham Flaxman, Jason D. Hartline, Robert D. Kleinberg
    On the Competitive Ratio of the Random Sampling Auction. [Citation Graph (0, 0)][DBLP]
    WINE, 2005, pp:878-886 [Conf]
  23. Noam Berger, Christian Borgs, Jennifer T. Chayes, R. M. D'Souza, Robert D. Kleinberg
    Competition-Induced Preferential Attachment [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  24. Nicholas J. A. Harvey, Robert D. Kleinberg, April Rasala Lehman
    On the capacity of information networks. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:6, pp:2345-2364 [Journal]
  25. Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tuomas Sandholm
    Automated Online Mechanism Design and Prophet Inequalities. [Citation Graph (0, 0)][DBLP]
    AAAI, 2007, pp:58-65 [Conf]
  26. Shuchi Chawla, Jason D. Hartline, Robert D. Kleinberg
    Algorithmic pricing via virtual valuations. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2007, pp:243-251 [Conf]
  27. R. M. D'Souza, Christian Borgs, Jennifer T. Chayes, Noam Berger, Robert D. Kleinberg
    Fitting the WHOIS Internet data [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  28. Noam Berger, Christian Borgs, Jennifer T. Chayes, R. M. D'Souza, Robert D. Kleinberg
    Degree Distribution of Competition-Induced Preferential Attachment Graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  29. Jiangzhuo Chen, Robert D. Kleinberg, László Lovász, Rajmohan Rajaraman, Ravi Sundaram, Adrian Vetta
    (Almost) Tight bounds and existence theorems for single-commodity confluent flows. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2007, v:54, n:4, pp:- [Journal]

  30. Improved Lower Bounds for the Universal and a priori TSP. [Citation Graph (, )][DBLP]


  31. Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem. [Citation Graph (, )][DBLP]


  32. Regret Bounds for Sleeping Experts and Bandits. [Citation Graph (, )][DBLP]


  33. The Serializability of Network Codes. [Citation Graph (, )][DBLP]


  34. On the internet delay space dimensionality. [Citation Graph (, )][DBLP]


  35. Online Bipartite Perfect Matching With Augmentations. [Citation Graph (, )][DBLP]


  36. On the internet delay space dimensionality. [Citation Graph (, )][DBLP]


  37. Load balancing without regret in the bulletin board model. [Citation Graph (, )][DBLP]


  38. Selling ad campaigns: online algorithms with cancellations. [Citation Graph (, )][DBLP]


  39. Truthful mechanisms with implicit payment computation. [Citation Graph (, )][DBLP]


  40. Pricing Randomized Allocations [Citation Graph (, )][DBLP]


  41. Sharp Dichotomies for Regret Minimization in Metric Spaces [Citation Graph (, )][DBLP]


  42. Index coding via linear programming [Citation Graph (, )][DBLP]


  43. Truthful Mechanisms with Implicit Payment Computation [Citation Graph (, )][DBLP]


Search in 0.225secs, Finished in 0.226secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002