default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul Dütting
Paul Duetting
Person information
- affiliation: Google Research, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j22]Paul Dütting
, Zhe Feng, Harikrishna Narasimhan, David C. Parkes, Sai Srivatsa Ravindranath:
Optimal Auctions through Deep Learning: Advances in Differentiable Economics. J. ACM 71(1): 5:1-5:53 (2024)- [j21]Paul Dütting, Silvio Lattanzi, Renato Paes Leme, Sergei Vassilvitskii:
Secretaries with Advice. Math. Oper. Res. 49(2): 856-879 (2024) - [j20]Paul Dütting, Felix A. Fischer, David C. Parkes:
Nontruthful Position Auctions Are More Robust to Misspecification. Math. Oper. Res. 49(2): 901-927 (2024) - [j19]Johannes Brustle, José Correa, Paul Duetting, Victor Verdugo:
The Competition Complexity of Dynamic Pricing. Math. Oper. Res. 49(3): 1986-2008 (2024) - [c48]Paul Duetting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam:
Consistent Submodular Maximization. ICML 2024 - [c47]Paul Dütting, Michal Feldman, Yoav Gal Tzur:
Combinatorial Contracts Beyond Gross Substitutes. SODA 2024: 92-108 - [c46]Paul Dütting, Vahab Mirrokni, Renato Paes Leme, Haifeng Xu, Song Zuo:
Mechanism Design for Large Language Models. WWW 2024: 144-155 - [i47]Johannes Brustle, José Correa, Paul Dütting, Tomer Ezra, Michal Feldman, Victor Verdugo:
The Competition Complexity of Prophet Inequalities. CoRR abs/2402.11084 (2024) - [i46]Paul Dütting, Michal Feldman, Yoav Gal Tzur, Aviad Rubinstein:
The Query Complexity of Contracts. CoRR abs/2403.09794 (2024) - [i45]Paul Duetting, Tomer Ezra, Michal Feldman, Thomas Kesselheim:
Multi-Agent Combinatorial Contracts. CoRR abs/2405.08260 (2024) - [i44]Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam:
Consistent Submodular Maximization. CoRR abs/2405.19977 (2024) - [i43]Andrés Cristi, Paul Dütting, Robert Kleinberg, Renato Paes Leme:
Online Matroid Embeddings. CoRR abs/2407.10316 (2024) - [i42]Dima Ivanov, Paul Dütting, Inbal Talgam-Cohen, Tonghan Wang, David C. Parkes:
Principal-Agent Reinforcement Learning. CoRR abs/2407.18074 (2024) - [i41]Gagan Aggarwal, Ashwinkumar Badanidiyuru, Paul Dütting, Federico Fusco:
Selling Joint Ads: A Regret Minimization Perspective. CoRR abs/2409.07819 (2024) - [i40]Paul Dütting, Thomas Kesselheim, Brendan Lucier, Rebecca Reiffenhäuser, Sahil Singla:
Online Combinatorial Allocations and Auctions with Few Samples. CoRR abs/2409.11091 (2024) - 2023
- [c45]Paul Duetting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam:
Fully Dynamic Submodular Maximization over Matroids. ICML 2023: 8821-8835 - [c44]Paul Duetting, Guru Guruganesh, Jon Schneider, Joshua Ruizhi Wang:
Optimal No-Regret Learning for One-Sided Lipschitz Functions. ICML 2023: 8836-8850 - [c43]Tonghan Wang, Paul Duetting, Dmitry Ivanov, Inbal Talgam-Cohen, David C. Parkes:
Deep Contract Design via Discontinuous Networks. NeurIPS 2023 - [c42]Tal Alon, Paul Duetting, Yingkai Li, Inbal Talgam-Cohen:
Bayesian Analysis of Linear Contracts. EC 2023: 66 - [c41]José Correa, Andrés Cristi, Paul Duetting, MohammadTaghi Hajiaghayi, Jan Olkowski, Kevin Schewior:
Trading Prophets. EC 2023: 490-510 - [c40]Paul Duetting, Michal Feldman, Daniel Peretz:
Ambiguous Contracts. EC 2023: 539 - [c39]Paul Dütting, Evangelia Gergatsouli, Rojin Rezvan, Yifeng Teng, Alexandros Tsigonias-Dimitriadis:
Prophet Secretary Against the Online Optimal. EC 2023: 561-581 - [c38]Paul Dütting, Tomer Ezra, Michal Feldman, Thomas Kesselheim:
Multi-agent Contracts. STOC 2023: 1311-1324 - [i39]Paul Dütting, Michal Feldman, Daniel Peretz:
Ambiguous Contracts. CoRR abs/2302.07621 (2023) - [i38]Paul Dütting, Evangelia Gergatsouli, Rojin Rezvan, Yifeng Teng, Alexandros Tsigonias-Dimitriadis:
Prophet Secretary Against the Online Optimal. CoRR abs/2305.11144 (2023) - [i37]José Correa, Andrés Cristi, Paul Dütting, Mohammad Hajiaghayi, Jan Olkowski, Kevin Schewior:
Trading Prophets. CoRR abs/2305.15566 (2023) - [i36]Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam:
Fully Dynamic Submodular Maximization over Matroids. CoRR abs/2305.19918 (2023) - [i35]Tonghan Wang, Paul Dütting, Dmitry Ivanov, Inbal Talgam-Cohen, David C. Parkes:
Deep Contract Design via Discontinuous Piecewise Affine Neural Networks. CoRR abs/2307.02318 (2023) - [i34]Paul Dütting, Michal Feldman, Yoav Gal Tzur:
Combinatorial Contracts Beyond Gross Substitutes. CoRR abs/2309.10766 (2023) - [i33]Paul Duetting, Vahab Mirrokni, Renato Paes Leme, Haifeng Xu, Song Zuo:
Mechanism Design for Large Language Models. CoRR abs/2310.10826 (2023) - 2022
- [j18]Paul Dütting, Thomas Kesselheim:
Best-response dynamics in combinatorial auctions with item bidding. Games Econ. Behav. 134: 428-448 (2022) - [j17]José Correa, Paul Dütting, Felix A. Fischer, Kevin Schewior:
Prophet Inequalities for Independent and Identically Distributed Random Variables from an Unknown Distribution. Math. Oper. Res. 47(2): 1287-1309 (2022) - [c37]Paul Duetting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam:
Deletion Robust Submodular Maximization over Matroids. ICML 2022: 5671-5693 - [c36]Johannes Brustle, José Correa, Paul Dütting, Victor Verdugo:
The Competition Complexity of Dynamic Pricing. EC 2022: 303-320 - [c35]Constantine Caramanis, Paul Dütting, Matthew Faw, Federico Fusco, Philip Lazos, Stefano Leonardi, Orestis Papadigenopoulos, Emmanouil Pountourakis, Rebecca Reiffenhäuser:
Single-Sample Prophet Inequalities via Greedy-Ordered Selection. SODA 2022: 1298-1325 - [c34]Dirk Bergemann, Paul Dütting, Renato Paes Leme, Song Zuo:
Calibrated Click-Through Auctions. WWW 2022: 47-57 - [c33]Johannes Brustle, Paul Dütting, Balasubramanian Sivan:
Price Manipulability in First-Price Auctions. WWW 2022: 58-67 - [i32]Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam:
Deletion Robust Submodular Maximization over Matroids. CoRR abs/2201.13128 (2022) - [i31]Johannes Brustle, Paul Dütting, Balasubramanian Sivan:
Price Manipulability in First-Price Auctions. CoRR abs/2203.12042 (2022) - [i30]Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam:
Deletion Robust Non-Monotone Submodular Maximization over Matroids. CoRR abs/2208.07582 (2022) - [i29]Paul Duetting, Tomer Ezra, Michal Feldman, Thomas Kesselheim:
Multi-Agent Contracts. CoRR abs/2211.05434 (2022) - [i28]Tal Alon, Paul Dütting, Yingkai Li, Inbal Talgam-Cohen:
Bayesian Analysis of Linear Contracts. CoRR abs/2211.06850 (2022) - 2021
- [j16]Paul Dütting, Zhe Feng, Harikrishna Narasimhan, David C. Parkes, Sai Srivatsa Ravindranath:
Optimal auctions through deep learning. Commun. ACM 64(8): 109-116 (2021) - [j15]Paul Dütting, Thomas Kesselheim, Éva Tardos:
Algorithms as Mechanisms: The Price of Anarchy of Relax and Round. Math. Oper. Res. 46(1): 317-335 (2021) - [j14]Paul Dütting, Tim Roughgarden, Inbal Talgam-Cohen:
The Complexity of Contracts. SIAM J. Comput. 50(1): 211-254 (2021) - [c32]Paul Dütting, Tomer Ezra, Michal Feldman, Thomas Kesselheim:
Combinatorial Contracts. FOCS 2021: 815-826 - [c31]José Correa, Andrés Cristi, Paul Duetting, Ashkan Norouzi-Fard:
Fairness and Bias in Online Selection. ICML 2021: 2112-2121 - [c30]José Correa, Paul Dütting, Felix A. Fischer, Kevin Schewior, Bruno Ziliotto:
Unknown I.I.D. Prophets: Better Bounds, Streaming Algorithms, and a New Impossibility (Extended Abstract). ITCS 2021: 86:1-86:1 - [c29]Tal Alon, Paul Dütting, Inbal Talgam-Cohen:
Contracts with Private Cost per Unit-of-Effort. EC 2021: 52-69 - [c28]Paul Dütting, Silvio Lattanzi, Renato Paes Leme, Sergei Vassilvitskii:
Secretaries with Advice. EC 2021: 409-429 - [c27]Paul Dütting, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser:
Efficient two-sided markets with limited information. STOC 2021: 1452-1465 - [i27]Paul Dütting, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser:
Prophet Inequalities for Matching with a Single Sample. CoRR abs/2104.02050 (2021) - [i26]Dirk Bergemann, Paul Duetting, Renato Paes Leme, Song Zuo:
Calibrated Click-Through Auctions: An Information Design Approach. CoRR abs/2105.09375 (2021) - [i25]Paul Duetting, Tomer Ezra, Michal Feldman, Thomas Kesselheim:
Combinatorial Contracts. CoRR abs/2109.14260 (2021) - [i24]Constantine Caramanis, Paul Dütting, Matthew Faw, Federico Fusco, Philip Lazos, Stefano Leonardi, Orestis Papadigenopoulos, Emmanouil Pountourakis, Rebecca Reiffenhäuser:
Single-Sample Prophet Inequalities via Greedy-Ordered Selection. CoRR abs/2111.03174 (2021) - [i23]Tal Alon, Paul Dütting, Inbal Talgam-Cohen:
Contracts with Private Cost per Unit-of-Effort. CoRR abs/2111.09179 (2021) - 2020
- [j13]Paul Dütting, Michal Feldman, Thomas Kesselheim, Brendan Lucier:
Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Nonstochastic Inputs. SIAM J. Comput. 49(3): 540-582 (2020) - [j12]Paul Dütting, Thomas Kesselheim, Brendan Lucier:
An O(log log m) prophet inequality for subadditive combinatorial auctions. SIGecom Exch. 18(2): 32-37 (2020) - [c26]Paul Dütting, Thomas Kesselheim, Brendan Lucier:
An O(log log m) Prophet Inequality for Subadditive Combinatorial Auctions. FOCS 2020: 306-317 - [c25]Paul Dütting, Tim Roughgarden, Inbal Talgam-Cohen:
The Complexity of Contracts. SODA 2020: 2688-2707 - [i22]Paul Duetting, Tim Roughgarden, Inbal Talgam-Cohen:
The Complexity of Contracts. CoRR abs/2002.12034 (2020) - [i21]Paul Dütting, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser:
Efficient Two-Sided Markets with Limited Information. CoRR abs/2003.07503 (2020) - [i20]Paul Dütting, Thomas Kesselheim, Brendan Lucier:
An O(log log m) Prophet Inequality for Subadditive Combinatorial Auctions. CoRR abs/2004.09784 (2020) - [i19]José Correa, Paul Dütting, Felix A. Fischer, Kevin Schewior, Bruno Ziliotto:
Streaming Algorithms for Online Selection Problems. CoRR abs/2007.06110 (2020) - [i18]Paul Dütting, Silvio Lattanzi, Renato Paes Leme, Sergei Vassilvitskii:
Secretaries with Advice. CoRR abs/2011.06726 (2020)
2010 – 2019
- 2019
- [j11]Paul Dütting, Felix A. Fischer, David C. Parkes:
Expressiveness and Robustness of First-Price Position Auctions. Math. Oper. Res. 44(1): 196-211 (2019) - [c24]José Correa, Paul Dütting, Felix A. Fischer, Kevin Schewior:
Prophet Inequalities for I.I.D. Random Variables from an Unknown Distribution. EC 2019: 3-17 - [c23]Paul Dütting, Thomas Kesselheim:
Posted Pricing and Prophet Inequalities with Inaccurate Priors. EC 2019: 111-129 - [c22]Paul Dütting, Tim Roughgarden, Inbal Talgam-Cohen:
Simple versus Optimal Contracts. EC 2019: 369-387 - [c21]Paul Duetting, Zhe Feng, Harikrishna Narasimhan, David C. Parkes, Sai Srivatsa Ravindranath:
Optimal Auctions through Deep Learning. ICML 2019: 1706-1715 - 2018
- [j10]Paul Dütting, Monika Henzinger, Martin Starnberger:
Valuation Compressions in VCG-Based Combinatorial Auctions. ACM Trans. Economics and Comput. 6(2): 5:1-5:18 (2018) - [i17]Paul Dütting, Tim Roughgarden, Inbal Talgam-Cohen:
Simple versus Optimal Contracts. CoRR abs/1808.03713 (2018) - [i16]José R. Correa, Paul Dütting, Felix A. Fischer, Kevin Schewior:
Prophet Inequalities for Independent Random Variables from an Unknown Distribution. CoRR abs/1811.06114 (2018) - 2017
- [j9]Paul Dütting, Inbal Talgam-Cohen, Tim Roughgarden:
Modularity and greed in double auctions. Games Econ. Behav. 105: 59-83 (2017) - [j8]Paul Dütting, Vasilis Gkatzelis, Tim Roughgarden:
The Performance of Deferred-Acceptance Auctions. Math. Oper. Res. 42(4): 897-914 (2017) - [c20]Paul Duetting, Michal Feldman, Thomas Kesselheim, Brendan Lucier:
Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Non-Stochastic Inputs. FOCS 2017: 540-551 - [c19]Paul Dütting, Thomas Kesselheim:
Best-Response Dynamics in Combinatorial Auctions with Item Bidding. SODA 2017: 521-533 - [i15]Paul Dütting, Zhe Feng, Harikrishna Narasimhan, David C. Parkes:
Optimal Auctions through Deep Learning. CoRR abs/1706.03459 (2017) - [i14]Paul W. Goldberg, Yishay Mansour, Paul Dütting:
Game Theory Meets Computational Learning Theory (Dagstuhl Seminar 17251). Dagstuhl Reports 7(6): 68-85 (2017) - 2016
- [c18]Paul Dütting, Felix A. Fischer, David C. Parkes:
Truthful Outcomes from Non-Truthful Position Auctions. EC 2016: 813 - [i13]Paul Dütting, Felix A. Fischer, David C. Parkes:
Truthful Outcomes from Non-Truthful Position Auctions. CoRR abs/1602.07593 (2016) - [i12]Paul Dütting, Thomas Kesselheim:
Best-Response Dynamics in Combinatorial Auctions with Item Bidding. CoRR abs/1607.04149 (2016) - [i11]Paul Dütting, Felix A. Fischer, Max Klimm:
Revenue Gaps for Discriminatory and Anonymous Sequential Posted Pricing. CoRR abs/1607.07105 (2016) - [i10]Paul Dütting, Michal Feldman, Thomas Kesselheim, Brendan Lucier:
Posted Prices, Smoothness, and Combinatorial Prophet Inequalities. CoRR abs/1612.03161 (2016) - 2015
- [j7]Paul Dütting, Thomas Kesselheim, Éva Tardos:
Algorithms as mechanisms: the price of anarchy of relax-and-round. SIGecom Exch. 14(2): 22-25 (2015) - [j6]Paul Dütting, Felix A. Fischer, Pichayut Jirapinyo, John K. Lai, Benjamin Lubin, David C. Parkes:
Payment Rules through Discriminant-Based Classifiers. ACM Trans. Economics and Comput. 3(1): 5:1-5:41 (2015) - [j5]Paul Dütting, Monika Henzinger, Ingmar Weber:
An Expressive Mechanism for Auctions on the Web. ACM Trans. Economics and Comput. 4(1): 1:1-1:34 (2015) - [j4]Paul Dütting, Monika Henzinger, Martin Starnberger:
Auctions for Heterogeneous Items and Budget Limits. ACM Trans. Economics and Comput. 4(1): 4:1-4:17 (2015) - [c17]Paul Dütting, Robert Kleinberg:
Polymatroid Prophet Inequalities. ESA 2015: 437-449 - [c16]Paul Dütting, Thomas Kesselheim, Éva Tardos:
Algorithms as Mechanisms: The Price of Anarchy of Relax-and-Round. EC 2015: 187-201 - [c15]Paul Dütting, Thomas Kesselheim:
Algorithms against Anarchy: Understanding Non-Truthful Mechanisms. EC 2015: 239-255 - [i9]Paul Dütting, Thomas Kesselheim, Éva Tardos:
Algorithms as Mechanisms: The Price of Anarchy of Relax-and-Round. CoRR abs/1511.09208 (2015) - 2014
- [c14]Paul Dütting, Felix A. Fischer, David C. Parkes:
Expressiveness and robustness of first-price position auctions. EC 2014: 57-74 - [c13]Paul Dütting, Vasilis Gkatzelis, Tim Roughgarden:
The performance of deferred-acceptance auctions. EC 2014: 187-204 - [c12]Paul Dütting, Tim Roughgarden, Inbal Talgam-Cohen:
Modularity and greed in double auctions. EC 2014: 241-258 - [c11]Paul Dütting, Thomas Kesselheim, Éva Tardos:
Mechanism with unique learnable equilibria. EC 2014: 877-894 - 2013
- [b1]Paul Dütting:
Challenges in Algorithmic Mechanism Design. EPFL, Switzerland, 2013 - [j3]Paul Dütting, Monika Henzinger, Ingmar Weber:
Sponsored search, market equilibria, and the Hungarian Method. Inf. Process. Lett. 113(3): 67-73 (2013) - [j2]Paul Dütting, Monika Henzinger, Ingmar Weber:
Bidder optimal assignments for general utilities. Theor. Comput. Sci. 478: 22-32 (2013) - [c10]Paul Dütting, Monika Henzinger, Martin Starnberger:
Valuation Compressions in VCG-Based Combinatorial Auctions. WINE 2013: 146-159 - [i8]Paul Dütting, Felix A. Fischer, David C. Parkes:
Expressiveness and Robustness of First-Price Position Auctions. CoRR abs/1307.5216 (2013) - [i7]Paul Duetting, Robert Kleinberg:
Polymatroid Prophet Inequalities. CoRR abs/1307.5299 (2013) - [i6]Paul Duetting, Monika Henzinger, Martin Starnberger:
Valuation Compressions in VCG-Based Combinatorial Auctions. CoRR abs/1310.3153 (2013) - 2012
- [c9]Paul Dütting, Monika Henzinger, Ingmar Weber:
Maximizing revenue from strategic recommendations under decaying trust. CIKM 2012: 2283-2286 - [c8]Paul Dütting, Felix A. Fischer, Pichayut Jirapinyo, John K. Lai, Benjamin Lubin, David C. Parkes:
Payment rules through discriminant-based classifiers. EC 2012: 477-494 - [c7]Paul Dütting, Monika Henzinger, Martin Starnberger:
Auctions with Heterogeneous Items and Budget Limits. WINE 2012: 44-57 - [i5]Paul Dütting, Felix A. Fischer, Pichayut Jirapinyo, John K. Lai, Benjamin Lubin, David C. Parkes:
Payment Rules through Discriminant-Based Classifiers. CoRR abs/1208.1184 (2012) - [i4]Paul Dütting, Monika Henzinger, Martin Starnberger:
Auctions with Heterogeneous Items and Budget Limits. CoRR abs/1209.6448 (2012) - 2011
- [j1]Paul Dütting, Monika Henzinger, Ingmar Weber:
Offline file assignments for online load balancing. Inf. Process. Lett. 111(4): 178-183 (2011) - [c6]Paul Dütting, Felix A. Fischer, David C. Parkes:
Simplicity-expressiveness tradeoffs in mechanism design. EC 2011: 341-350 - [c5]Paul Dütting, Monika Henzinger, Ingmar Weber:
An expressive mechanism for auctions on the web. WWW 2011: 127-136 - [i3]Paul Dütting, Felix A. Fischer, David C. Parkes:
Simplicity-Expressiveness Tradeoffs in Mechanism Design. CoRR abs/1102.3632 (2011) - 2010
- [c4]Paul Dütting, Monika Henzinger:
Mechanisms for the Marriage and the Assignment Game. CIAC 2010: 6-12 - [c3]Paul Dütting, Monika Henzinger, Ingmar Weber:
Sponsored Search, Market Equilibria, and the Hungarian Method. STACS 2010: 287-298 - [c2]Paul Dütting, Monika Henzinger, Ingmar Weber:
How much is your personal recommendation worth? WWW 2010: 1085-1086
2000 – 2009
- 2009
- [c1]Paul Dütting, Monika Henzinger, Ingmar Weber:
Bidder Optimal Assignments for General Utilities. WINE 2009: 575-582 - [i2]Paul Dütting, Monika Henzinger, Ingmar Weber:
On the Pricing of Recommendations and Recommending Strategically. CoRR abs/0911.1619 (2009) - [i1]Paul Dütting, Monika Henzinger, Ingmar Weber:
Sponsored Search, Market Equilibria, and the Hungarian Method. CoRR abs/0912.1934 (2009)
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-15 21:34 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:
