default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJelani Nelson
Person information
- affiliation: University of California, Berkeley, CA, USA
- award (2017): Presidential Early Career Award for Scientists and Engineers
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j8]Yeshwanth Cherapanamjeri, Jelani Nelson:
Terminal Embeddings in Sublinear Time. TheoretiCS 3 (2024)- [c53]Ishaq Aden-Ali, Yanjun Han, Jelani Nelson, Huacheng Yu:
On the Amortized Complexity of Approximate Counting. APPROX/RANDOM 2024: 33:1-33:17 - [c52]Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, Uri Stemmer:
Lower Bounds for Differential Privacy Under Continual Observation and Online Threshold Queries. COLT 2024: 1200-1222 - [c51]Hilal Asi, Vitaly Feldman, Jelani Nelson, Huy L. Nguyen, Kunal Talwar, Samson Zhou:
Private Vector Mean Estimation in the Shuffle Model: Optimal Rates Require Many Messages. ICML 2024 - [c50]Mikael Møller Høgsgaard, Lior Kamma, Kasper Green Larsen, Jelani Nelson, Chris Schwiegelshohn:
Sparse Dimensionality Reduction Revisited. ICML 2024 - [i58]Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, Uri Stemmer:
Lower Bounds for Differential Privacy Under Continual Observation and Online Threshold Queries. CoRR abs/2403.00028 (2024) - [i57]Hilal Asi, Vitaly Feldman, Jelani Nelson, Huy L. Nguyen, Kunal Talwar, Samson Zhou:
Private Vector Mean Estimation in the Shuffle Model: Optimal Rates Require Many Messages. CoRR abs/2404.10201 (2024) - [i56]Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, Uri Stemmer:
Lower Bounds for Differential Privacy Under Continual Observation and Online Threshold Queries. IACR Cryptol. ePrint Arch. 2024: 373 (2024) - 2023
- [c49]Edith Cohen, Jelani Nelson, Tamás Sarlós, Uri Stemmer:
Tricking the Hashing Trick: A Tight Lower Bound on the Robustness of CountSketch to Adaptive Inputs. AAAI 2023: 7235-7243 - [c48]Badih Ghazi, Ravi Kumar, Pasin Manurangsi, Jelani Nelson, Samson Zhou:
Differentially Private Aggregation via Imperfect Shuffling. ITC 2023: 17:1-17:22 - [c47]Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, Uri Stemmer:
Generalized Private Selection and Testing with High Confidence. ITCS 2023: 39:1-39:23 - [c46]Badih Ghazi, Ravi Kumar, Jelani Nelson, Pasin Manurangsi:
Private Counting of Distinct and k-Occurring Items in Time Windows. ITCS 2023: 55:1-55:24 - [c45]Hilal Asi, Vitaly Feldman, Jelani Nelson, Huy L. Nguyen, Kunal Talwar:
Fast Optimal Locally Private Mean Estimation via Random Projections. NeurIPS 2023 - [c44]Justin Y. Chen, Badih Ghazi, Ravi Kumar, Pasin Manurangsi, Shyam Narayanan, Jelani Nelson, Yinzhan Xu:
Differentially Private All-Pairs Shortest Path Distances: Improved Algorithms and Lower Bounds. SODA 2023: 5040-5067 - [c43]Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, Uri Stemmer:
Optimal Differentially Private Learning of Thresholds and Quasi-Concave Optimization. STOC 2023: 472-482 - [i55]Mikael Møller Høgsgaard, Lior Kamma, Kasper Green Larsen, Jelani Nelson, Chris Schwiegelshohn:
Sparse Dimensionality Reduction Revisited. CoRR abs/2302.06165 (2023) - [i54]Hilal Asi, Vitaly Feldman, Jelani Nelson, Huy L. Nguyen, Kunal Talwar:
Fast Optimal Locally Private Mean Estimation via Random Projections. CoRR abs/2306.04444 (2023) - [i53]Badih Ghazi, Ravi Kumar, Pasin Manurangsi, Jelani Nelson, Samson Zhou:
Differentially Private Aggregation via Imperfect Shuffling. CoRR abs/2308.14733 (2023) - [i52]Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, Uri Stemmer:
Hot PATE: Private Aggregation of Distributions for Diverse Task. CoRR abs/2312.02132 (2023) - 2022
- [c42]Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, Moshe Shechner, Uri Stemmer:
On the Robustness of CountSketch to Adaptive Inputs. ICML 2022: 4112-4140 - [c41]Vitaly Feldman, Jelani Nelson, Huy L. Nguyen, Kunal Talwar:
Private frequency estimation via projective geometry. ICML 2022: 6418-6433 - [c40]Maryam Aliakbarpour, Andrew McGregor, Jelani Nelson, Erik Waingarten:
Estimation of Entropy in Constant Space with Improved Sample Complexity. NeurIPS 2022 - [c39]Nishanth Dikkala, Sankeerth Rao Karingula, Raghu Meka, Jelani Nelson, Rina Panigrahy, Xin Wang:
Sketching based Representations for Robust Image Classification with Provable Guarantees. NeurIPS 2022 - [c38]Jelani Nelson, Huacheng Yu:
Optimal Bounds for Approximate Counting. PODS 2022: 119-127 - [c37]Yeshwanth Cherapanamjeri, Jelani Nelson:
Uniform approximations for Randomized Hadamard Transforms with applications. STOC 2022: 659-671 - [i51]Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, Moshe Shechner, Uri Stemmer:
On the Robustness of CountSketch to Adaptive Inputs. CoRR abs/2202.13736 (2022) - [i50]Vitaly Feldman, Jelani Nelson, Huy Le Nguyen, Kunal Talwar:
Private Frequency Estimation via Projective Geometry. CoRR abs/2203.00194 (2022) - [i49]Yeshwanth Cherapanamjeri, Jelani Nelson:
Uniform Approximations for Randomized Hadamard Transforms with Applications. CoRR abs/2203.01599 (2022) - [i48]Badih Ghazi, Ravi Kumar, Pasin Manurangsi, Jelani Nelson:
Differentially Private All-Pairs Shortest Path Distances: Improved Algorithms and Lower Bounds. CoRR abs/2203.16476 (2022) - [i47]Maryam Aliakbarpour
, Andrew McGregor, Jelani Nelson, Erik Waingarten:
Estimation of Entropy in Constant Space with Improved Sample Complexity. CoRR abs/2205.09804 (2022) - [i46]Edith Cohen, Jelani Nelson, Tamás Sarlós, Uri Stemmer:
Tricking the Hashing Trick: A Tight Lower Bound on the Robustness of CountSketch to Adaptive Inputs. CoRR abs/2207.00956 (2022) - [i45]Ishaq Aden-Ali, Yanjun Han, Jelani Nelson, Huacheng Yu:
On the amortized complexity of approximate counting. CoRR abs/2211.03917 (2022) - [i44]Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, Uri Stemmer:
Õptimal Differentially Private Learning of Thresholds and Quasi-Concave Optimization. CoRR abs/2211.06387 (2022) - [i43]Badih Ghazi, Ravi Kumar, Pasin Manurangsi, Jelani Nelson:
Private Counting of Distinct and k-Occurring Items in Time Windows. CoRR abs/2211.11718 (2022) - [i42]Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, Uri Stemmer:
Generalized Private Selection and Testing with High Confidence. CoRR abs/2211.12063 (2022) - 2021
- [c36]Yeshwanth Cherapanamjeri, Jelani Nelson:
Terminal Embeddings in Sublinear Time. FOCS 2021: 1209-1216 - [c35]Ce Jin, Jelani Nelson, Kewen Wu:
An Improved Sketching Algorithm for Edit Distance. STACS 2021: 45:1-45:16 - [i41]Aydin Buluç, Tamara G. Kolda, Stefan M. Wild, Mihai Anitescu, Anthony M. DeGennaro, John Jakeman, Chandrika Kamath, Ramakrishnan Kannan, Miles E. Lopes, Per-Gunnar Martinsson, Kary L. Myers, Jelani Nelson, Juan M. Restrepo, C. Seshadhri, Draguna L. Vrabie, Brendt Wohlberg, Stephen J. Wright, Chao Yang, Peter Zwart:
Randomized Algorithms for Scientific Computing (RASC). CoRR abs/2104.11079 (2021) - [i40]Shuchi Chawla, Jelani Nelson, Chris Umans, David P. Woodruff:
Visions in Theoretical Computer Science: A Report on the TCS Visioning Workshop 2020. CoRR abs/2107.02846 (2021) - [i39]Yeshwanth Cherapanamjeri, Jelani Nelson:
Terminal Embeddings in Sublinear Time. CoRR abs/2110.08691 (2021) - 2020
- [c34]Yeshwanth Cherapanamjeri, Jelani Nelson:
On Adaptive Distance Estimation. NeurIPS 2020 - [i38]Jelani Nelson, Huacheng Yu:
Optimal bounds for approximate counting. CoRR abs/2010.02116 (2020) - [i37]Yeshwanth Cherapanamjeri, Jelani Nelson:
On Adaptive Distance Estimation. CoRR abs/2010.11252 (2020) - [i36]Ce Jin, Jelani Nelson, Kewen Wu:
An Improved Sketching Bound for Edit Distance. CoRR abs/2010.13170 (2020)
2010 – 2019
- 2019
- [j7]Kasper Green Larsen, Jelani Nelson, Huy L. Nguyen, Mikkel Thorup:
Heavy hitters via cluster-preserving clustering. Commun. ACM 62(8): 95-100 (2019) - [j6]Mark Bun, Jelani Nelson, Uri Stemmer:
Heavy Hitters and the Structure of Local Privacy. ACM Trans. Algorithms 15(4): 51:1-51:40 (2019) - [c33]Allan Grønlund, Lior Kamma, Kasper Green Larsen, Alexander Mathiasen, Jelani Nelson:
Margin-Based Generalization Lower Bounds for Boosted Classifiers. NeurIPS 2019: 11940-11949 - [c32]Jelani Nelson, Huacheng Yu:
Optimal Lower Bounds for Distributed and Streaming Spanning Forest Computation. SODA 2019: 1844-1860 - [c31]Shyam Narayanan, Jelani Nelson:
Optimal terminal dimensionality reduction in Euclidean space. STOC 2019: 1064-1069 - [i35]Allan Grønlund, Lior Kamma, Kasper Green Larsen, Alexander Mathiasen, Jelani Nelson:
Margin-Based Generalization Lower Bounds for Boosted Classifiers. CoRR abs/1909.12518 (2019) - 2018
- [c30]Tom Morgan, Jelani Nelson:
A Note on Reductions Between Compressed Sensing Guarantees. ISIT 2018: 411-415 - [c29]Mark Bun, Jelani Nelson, Uri Stemmer:
Heavy Hitters and the Structure of Local Privacy. PODS 2018: 435-447 - [c28]Michael B. Cohen, T. S. Jayram, Jelani Nelson:
Simple Analyses of the Sparse Johnson-Lindenstrauss Transform. SOSA 2018: 15:1-15:9 - [i34]Jelani Nelson, Huacheng Yu:
Optimal Lower Bounds for Distributed and Streaming Spanning Forest Computation. CoRR abs/1807.05135 (2018) - [i33]Shyam Narayanan, Jelani Nelson:
Optimal terminal dimensionality reduction in Euclidean space. CoRR abs/1810.09250 (2018) - [i32]Jelani Nelson, Huacheng Yu:
Optimal Lower Bounds for Distributed and Streaming Spanning Forest Computation. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c27]Jaroslaw Blasiok, Jian Ding, Jelani Nelson:
Continuous Monitoring of l_p Norms in Data Streams. APPROX-RANDOM 2017: 32:1-32:13 - [c26]Michael Kapralov, Jelani Nelson, Jakub Pachocki, Zhengyu Wang, David P. Woodruff, Mobin Yahyazadeh:
Optimal Lower Bounds for Universal Relation, and for Samplers and Finding Duplicates in Streams. FOCS 2017: 475-486 - [c25]Kasper Green Larsen, Jelani Nelson:
Optimality of the Johnson-Lindenstrauss Lemma. FOCS 2017: 633-638 - [c24]Vladimir Braverman, Stephen R. Chestnut, Nikita Ivkin, Jelani Nelson, Zhengyu Wang, David P. Woodruff:
BPTree: An ℓ2 Heavy Hitters Algorithm Using Constant Memory. PODS 2017: 361-376 - [i31]Jelani Nelson, Jakub Pachocki, Zhengyu Wang:
Optimal lower bounds for universal relation, samplers, and finding duplicates. CoRR abs/1703.08139 (2017) - [i30]Michael Kapralov, Jelani Nelson, Jakub Pachocki, Zhengyu Wang, David P. Woodruff, Mobin Yahyazadeh:
Optimal lower bounds for universal relation, and for samplers and finding duplicates in streams. CoRR abs/1704.00633 (2017) - [i29]Jian Ding, Jaroslaw Blasiok, Jelani Nelson:
Continuous monitoring of 𝓁p norms in data streams. CoRR abs/1704.06710 (2017) - [i28]Jacob Teo Por Loong, Jelani Nelson, Huacheng Yu:
Fillable arrays with constant time operations and a single bit of redundancy. CoRR abs/1709.09574 (2017) - [i27]Mark Bun, Jelani Nelson, Uri Stemmer:
Heavy Hitters and the Structure of Local Privacy. CoRR abs/1711.04740 (2017) - 2016
- [j5]Jelani Nelson:
Chaining introduction with some computer science applications. Bull. EATCS 120 (2016) - [j4]Miklós Ajtai, Vitaly Feldman, Avinatan Hassidim, Jelani Nelson:
Sorting and Selection with Imprecise Comparisons. ACM Trans. Algorithms 12(2): 19:1-19:19 (2016) - [c23]Kasper Green Larsen, Jelani Nelson, Huy L. Nguyen, Mikkel Thorup:
Heavy Hitters via Cluster-Preserving Clustering. FOCS 2016: 61-70 - [c22]Michael B. Cohen, Jelani Nelson, David P. Woodruff:
Optimal Approximate Matrix Product in Terms of Stable Rank. ICALP 2016: 11:1-11:14 - [c21]Jaroslaw Blasiok, Jelani Nelson:
An Improved Analysis of the ER-SpUD Dictionary Learning Algorithm. ICALP 2016: 44:1-44:14 - [c20]Kasper Green Larsen, Jelani Nelson:
The Johnson-Lindenstrauss Lemma Is Optimal for Linear Dimensionality Reduction. ICALP 2016: 82:1-82:11 - [r1]Jelani Nelson:
Oblivious Subspace Embeddings. Encyclopedia of Algorithms 2016: 1430-1434 - [i26]Jaroslaw Blasiok, Jelani Nelson:
An improved analysis of the ER-SpUD dictionary learning algorithm. CoRR abs/1602.05719 (2016) - [i25]Vladimir Braverman, Stephen R. Chestnut, Nikita Ivkin, Jelani Nelson, Zhengyu Wang, David P. Woodruff:
BPTree: an ℓ2 heavy hitters algorithm using constant memory. CoRR abs/1603.00759 (2016) - [i24]Kasper Green Larsen, Jelani Nelson, Huy L. Nguyen, Mikkel Thorup:
Heavy hitters via cluster-preserving clustering. CoRR abs/1604.01357 (2016) - [i23]Tom Morgan, Jelani Nelson:
A note on reductions between compressed sensing guarantees. CoRR abs/1606.00757 (2016) - [i22]Kasper Green Larsen, Jelani Nelson:
Optimality of the Johnson-Lindenstrauss Lemma. CoRR abs/1609.02094 (2016) - 2015
- [c19]Jean Bourgain, Sjoerd Dirksen, Jelani Nelson:
Toward a Unified Theory of Sparse Dimensionality Reduction in Euclidean Space. STOC 2015: 499-508 - [c18]Kasper Green Larsen, Jelani Nelson, Huy L. Nguyên:
Time Lower Bounds for Nonadaptive Turnstile Streaming Algorithms. STOC 2015: 803-812 - [i21]Miklós Ajtai, Vitaly Feldman, Avinatan Hassidim, Jelani Nelson:
Sorting and Selection with Imprecise Comparisons. CoRR abs/1501.02911 (2015) - [i20]Michael B. Cohen, Jelani Nelson, David P. Woodruff:
Optimal approximate matrix product in terms of stable rank. CoRR abs/1507.02268 (2015) - 2014
- [j3]Daniel M. Kane, Jelani Nelson:
Sparser Johnson-Lindenstrauss Transforms. J. ACM 61(1): 4:1-4:23 (2014) - [c17]Jelani Nelson, Huy L. Nguyên:
Lower Bounds for Oblivious Subspace Embeddings. ICALP (1) 2014: 883-894 - [c16]Jelani Nelson, Eric Price, Mary Wootters:
New constructions of RIP matrices with fast multiplication and fewer rows. SODA 2014: 1515-1528 - [i19]Kasper Green Larsen, Jelani Nelson, Huy L. Nguyen:
Time lower bounds for nonadaptive turnstile streaming algorithms. CoRR abs/1407.2151 (2014) - [i18]Kasper Green Larsen, Jelani Nelson:
The Johnson-Lindenstrauss lemma is optimal for linear dimensionality reduction. CoRR abs/1411.2404 (2014) - 2013
- [c15]Jelani Nelson, Huy L. Nguyen:
OSNAP: Faster Numerical Linear Algebra Algorithms via Sparser Subspace Embeddings. FOCS 2013: 117-126 - [c14]Jelani Nelson, Huy L. Nguyen:
Sparsity lower bounds for dimensionality reducing maps. STOC 2013: 101-110 - [i17]Jelani Nelson, Huy L. Nguyen:
Lower bounds for oblivious subspace embeddings. CoRR abs/1308.3280 (2013) - [i16]Jean Bourgain, Jelani Nelson:
Toward a unified theory of sparse dimensionality reduction in Euclidean space. CoRR abs/1311.2542 (2013) - 2012
- [j2]Jelani Nelson:
Sketching and streaming algorithms for processing massive data. XRDS 19(1): 14-19 (2012) - [c13]Jelani Nelson, Huy L. Nguyên, David P. Woodruff:
On Deterministic Sketching and Streaming for Sparse Recovery and Norm Estimation. APPROX-RANDOM 2012: 627-638 - [c12]Daniel M. Kane, Jelani Nelson:
Sparser Johnson-Lindenstrauss transforms. SODA 2012: 1195-1206 - [i15]Jelani Nelson, Huy L. Nguyên, David P. Woodruff:
On Deterministic Sketching and Streaming for Sparse Recovery and Norm Estimation. CoRR abs/1206.5725 (2012) - [i14]Jelani Nelson, Eric Price, Mary Wootters:
New constructions of RIP matrices with fast multiplication and fewer rows. CoRR abs/1211.0986 (2012) - [i13]Jelani Nelson, Huy L. Nguyen:
Sparsity Lower Bounds for Dimensionality Reducing Maps. CoRR abs/1211.0995 (2012) - [i12]Jelani Nelson, Huy L. Nguyen:
OSNAP: Faster numerical linear algebra algorithms via sparser subspace embeddings. CoRR abs/1211.1002 (2012) - 2011
- [b1]Jelani Nelson:
Sketching and streaming algorithms. Massachusetts Institute of Technology, Cambridge, MA, USA, 2011 - [c11]Daniel Kane, Raghu Meka, Jelani Nelson:
Almost Optimal Explicit Johnson-Lindenstrauss Families. APPROX-RANDOM 2011: 628-639 - [c10]Daniel M. Kane, Jelani Nelson, Ely Porat, David P. Woodruff:
Fast moment estimation in data streams in optimal space. STOC 2011: 745-754 - 2010
- [c9]Ilias Diakonikolas, Daniel M. Kane, Jelani Nelson:
Bounded Independence Fools Degree-2 Threshold Functions. FOCS 2010: 11-20 - [c8]Daniel M. Kane, Jelani Nelson, David P. Woodruff:
An optimal algorithm for the distinct elements problem. PODS 2010: 41-52 - [c7]Jelani Nelson, David P. Woodruff:
Fast Manhattan sketches in data streams. PODS 2010: 99-110 - [c6]Daniel M. Kane, Jelani Nelson, David P. Woodruff:
On the Exact Space Complexity of Sketching and Streaming Small Norms. SODA 2010: 1161-1178 - [i11]Daniel M. Kane, Jelani Nelson:
A Derandomized Sparse Johnson-Lindenstrauss Transform. CoRR abs/1006.3585 (2010) - [i10]Daniel M. Kane, Jelani Nelson, Ely Porat, David P. Woodruff:
Fast Moment Estimation in Data Streams in Optimal Space. CoRR abs/1007.4191 (2010) - [i9]Daniel M. Kane, Jelani Nelson:
A Sparser Johnson-Lindenstrauss Transform. CoRR abs/1012.1577 (2010) - [i8]Daniel Kane, Raghu Meka, Jelani Nelson:
Almost Optimal Explicit Johnson-Lindenstrauss Transformations. Electron. Colloquium Comput. Complex. TR10 (2010) - [i7]Daniel M. Kane, Jelani Nelson:
A Derandomized Sparse Johnson-Lindenstrauss Transform. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j1]Timothy G. Abbott, Michael A. Burr, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, John Hugg, Daniel Kane, Stefan Langerman, Jelani Nelson, Eynat Rafalin, Kathryn Seyboth, Vincent Yeung:
Dynamic ham-sandwich cuts in the plane. Comput. Geom. 42(5): 419-428 (2009) - [c5]Miklós Ajtai, Vitaly Feldman, Avinatan Hassidim, Jelani Nelson:
Sorting and Selection with Imprecise Comparisons. ICALP (1) 2009: 37-48 - [i6]Jelani Nelson, David P. Woodruff:
A Near-Optimal Algorithm for L1-Difference. CoRR abs/0904.2027 (2009) - [i5]Ilias Diakonikolas, Daniel M. Kane, Jelani Nelson:
Bounded Independence Fools Degree-2 Threshold Functions. CoRR abs/0911.3389 (2009) - [i4]Ilias Diakonikolas, Daniel M. Kane, Jelani Nelson:
Bounded Independence Fools Degree-2 Threshold Functions. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [c4]Nicholas J. A. Harvey, Jelani Nelson, Krzysztof Onak:
Sketching and Streaming Entropy via Approximation Theory. FOCS 2008: 489-498 - [c3]Nicholas J. A. Harvey, Jelani Nelson, Krzysztof Onak:
Streaming algorithms for estimating entropy. ITW 2008: 227-231 - [i3]Nicholas J. A. Harvey, Jelani Nelson, Krzysztof Onak:
Sketching and Streaming Entropy via Approximation Theory. CoRR abs/0804.4138 (2008) - [i2]Daniel M. Kane, Jelani Nelson, David P. Woodruff:
Revisiting Norm Estimation in Data Streams. CoRR abs/0811.3648 (2008) - 2007
- [c2]Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Yonatan R. Fogel, Bradley C. Kuszmaul, Jelani Nelson:
Cache-oblivious streaming B-trees. SPAA 2007: 81-92 - [i1]Jelani Nelson:
A Note on Set Cover Inapproximability Independent of Universe Size. Electron. Colloquium Comput. Complex. TR07 (2007) - 2005
- [c1]Timothy G. Abbott, Erik D. Demaine, Martin L. Demaine, Daniel Kane, Stefan Langerman, Jelani Nelson, Vincent Yeung:
Dynamic Ham-Sandwich Cuts of Convex Polygons in the Plane. CCCG 2005: 61-64
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:19 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:
