Kleinberg, Robert D. - Department of Computer Science, Cornell University

• Adaptive Limited-Supply Online Auctions Mohammad T. Hajiaghayi
• Noisy binary search and its applications Richard M. Karp
• Adaptive Routing with End-to-End feedback: Distributed Learning and Geometric Approaches
• Multiplicative Updates Outperform Generic No-Regret Learning in Congestion Games
• Nearly Tight Bounds for the Continuum-Armed Bandit Problem
• Tighter Cut-based Bounds for k-pairs Communication Problems
• The Value of Knowing a Demand Curve: Bounds on Regret for On-line Posted-Price
• PROCEEDINGS OF THE IEEE 1 A Transport Layer for Live Streaming in a Content
• Competitive Collaborative Learning Baruch Awerbuch1,
• Online Client-Server Load Balancing Without Global Information
• arXiv:math.NA/0603207v37Dec2006 Fast matrix multiplication is stable
• A "Chicken & Egg" Network Coding Problem Nicholas J.A. Harvey
• Group-theoretic Algorithms for Matrix Multiplication Robert Kleinberg
• A Multiple-Choice Secretary Algorithm with Applications to Online Robert Kleinberg
• On the Internet Delay Space Dimensionality Bruno Abrahao Robert Kleinberg
• Matroids, Secretary Problems, and Online Mechanisms Moshe Babaioff
• New Lower Bounds for Oblivious Routing in Undirected Graphs Mohammad T. Hajiaghayi
• Selling Ad Campaigns: Online Algorithms with Cancellations
• Selling Banner Ads: Online Algorithms with Buyback Moshe Babaioff
• Brief Announcement On the Internet Delay Space Dimensionality
• Truthful germs are contagious: A local to global characterization of truthfulness
• Regret Bounds for Sleeping Experts and Bandits Robert D. Kleinberg
• Multi-Armed Bandits in Metric Spaces Robert Kleinberg
• Geographic Routing Using Hyperbolic Space Robert Kleinberg
• Hat Guessing Games Steve Butler
• SPECIAL ISSUE ON NETWORK CODING 1 On the Capacity of Information Networks
• Improved Lower and Upper Bounds for Universal TSP in Planar Metrics
• Oblivious Routing on Node-Capacitated and Directed Graphs Mohammad T. Hajiaghayi
• Degree Distribution of Competition-Induced Preferential Attachment Graphs
• (Almost) Tight Bounds and Existence Theorems for Single-Commodity Confluent Flows
• Online Decision Problems with Large Strategy Sets
• Online Bipartite Perfect Matching With Augmentations
• On the Capacity of Information Networks Micah Adler
• Provably Competitive Adaptive Routing Baruch Awerbuch, David Holmer, and Herbert Rubens
• Anytime Algorithms for Multi-Armed Bandit Problems Robert Kleinberg
• Congestion Games with Malicious Players Moshe Babaioff
• Semi-oblivious Routing: Lower Bounds MohammadTaghi Hajiaghayi
• The Serializability of Network Codes Anna Blasiak Robert Kleinberg