Robert Kleinberg

Q: What Schools Are Affiliated With Robert Kleinberg

Robert Kleinberg is affiliated with the following schools: Massachusetts Institute of Technology, Cornell University

Robert Kleinberg's AcademicInfluence.com Rankings

Robert Kleinberg

Computer Science

#1276

World Rank

#1317

Historical Rank

#652

USA Rank

Database

#7215

World Rank

#7463

Historical Rank

#857

USA Rank

computer-science Degrees

Download Badge

Computer Science

Robert Kleinberg's Degrees

Bachelors Computer Science Cornell University

Similar Degrees You Can Earn

Why Is Robert Kleinberg Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Robert David Kleinberg is an American theoretical computer scientist and professor of Computer Science at Cornell University. Early life Robert Kleinberg was one of the finalists at the 1989 Mathcounts. He was a member of the 1991 and 1992 USA teams in the International Mathematical Olympiad, winning a silver medal and a gold medal, respectively. He was also a Putnam Fellow in 1996.

(See a Problem?)

Robert Kleinberg's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Learning diverse rankings with multi-armed bandits (2008) (518)
Multi-armed bandits in metric spaces (2008) (427)
Geographic Routing Using Hyperbolic Space (2007) (383)
Nearly Tight Bounds for the Continuum-Armed Bandit Problem (2004) (364)
The value of knowing a demand curve: bounds on regret for online posted-price auctions (2003) (349)
Bandits with Knapsacks (2013) (347)
A multiple-choice secretary algorithm with applications to online auctions (2005) (287)
The K-armed Dueling Bandits Problem (2012) (279)
Algorithmic pricing via virtual valuations (2007) (275)
Adaptive routing with end-to-end feedback: distributed learning and geometric approaches (2004) (251)
Continuous-time model of structural balance (2010) (247)
Matroids, secretary problems, and online mechanisms (2007) (240)
An Alternative View: When Does SGD Escape Local Minima? (2018) (235)
Matroid prophet inequalities (2012) (229)
Regret bounds for sleeping experts and bandits (2010) (216)
A Knapsack Secretary Problem with Applications (2007) (206)
On the capacity of information networks (2006) (196)
Adaptive limited-supply online auctions (2004) (196)
Randomized Primal-Dual analysis of RANKING for Online BiPartite Matching (2013) (194)
Automated Online Mechanism Design and Prophet Inequalities (2007) (185)
Merlin: A Language for Provisioning Network Resources (2014) (185)
Online linear optimization and adaptive routing (2008) (183)
Online auctions with re-usable goods (2005) (174)
Online auctions and generalized secretary problems (2008) (171)
A Measure of Polarization on Social Media Networks Based on Community Boundaries (2013) (162)
Multiplicative updates outperform generic no-regret learning in congestion games: extended abstract (2009) (161)
Dynamic Pricing with Limited Supply (2011) (144)
Learning on a budget: posted price mechanisms for online procurement (2012) (127)
Network Formation in the Presence of Contagious Risk (2011) (126)
Noisy binary search and its applications (2007) (124)
Emergence of tempered preferential attachment from optimization (2007) (115)
Broadcasting With Side Information: Bounding and Approximating the Broadcast Rate (2013) (109)
Congestion games with malicious players (2007) (106)
Pricing randomized allocations (2009) (105)
Bayesian incentive compatibility via matchings (2011) (100)
Incentivizing exploration (2014) (99)
Prophet Inequalities with Limited Information (2013) (98)
Truthful mechanisms with implicit payment computation (2010) (97)
Which Networks are Least Susceptible to Cascading Failures? (2011) (96)
Lexicographic Products and the Power of Non-linear Network Coding (2011) (92)
Index coding via linear programming (2010) (89)
Trace complexity of network inference (2013) (86)
Semi-Oblivious Traffic Engineering: The Road Not Taken (2018) (85)
A transport layer for live streaming in a content delivery network (2004) (85)
Bandits and Experts in Metric Spaces (2013) (83)
Optimal auctions with correlated bidders are easy (2010) (77)
Improving Christofides' Algorithm for the s-t Path TSP (2011) (76)
Managing the network with Merlin (2013) (76)
Hat Guessing Games (2008) (75)
Competitive collaborative learning (2005) (74)
Optimal mechanisms for selling information (2012) (72)
Sketching valuation functions (2012) (72)
Direct Uncertainty Prediction for Medical Second Opinions (2018) (70)
Truthful germs are contagious: a local to global characterization of truthfulness (2008) (69)
Fast matrix multiplication is stable (2006) (68)
Beating 1-1/e for ordered prophets (2017) (66)
Comparing Network Coding with Multicommodity Flow for the k-pairs Communication Problem (2004) (64)
Beyond the Nash Equilibrium Barrier (2011) (62)
Selling ad campaigns: online algorithms with cancellations (2009) (59)
An analysis of one-dimensional schelling segregation (2012) (59)
Descending Price Optimally Coordinates Search (2016) (56)
On the separability of structural classes of communities (2012) (54)
Polymatroid Prophet Inequalities (2013) (52)
Combinatorial Partial Monitoring Game with Linear Feedback and Its Applications (2014) (52)
Inapproximability for VCG-based combinatorial auctions (2010) (52)
Conditional equilibrium outcomes via ascending price processes with applications to combinatorial auctions with item bidding (2012) (49)
Online decision problems with large strategy sets (2005) (49)
Recharging Bandits (2018) (47)
Load balancing without regret in the bulletin board model (2009) (46)
The growth rate of tri-colored sum-free sets (2016) (44)
Improved lower and upper bounds for universal TSP in planar metrics (2006) (43)
Exponential Segregation in a Two-Dimensional Schelling Model with Tolerant Individuals (2015) (43)
Competition-Induced Preferential Attachment (2004) (42)
Oblivious routing on node-capacitated and directed graphs (2005) (41)
Inferential Privacy Guarantees for Differentially Private Mechanisms (2016) (40)
Selling Banner Ads: Online Algorithms with Buyback (2008) (39)
Network formation in the presence of contagious risk (2011) (38)
Online Bipartite Perfect Matching With Augmentations (2009) (38)
Online Learning for Global Cost Functions (2009) (37)
Pricing lotteries (2015) (37)
Sharp dichotomies for regret minimization in metric spaces (2009) (37)
On the Competitive Ratio of the Random Sampling Auction (2005) (35)
Efficiency Through Procrastination: Approximately Optimal Algorithm Configuration with Runtime Guarantees (2017) (35)
Secretary Problems with Competing Employers (2006) (34)
Bernoulli factories and black-box reductions in mechanism design (2017) (33)
Matroid prophet inequalities and applications to multi-dimensional mechanism design (2014) (33)
Secretary Problems with Non-Uniform Arrival Order (2015) (33)
Improving christofides' algorithm for the s-t path TSP (2012) (33)
Anytime algorithms for multi-armed bandit problems (2006) (33)
(Almost) Tight bounds and existence theorems for single-commodity confluent flows (2007) (33)
Provably competitive adaptive routing (2005) (30)
Dynamic pricing with limited supply (2012) (29)
Analyzing quadratic unconstrained binary optimization problems via multicommodity flows (2009) (29)
Optimal Contest Design for Simple Agents (2016) (28)
Improved Lower Bounds for the Universal and a priori TSP (2010) (28)
Building a Secure and Privacy-Preserving Smart Grid (2015) (27)
Matroid Secretary Problems (2018) (27)
Degree Distribution of Competition-Induced Preferential Attachment Graphs (2005) (27)
Kulfi: Robust Traffic Engineering Using Semi-Oblivious Routing (2016) (26)
Approximating low-dimensional coverage problems (2011) (26)
Isomorphism and embedding problems for infinite limits of scale-free graphs (2005) (26)
Truthful germs are contagious: A local-to-global characterization of truthfulness (2014) (26)
Can Deep Reinforcement Learning Solve Erdos-Selfridge-Spencer Games? (2017) (25)
Randomized Online Algorithms for the Buyback Problem (2009) (24)
Multi-parameter mechanisms with implicit payment computation (2013) (24)
Delegated Search Approximates Efficient Search (2018) (23)
A separability framework for analyzing community structure (2014) (23)
On the internet delay space dimensionality (2008) (22)
Pandora's Problem with Nonobligatory Inspection (2019) (21)
On the Complexity of Computing an Equilibrium in Combinatorial Auctions (2014) (21)
Optimal auctions for correlated buyers with sampling (2014) (20)
Tighter Cut-based Bounds for k-pairs Communication Problems (2005) (20)
Truthful Mechanisms with Implicit Payment Computation (2015) (20)
New lower bounds for oblivious routing in undirected graphs (2006) (19)
On the internet delay space dimensionality (2008) (19)
Introduction to computer science and economic theory (2015) (18)
Improved Lower Bounds for Testing Triangle-freeness in Boolean Functions via Fast Matrix Multiplication (2013) (18)
Procrastinating with Confidence: Near-Optimal, Anytime, Adaptive Algorithm Configuration (2019) (18)
Simple and Near-Optimal Mechanisms for Market Intermediation (2014) (17)
YATES: Rapid Prototyping for Traffic Engineering Systems (2018) (16)
The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime (2017) (15)
Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem (2010) (15)
Online client-server load balancing without global information (2005) (14)
Semi-Oblivious Traffic Engineering with SMORE (2018) (14)
Truthfulness via Proxies (2010) (13)
Optimal contest design for simple agents (2014) (13)
Characterizing truthful mechanisms with convex type spaces (2008) (12)
On the ratio of revenue to welfare in single-parameter mechanism design (2013) (12)
Nonmanipulable Randomized Tournament Selections (2010) (11)
(Almost) tight bounds and existence theorems for confluent flows (2004) (11)
A "Chicken & Egg" Network Coding Problem (2007) (11)
Semi-oblivious routing: lower bounds (2007) (11)
Merlin: A Language for Managing Network Resources (2018) (10)
Bernoulli factories and black-box reductions in mechanism design (2017) (10)
Prior independent mechanisms via prophet inequalities with limited information (2019) (10)
Bernoulli Factories and Black-box Reductions in Mechanism Design (2021) (10)
Smooth Online Mechanisms: A Game-Theoretic Problem in Renewable Energy Markets (2015) (9)
A nearly tight upper bound on tri-colored sum-free sets in characteristic 2 (2016) (8)
Job security, stability, and production efficiency (2017) (8)
Descending Price Coordinates Approximately Efficient Search (2016) (7)
Dynamic Pricing with Limited Supply (extended abstract) (2012) (7)
Constrained-Order Prophet Inequalities (2020) (7)
Bandits with Knapsacks: Dynamic procurement for crowdsourcing∗ (2013) (7)
Approximately optimal auctions for correlated bidders (2015) (7)
Total Functions in the Polynomial Hierarchy (2020) (6)
Proceedings of the 4th conference on Innovations in Theoretical Computer Science (2013) (6)
Behavioral Mechanism Design: Optimal Contests for Simple Agents (2014) (5)
Full surplus extraction from samples (2021) (5)
Train tracks and zipping sequences for pseudo-Anosov braids (1998) (5)
Badminton and the Science of Rule Making: Huffington Post (2012) (5)
A Unified Approach to Online Allocation Algorithms via Randomized Dual Fitting (2013) (5)
Amplified Hardness of Approximation for VCG-Based Mechanisms (2009) (5)
Orienteering for electioneering (2017) (4)
Optimal oblivious reconfigurable networks (2021) (4)
Merlin : Programming the Big Switch (2014) (3)
On Learning Submodular Functions A Preliminary Draft (2007) (3)
Stability and auctions in labor markets with job security (2017) (3)
Tutorial: Incentivizing and Coordinating Exploration∗ (2017) (3)
Consistent load balancing via spread minimization (2003) (3)
Anonymous, Fault-Tolerant Distributed Queries for Smart Devices (2018) (2)
The Value of Knowing a Demand Curve : Bounds on Regret for On-line Posted-Price Auctions PRELIMINARY VERSION – DO NOT DISTRIBUTE (2004) (2)
The Serializability of Network Codes (2010) (2)
Simultaneous Nearest Neighbor Search (2016) (2)
Individual Fairness in Prophet Inequalities (2022) (1)
A Private Framework for Distributed Computation (2014) (1)
Fitting the WHOIS Internet data (2007) (1)
Non-monotonic Resource Utilization in the Bandits with Knapsacks Problem (2022) (1)
Optimal Stopping with Behaviorally Biased Agents: The Role of Loss Aversion and Changing Reference Points (2021) (1)
Job Security , Stability and Production Efficiency ∗ PRELIMINARY DRAFT (2013) (1)
A multiplicative deformation of the Möbius function for the poset of partitions of a multiset (2008) (1)
Online Convex Optimization with Unbounded Memory (2022) (1)
Conditional Equilibrium Outcomes via Ascending Price Processes (2011) (1)
Semi-oblivious routing (2006) (1)
Non-Stochastic CDF Estimation Using Threshold Queries (2023) (0)
Manuscript-An Analysis of One-Dimensional Schelling Segregation (2016) (0)
Special Section on the Forty-Second Annual ACM Symposium on Theory of Computing (STOC 2010) (2013) (0)
CS 4820: Limits of Computability (2018) (0)
Bandits with Knapsacks (Extended Abstract) (2013) (0)
44 : 2 Simultaneous Nearest Neighbor Search 1 Introduction (2016) (0)
Session details: Session 4B (2007) (0)
Equilibrage de charge global entre centres de donnees utilises en ecriture miroir (2001) (0)
Revenue Monotonicity Under Misspecified Bidders (2020) (0)
Kleinberg Complex Networks (2014) (0)
Incentivizing and Coordinating Exploration (Tutorial proposal for ALT 2019) (2018) (0)
Lectures on Nonbipartite Matchings (2020) (0)
A Diameter-Revealing Proof of the Bondy-Lovász Lemma (2011) (0)
Extending Optimal Oblivious Reconﬁgurable Networks to all N (2022) (0)
Localized Client-Server Load Balancing without Global Information (2007) (0)
Privacy-Compatibility For General Utility Metrics (2010) (0)
Analysis of a Continuous-time Model of Structural Balance (2021) (0)
Online Auctions with Re-usable Goods The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters (2005) (0)
Optimal Stopping Meets Combinatorial Optimization (2013) (0)
Threshold Tests as Quality Signals: Optimal Strategies, Equilibria, and Price of Anarchy (2021) (0)
Session details: Session 8A (2007) (0)
Online Flow Computation on Unit-Vertex-Capacitated Networks (2020) (0)
Adaptive Limited-Supply Online Auctions The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters (2004) (0)
Re-Designing Hazardous Chemicals with Target-Specific Toxicities by Learning from Structure-Based Drug Design (2018) (0)
On the structure of communities in networks (2012) (0)
ul 2 01 5 Bandits with Knapsacks ∗ (2019) (0)
Limits of Computability (2019) (0)
Fault-Tolerant DistributedQueries for Smart Devices (2018) (0)

This paper list is powered by the following services:

Other Resources About Robert Kleinberg

What Schools Are Affiliated With Robert Kleinberg?

Robert Kleinberg is affiliated with the following schools:

Robert Kleinberg's Academic­Influence.com Rankings