default search action
Renato Paes Leme
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j18]Paul Dütting
, Silvio Lattanzi
Secretaries with Advice. Math. Oper. Res. 49(2): 856-879 (2024) - [j17]Rad Niazadeh, Renato Paes Leme, Jon Schneider:
Bernoulli Factories for Flow-Based Polytopes. SIAM J. Discret. Math. 38(1): 726-742 (2024) - [c64]Paul Dütting
Mechanism Design for Large Language Models. WWW 2024: 144-155 - [i52]R. Preston McAfee, Renato Paes Leme, Balasubramanian Sivan, Sergei Vassilvitskii:
Winner-Pays-Bid Auctions Minimize Variance. CoRR abs/2403.04856 (2024) - [i51]Renato Paes Leme, Georgios Piliouras, Jon Schneider, Kelly Spendlove, Song Zuo:
Dynamical Analysis of Autobidding Systems. CoRR abs/2406.19350 (2024) - [i50]Andrés Cristi, Paul Dütting, Robert Kleinberg, Renato Paes Leme:
Online Matroid Embeddings. CoRR abs/2407.10316 (2024) - [i49]Gagan Aggarwal, Ashwinkumar Badanidiyuru, Santiago R. Balseiro, Kshipra Bhawalkar, Yuan Deng, Zhe Feng, Gagan Goel, Christopher Liaw, Haihao Lu, Mohammad Mahdian, Jieming Mao, Aranyak Mehta, Vahab Mirrokni, Renato Paes Leme, Andrés Perlroth, Georgios Piliouras, Jon Schneider, Ariel Schvartzman, Balasubramanian Sivan, Kelly Spendlove, Yifeng Teng, Di Wang, Hanrui Zhang, Mingfei Zhao, Wennan Zhu, Song Zuo:
Auto-bidding and Auctions in Online Advertising: A Survey. CoRR abs/2408.07685 (2024) - 2023
- [c63]Bobby Kleinberg, Renato Paes Leme, Jon Schneider, Yifeng Teng:
U-Calibration: Forecasting for an Unknown Agent. COLT 2023: 5143-5145 - [c62]Renato Paes Leme
Description Complexity of Regular Distributions. EC 2023: 959 - [c61]Renato Paes Leme, Balasubramanian Sivan, Yifeng Teng, Pratik Worah:
Pricing Query Complexity of Revenue Maximization. SODA 2023: 399-415 - [c60]Gagan Goel
Eligibility Mechanisms: Auctions Meet Information Retrieval. WWW 2023: 3541-3549 - [i48]Renato Paes Leme, Balasubramanian Sivan, Yifeng Teng, Pratik Worah:
Description Complexity of Regular Distributions. CoRR abs/2305.05590 (2023) - [i47]Robert Kleinberg, Renato Paes Leme, Jon Schneider, Yifeng Teng:
U-Calibration: Forecasting for an Unknown Agent. CoRR abs/2307.00168 (2023) - [i46]Renato Paes Leme, Jon Schneider, Shuran Zheng:
Bayesian Conversations. CoRR abs/2307.08827 (2023) - [i45]Khashayar Khosravi, Renato Paes Leme, Chara Podimata, Apostolis Tsorvantzis:
Bandits with Deterministically Evolving States. CoRR abs/2307.11655 (2023) - [i44]Renato Paes Leme, Jon Schneider, Hanrui Zhang:
Nonbossy Mechanisms: Mechanism Design Robust to Secondary Goals. CoRR abs/2307.11967 (2023) - [i43]Paul Duetting, Vahab Mirrokni, Renato Paes Leme, Haifeng Xu, Song Zuo:
Mechanism Design for Large Language Models. CoRR abs/2310.10826 (2023) - [i42]Jiahao Zhang, Shuran Zheng, Renato Paes Leme, Zhiwei Steven Wu:
Ex-post Individually Rational Bayesian Persuasion. CoRR abs/2312.04973 (2023) - 2022
- [j16]Santiago R. Balseiro
Dynamic Double Auctions: Toward First Best. Oper. Res. 70(4): 2299-2317 (2022) - [j15]Mahsa Derakhshan, Negin Golrezaei
Linear Program-Based Approximation for Personalized Reserve Prices. Manag. Sci. 68(3): 1849-1864 (2022) - [j14]Renato Paes Leme, Jon Schneider:
Contextual Search via Intrinsic Volumes. SIAM J. Comput. 51(4): 1096-1125 (2022) - [c59]Renato Paes Leme, Chara Podimata, Jon Schneider:
Corruption-Robust Contextual Search through Density Updates. COLT 2022: 3504-3505 - [c58]Jieming Mao, Renato Paes Leme, Kangning Wang
Interactive Communication in Bilateral Trade. ITCS 2022: 105:1-105:21 - [c57]Dirk Bergemann, Paul Dütting, Renato Paes Leme, Song Zuo:
Calibrated Click-Through Auctions. WWW 2022: 47-57 - [i41]Renato Paes Leme, Jon Schneider:
Multiparameter Bernoulli Factories. CoRR abs/2202.07216 (2022) - [i40]Renato Paes Leme, Chara Podimata, Jon Schneider:
Corruption-Robust Contextual Search through Density Updates. CoRR abs/2206.07528 (2022) - [i39]Rad Niazadeh, Renato Paes Leme, Jon Schneider:
Bernoulli Factories for Flow-Based Polytopes. CoRR abs/2207.08965 (2022) - 2021
- [j13]Hedyeh Beyhaghi, Negin Golrezaei
Improved Revenue Bounds for Posted-Price and Second-Price Mechanisms. Oper. Res. 69(6): 1805-1822 (2021) - [c56]Renato Paes Leme, Balasubramanian Sivan, Yifeng Teng, Pratik Worah:
Learning to Price Against a Moving Target. ICML 2021: 6223-6232 - [c55]Ehsan Emamjomeh-Zadeh, Renato Paes Leme, Jon Schneider, Balasubramanian Sivan:
Jointly Learning Prices and Product Features. IJCAI 2021: 2360-2366 - [c54]Sreenivas Gollapudi, Guru Guruganesh, Kostas Kollias, Pasin Manurangsi, Renato Paes Leme, Jon Schneider:
Contextual Recommendations and Low-Regret Cutting-Plane Algorithms. NeurIPS 2021: 22498-22508 - [c53]Paul Dütting, Silvio Lattanzi, Renato Paes Leme, Sergei Vassilvitskii:
Secretaries with Advice. EC 2021: 409-429 - [c52]Allen Liu, Renato Paes Leme, Martin Pál, Jon Schneider, Balasubramanian Sivan:
Variable Decomposition for Prophet Inequalities and Optimal Ordering. EC 2021: 692 - [c51]Allen Liu, Renato Paes Leme, Jon Schneider:
Optimal Contextual Pricing and Extensions. SODA 2021: 1059-1078 - [c50]Santiago R. Balseiro, Vahab S. Mirrokni, Renato Paes Leme, Song Zuo:
Non-Excludable Dynamic Mechanism Design. SODA 2021: 1357-1373 - [c49]Rad Niazadeh
Combinatorial Bernoulli factories: matchings, flows, and other polytopes. STOC 2021: 833-846 - [c48]Negin Golrezaei, Ilan Lobel, Renato Paes Leme:
Auction Design for ROI-Constrained Buyers. WWW 2021: 3941-3952 - [i38]Dirk Bergemann, Paul Duetting, Renato Paes Leme, Song Zuo:
Calibrated Click-Through Auctions: An Information Design Approach. CoRR abs/2105.09375 (2021) - [i37]Jieming Mao, Renato Paes Leme, Kangning Wang:
Interactive Communication in Bilateral Trade. CoRR abs/2106.02150 (2021) - [i36]Renato Paes Leme, Balasubramanian Sivan, Yifeng Teng, Pratik Worah:
Learning to Price Against a Moving Target. CoRR abs/2106.04689 (2021) - [i35]Sreenivas Gollapudi, Guru Guruganesh, Kostas Kollias, Pasin Manurangsi, Renato Paes Leme, Jon Schneider:
Contextual Recommendations and Low-Regret Cutting-Plane Algorithms. CoRR abs/2106.04819 (2021) - [i34]Renato Paes Leme, Balasubramanian Sivan, Yifeng Teng, Pratik Worah:
Pricing Query Complexity of Revenue Maximization. CoRR abs/2111.03158 (2021) - 2020
- [j12]Gagan Goel, Vahab S. Mirrokni, Renato Paes Leme:
Clinching auctions with online supply. Games Econ. Behav. 123: 342-358 (2020) - [j11]Maxime C. Cohen
Feature-Based Dynamic Pricing. Manag. Sci. 66(11): 4921-4943 (2020) - [j10]Eric Balkanski
On the Construction of Substitutes. Math. Oper. Res. 45(1): 272-291 (2020) - [j9]Renato Paes Leme
Computing Walrasian equilibria: fast algorithms and structural properties. Math. Program. 179(1): 343-384 (2020) - [c47]Renato Paes Leme, Jon Schneider:
Costly Zero Order Oracles. COLT 2020: 3120-3132 - [c46]Thodoris Lykouris, Vahab S. Mirrokni, Renato Paes Leme:
Bandits with Adversarial Scaling. ICML 2020: 6511-6521 - [c45]Allen Liu, Renato Paes Leme, Jon Schneider:
Myersonian Regression. NeurIPS 2020 - [c44]Renato Paes Leme, Balasubramanian Sivan, Yifeng Teng:
Why Do Competitive Markets Converge to First-Price Auctions? WWW 2020: 596-605 - [i33]Renato Paes Leme, Balasubramanian Sivan, Yifeng Teng:
Why Do Competitive Markets Converge to First-Price Auctions? CoRR abs/2001.06074 (2020) - [i32]Allen Liu, Renato Paes Leme, Jon Schneider:
Contextual Search for General Hypothesis Classes. CoRR abs/2003.01703 (2020) - [i31]Thodoris Lykouris, Vahab S. Mirrokni, Renato Paes Leme:
Bandits with adversarial scaling. CoRR abs/2003.02287 (2020) - [i30]Allen Liu, Renato Paes Leme, Martin Pal, Jon Schneider, Balasubramanian Sivan:
Competing Optimally Against An Imperfect Prophet. CoRR abs/2004.10163 (2020) - [i29]Rad Niazadeh, Renato Paes Leme, Jon Schneider:
Combinatorial Bernoulli Factories: Matchings, Flows and Other Polytopes. CoRR abs/2011.03865 (2020) - [i28]Paul Dütting, Silvio Lattanzi, Renato Paes Leme, Sergei Vassilvitskii:
Secretaries with Advice. CoRR abs/2011.06726 (2020)
2010 – 2019
- 2019
- [c43]Gagan Goel, Vahab S. Mirrokni, Renato Paes Leme:
Pareto Efficient Auctions with Interest Rates. AAAI 2019: 1989-1995 - [c42]Ilan Lobel, Renato Paes Leme:
Dynamic Contracting under Positive Commitment. AAAI 2019: 2101-2108 - [c41]Vahab S. Mirrokni, Renato Paes Leme, Pingzhong Tang, Song Zuo:
Optimal Dynamic Auctions Are Virtual Welfare Maximizers. AAAI 2019: 2125-2132 - [c40]Mahsa Derakhshan, Negin Golrezaei, Renato Paes Leme:
LP-based Approximation for Personalized Reserve Prices. EC 2019: 589 - [c39]Weiran Shen, Sébastien Lahaie, Renato Paes Leme:
Learning to Clear the Market. ICML 2019: 5710-5718 - [c38]Sepehr Assadi, Eric Balkanski, Renato Paes Leme:
Secretary Ranking with Minimal Inversions. NeurIPS 2019: 1049-1061 - [c37]Santiago R. Balseiro, Vahab S. Mirrokni, Renato Paes Leme, Song Zuo:
Dynamic Double Auctions: Towards First Best. SODA 2019: 157-172 - [i27]Mahsa Derakhshan, Negin Golrezaei, Renato Paes Leme:
LP-based Approximation for Personalized Reserve Prices. CoRR abs/1905.01526 (2019) - [i26]Weiran Shen, Sébastien Lahaie, Renato Paes Leme:
Learning to Clear the Market. CoRR abs/1906.01184 (2019) - 2018
- [j8]Ilan Lobel
Multidimensional Binary Search for Contextual Decision-Making. Oper. Res. 66(5): 1346-1361 (2018) - [j7]Santiago R. Balseiro
Dynamic Mechanisms with Martingale Utilities. Manag. Sci. 64(11): 5062-5082 (2018) - [c36]Renato Paes Leme, Jon Schneider:
Contextual Search via Intrinsic Volumes. FOCS 2018: 268-282 - [c35]Jieming Mao, Renato Paes Leme, Jon Schneider:
Contextual Pricing for Lipschitz Buyers. NeurIPS 2018: 5648-5656 - [c34]Vahab S. Mirrokni, Renato Paes Leme, Pingzhong Tang, Song Zuo:
Non-clairvoyant Dynamic Mechanism Design. EC 2018: 169 - [c33]Eric Balkanski, Renato Paes Leme:
On the Construction of Substitutes. EC 2018: 643 - [c32]Thodoris Lykouris
Stochastic bandits robust to adversarial corruptions. STOC 2018: 114-122 - [c31]Vahab S. Mirrokni, Renato Paes Leme, Rita Ren, Song Zuo:
Dynamic Mechanism Design in the Field. WWW 2018: 1359-1368 - [i25]Thodoris Lykouris, Vahab S. Mirrokni, Renato Paes Leme:
Stochastic bandits robust to adversarial corruptions. CoRR abs/1803.09353 (2018) - [i24]Renato Paes Leme, Jon Schneider:
Contextual Search via Intrinsic Volumes. CoRR abs/1804.03195 (2018) - [i23]Eric Balkanski, Renato Paes Leme:
On the Construction of Substitutes. CoRR abs/1805.03726 (2018) - [i22]Hedyeh Beyhaghi, Negin Golrezaei, Renato Paes Leme, Martin Pal, Balasubramanian Sivan:
Improved Approximations for Free-Order Prophets and Second-Price Auctions. CoRR abs/1807.03435 (2018) - [i21]Sepehr Assadi, Eric Balkanski, Renato Paes Leme:
Secretary Ranking with Minimal Inversions. CoRR abs/1811.06444 (2018) - [i20]Vahab S. Mirrokni, Renato Paes Leme, Pingzhong Tang, Song Zuo:
Optimal Dynamic Auctions are Virtual Welfare Maximizers. CoRR abs/1812.02993 (2018) - 2017
- [j6]Renato Paes Leme:
Gross substitutability: An algorithmic survey. Games Econ. Behav. 106: 294-316 (2017) - [j5]Maxime C. Cohen, Ilan Lobel, Renato Paes Leme:
Ellipsoids for contextual dynamic pricing. SIGecom Exch. 15(2): 40-44 (2017) - [c30]Vahab S. Mirrokni, Renato Paes Leme, Adrian Vladu, Sam Chiu-wai Wong:
Tight Bounds for Approximate Carathéodory and Beyond. ICML 2017: 2440-2448 - [c29]Alessandro Epasto
Ego-Splitting Framework: from Non-Overlapping to Overlapping Clusters. KDD 2017: 145-154 - [c28]Santiago R. Balseiro, Max Lin, Vahab S. Mirrokni, Renato Paes Leme, Song Zuo:
Dynamic Revenue Sharing. NIPS 2017: 2681-2689 - [c27]Santiago R. Balseiro, Vahab S. Mirrokni, Renato Paes Leme:
Dynamic Mechanisms with Martingale Utilities. EC 2017: 165 - [c26]Ilan Lobel, Renato Paes Leme, Adrian Vladu:
Multidimensional Binary Search for Contextual Decision-Making. EC 2017: 585 - [c25]Renato Paes Leme, Sam Chiu-wai Wong:
Computing Walrasian Equilibria: Fast Algorithms and Structural Properties. SODA 2017: 632-651 - 2016
- [c24]Gagan Goel, Stefano Leonardi, Vahab S. Mirrokni, Afshin Nikzad, Renato Paes Leme:
Reservation Exchange Markets for Internet Advertising. ICALP 2016: 142:1-142:13 - [c23]Vahab S. Mirrokni, Renato Paes Leme, Pingzhong Tang, Song Zuo:
Dynamic Auctions with Bank Accounts. IJCAI 2016: 387-393 - [c22]Hamid Nazerzadeh, Renato Paes Leme, Afshin Rostamizadeh, Umar Syed:
Where to Sell: Simulating Auctions From Learning Algorithms. EC 2016: 597-598 - [c21]Maxime C. Cohen, Ilan Lobel, Renato Paes Leme:
Feature-based Dynamic Pricing. EC 2016: 817 - [c20]Renato Paes Leme, Martin Pál, Sergei Vassilvitskii:
A Field Guide to Personalized Reserve Prices. WWW 2016: 1093-1102 - [i19]Renato Paes Leme, Martin Pal, Sergei Vassilvitskii:
A Field Guide to Personalized Reserve Prices. CoRR abs/1602.07720 (2016) - [i18]Vahab S. Mirrokni, Renato Paes Leme, Pingzhong Tang, Song Zuo:
Optimal dynamic mechanisms with ex-post IR via bank accounts. CoRR abs/1605.08840 (2016) - [i17]Ilan Lobel, Renato Paes Leme, Adrian Vladu:
Multidimensional Binary Search for Contextual Decision-Making. CoRR abs/1611.00829 (2016) - 2015
- [j4]Gagan Goel, Vahab S. Mirrokni, Renato Paes Leme:
Polyhedral Clinching Auctions and the AdWords Polytope. J. ACM 62(3): 18:1-18:27 (2015) - [j3]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos
Bounding the inefficiency of outcomes in generalized second price auctions. J. Econ. Theory 156: 343-388 (2015) - [c19]Gagan Goel, Mohammad Reza Khani, Renato Paes Leme:
Core-competitive Auctions. EC 2015: 149-166 - [c18]Moshe Babaioff, Renato Paes Leme, Balasubramanian Sivan:
Price Competition, Fluctuations and Welfare Guarantees. EC 2015: 759-776 - [i16]Gagan Goel, Mohammad Reza Khani, Renato Paes Leme:
Core-competitive Auctions. CoRR abs/1505.07911 (2015) - [i15]Renato Paes Leme, Sam Chiu-wai Wong:
Computing Walrasian Equilibria: Fast Algorithms and Economic Insights. CoRR abs/1511.04032 (2015) - [i14]Vahab S. Mirrokni, Renato Paes Leme, Adrian Vladu, Sam Chiu-wai Wong:
Tight Bounds for Approximate Carathéodory and Beyond. CoRR abs/1512.08602 (2015) - 2014
- [j2]Yuval Emek, Michal Feldman, Iftah Gamzu, Renato Paes Leme, Moshe Tennenholtz:
Signaling Schemes for Revenue Maximization. ACM Trans. Economics and Comput. 2(2): 5:1-5:19 (2014) - [c17]Abhimanyu Das, Sreenivas Gollapudi, Arindam Khan, Renato Paes Leme:
Role of conformity in opinion dynamics in social networks. COSN 2014: 25-36 - [c16]Shahar Dobzinski, Renato Paes Leme:
Efficiency Guarantees in Auctions with Budgets. ICALP (1) 2014: 392-404 - [c15]Gagan Goel, Vahab S. Mirrokni, Renato Paes Leme:
Clinching auctions beyond hard budget constraints. EC 2014: 167-184 - [c14]Moshe Babaioff, Brendan Lucier, Noam Nisan
On the efficiency of the walrasian mechanism. EC 2014: 783-800 - [c13]Moshe Babaioff, Noam Nisan
Price competition in online combinatorial markets. WWW 2014: 711-722 - [i13]Moshe Babaioff, Noam Nisan, Renato Paes Leme:
Price Competition in Online Combinatorial Markets. CoRR abs/1401.1559 (2014) - [i12]Gagan Goel, Vahab S. Mirrokni, Renato Paes Leme:
Clinching Auctions Beyond Hard Budget Constraints. CoRR abs/1404.5000 (2014) - [i11]Moshe Babaioff, Renato Paes Leme, Balasubramanian Sivan:
Price Competition, Fluctuations, and Welfare Guarantees. CoRR abs/1411.2036 (2014) - 2013
- [b1]Renato Paes Leme:
Design and Analysis of Sponsored Search Mechanisms. Cornell University, USA, 2013 - [c12]Michal Feldman, David Kempe, Brendan Lucier, Renato Paes Leme:
Pricing public goods for private sale. EC 2013: 417-434 - [c11]Gagan Goel, Vahab S. Mirrokni, Renato Paes Leme:
Clinching Auction with Online Supply. SODA 2013: 605-619 - [i10]Shahar Dobzinski, Renato Paes Leme:
Efficiency Guarantees in Auctions with Budgets. CoRR abs/1304.7048 (2013) - [i9]Michal Feldman, David Kempe, Brendan Lucier, Renato Paes Leme:
Pricing Public Goods for Private Sale. CoRR abs/1305.0085 (2013) - [i8]Moshe Babaioff, Brendan Lucier, Noam Nisan, Renato Paes Leme:
On the Efficiency of the Walrasian Mechanism. CoRR abs/1311.0924 (2013) - 2012
- [j1]Renato Paes Leme, Vasilis Syrgkanis, Éva Tardos:
The dining bidder problem: à la russe et à la française. SIGecom Exch. 11(2): 25-28 (2012) - [c10]Renato Paes Leme, Vasilis Syrgkanis, Éva Tardos:
The curse of simultaneity. ITCS 2012: 60-67 - [c9]Moshe Babaioff, Robert Kleinberg, Renato Paes Leme:
Optimal mechanisms for selling information. EC 2012: 92-109 - [c8]Yuval Emek, Michal Feldman, Iftah Gamzu, Renato Paes Leme, Moshe Tennenholtz:
Signaling schemes for revenue maximization. EC 2012: 514-531 - [c7]Renato Paes Leme, Vasilis Syrgkanis, Éva Tardos:
Sequential auctions and externalities. SODA 2012: 869-886 - [c6]Gagan Goel, Vahab S. Mirrokni, Renato Paes Leme:
Polyhedral clinching auctions and the adwords polytope. STOC 2012: 107-122 - [c5]Brendan Lucier, Renato Paes Leme, Éva Tardos:
On revenue in the generalized second price auction. WWW 2012: 361-370 - [i7]Gagan Goel, Vahab S. Mirrokni, Renato Paes Leme:
Polyhedral Clinching Auctions and the Adwords Polytope. CoRR abs/1201.0404 (2012) - [i6]Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou, Brendan Lucier, Renato Paes Leme, Éva Tardos:
On the efficiency of equilibria in generalized second price auctions. CoRR abs/1201.6429 (2012) - [i5]Yuval Emek, Michal Feldman, Iftah Gamzu, Renato Paes Leme, Moshe Tennenholtz:
Signaling Schemes for Revenue Maximization. CoRR abs/1202.1590 (2012) - [i4]Moshe Babaioff, Robert Kleinberg, Renato Paes Leme:
Optimal Mechanisms for Selling Information. CoRR abs/1204.5519 (2012) - [i3]Gagan Goel, Vahab S. Mirrokni, Renato Paes Leme:
Clinching Auctions with Online Supply. CoRR abs/1210.1456 (2012) - 2011
- [c4]Brendan Lucier, Renato Paes Leme:
GSP auctions with correlated types. EC 2011: 71-80 - [i2]Renato Paes Leme, Vasilis Syrgkanis, Éva Tardos:
Sequential Auctions and Externalities. CoRR abs/1108.2452 (2011) - 2010
- [c3]Renato Paes Leme, Éva Tardos:
Pure and Bayes-Nash Price of Anarchy for Generalized Second Price Auction. FOCS 2010: 735-744 - [i1]Brendan Lucier, Renato Paes Leme:
Improved Social Welfare Bounds for GSP at Equilibrium. CoRR abs/1011.3268 (2010)
2000 – 2009
- 2009
- [c2]Thiago Pereira, Renato Paes Leme, Luiz Velho, Thomas Lewiner:
Symmetry-based Completion. GRAPP 2009: 39-45 - 2006
- [c1]Claudia Oliveira, Maria Claudia de Freitas, Violeta Quental, Cícero Nogueira dos Santos, Renato Paes Leme, Lucas Souza:
A Set of NP-Extraction Rules for Portuguese: Defining, Learning and Pruning. PROPOR 2006: 150-159
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-16 21:24 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: