|
Search the dblp DataBase
Robert D. Kleinberg:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Baruch Awerbuch, Robert D. Kleinberg
Competitive Collaborative Learning. [Citation Graph (0, 0)][DBLP] COLT, 2005, pp:233-248 [Conf]
- 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]
- 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]
- 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]
- Baruch Awerbuch, David Holmer, Herbert Rubens, Robert D. Kleinberg
Provably competitive adaptive routing. [Citation Graph (0, 0)][DBLP] INFOCOM, 2005, pp:631-641 [Conf]
- Robert D. Kleinberg
Nearly Tight Bounds for the Continuum-Armed Bandit Problem. [Citation Graph (0, 0)][DBLP] NIPS, 2004, pp:- [Conf]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- Robert D. Kleinberg
A multiple-choice secretary algorithm with applications to online auctions. [Citation Graph (0, 0)][DBLP] SODA, 2005, pp:630-631 [Conf]
- Robert D. Kleinberg
Anytime algorithms for multi-armed bandit problems. [Citation Graph (0, 0)][DBLP] SODA, 2006, pp:928-936 [Conf]
- 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]
- Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton
Semi-oblivious routing. [Citation Graph (0, 0)][DBLP] SPAA, 2006, pp:234- [Conf]
- 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]
- 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]
- Robert D. Kleinberg, Frank Thomson Leighton
Consistent load balancing via spread minimization. [Citation Graph (0, 0)][DBLP] STOC, 2003, pp:565-574 [Conf]
- Nicole Immorlica, Robert D. Kleinberg, Mohammad Mahdian
Secretary Problems with Competing Employers. [Citation Graph (0, 0)][DBLP] WINE, 2006, pp:389-400 [Conf]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
Improved Lower Bounds for the Universal and a priori TSP. [Citation Graph (, )][DBLP]
Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem. [Citation Graph (, )][DBLP]
Regret Bounds for Sleeping Experts and Bandits. [Citation Graph (, )][DBLP]
The Serializability of Network Codes. [Citation Graph (, )][DBLP]
On the internet delay space dimensionality. [Citation Graph (, )][DBLP]
Online Bipartite Perfect Matching With Augmentations. [Citation Graph (, )][DBLP]
On the internet delay space dimensionality. [Citation Graph (, )][DBLP]
Load balancing without regret in the bulletin board model. [Citation Graph (, )][DBLP]
Selling ad campaigns: online algorithms with cancellations. [Citation Graph (, )][DBLP]
Truthful mechanisms with implicit payment computation. [Citation Graph (, )][DBLP]
Pricing Randomized Allocations [Citation Graph (, )][DBLP]
Sharp Dichotomies for Regret Minimization in Metric Spaces [Citation Graph (, )][DBLP]
Index coding via linear programming [Citation Graph (, )][DBLP]
Truthful Mechanisms with Implicit Payment Computation [Citation Graph (, )][DBLP]
Search in 0.063secs, Finished in 0.066secs
|