The following pages link to Robert D. Kleinberg (Q1809558):
Displayed 39 items.
- (Q3620819) (← links)
- Bandits with Knapsacks (Q4561500) (← links)
- Exponential Segregation in a Two-Dimensional Schelling Model with Tolerant Individuals (Q4575802) (← links)
- Matroid Secretary Problems (Q4625656) (← links)
- The growth rate of tri-colored sum-free sets (Q4645037) (← links)
- Job security, stability, and production efficiency (Q4682751) (← links)
- Oblivious routing on node-capacitated and directed graphs (Q4962691) (← links)
- Beating 1-1/e for ordered prophets (Q4977961) (← links)
- Bernoulli factories and black-box reductions in mechanism design (Q4977969) (← links)
- The Lov\'asz Theta Function for Random Regular Graphs and Community Detection in the Hard Regime (Q5002631) (← links)
- Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem (Q5035879) (← links)
- Bernoulli Factories and Black-box Reductions in Mechanism Design (Q5056441) (← links)
- Load balancing without regret in the bulletin board model (Q5170301) (← links)
- Multiplicative updates outperform generic no-regret learning in congestion games (Q5172748) (← links)
- Bandits and Experts in Metric Spaces (Q5215459) (← links)
- The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime (Q5232321) (← links)
- (Q5302093) (← links)
- Broadcasting With Side Information: Bounding and Approximating the Broadcast Rate (Q5346393) (← links)
- On the Complexity of Computing an Equilibrium in Combinatorial Auctions (Q5363024) (← links)
- (Q5365077) (← links)
- Prophet Inequalities with Limited Information (Q5384062) (← links)
- Matroid prophet inequalities (Q5415470) (← links)
- An analysis of one-dimensional schelling segregation (Q5415516) (← links)
- Improving christofides' algorithm for the s-t path TSP (Q5415521) (← links)
- (Q5417646) (← links)
- (Q5417650) (← links)
- (Q5417671) (← links)
- Optimal auctions with correlated bidders are easy (Q5419082) (← links)
- Learning Theory (Q5473613) (← links)
- Which Networks are Least Susceptible to Cascading Failures? (Q5494979) (← links)
- Lexicographic Products and the Power of Non-linear Network Coding (Q5494990) (← links)
- (Q5743455) (← links)
- On the capacity of information networks (Q5900528) (← links)
- Hat Guessing Games (Q5901992) (← links)
- Hat Guessing Games (Q5902082) (← links)
- Optimal oblivious reconfigurable networks (Q6083590) (← links)
- (Q6147377) (← links)
- A nearly tight upper bound on tri-colored sum-free sets in characteristic 2 (Q6273999) (← links)
- Group-theoretic algorithms for matrix multiplication (Q6476323) (← links)