default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert D. Kleinberg
Robert Kleinberg
Person information
- affiliation: Cornell University, Ithaca, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c124]Princewill Okoroafor, Robert D. Kleinberg, Wen Sun:
Faster Recalibration of an Online Predictor via Approachability. AISTATS 2024: 4690-4698- [c123]Bartek Wydrowski, Robert Kleinberg, Stephen M. Rumble, Aaron Archer:
Load is not what you should balance: Introducing Prequal. NSDI 2024 - [c122]Daniel Amir
, Nitika Saran, Tegan Wilson, Robert Kleinberg, Vishal Shrivastav, Hakim Weatherspoon:
Shale: A Practical, Scalable Oblivious Reconfigurable Network. SIGCOMM 2024: 449-464 - [c121]Tegan Wilson, Daniel Amir, Nitika Saran, Robert Kleinberg, Vishal Shrivastav, Hakim Weatherspoon:
Breaking the VLB Barrier for Oblivious Reconfigurable Networks. STOC 2024: 1865-1876 - [i69]Yuval Dagan, Constantinos Daskalakis, Maxwell Fishelson, Noah Golowich, Robert Kleinberg, Princewill Okoroafor:
Improved bounds for calibration via stronger sign preservation games. CoRR abs/2406.13668 (2024) - [i68]Andrés Cristi, Paul Dütting, Robert Kleinberg, Renato Paes Leme:
Online Matroid Embeddings. CoRR abs/2407.10316 (2024) - 2023
- [c120]Tegan Wilson, Daniel Amir, Vishal Shrivastav, Hakim Weatherspoon, Robert Kleinberg:
Extending Optimal Oblivious Reconfigurable Networks to all N. APOCS 2023: 1-16 - [c119]Raunak Kumar, Sarah Dean, Robert Kleinberg:
Online Convex Optimization with Unbounded Memory. NeurIPS 2023 - [c118]Daniel Amir, Tegan Wilson, Vishal Shrivastav, Hakim Weatherspoon, Robert Kleinberg:
Poster: Scalability and Congestion Control in Oblivious Reconfigurable Networks. SIGCOMM 2023: 1138-1140 - [c117]Princewill Okoroafor, Vaishnavi Gupta, Robert Kleinberg:
Non-Stochastic CDF Estimation Using Threshold Queries. SODA 2023: 3551-3572 - [i67]Princewill Okoroafor, Vaishnavi Gupta, Robert Kleinberg, Eleanor Goh:
Non-Stochastic CDF Estimation Using Threshold Queries. CoRR abs/2301.05682 (2023) - [i66]Robert Kleinberg, Renato Paes Leme, Jon Schneider, Yifeng Teng:
U-Calibration: Forecasting for an Unknown Agent. CoRR abs/2307.00168 (2023) - [i65]Tegan Wilson, Daniel Amir, Vishal Shrivastav, Robert Kleinberg, Hakim Weatherspoon:
Improving Oblivious Reconfigurable Networks with High Probability. CoRR abs/2308.14837 (2023) - [i64]Princewill Okoroafor, Robert Kleinberg, Wen Sun:
Faster Recalibration of an Online Predictor via Approachability. CoRR abs/2310.17002 (2023) - [i63]Bartek Wydrowski, Robert Kleinberg, Stephen M. Rumble, Aaron Archer:
Load is not what you should balance: Introducing Prequal. CoRR abs/2312.10172 (2023) - 2022
- [j48]Jon M. Kleinberg, Robert Kleinberg, Sigal Oren:
Optimal stopping with behaviorally biased agents: The role of loss aversion and changing reference points. Games Econ. Behav. 133: 282-299 (2022) - [j47]Hyung-Chan An, Robert Kleinberg:
A diameter-revealing proof of the Bondy-Lovász lemma. Inf. Process. Lett. 174: 106194 (2022) - [c116]Raunak Kumar, Robert Kleinberg:
Non-monotonic Resource Utilization in the Bandits with Knapsacks Problem. NeurIPS 2022 - [c115]Makis Arsenis, Robert Kleinberg:
Individual Fairness in Prophet Inequalities. EC 2022: 245 - [c114]Daniel Amir, Tegan Wilson, Vishal Shrivastav, Hakim Weatherspoon, Robert Kleinberg, Rachit Agarwal:
Optimal oblivious reconfigurable networks. STOC 2022: 1339-1352 - [i62]Makis Arsenis, Robert Kleinberg:
Individual Fairness in Prophet Inequalities. CoRR abs/2205.10302 (2022) - [i61]Raunak Kumar, Robert Kleinberg:
Non-monotonic Resource Utilization in the Bandits with Knapsacks Problem. CoRR abs/2209.12013 (2022) - [i60]Raunak Kumar, Sarah Dean, Robert D. Kleinberg:
Online Convex Optimization with Unbounded Memory. CoRR abs/2210.09903 (2022) - 2021
- [j46]Shaddin Dughmi, Jason D. Hartline, Robert D. Kleinberg, Rad Niazadeh:
Bernoulli Factories and Black-box Reductions in Mechanism Design. J. ACM 68(2): 10:1-10:30 (2021) - [j45]Hu Fu, Nima Haghpanah, Jason D. Hartline, Robert Kleinberg:
Full surplus extraction from samples. J. Econ. Theory 193: 105230 (2021) - [j44]Hyung-Chan An, Robert Kleinberg, David B. Shmoys:
Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem. ACM Trans. Algorithms 17(4): 35:1-35:12 (2021) - [c113]Robert Kleinberg, Oliver Korten, Daniel Mitropolsky, Christos H. Papadimitriou:
Total Functions in the Polynomial Hierarchy. ITCS 2021: 44:1-44:18 - [c112]Jon M. Kleinberg, Robert Kleinberg, Sigal Oren:
Optimal Stopping with Behaviorally Biased Agents: The Role of Loss Aversion and Changing Reference Points. EC 2021: 681-682 - [c111]Makis Arsenis, Odysseas Drosis, Robert Kleinberg:
Constrained-Order Prophet Inequalities. SODA 2021: 2034-2046 - [c110]Siddhartha Banerjee, David Kempe, Robert Kleinberg:
Threshold Tests as Quality Signals: Optimal Strategies, Equilibria, and Price of Anarchy. WINE 2021: 299-316 - [i59]Jon M. Kleinberg, Robert Kleinberg, Sigal Oren:
Optimal Stopping with Behaviorally Biased Agents: The Role of Loss Aversion and Changing Reference Points. CoRR abs/2106.00604 (2021) - [i58]Siddhartha Banerjee, David Kempe, Robert Kleinberg:
Threshold Tests as Quality Signals: Optimal Strategies, Equilibria, and Price of Anarchy. CoRR abs/2110.10881 (2021) - [i57]Daniel Amir, Tegan Wilson, Vishal Shrivastav, Hakim Weatherspoon, Robert Kleinberg, Rachit Agarwal:
Optimal Oblivious Reconfigurable Networks. CoRR abs/2111.08780 (2021) - 2020
- [c109]Makis Arsenis, Robert Kleinberg:
Online Flow Computation on Unit-Vertex-Capacitated Networks. APOCS 2020: 120-132 - [c108]Makis Arsenis, Odysseas Drosis, Robert Kleinberg:
Revenue Monotonicity Under Misspecified Bidders. WINE 2020: 191-205 - [i56]Makis Arsenis, Odysseas Drosis, Robert Kleinberg:
Revenue Monotonicity Under Misspecified Bidders. CoRR abs/2007.10602 (2020) - [i55]Makis Arsenis, Odysseas Drosis, Robert Kleinberg:
Constrained-Order Prophet Inequalities. CoRR abs/2010.09705 (2020) - [i54]Hyung-Chan An, Robert Kleinberg, David B. Shmoys:
Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem. CoRR abs/2012.14233 (2020) - [i53]Robert Kleinberg, Daniel Mitropolsky, Christos H. Papadimitriou:
Total Functions in the Polynomial Hierarchy. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j43]Robert Kleinberg, S. Matthew Weinberg:
Matroid prophet inequalities and applications to multi-dimensional mechanism design. Games Econ. Behav. 113: 97-115 (2019) - [j42]Pablo Daniel Azar, Robert Kleinberg, S. Matthew Weinberg:
Prior independent mechanisms via prophet inequalities with limited information. Games Econ. Behav. 118: 511-532 (2019) - [j41]Robert Kleinberg, Aleksandrs Slivkins, Eli Upfal:
Bandits and Experts in Metric Spaces. J. ACM 66(4): 30:1-30:77 (2019) - [j40]Jess Banks, Robert Kleinberg, Cristopher Moore:
The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime. SIAM J. Comput. 48(3): 1098-1119 (2019) - [j39]Edward Tremel, Ken Birman, Robert Kleinberg, Márk Jelasity:
Anonymous, Fault-Tolerant Distributed Queries for Smart Devices. ACM Trans. Cyber Phys. Syst. 3(2): 16:1-16:29 (2019) - [c107]Hedyeh Beyhaghi, Robert Kleinberg:
Pandora's Problem with Nonobligatory Inspection. EC 2019: 131-132 - [c106]Maithra Raghu, Katy Blumer, Rory Sayres, Ziad Obermeyer, Robert D. Kleinberg, Sendhil Mullainathan, Jon M. Kleinberg:
Direct Uncertainty Prediction for Medical Second Opinions. ICML 2019: 5281-5290 - [c105]Robert Kleinberg, Kevin Leyton-Brown, Brendan Lucier, Devon R. Graham:
Procrastinating with Confidence: Near-Optimal, Anytime, Adaptive Algorithm Configuration. NeurIPS 2019: 8881-8891 - [i52]Robert Kleinberg, Kevin Leyton-Brown, Brendan Lucier, Devon R. Graham:
Procrastinating with Confidence: Near-Optimal, Anytime, Adaptive Algorithm Configuration. CoRR abs/1902.05454 (2019) - [i51]Hedyeh Beyhaghi, Robert Kleinberg:
Pandora's Problem with Nonobligatory Inspection. CoRR abs/1905.01428 (2019) - 2018
- [j38]Ashwinkumar Badanidiyuru, Robert Kleinberg, Aleksandrs Slivkins:
Bandits with Knapsacks. J. ACM 65(3): 13:1-13:55 (2018) - [j37]Moshe Babaioff, Nicole Immorlica, David Kempe, Robert Kleinberg:
Matroid Secretary Problems. J. ACM 65(6): 35:1-35:26 (2018) - [j36]Jonah Kallenbach, Robert Kleinberg, Scott Duke Kominers:
Orienteering for electioneering. Oper. Res. Lett. 46(2): 205-210 (2018) - [j35]Robert Soulé, Shrutarshi Basu, Parisa Jalili Marandi, Fernando Pedone, Robert Kleinberg, Emin Gün Sirer, Nate Foster:
Merlin: A Language for Managing Network Resources. IEEE/ACM Trans. Netw. 26(5): 2188-2201 (2018) - [c104]Praveen Kumar, Yang Yuan, Chris Yu, Nate Foster, Robert Kleinberg, Petr Lapukhov, Chiunlin Lim, Robert Soulé:
Semi-Oblivious Traffic Engineering with SMORE. ANRW 2018: 21 - [c103]Robert Kleinberg, Nicole Immorlica:
Recharging Bandits. FOCS 2018: 309-319 - [c102]Maithra Raghu, Alex Irpan, Jacob Andreas, Robert Kleinberg, Quoc V. Le, Jon M. Kleinberg:
Can Deep Reinforcement Learning solve Erdos-Selfridge-Spencer Games? ICLR (Workshop) 2018 - [c101]Robert Kleinberg, Yuanzhi Li, Yang Yuan:
An Alternative View: When Does SGD Escape Local Minima? ICML 2018: 2703-2712 - [c100]Maithra Raghu, Alex Irpan, Jacob Andreas, Robert Kleinberg, Quoc V. Le, Jon M. Kleinberg:
Can Deep Reinforcement Learning Solve Erdos-Selfridge-Spencer Games? ICML 2018: 4235-4243 - [c99]Praveen Kumar, Yang Yuan, Chris Yu, Nate Foster, Robert Kleinberg, Petr Lapukhov, Chiunlin Lim, Robert Soulé:
Semi-Oblivious Traffic Engineering: The Road Not Taken. NSDI 2018: 157-170 - [c98]Jon M. Kleinberg, Robert Kleinberg:
Delegated Search Approximates Efficient Search. EC 2018: 287-302 - [c97]Praveen Kumar, Chris Yu, Yang Yuan, Nate Foster, Robert Kleinberg, Robert Soulé:
YATES: Rapid Prototyping for Traffic Engineering Systems. SOSR 2018: 11:1-11:7 - [i50]Robert Kleinberg, Yuanzhi Li, Yang Yuan:
An Alternative View: When Does SGD Escape Local Minima? CoRR abs/1802.06175 (2018) - [i49]Jon M. Kleinberg, Robert Kleinberg:
Delegated Search Approximates Efficient Search. CoRR abs/1806.06933 (2018) - 2017
- [j34]Shaddin Dughmi, Jason D. Hartline, Robert Kleinberg, Rad Niazadeh:
Bernoulli factories and black-box reductions in mechanism design. SIGecom Exch. 16(1): 58-71 (2017) - [c96]Jess Banks, Robert Kleinberg, Cristopher Moore:
The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime. APPROX-RANDOM 2017: 28:1-28:22 - [c95]Robert Kleinberg, Kevin Leyton-Brown, Brendan Lucier:
Efficiency Through Procrastination: Approximately Optimal Algorithm Configuration with Runtime Guarantees. IJCAI 2017: 2023-2031 - [c94]Arpita Ghosh, Robert Kleinberg:
Inferential Privacy Guarantees for Differentially Private Mechanisms. ITCS 2017: 9:1-9:3 - [c93]Nicole Immorlica, Robert Kleinberg, Brendan Lucier, Morteza Zadomighaddam:
Exponential Segregation in a Two-Dimensional Schelling Model with Tolerant Individuals. SODA 2017: 984-993 - [c92]Melika Abolhassani, Soheil Ehsani, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Robert D. Kleinberg, Brendan Lucier:
Beating 1-1/e for ordered prophets. STOC 2017: 61-71 - [c91]Shaddin Dughmi, Jason D. Hartline, Robert Kleinberg, Rad Niazadeh:
Bernoulli factories and black-box reductions in mechanism design. STOC 2017: 158-169 - [i48]Shaddin Dughmi, Jason D. Hartline, Robert D. Kleinberg, Rad Niazadeh:
Bernoulli Factories and Black-Box Reductions in Mechanism Design. CoRR abs/1703.04143 (2017) - [i47]Melika Abolhassani, Soheil Ehsani, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Robert Kleinberg, Brendan Lucier:
Beating 1-1/e for Ordered Prophets. CoRR abs/1704.05836 (2017) - [i46]Jess Banks, Robert Kleinberg, Cristopher Moore:
The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime. CoRR abs/1705.01194 (2017) - [i45]Maithra Raghu, Alex Irpan, Jacob Andreas, Robert Kleinberg, Quoc V. Le, Jon M. Kleinberg:
Can Deep Reinforcement Learning Solve Erdos-Selfridge-Spencer Games? CoRR abs/1711.02301 (2017) - 2016
- [j33]Arpita Ghosh, Robert D. Kleinberg:
Optimal Contest Design for Simple Agents. ACM Trans. Economics and Comput. 4(4): 22:1-22:41 (2016) - [c90]Piotr Indyk, Robert D. Kleinberg, Sepideh Mahabadi, Yang Yuan:
Simultaneous Nearest Neighbor Search. SoCG 2016: 44:1-44:15 - [c89]Robert D. Kleinberg, Bo Waggoner, E. Glen Weyl:
Descending Price Optimally Coordinates Search. EC 2016: 23-24 - [i44]Praveen Kumar, Yang Yuan, Chris Yu, Nate Foster, Robert D. Kleinberg, Robert Soulé:
Kulfi: Robust Traffic Engineering Using Semi-Oblivious Routing. CoRR abs/1603.01203 (2016) - [i43]Arpita Ghosh, Robert Kleinberg:
Inferential Privacy Guarantees for Differentially Private Mechanisms. CoRR abs/1603.01508 (2016) - [i42]Robert Kleinberg, Bo Waggoner, E. Glen Weyl:
Descending Price Coordinates Approximately Efficient Search. CoRR abs/1603.07682 (2016) - [i41]Piotr Indyk, Robert D. Kleinberg, Sepideh Mahabadi, Yang Yuan:
Simultaneous Nearest Neighbor Search. CoRR abs/1604.02188 (2016) - 2015
- [j32]Shahar Dobzinski, Hu Fu, Robert Kleinberg:
Approximately optimal auctions for correlated bidders. Games Econ. Behav. 92: 349-369 (2015) - [j31]Jason D. Hartline, Robert Kleinberg, Azarakhsh Malekian:
Bayesian incentive compatibility via matchings. Games Econ. Behav. 92: 401-429 (2015) - [j30]Moshe Babaioff, Robert D. Kleinberg, Aleksandrs Slivkins:
Truthful Mechanisms with Implicit Payment Computation. J. ACM 62(2): 10:1-10:37 (2015) - [j29]Hyung-Chan An, Robert D. Kleinberg, David B. Shmoys:
Improving Christofides' Algorithm for the s-t Path TSP. J. ACM 62(5): 34:1-34:28 (2015) - [j28]Lawrence E. Blume, David A. Easley, Jon M. Kleinberg, Robert D. Kleinberg, Éva Tardos:
Introduction to computer science and economic theory. J. Econ. Theory 156: 1-13 (2015) - [j27]Patrick Briest, Shuchi Chawla, Robert Kleinberg, S. Matthew Weinberg:
Pricing lotteries. J. Econ. Theory 156: 144-174 (2015) - [j26]Ken Birman, Márk Jelasity, Robert Kleinberg, Edward Tremel:
Building a Secure and Privacy-Preserving Smart Grid. ACM SIGOPS Oper. Syst. Rev. 49(1): 131-136 (2015) - [j25]Moshe Babaioff, Shaddin Dughmi, Robert D. Kleinberg, Aleksandrs Slivkins:
Dynamic Pricing with Limited Supply. ACM Trans. Economics and Comput. 3(1): 4:1-4:26 (2015) - [c88]Paul Dütting, Robert Kleinberg:
Polymatroid Prophet Inequalities. ESA 2015: 437-449 - [c87]Thomas Kesselheim, Robert D. Kleinberg, Éva Tardos:
Smooth Online Mechanisms: A Game-Theoretic Problem in Renewable Energy Markets. EC 2015: 203-220 - [c86]Shahar Dobzinski, Hu Fu, Robert D. Kleinberg:
On the Complexity of Computing an Equilibrium in Combinatorial Auctions. SODA 2015: 110-122 - [c85]Thomas Kesselheim, Robert D. Kleinberg, Rad Niazadeh:
Secretary Problems with Non-Uniform Arrival Order. STOC 2015: 879-888 - [i40]Thomas Kesselheim, Robert D. Kleinberg, Rad Niazadeh:
Secretary Problems with Non-Uniform Arrival Order. CoRR abs/1502.02155 (2015) - [i39]Nicole Immorlica, Robert D. Kleinberg, Brendan Lucier, Morteza Zadomighaddam:
Exponential Segregation in a Two-Dimensional Schelling Model with Tolerant Individuals. CoRR abs/1511.02537 (2015) - 2014
- [j24]Aaron Archer, Robert Kleinberg:
Truthful germs are contagious: A local-to-global characterization of truthfulness. Games Econ. Behav. 86: 340-366 (2014) - [j23]Bruno D. Abrahao, Sucheta Soundarajan, John E. Hopcroft, Robert D. Kleinberg:
A separability framework for analyzing community structure. ACM Trans. Knowl. Discov. Data 8(1): 5:1-5:29 (2014) - [c84]Hu Fu, Robert D. Kleinberg:
Improved Lower Bounds for Testing Triangle-freeness in Boolean Functions via Fast Matrix Multiplication. APPROX-RANDOM 2014: 669-676 - [c83]Robert Soulé, Shrutarshi Basu, Parisa Jalili Marandi, Fernando Pedone, Robert D. Kleinberg, Emin Gün Sirer, Nate Foster:
Merlin: A Language for Provisioning Network Resources. CoNEXT 2014: 213-226 - [c82]Tian Lin, Bruno D. Abrahao, Robert D. Kleinberg, John C. S. Lui, Wei Chen:
Combinatorial Partial Monitoring Game with Linear Feedback and Its Applications. ICML 2014: 901-909 - [c81]Peter I. Frazier, David Kempe, Jon M. Kleinberg, Robert Kleinberg:
Incentivizing exploration. EC 2014: 5-22 - [c80]Hu Fu, Nima Haghpanah, Jason D. Hartline, Robert Kleinberg:
Optimal auctions for correlated buyers with sampling. EC 2014: 23-36 - [c79]Arpita Ghosh, Robert Kleinberg:
Optimal contest design for simple agents. EC 2014: 913-930 - [c78]Pablo Daniel Azar, Robert Kleinberg, S. Matthew Weinberg:
Prophet Inequalities with Limited Information. SODA 2014: 1358-1377 - [c77]Rad Niazadeh, Yang Yuan, Robert D. Kleinberg:
Simple and Near-Optimal Mechanisms for Market Intermediation. WINE 2014: 386-399 - [i38]Shahar Dobzinski, Hu Fu, Robert Kleinberg:
On the Complexity of Computing an Equilibrium in Combinatorial Auctions. CoRR abs/1404.2041 (2014) - [i37]Hu Fu, Nima Haghpanah, Jason D. Hartline, Robert Kleinberg:
Optimal Auctions for Correlated Buyers with Sampling. CoRR abs/1406.1571 (2014) - [i36]Arpita Ghosh, Robert Kleinberg:
Behavioral Mechanism Design: Optimal Contests for Simple Agents. CoRR abs/1406.1790 (2014) - [i35]Robert Soulé, Shrutarshi Basu, Parisa Jalili Marandi, Fernando Pedone, Robert Kleinberg, Emin Gün Sirer, Nate Foster:
Merlin: A Language for Provisioning Network Resources. CoRR abs/1407.1199 (2014) - [i34]Rad Niazadeh, Yang Yuan, Robert D. Kleinberg:
Simple and Near-Optimal Mechanisms For Market Intermediation. CoRR abs/1409.2597 (2014) - 2013
- [j22]Chris Peikert, Robert Kleinberg, Aravind Srinivasan, Alan M. Frieze, Alexander Russell, Leonard J. Schulman:
Special Section on the Forty-Second Annual ACM Symposium on Theory of Computing (STOC 2010). SIAM J. Comput. 42(3): 1216-1217 (2013) - [j21]Lawrence E. Blume, David A. Easley, Jon M. Kleinberg, Robert Kleinberg, Éva Tardos:
Network Formation in the Presence of Contagious Risk. ACM Trans. Economics and Comput. 1(2): 6:1-6:20 (2013) - [j20]Anna Blasiak, Robert Kleinberg, Eyal Lubetzky:
Broadcasting With Side Information: Bounding and Approximating the Broadcast Rate. IEEE Trans. Inf. Theory 59(9): 5811-5823 (2013) - [c76]Robert Kleinberg:
Optimal Stopping Meets Combinatorial Optimization. COCOON 2013: 4 - [c75]Ashwinkumar Badanidiyuru, Robert Kleinberg, Aleksandrs Slivkins:
Bandits with Knapsacks. FOCS 2013: 207-216 - [c74]Robert Soulé, Shrutarshi Basu, Robert Kleinberg, Emin Gün Sirer, Nate Foster:
Managing the network with Merlin. HotNets 2013: 24:1-24:7 - [c73]Pedro Henrique Calais Guerra, Wagner Meira Jr., Claire Cardie, Robert Kleinberg:
A Measure of Polarization on Social Media Networks Based on Community Boundaries. ICWSM 2013 - [c72]Bruno D. Abrahao, Flavio Chierichetti, Robert Kleinberg, Alessandro Panconesi:
Trace complexity of network inference. KDD 2013: 491-499 - [c71]Moshe Babaioff, Robert Kleinberg, Aleksandrs Slivkins:
Multi-parameter mechanisms with implicit payment computation. EC 2013: 35-52 - [c70]Robert Kleinberg, Yang Yuan:
On the ratio of revenue to welfare in single-parameter mechanism design. EC 2013: 589-602 - [c69]Nikhil R. Devanur, Kamal Jain, Robert D. Kleinberg:
Randomized Primal-Dual analysis of RANKING for Online BiPartite Matching. SODA 2013: 101-107 - [e1]Robert D. Kleinberg:
Innovations in Theoretical Computer Science, ITCS '13, Berkeley, CA, USA, January 9-12, 2013. ACM 2013, ISBN 978-1-4503-1859-4 [contents] - [i33]Moshe Babaioff, Robert Kleinberg, Aleksandrs Slivkins:
Multi-parameter Mechanisms with Implicit Payment Computation. CoRR abs/1302.4138 (2013) - [i32]Robert Kleinberg, Yang Yuan:
On the Ratio of Revenue to Welfare in Single-Parameter Mechanism Design. CoRR abs/1305.0534 (2013) - [i31]Ashwinkumar Badanidiyuru, Robert Kleinberg, Aleksandrs Slivkins:
Bandits with Knapsacks. CoRR abs/1305.2545 (2013) - [i30]Pablo Daniel Azar, Robert Kleinberg, S. Matthew Weinberg:
Prophet Inequalities with Limited Information. CoRR abs/1307.3736 (2013) - [i29]Paul Duetting, Robert Kleinberg:
Polymatroid Prophet Inequalities. CoRR abs/1307.5299 (2013) - [i28]Hu Fu, Robert Kleinberg:
Improved Lower Bounds for Testing Triangle-freeness in Boolean Functions via Fast Matrix Multiplication. CoRR abs/1308.1643 (2013) - [i27]Bruno D. Abrahao, Flavio Chierichetti, Robert Kleinberg, Alessandro Panconesi:
Trace Complexity of Network Inference. CoRR abs/1308.2954 (2013) - [i26]Rad Niazadeh, Robert D. Kleinberg:
A Unified Approach to Online Allocation Algorithms via Randomized Dual Fitting. CoRR abs/1308.5444 (2013) - [i25]Robert Kleinberg, Aleksandrs Slivkins, Eli Upfal:
Bandits and Experts in Metric Spaces. CoRR abs/1312.1277 (2013) - 2012
- [j19]Yisong Yue, Josef Broder, Robert Kleinberg, Thorsten Joachims:
The K-armed dueling bandits problem. J. Comput. Syst. Sci. 78(5): 1538-1556 (2012) - [c68]Ashwinkumar Badanidiyuru, Robert Kleinberg, Hooyeon Lee:
Approximating low-dimensional coverage problems. SCG 2012: 161-170 - [c67]Bruno D. Abrahao, Sucheta Soundarajan, John E. Hopcroft, Robert Kleinberg:
On the separability of structural classes of communities. KDD 2012: 624-632 - [c66]Moshe Babaioff, Shaddin Dughmi, Robert Kleinberg, Aleksandrs Slivkins:
Dynamic pricing with limited supply. EC 2012: 74-91 - [c65]Moshe Babaioff, Robert Kleinberg, Renato Paes Leme:
Optimal mechanisms for selling information. EC 2012: 92-109 - [c64]Ashwinkumar Badanidiyuru, Robert Kleinberg, Yaron Singer:
Learning on a budget: posted price mechanisms for online procurement. EC 2012: 128-145 - [c63]Hu Fu, Robert Kleinberg, Ron Lavi:
Conditional equilibrium outcomes via ascending price processes with applications to combinatorial auctions with item bidding. EC 2012: 586 - [c62]Ashwinkumar Badanidiyuru, Shahar Dobzinski, Hu Fu, Robert Kleinberg, Noam Nisan, Tim Roughgarden:
Sketching valuation functions. SODA 2012: 1025-1035 - [c61]Robert Kleinberg, S. Matthew Weinberg:
Matroid prophet inequalities. STOC 2012: 123-136 - [c60]Christina Brandt, Nicole Immorlica, Gautam Kamath, Robert Kleinberg:
An analysis of one-dimensional schelling segregation. STOC 2012: 789-804 - [c59]Hyung-Chan An, Robert Kleinberg, David B. Shmoys:
Improving christofides' algorithm for the s-t path TSP. STOC 2012: 875-886 - [i24]Robert Kleinberg, S. Matthew Weinberg:
Matroid Prophet Inequalities. CoRR abs/1201.4764 (2012) - [i23]Christina Brandt, Nicole Immorlica, Gautam Kamath, Robert D. Kleinberg:
An Analysis of One-Dimensional Schelling Segregation. CoRR abs/1203.6346 (2012) - [i22]Moshe Babaioff, Robert Kleinberg, Renato Paes Leme:
Optimal Mechanisms for Selling Information. CoRR abs/1204.5519 (2012) - 2011
- [j18]Robert Kleinberg, Georgios Piliouras, Éva Tardos:
Load balancing without regret in the bulletin board model. Distributed Comput. 24(1): 21-29 (2011) - [c58]Lawrence E. Blume, David A. Easley, Jon M. Kleinberg, Robert Kleinberg, Éva Tardos:
Which Networks are Least Susceptible to Cascading Failures? FOCS 2011: 393-402 - [c57]Anna Blasiak, Robert Kleinberg, Eyal Lubetzky:
Lexicographic Products and the Power of Non-linear Network Coding. FOCS 2011: 609-618 - [c56]Robert D. Kleinberg, Katrina Ligett, Georgios Piliouras, Éva Tardos:
Beyond the Nash Equilibrium Barrier. ICS 2011: 125-140 - [c55]Larry Blume, David A. Easley, Jon M. Kleinberg, Robert D. Kleinberg, Éva Tardos:
Network formation in the presence of contagious risk. EC 2011: 1-10 - [c54]Jason D. Hartline, Robert Kleinberg, Azarakhsh Malekian:
Bayesian Incentive Compatibility via Matchings. SODA 2011: 734-747 - [c53]Shahar Dobzinski, Hu Fu, Robert D. Kleinberg:
Optimal auctions with correlated bidders are easy. STOC 2011: 129-138 - [i21]Anna Blasiak, Robert Kleinberg, Eyal Lubetzky:
Lexicographic products and the power of non-linear network coding. CoRR abs/1108.2489 (2011) - [i20]Moshe Babaioff, Shaddin Dughmi, Robert Kleinberg, Aleksandrs Slivkins:
Dynamic Pricing with Limited Supply. CoRR abs/1108.4142 (2011) - [i19]Hyung-Chan An, Robert Kleinberg, David B. Shmoys:
Improving Christofides' Algorithm for the s-t Path TSP. CoRR abs/1110.4604 (2011) - [i18]Hyung-Chan An, Robert Kleinberg:
A Diameter-Revealing Proof of the Bondy-Lovász Lemma. CoRR abs/1111.6561 (2011) - [i17]Ashwinkumar Badanidiyuru, Robert Kleinberg, Hooyeon Lee:
Approximating Low-Dimensional Coverage Problems. CoRR abs/1112.0689 (2011) - 2010
- [j17]Robert Kleinberg, Alexandru Niculescu-Mizil, Yogeshwer Sharma:
Regret bounds for sleeping experts and bandits. Mach. Learn. 80(2-3): 245-272 (2010) - [c52]Alon Altman, Robert Kleinberg:
Nonmanipulable Randomized Tournament Selections. AAAI 2010: 686-690 - [c51]Hyung-Chan An, Robert D. Kleinberg, David B. Shmoys:
Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem. APPROX-RANDOM 2010: 1-11 - [c50]Igor Gorodezky, Robert D. Kleinberg, David B. Shmoys, Gwen Spencer:
Improved Lower Bounds for the Universal and a priori TSP. APPROX-RANDOM 2010: 178-191 - [c49]Anna Blasiak, Robert D. Kleinberg:
The Serializability of Network Codes. ICALP (2) 2010: 100-114 - [c48]Moshe Babaioff, Robert D. Kleinberg, Aleksandrs Slivkins:
Truthful mechanisms with implicit payment computation. EC 2010: 43-52 - [c47]David Buchfuhrer, Shaddin Dughmi, Hu Fu, Robert Kleinberg, Elchanan Mossel, Christos H. Papadimitriou, Michael Schapira, Yaron Singer, Christopher Umans:
Inapproximability for VCG-Based Combinatorial Auctions. SODA 2010: 518-536 - [c46]Patrick Briest, Shuchi Chawla, Robert Kleinberg, S. Matthew Weinberg:
Pricing Randomized Allocations. SODA 2010: 585-597 - [c45]Robert Kleinberg, Aleksandrs Slivkins:
Sharp Dichotomies for Regret Minimization in Metric Spaces. SODA 2010: 827-846 - [i16]Anna Blasiak, Robert Kleinberg:
The Serializability of Network Codes. CoRR abs/1001.1373 (2010) - [i15]Anna Blasiak, Robert D. Kleinberg, Eyal Lubetzky:
Index coding via linear programming. CoRR abs/1004.1379 (2010) - [i14]Moshe Babaioff, Robert D. Kleinberg, Aleksandrs Slivkins:
Truthful Mechanisms with Implicit Payment Computation. CoRR abs/1004.3630 (2010) - [i13]Robert Kleinberg, Katrina Ligett:
Privacy-Compatibility For General Utility Metrics. CoRR abs/1010.2705 (2010) - [i12]Shahar Dobzinski, Hu Fu, Robert Kleinberg:
Optimal Auctions with Correlated Bidders are Easy. CoRR abs/1011.2413 (2010) - [i11]Shahar Dobzinski, Hu Fu, Robert Kleinberg:
Truthfulness via Proxies. CoRR abs/1011.3232 (2010)
2000 – 2009
- 2009
- [j16]Di Wang, Robert Kleinberg:
Analyzing quadratic unconstrained binary optimization problems via multicommodity flows. Discret. Appl. Math. 157(18): 3746-3753 (2009) - [j15]Moshe Babaioff, Robert Kleinberg, Christos H. Papadimitriou:
Congestion games with malicious players. Games Econ. Behav. 67(1): 22-35 (2009) - [j14]Robert D. Kleinberg, Christian Scheideler:
Foreword. Theory Comput. Syst. 45(2): 187 (2009) - [j13]Steve Butler, Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton:
Hat Guessing Games. SIAM Rev. 51(2): 399-413 (2009) - [c44]Eyal Even-Dar, Robert Kleinberg, Shie Mannor, Yishay Mansour:
Online Learning for Global Cost Functions. COLT 2009 - [c43]Yisong Yue, Josef Broder, Robert Kleinberg, Thorsten Joachims:
The K-armed Dueling Bandits Problem. COLT 2009 - [c42]Kamalika Chaudhuri, Constantinos Daskalakis, Robert D. Kleinberg, Henry Lin:
Online Bipartite Perfect Matching With Augmentations. INFOCOM 2009: 1044-1052 - [c41]Robert D. Kleinberg, Georgios Piliouras, Éva Tardos:
Load balancing without regret in the bulletin board model. PODC 2009: 56-62 - [c40]Moshe Babaioff, Jason D. Hartline, Robert D. Kleinberg:
Selling ad campaigns: online algorithms with cancellations. EC 2009: 61-70 - [c39]Robert Kleinberg, Georgios Piliouras, Éva Tardos:
Multiplicative updates outperform generic no-regret learning in congestion games: extended abstract. STOC 2009: 533-542 - [c38]B. V. Ashwinkumar, Robert Kleinberg:
Randomized Online Algorithms for the Buyback Problem. WINE 2009: 529-536 - [i10]Patrick Briest, Shuchi Chawla, Robert D. Kleinberg, S. Matthew Weinberg:
Pricing Randomized Allocations. CoRR abs/0904.2400 (2009) - [i9]Shaddin Dughmi, Hu Fu, Robert Kleinberg:
Amplified Hardness of Approximation for VCG-Based Mechanisms. CoRR abs/0907.1948 (2009) - [i8]B. V. Ashwinkumar, Robert Kleinberg:
Randomized Online Algorithms for the Buyback Problem. CoRR abs/0908.0043 (2009) - [i7]Robert D. Kleinberg, Aleksandrs Slivkins:
Sharp Dichotomies for Regret Minimization in Metric Spaces. CoRR abs/0911.1174 (2009) - 2008
- [j12]Baruch Awerbuch, Robert Kleinberg:
Online linear optimization and adaptive routing. J. Comput. Syst. Sci. 74(1): 97-114 (2008) - [j11]Baruch Awerbuch, Robert Kleinberg:
Competitive collaborative learning. J. Comput. Syst. Sci. 74(8): 1271-1288 (2008) - [j10]Steve Butler, Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton:
Hat Guessing Games. SIAM J. Discret. Math. 22(2): 592-605 (2008) - [j9]Moshe Babaioff, Nicole Immorlica, David Kempe, Robert Kleinberg:
Online auctions and generalized secretary problems. SIGecom Exch. 7(2) (2008) - [j8]Aaron Archer, Robert Kleinberg:
Characterizing truthful mechanisms with convex type spaces. SIGecom Exch. 7(3) (2008) - [c37]Robert D. Kleinberg, Alexandru Niculescu-Mizil, Yogeshwer Sharma:
Regret Bounds for Sleeping Experts and Bandits. COLT 2008: 425-436 - [c36]Filip Radlinski, Robert Kleinberg, Thorsten Joachims:
Learning diverse rankings with multi-armed bandits. ICML 2008: 784-791 - [c35]Bruno D. Abrahao, Robert D. Kleinberg:
On the internet delay space dimensionality. Internet Measurement Conference 2008: 157-168 - [c34]Bruno D. Abrahao, Robert D. Kleinberg:
On the internet delay space dimensionality. PODC 2008: 419 - [c33]Aaron Archer, Robert Kleinberg:
Truthful germs are contagious: a local to global characterization of truthfulness. EC 2008: 21-30 - [c32]Robert Kleinberg, Aleksandrs Slivkins, Eli Upfal:
Multi-armed bandits in metric spaces. STOC 2008: 681-690 - [i6]Shuchi Chawla, Jason D. Hartline, Robert Kleinberg:
Algorithmic Pricing via Virtual Valuations. CoRR abs/0808.1671 (2008) - [i5]Robert Kleinberg, Aleksandrs Slivkins, Eli Upfal:
Multi-Armed Bandits in Metric Spaces. CoRR abs/0809.4882 (2008) - 2007
- [j7]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. J. ACM 54(4): 16 (2007) - [j6]James Demmel, Ioana Dumitriu, Olga Holtz, Robert Kleinberg:
Fast matrix multiplication is stable. Numerische Mathematik 106(2): 199-224 (2007) - [j5]Raissa M. D'Souza, Christian Borgs, Jennifer T. Chayes, Noam Berger, Robert D. Kleinberg:
Emergence of tempered preferential attachment from optimization. Proc. Natl. Acad. Sci. USA 104(15): 6112-6117 (2007) - [j4]Baruch Awerbuch, Mohammad Taghi Hajiaghayi, Robert Kleinberg, Tom Leighton:
Localized Client-Server Load Balancing without Global Information. SIAM J. Comput. 37(4): 1259-1279 (2007) - [j3]Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Harald Räcke, Tom Leighton:
Oblivious routing on node-capacitated and directed graphs. ACM Trans. Algorithms 3(4): 51 (2007) - [c31]Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tuomas Sandholm:
Automated Online Mechanism Design and Prophet Inequalities. AAAI 2007: 58-65 - [c30]Moshe Babaioff, Nicole Immorlica, David Kempe, Robert Kleinberg:
A Knapsack Secretary Problem with Applications. APPROX-RANDOM 2007: 16-28 - [c29]Robert Kleinberg:
Geographic Routing Using Hyperbolic Space. INFOCOM 2007: 1902-1909 - [c28]Nicholas J. A. Harvey, Robert Kleinberg, Chandra Nair, Yunnan Wu:
A "Chicken & Egg" Network Coding Problem. ISIT 2007: 131-135 - [c27]Moshe Babaioff, Robert Kleinberg, Christos H. Papadimitriou:
Congestion games with malicious players. EC 2007: 103-112 - [c26]Shuchi Chawla, Jason D. Hartline, Robert D. Kleinberg:
Algorithmic pricing via virtual valuations. EC 2007: 243-251 - [c25]Moshe Babaioff, Nicole Immorlica, Robert Kleinberg:
Matroids, secretary problems, and online mechanisms. SODA 2007: 434-443 - [c24]Richard M. Karp, Robert Kleinberg:
Noisy binary search and its applications. SODA 2007: 881-890 - [c23]Mohammad Taghi Hajiaghayi, Robert Kleinberg, Tom Leighton:
Semi-oblivious routing: lower bounds. SODA 2007: 929-938 - [i4]Raissa M. D'Souza, Christian Borgs, Jennifer T. Chayes, Noam Berger, Robert D. Kleinberg:
Fitting the WHOIS Internet data. CoRR abs/cs/0701198 (2007) - 2006
- [j2]Nicholas J. A. Harvey, Robert D. Kleinberg, April Rasala Lehman:
On the capacity of information networks. IEEE Trans. Inf. Theory 52(6): 2345-2364 (2006) - [c22]Micah Adler, Nicholas J. A. Harvey, Kamal Jain, Robert D. Kleinberg, April Rasala Lehman:
On the capacity of information networks. SODA 2006: 241-250 - [c21]Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Frank Thomson Leighton:
Improved lower and upper bounds for universal TSP in planar metrics. SODA 2006: 649-658 - [c20]Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Frank Thomson Leighton, Harald Räcke:
New lower bounds for oblivious routing in undirected graphs. SODA 2006: 918-927 - [c19]Robert D. Kleinberg:
Anytime algorithms for multi-armed bandit problems. SODA 2006: 928-936 - [c18]Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton:
Semi-oblivious routing. SPAA 2006: 234 - [c17]Nicole Immorlica, Robert D. Kleinberg, Mohammad Mahdian:
Secretary Problems with Competing Employers. WINE 2006: 389-400 - [i3]James Demmel, Ioana Dumitriu, Olga Holtz, Robert Kleinberg:
Fast matrix multiplication is stable. CoRR abs/math/0603207 (2006) - 2005
- [c16]Baruch Awerbuch, Robert D. Kleinberg:
Competitive Collaborative Learning. COLT 2005: 233-248 - [c15]Henry Cohn, Robert D. Kleinberg, Balázs Szegedy, Christopher Umans:
Group-theoretic Algorithms for Matrix Multiplication. FOCS 2005: 379-388 - [c14]Baruch Awerbuch, David Holmer, Herbert Rubens, Robert D. Kleinberg:
Provably competitive adaptive routing. INFOCOM 2005: 631-641 - [c13]Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Mohammad Mahdian, David C. Parkes:
Online auctions with re-usable goods. EC 2005: 165-174 - [c12]Baruch Awerbuch, Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton:
Online client-server load balancing without global information. SODA 2005: 197-206 - [c11]Robert D. Kleinberg, Jon M. Kleinberg:
Isomorphism and embedding problems for infinite limits of scale-free graphs. SODA 2005: 277-286 - [c10]Robert D. Kleinberg:
A multiple-choice secretary algorithm with applications to online auctions. SODA 2005: 630-631 - [c9]Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton, Harald Räcke:
Oblivious routing on node-capacitated and directed graphs. SODA 2005: 782-790 - [c8]Uriel Feige, Abraham Flaxman, Jason D. Hartline, Robert D. Kleinberg:
On the Competitive Ratio of the Random Sampling Auction. WINE 2005: 878-886 - [i2]Noam Berger, Christian Borgs, Jennifer T. Chayes, Raissa M. D'Souza, Robert D. Kleinberg:
Degree Distribution of Competition-Induced Preferential Attachment Graphs. CoRR abs/cond-mat/0502205 (2005) - 2004
- [j1]Leonidas I. Kontothanassis, Ramesh K. Sitaraman, Joel Wein, Duke Hong, Robert Kleinberg, Brian Mancuso, David Shaw, Daniel Stodolsky:
A transport layer for live streaming in a content delivery network. Proc. IEEE 92(9): 1408-1419 (2004) - [c7]Noam Berger, Christian Borgs, Jennifer T. Chayes, Raissa M. D'Souza, Robert D. Kleinberg:
Competition-Induced Preferential Attachment. ICALP 2004: 208-221 - [c6]Robert D. Kleinberg:
Nearly Tight Bounds for the Continuum-Armed Bandit Problem. NIPS 2004: 697-704 - [c5]Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, David C. Parkes:
Adaptive limited-supply online auctions. EC 2004: 71-80 - [c4]Baruch Awerbuch, Robert D. Kleinberg:
Adaptive routing with end-to-end feedback: distributed learning and geometric approaches. STOC 2004: 45-53 - [c3]Jiangzhuo Chen, Robert D. Kleinberg, László Lovász, Rajmohan Rajaraman, Ravi Sundaram, Adrian Vetta:
(Almost) tight bounds and existence theorems for confluent flows. STOC 2004: 529-538 - [i1]Noam Berger, Christian Borgs, Jennifer T. Chayes, Raissa M. D'Souza, Robert D. Kleinberg:
Competition-Induced Preferential Attachment. CoRR cond-mat/0402268 (2004) - 2003
- [c2]Robert D. Kleinberg, Frank Thomson Leighton:
The Value of Knowing a Demand Curve: Bounds on Regret for Online Posted-Price Auctions. FOCS 2003: 594-605 - [c1]Robert D. Kleinberg, Frank Thomson Leighton:
Consistent load balancing via spread minimization. STOC 2003: 565-574
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
