default search action
Jan Vondrák
Person information
- affiliation: Stanford University, CA, USA
- affiliation (former): IBM Almaden Research Center, San Jose, USA
- affiliation (former): Princeton University, Department of Mathematics
- affiliation (former): Microsoft Research, Redmond, USA
- affiliation (former): Charles University, Prague, Department of Applied Mathematics
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j32]Bryan Park, Jan Vondrák:
A Simple Proof of the Nonuniform Kahn-Kalai Conjecture. SIAM J. Discret. Math. 38(3): 2089-2094 (2024) - [c65]Shahar Dobzinski
, Wenzheng Li
A Constant-Factor Approximation for Nash Social Welfare with Subadditive Valuations. STOC 2024: 467-478 - [c64]Farbod Ekbatani
Prophet Inequalities with Cancellation Costs. STOC 2024: 1247-1258 - [i42]Shahar Dobzinski, Sigal Oren, Jan Vondrák:
Fairness and Incentive Compatibility via Percentage Fees. CoRR abs/2402.14173 (2024) - [i41]Farbod Ekbatani, Rad Niazadeh, Pranav Nuti, Jan Vondrák:
Prophet Inequalities with Cancellation Costs. CoRR abs/2404.00527 (2024) - 2023
- [c63]Monika Henzinger, Paul Liu, Jan Vondrák, Da Wei Zheng:
Faster Submodular Maximization for Several Classes of Matroids. ICALP 2023: 74:1-74:18 - [c62]Pranav Nuti, Jan Vondrák:
Towards an Optimal Contention Resolution Scheme for Matchings. IPCO 2023: 378-392 - [c61]Shahar Dobzinski
Fairness and Incentive Compatibility via Percentage Fees. EC 2023: 517-535 - [c60]Ferenc Bencs, Péter Csikvári, Piyush Srivastava
On complex roots of the independence polynomial. SODA 2023: 675-699 - [c59]Pranav Nuti, Jan Vondrák:
Secretary Problems: The Power of a Single Sample. SODA 2023: 2015-2029 - [c58]Jugal Garg, Edin Husic
Approximating Nash Social Welfare by Matching and Local Search. STOC 2023: 1298-1310 - [i40]Monika Henzinger, Paul Liu, Jan Vondrák, Da Wei Zheng:
Faster Submodular Maximization for Several Classes of Matroids. CoRR abs/2305.00122 (2023) - [i39]Shahar Dobzinski, Wenzheng Li, Aviad Rubinstein, Jan Vondrák:
A constant factor approximation for Nash social welfare with subadditive valuations. CoRR abs/2309.04656 (2023) - 2022
- [c57]Zi Yang Kang, Francisco Pernice, Jan Vondrák:
Fixed-Price Approximations in Bilateral Trade. SODA 2022: 2964-2985 - [c56]Shahar Dobzinski, Shiri Ron, Jan Vondrák:
On the hardness of dominant strategy mechanism design. STOC 2022: 690-703 - [i38]Ferenc Bencs, Péter Csikvári, Piyush Srivastava, Jan Vondrák:
On complex roots of the independence polynomial. CoRR abs/2204.04868 (2022) - [i37]Shahar Dobzinski, Shiri Ron, Jan Vondrák:
On the Hardness of Dominant Strategy Mechanism Design. CoRR abs/2206.00334 (2022) - [i36]Pranav Nuti, Jan Vondrák:
Secretary Problems: The Power of a Single Sample. CoRR abs/2208.09159 (2022) - [i35]Pranav Nuti, Jan Vondrák:
Towards an Optimal Contention Resolution Scheme for Matchings. CoRR abs/2211.03599 (2022) - [i34]Jugal Garg, Edin Husic, Wenzheng Li, László A. Végh, Jan Vondrák:
Approximating Nash Social Welfare by Matching and Local Search. CoRR abs/2211.03883 (2022) - 2021
- [c55]Wenzheng Li, Jan Vondrák:
A constant-factor approximation algorithm for Nash Social Welfare with submodular valuations. FOCS 2021: 25-36 - [c54]Paul Liu, Aviad Rubinstein, Jan Vondrák, Junyao Zhao:
Cardinality constrained submodular maximization for random streams. NeurIPS 2021: 6491-6502 - [c53]Wenzheng Li, Jan Vondrák:
Estimating the Nash Social Welfare for coverage and other submodular valuations. SODA 2021: 1119-1130 - [i33]Wenzheng Li, Jan Vondrák:
Estimating the Nash Social Welfare for coverage and other submodular valuations. CoRR abs/2101.02278 (2021) - [i32]Wenzheng Li, Jan Vondrák:
A constant-factor approximation algorithm for Nash Social Welfare with submodular valuations. CoRR abs/2103.10536 (2021) - [i31]Zi Yang Kang, Francisco Pernice, Jan Vondrák:
Fixed-Price Approximations in Bilateral Trade. CoRR abs/2107.14327 (2021) - [i30]Paul Liu, Aviad Rubinstein, Jan Vondrák, Junyao Zhao:
Cardinality constrained submodular maximization for random streams. CoRR abs/2111.07217 (2021) - 2020
- [j31]Nicholas J. A. Harvey, Jan Vondrák:
An Algorithmic Proof of the Lovász Local Lemma via Resampling Oracles. SIAM J. Comput. 49(2): 394-428 (2020) - [j30]Vitaly Feldman, Pravesh Kothari, Jan Vondrák:
Tight bounds on ℓ1 approximation and learning of self-bounding functions. Theor. Comput. Sci. 808: 86-98 (2020) - [c52]Ashwinkumar Badanidiyuru, Amin Karbasi, Ehsan Kazemi, Jan Vondrák:
Submodular Maximization Through Barrier Functions. NeurIPS 2020 - [c51]Wenzheng Li, Paul Liu
A polynomial lower bound on adaptive complexity of submodular maximization. STOC 2020: 140-152 - [i29]Ashwinkumar Badanidiyuru, Amin Karbasi, Ehsan Kazemi, Jan Vondrák:
Submodular Maximization Through Barrier Functions. CoRR abs/2002.03523 (2020) - [i28]Wenzheng Li, Paul Liu, Jan Vondrák:
A polynomial lower bound on adaptive complexity of submodular maximization. CoRR abs/2002.09130 (2020)
2010 – 2019
- 2019
- [c50]Vitaly Feldman, Jan Vondrák:
High probability generalization bounds for uniformly stable algorithms with nearly optimal rate. COLT 2019: 1270-1279 - [c49]Paul Liu, Jan Vondrák:
Submodular Optimization in the MapReduce Model. SOSA 2019: 18:1-18:10 - [i27]Vitaly Feldman, Jan Vondrák:
High probability generalization bounds for uniformly stable algorithms with nearly optimal rate. CoRR abs/1902.10710 (2019) - 2018
- [c48]Vitaly Feldman, Jan Vondrák:
Generalization Bounds for Uniformly Stable Algorithms. NeurIPS 2018: 9770-9780 - [c47]Nicholas J. A. Harvey, Piyush Srivastava, Jan Vondrák:
Computing the Independence Polynomial: from the Tree Threshold down to the Roots. SODA 2018: 1557-1576 - [i26]Paul Liu, Jan Vondrák:
Submodular Optimization in the MapReduce Model. CoRR abs/1810.01489 (2018) - [i25]Vitaly Feldman, Jan Vondrák:
Generalization Bounds for Uniformly Stable Algorithms. CoRR abs/1812.09859 (2018) - 2017
- [j29]Maxim Sviridenko, Jan Vondrák, Justin Ward:
Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature. Math. Oper. Res. 42(4): 1197-1218 (2017) - [c46]Vitaly Feldman, Pravesh Kothari, Jan Vondrák:
Tight Bounds on ℓ1 Approximation and Learning of Self-Bounding Functions. ALT 2017: 540-559 - [c45]Tim Roughgarden, Inbal Talgam-Cohen, Jan Vondrák:
When Are Welfare Guarantees Robust?. APPROX-RANDOM 2017: 22:1-22:23 - [c44]Vaggos Chatziafratis, Tim Roughgarden, Jan Vondrák:
Stability and Recovery for Independence Systems. ESA 2017: 26:1-26:15 - [i24]Vaggos Chatziafratis, Tim Roughgarden, Jan Vondrák:
Stability and Recovery for Independence Systems. CoRR abs/1705.00127 (2017) - 2016
- [j28]Shahar Dobzinski, Jan Vondrák:
Impossibility Results for Truthful Combinatorial Auctions with Submodular Valuations. J. ACM 63(1): 5:1-5:19 (2016) - [j27]Vitaly Feldman, Jan Vondrák:
Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas. SIAM J. Comput. 45(3): 1129-1170 (2016) - [i23]Nicholas J. A. Harvey, Piyush Srivastava, Jan Vondrák:
Computing the independence polynomial in Shearer's region for the LLL. CoRR abs/1608.02282 (2016) - [i22]Tim Roughgarden, Inbal Talgam-Cohen, Jan Vondrák:
When Are Welfare Guarantees Robust? CoRR abs/1608.02402 (2016) - 2015
- [j26]Shaddin Dughmi, Jan Vondrák:
Limitations of randomized mechanisms for combinatorial auctions. Games Econ. Behav. 92: 370-400 (2015) - [c43]Baharan Mirzasoleiman, Ashwinkumar Badanidiyuru, Amin Karbasi, Jan Vondrák, Andreas Krause:
Lazier Than Lazy Greedy. AAAI 2015: 1812-1818 - [c42]Vitaly Feldman, Jan Vondrák:
Tight Bounds on Low-Degree Spectral Concentration of Submodular and XOS Functions. FOCS 2015: 923-942 - [c41]Nicholas J. A. Harvey, Jan Vondrák:
An Algorithmic Proof of the Lovasz Local Lemma via Resampling Oracles. FOCS 2015: 1327-1346 - [c40]Chandra Chekuri, T. S. Jayram, Jan Vondrák:
On Multiplicative Weight Updates for Concave and Submodular Function Maximization. ITCS 2015: 201-210 - [c39]Yaron Singer, Jan Vondrák:
Information-theoretic lower bounds for convex optimization with erroneous oracles. NIPS 2015: 3204-3212 - [c38]Maryam Mirzakhani
Sperner's Colorings, Hypergraph Labeling Problems and Fair Division. SODA 2015: 873-886 - [c37]Maxim Sviridenko, Jan Vondrák, Justin Ward:
Optimal approximation for submodular and supermodular optimization with bounded curvature. SODA 2015: 1134-1148 - [i21]Alina Ene, Jan Vondrák, Yi Wu:
Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems. CoRR abs/1503.03905 (2015) - [i20]Nicholas J. A. Harvey, Jan Vondrák:
An Algorithmic Proof of the Lopsided Lovasz Local Lemma. CoRR abs/1504.02044 (2015) - [i19]Vitaly Feldman, Jan Vondrák:
Tight Bounds on Low-degree Spectral Concentration of Submodular and XOS functions. CoRR abs/1504.03391 (2015) - 2014
- [j25]C. Seshadhri, Jan Vondrák:
Is Submodularity Testable? Algorithmica 69(1): 1-25 (2014) - [j24]Chandra Chekuri, Jan Vondrák, Rico Zenklusen:
Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes. SIAM J. Comput. 43(6): 1831-1879 (2014) - [c36]Alina Ene, Jan Vondrák:
Hardness of Submodular Cost Allocation: Lattice Matching and a Simplex Coloring Conjecture. APPROX-RANDOM 2014: 144-159 - [c35]T. S. Jayram, Jan Vondrák:
Exchangeability and Realizability: De Finetti Theorems on Graphs. APPROX-RANDOM 2014: 762-778 - [c34]Vitaly Feldman, Jan Vondrák:
Optimal bounds on approximation of submodular and XOS functions by juntas. ITA 2014: 1-10 - [c33]Ashwinkumar Badanidiyuru, Jan Vondrák:
Fast algorithms for maximizing submodular functions. SODA 2014: 1497-1514 - [c32]Ankit Sharma, Jan Vondrák:
Multiway cut, pairwise realizable distributions, and descending thresholds. STOC 2014: 724-733 - [i18]Vitaly Feldman, Pravesh Kothari, Jan Vondrák:
Nearly Tight Bounds on ℓ1 Approximation of Self-Bounding Functions. CoRR abs/1404.4702 (2014) - [i17]Baharan Mirzasoleiman, Ashwinkumar Badanidiyuru, Amin Karbasi, Jan Vondrák, Andreas Krause:
Lazier Than Lazy Greedy. CoRR abs/1409.7938 (2014) - 2013
- [j23]Shayan Oveis Gharan, Jan Vondrák:
On Variants of the Matroid Secretary Problem. Algorithmica 67(4): 472-497 (2013) - [j22]Benny Kimelfeld, Jan Vondrák, David P. Woodruff:
Multi-Tuple Deletion Propagation: Approximations and Complexity. Proc. VLDB Endow. 6(13): 1558-1569 (2013) - [j21]Jan Vondrák:
Symmetry and Approximability of Submodular Maximization Problems. SIAM J. Comput. 42(1): 265-304 (2013) - [j20]Jon Lee
Matroid Matching: The Power of Local Search. SIAM J. Comput. 42(1): 357-379 (2013) - [j19]Vitaly Feldman, Jan Vondrák:
Structure and learning of valuation functions. SIGecom Exch. 12(2): 50-53 (2013) - [c31]Vitaly Feldman, Pravesh Kothari, Jan Vondrák:
Representation, Approximation and Learning of Submodular Functions Using Low-rank Decision Trees. COLT 2013: 711-740 - [c30]Mohamed Y. Eltabakh, Fatma Özcan
Eagle-eyed elephant: split-oriented indexing in Hadoop. EDBT 2013: 89-100 - [c29]Vitaly Feldman, Jan Vondrák:
Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas. FOCS 2013: 227-236 - [c28]Alina Ene, Jan Vondrák, Yi Wu:
Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems. SODA 2013: 306-325 - [c27]Shahar Dobzinski, Jan Vondrák:
Communication Complexity of Combinatorial Auctions with Submodular Valuations. SODA 2013: 1205-1215 - [c26]Michael Kapralov
Online Submodular Welfare Maximization: Greedy is Optimal. SODA 2013: 1216-1225 - [i16]Vitaly Feldman, Pravesh Kothari, Jan Vondrák:
Representation, Approximation and Learning of Submodular Functions Using Low-rank Decision Trees. CoRR abs/1304.0730 (2013) - [i15]Vitaly Feldman, Jan Vondrák:
Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas. CoRR abs/1307.3301 (2013) - [i14]Ankit Sharma, Jan Vondrák:
Multiway Cut, the Golden Ratio, and Descending Thresholds. CoRR abs/1309.2729 (2013) - 2012
- [j18]Benny Kimelfeld, Jan Vondrák, Ryan Williams
Maximizing Conjunctive Views in Deletion Propagation. ACM Trans. Database Syst. 37(4): 24:1-24:37 (2012) - [c25]Shahar Dobzinski, Jan Vondrák:
The computational complexity of truthfulness in combinatorial auctions. EC 2012: 405-422 - [c24]Shahar Dobzinski, Jan Vondrák:
From query complexity to computational complexity. STOC 2012: 1107-1116 - [i13]Shahar Dobzinski, Jan Vondrák:
The Computational Complexity of Truthfulness in Combinatorial Auctions. CoRR abs/1202.2789 (2012) - [i12]Shahar Dobzinski, Jan Vondrák:
On the Hardness of Welfare Maximization in Combinatorial Auctions with Submodular Valuations. CoRR abs/1202.2792 (2012) - [i11]Mikhail Kapralov, Ian Post, Jan Vondrák:
Online and stochastic variants of welfare maximization. CoRR abs/1204.1025 (2012) - 2011
- [j17]Uriel Feige, Vahab S. Mirrokni, Jan Vondrák:
Maximizing Non-monotone Submodular Functions. SIAM J. Comput. 40(4): 1133-1153 (2011) - [j16]Gruia Calinescu
Maximizing a Monotone Submodular Function Subject to a Matroid Constraint. SIAM J. Comput. 40(6): 1740-1766 (2011) - [c23]Shayan Oveis Gharan, Jan Vondrák:
On Variants of the Matroid Secretary Problem. ESA 2011: 335-346 - [c22]Shaddin Dughmi, Jan Vondrák:
Limitations of Randomized Mechanisms for Combinatorial Auctions. FOCS 2011: 502-511 - [c21]C. Seshadhri, Jan Vondrák:
Is Submodularity Testable? ICS 2011: 195-210 - [c20]Benny Kimelfeld, Jan Vondrák, Ryan Williams
Maximizing conjunctive views in deletion propagation. PODS 2011: 187-198 - [c19]Chandra Chekuri, Jan Vondrák, Rico Zenklusen:
Multi-budgeted Matchings and Matroid Intersection via Dependent Rounding. SODA 2011: 1080-1097 - [c18]Shayan Oveis Gharan, Jan Vondrák:
Submodular Maximization by Simulated Annealing. SODA 2011: 1098-1116 - [c17]Jan Vondrák, Chandra Chekuri, Rico Zenklusen:
Submodular function maximization via the multilinear relaxation and contention resolution schemes. STOC 2011: 783-792 - [c16]Sara Cohen, Benny Kimelfeld, Georgia Koutrika, Jan Vondrák:
On Principles of Egocentric Person Search in Social Networks. VLDS 2011: 3-6 - [i10]Shayan Oveis Gharan, Jan Vondrák:
On Variants of the Matroid Secretary Problem. CoRR abs/1104.4081 (2011) - [i9]Chandra Chekuri, Jan Vondrák, Rico Zenklusen:
Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes. CoRR abs/1105.4593 (2011) - [i8]Shaddin Dughmi, Tim Roughgarden, Jan Vondrák, Qiqi Yan:
An approximately truthful-in-expectation mechanism for combinatorial auctions using value queries. CoRR abs/1109.1053 (2011) - [i7]Shaddin Dughmi, Jan Vondrák:
Limitations of randomized mechanisms for combinatorial auctions. CoRR abs/1109.1055 (2011) - [i6]Jan Vondrák:
Symmetry and approximability of submodular maximization problems. CoRR abs/1110.4860 (2011) - 2010
- [j15]Benny Sudakov, Jan Vondrák:
A randomized embedding algorithm for trees. Comb. 30(4): 445-470 (2010) - [j14]Jon Lee
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties. Math. Oper. Res. 35(4): 795-806 (2010) - [j13]Uriel Feige, Jan Vondrák:
The Submodular Welfare Problem with Demand Queries. Theory Comput. 6(1): 247-290 (2010) - [c15]Chandra Chekuri, Jan Vondrák, Rico Zenklusen:
Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures. FOCS 2010: 575-584 - [c14]Jon Lee
Matroid matching: the power of local search. STOC 2010: 369-378 - [i5]Jan Vondrák:
A note on concentration of submodular functions. CoRR abs/1005.2791 (2010) - [i4]Shayan Oveis Gharan, Jan Vondrák:
Submodular Maximization by Simulated Annealing. CoRR abs/1007.1632 (2010) - [i3]C. Seshadhri, Jan Vondrák:
Is submodularity testable? CoRR abs/1008.0831 (2010)
2000 – 2009
- 2009
- [j12]Gruia Calinescu
Disjoint bases in a polymatroid. Random Struct. Algorithms 35(4): 418-430 (2009) - [c13]Lalitha Sankar, Jan Vondrák, H. Vincent Poor:
K-user fading interference channels: The ergodic very strong case. Allerton 2009: 82-87 - [c12]Jon Lee
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties. APPROX-RANDOM 2009: 244-257 - [c11]Jan Vondrák:
Symmetry and Approximability of Submodular Maximization Problems. FOCS 2009: 651-670 - [i2]Chandra Chekuri, Jan Vondrák:
Randomized Pipage Rounding for Matroid Polytopes and Applications. CoRR abs/0909.4348 (2009) - [i1]Lalitha Sankar, Jan Vondrák, H. Vincent Poor:
K-User Fading Interference Channels: The Ergodic Very Strong Case. CoRR abs/0910.4874 (2009) - 2008
- [j11]Brian C. Dean, Michel X. Goemans, Jan Vondrák:
Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity. Math. Oper. Res. 33(4): 945-964 (2008) - [j10]Benny Sudakov, Jan Vondrák:
How many random edges make a dense hypergraph non-2-colorable? Random Struct. Algorithms 32(3): 290-306 (2008) - [c10]Vahab S. Mirrokni, Michael Schapira, Jan Vondrák:
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions. EC 2008: 70-77 - [c9]Jan Vondrák:
Optimal approximation for the submodular welfare problem in the value oracle model. STOC 2008: 67-74 - 2007
- [j9]Jan Vondrák:
Shortest-path metric approximation for random subgraphs. Random Struct. Algorithms 30(1-2): 95-104 (2007) - [c8]Uriel Feige, Vahab S. Mirrokni, Jan Vondrák:
Maximizing Non-Monotone Submodular Functions. FOCS 2007: 461-471 - [c7]Gruia Calinescu, Chandra Chekuri, Martin Pál, Jan Vondrák:
Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract). IPCO 2007: 182-196 - 2006
- [j8]János Pach, Rados Radoicic, Jan Vondrák:
Nearly equal distances and Szemerédi's regularity lemma. Comput. Geom. 34(1): 11-19 (2006) - [j7]János Pach, Rados Radoicic, Jan Vondrák:
On the diameter of separated point sets with many nearly equal distances. Eur. J. Comb. 27(8): 1321-1332 (2006) - [j6]Noga Alon, Rados Radoicic, Benny Sudakov, Jan Vondrák:
A Ramsey-type result for the hypercube. J. Graph Theory 53(3): 196-208 (2006) - [j5]Michel X. Goemans, Jan Vondrák:
Covering minimum spanning trees of random subgraphs. Random Struct. Algorithms 29(3): 257-276 (2006) - [c6]Uriel Feige, Jan Vondrák:
Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e. FOCS 2006: 667-676 - [c5]Michel X. Goemans, Jan Vondrák:
Stochastic Covering and Adaptivity. LATIN 2006: 532-543 - 2005
- [c4]Brian C. Dean, Michel X. Goemans, Jan Vondrák:
Adaptivity and approximation for stochastic packing problems. SODA 2005: 395-404 - 2004
- [c3]Brian C. Dean, Michel X. Goemans, Jan Vondrák:
Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity. FOCS 2004: 208-217 - [c2]Michel X. Goemans, Jan Vondrák:
Covering minimum spanning trees of random subgraphs. SODA 2004: 934-941 - 2003
- [j4]Timothy Y. Chow, C. Kenneth Fan, Michel X. Goemans, Jan Vondrák:
Wide partitions, Latin tableaux, and Rota's basis conjecture. Adv. Appl. Math. 31(2): 334-358 (2003) - [j3]Martin Loebl
Towards a theory of frustrated degeneracy. Discret. Math. 271(1-3): 179-193 (2003) - 2001
- [j2]Robert Sámal
The limit checker number of a graph. Discret. Math. 235(1-3): 343-347 (2001) - [j1]Anna Galluccio, Martin Loebl
Optimization via enumeration: a new algorithm for the Max Cut Problem. Math. Program. 90(2): 273-290 (2001)
1990 – 1999
- 1999
- [c1]Robert Babilon, Helena Nyklová, Ondrej Pangrác
Visibility Representations of Complete Graphs. GD 1999: 333-340
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:26 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: