default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnindya De
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2020
[j10]Anindya De, Ryan O'Donnell, Rocco A. Servedio
:
Sharp Bounds for Population Recovery. Theory Comput. 16: 1-20 (2020)- 2019
- [j9]Anindya De, Elchanan Mossel, Joe Neeman:
Noise Stability is Computable and Approximately Low-Dimensional. Theory Comput. 15: 1-47 (2019) - 2017
- [j8]Anindya De, Ilias Diakonikolas, Rocco A. Servedio:
The Inverse Shapley value problem. Games Econ. Behav. 105: 122-147 (2017) - 2016
- [j7]Anindya De, Ilias Diakonikolas, Rocco A. Servedio:
A Robust Khintchine Inequality, and Algorithms for Computing Optimal Constants in Fourier Analysis and High-Dimensional Geometry. SIAM J. Discret. Math. 30(2): 1058-1094 (2016) - [j6]Anindya De, Elchanan Mossel, Joe Neeman:
Majority is Stablest: Discrete and SoS. Theory Comput. 12(1): 1-50 (2016) - 2014
- [j5]Anindya De, Ilias Diakonikolas, Vitaly Feldman, Rocco A. Servedio:
Nearly Optimal Solutions for the Chow Parameters Problem and Low-Weight Approximation of Halfspaces. J. ACM 61(2): 11:1-11:36 (2014) - 2013
- [j4]Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi:
Fast Integer Multiplication Using Modular Arithmetic. SIAM J. Comput. 42(2): 685-699 (2013) - [j3]Anindya De, Elchanan Mossel:
Explicit Optimal Hardness via Gaussian Stability Results. ACM Trans. Comput. Theory 5(4): 14:1-14:26 (2013) - 2012
- [j2]Anindya De, Christopher Portmann, Thomas Vidick, Renato Renner:
Trevisan's Extractor in the Presence of Quantum Side Information. SIAM J. Comput. 41(4): 915-940 (2012) - [j1]Anindya De, Thomas Watson:
Extractors and Lower Bounds for Locally Samplable Sources. ACM Trans. Comput. Theory 4(1): 3:1-3:21 (2012)
Conference and Workshop Papers
- 2024
- [c54]Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio:
Trace Reconstruction from Local Statistical Queries. APPROX/RANDOM 2024: 52:1-52:24 - [c53]Xi Chen, Anindya De, Yuhao Li, Shivam Nadimpalli, Rocco A. Servedio:
Testing Intersecting and Union-Closed Families. ITCS 2024: 33:1-33:23 - [c52]Xi Chen, Anindya De, Yuhao Li, Shivam Nadimpalli, Rocco A. Servedio:
Mildly Exponential Lower Bounds on Tolerant Testers for Monotonicity, Unateness, and Juntas. SODA 2024: 4321-4337 - [c51]Anindya De, Huan Li, Shivam Nadimpalli, Rocco A. Servedio:
Detecting Low-Degree Truncation. STOC 2024: 1027-1038 - 2023
- [c50]Eshwar Ram Arunachaleswaran, Anindya De, Sampath Kannan:
Reconstructing Ultrametric Trees from Noisy Experiments. ALT 2023: 82-114 - [c49]Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha:
Approximate Trace Reconstruction from a Single Trace. SODA 2023: 605-637 - [c48]Anindya De, Shivam Nadimpalli, Rocco A. Servedio:
Testing Convex Truncation. SODA 2023: 4050-4082 - 2022
- [c47]Aidao Chen, Anindya De, Aravindan Vijayaraghavan:
Algorithms for learning a mixture of linear classifiers. ALT 2022: 205-226 - [c46]Anindya De, Shivam Nadimpalli, Rocco A. Servedio:
Convex Influences. ITCS 2022: 53:1-53:21 - [c45]Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha:
Near-Optimal Average-Case Approximate Trace Reconstruction from Few Traces. SODA 2022: 779-821 - [c44]Anindya De, Shivam Nadimpalli, Rocco A. Servedio:
Approximating Sumset Size. SODA 2022: 2339-2357 - [c43]Anindya De, Sanjeev Khanna, Huan Li, Hesam Nikpey:
Nearly Tight Bounds for Discrete Search under Outlier Noise. SOSA 2022: 161-173 - 2021
- [c42]Aidao Chen, Anindya De, Aravindan Vijayaraghavan:
Learning a mixture of two subspaces over finite fields. ALT 2021: 481-504 - [c41]Huck Bennett, Anindya De, Rocco A. Servedio, Emmanouil-Vasileios Vlatakis-Gkaragkounis:
Reconstructing weighted voting schemes from partial information about their power indices. COLT 2021: 500-565 - [c40]Anindya De, Rocco A. Servedio:
Weak learning convex sets under normal distributions. COLT 2021: 1399-1428 - [c39]Anindya De, Ryan O'Donnell, Rocco A. Servedio:
Learning sparse mixtures of permutations from noisy information. COLT 2021: 1429-1466 - [c38]Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha:
Polynomial-Time Trace Reconstruction in the Low Deletion Rate Regime. ITCS 2021: 20:1-20:20 - [c37]Anindya De, Shivam Nadimpalli, Rocco A. Servedio:
Quantitative Correlation Inequalities via Semigroup Interpolation. ITCS 2021: 69:1-69:20 - [c36]Anindya De, Sanjeev Khanna, Huan Li, MohammadHesam NikpeySalekde:
Approximate optimization of convex functions with outlier noise. NeurIPS 2021: 8147-8157 - [c35]Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha:
Polynomial-time trace reconstruction in the smoothed complexity model. SODA 2021: 54-73 - [c34]Anindya De, Elchanan Mossel, Joe Neeman:
Robust testing of low dimensional functions. STOC 2021: 584-597 - 2020
- [c33]Anindya De, Sanjeev Khanna, Huan Li, Hesam Nikpey:
An Efficient PTAS for Stochastic Load Balancing with Poisson Jobs. ICALP 2020: 37:1-37:18 - [c32]Clément L. Canonne, Anindya De, Rocco A. Servedio:
Learning from satisfying assignments under continuous distributions. SODA 2020: 82-101 - [c31]Xue Chen, Anindya De:
Reconstruction under outliers for Fourier-sparse functions. SODA 2020: 2010-2029 - [c30]Xue Chen, Anindya De, Rocco A. Servedio:
Testing noisy linear functions for sparsity. STOC 2020: 610-623 - 2019
- [c29]Eshan Chattopadhyay, Anindya De, Rocco A. Servedio:
Simple and Efficient Pseudorandom Generators from Gaussian Processes. CCC 2019: 4:1-4:33 - [c28]Anindya De, Elchanan Mossel, Joe Neeman:
Is your function low dimensional? COLT 2019: 979-993 - [c27]Anindya De, Elchanan Mossel, Joe Neeman:
Junta Correlation is Testable. FOCS 2019: 1549-1563 - [c26]Anindya De, Philip M. Long, Rocco A. Servedio:
Density Estimation for Shift-Invariant Multidimensional Distributions. ITCS 2019: 28:1-28:20 - 2018
- [c25]Anindya De, Philip M. Long, Rocco A. Servedio:
Learning Sums of Independent Random Variables with Sparse Collective Support. FOCS 2018: 297-308 - [c24]Anindya De:
Boolean function analysis meets stochastic optimization: An approximation scheme for stochastic knapsack. SODA 2018: 1286-1305 - [c23]Anindya De, Elchanan Mossel, Joe Neeman:
Non interactive simulation of correlated distributions is decidable. SODA 2018: 2728-2746 - 2017
- [c22]Anindya De, Elchanan Mossel, Joe Neeman:
Noise Stability Is Computable and Approximately Low-Dimensional. CCC 2017: 10:1-10:11 - [c21]Anindya De, Ryan O'Donnell, Rocco A. Servedio:
Optimal mean-based algorithms for trace reconstruction. STOC 2017: 1047-1056 - 2016
- [c20]Anindya De, Michael E. Saks, Sijian Tang:
Noisy Population Recovery in Polynomial Time. FOCS 2016: 675-684 - [c19]Constantinos Daskalakis, Anindya De, Gautam Kamath, Christos Tzamos:
A size-free CLT for poisson multinomials and its applications. STOC 2016: 1074-1086 - 2015
- [c18]Anindya De:
Beyond the Central Limit theorem: Asymptotic Expansions and Pseudorandomness for Combinatorial Sums. FOCS 2015: 883-902 - [c17]Anindya De, Ilias Diakonikolas, Rocco A. Servedio:
Learning from satisfying assignments. SODA 2015: 478-497 - [c16]Xi Chen, Anindya De, Rocco A. Servedio, Li-Yang Tan:
Boolean Function Monotonicity Testing Requires (Almost) n1/2 Non-adaptive Queries. STOC 2015: 519-528 - 2014
- [c15]Anindya De, Ilias Diakonikolas, Rocco A. Servedio:
Deterministic Approximate Counting for Juntas of Degree-2 Polynomial Threshold Functions. CCC 2014: 229-240 - [c14]Constantinos Daskalakis, Anindya De, Ilias Diakonikolas, Ankur Moitra, Rocco A. Servedio:
A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage. SODA 2014: 628-644 - [c13]Anindya De, Rocco A. Servedio:
Efficient deterministic approximate counting for low-degree polynomial threshold functions. STOC 2014: 832-841 - 2013
- [c12]Anindya De, Ilias Diakonikolas, Rocco A. Servedio:
A Robust Khintchine Inequality, and Algorithms for Computing Optimal Constants in Fourier Analysis and High-Dimensional Geometry. ICALP (1) 2013: 376-387 - [c11]Anindya De, Elchanan Mossel, Joe Neeman:
Majority is stablest: discrete and SoS. STOC 2013: 477-486 - 2012
- [c10]Anindya De, Ilias Diakonikolas, Rocco A. Servedio:
The Inverse Shapley Value Problem. ICALP (1) 2012: 266-277 - [c9]Anindya De, Ilias Diakonikolas, Vitaly Feldman, Rocco A. Servedio:
Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces. STOC 2012: 729-746 - [c8]Anindya De:
Lower Bounds in Differential Privacy. TCC 2012: 321-338 - 2011
- [c7]Anindya De, Thomas Watson:
Extractors and Lower Bounds for Locally Samplable Sources. APPROX-RANDOM 2011: 483-494 - [c6]Anindya De:
Pseudorandomness for Permutation and Regular Branching Programs. CCC 2011: 221-231 - 2010
- [c5]Anindya De, Omid Etesami, Luca Trevisan, Madhur Tulsiani:
Improved Pseudorandom Generators for Depth 2 Circuits. APPROX-RANDOM 2010: 504-517 - [c4]Anindya De, Luca Trevisan, Madhur Tulsiani:
Time Space Tradeoffs for Attacks against One-Way Functions and PRGs. CRYPTO 2010: 649-665 - [c3]Anindya De, Thomas Vidick:
Near-optimal extractors against quantum storage. STOC 2010: 161-170 - 2009
- [c2]Anindya De, Luca Trevisan:
Extractors Using Hardness Amplification. APPROX-RANDOM 2009: 462-475 - 2008
- [c1]Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi:
Fast integer multiplication using modular arithmetic. STOC 2008: 499-506
Informal and Other Publications
- 2024
- [i64]Anindya De, Huan Li, Shivam Nadimpalli, Rocco A. Servedio:
Detecting Low-Degree Truncation. CoRR abs/2402.08133 (2024) - [i63]Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio:
Trace reconstruction from local statistical queries. CoRR abs/2407.11177 (2024) - 2023
- [i62]Anindya De, Shivam Nadimpalli, Rocco A. Servedio:
Testing Convex Truncation. CoRR abs/2305.03146 (2023) - [i61]Xi Chen, Anindya De, Yuhao Li, Shivam Nadimpalli, Rocco A. Servedio:
Mildly Exponential Lower Bounds on Tolerant Testers for Monotonicity, Unateness, and Juntas. CoRR abs/2309.12513 (2023) - [i60]Anindya De, Shivam Nadimpalli, Rocco A. Servedio:
Gaussian Approximation of Convex Sets by Intersections of Halfspaces. CoRR abs/2311.08575 (2023) - [i59]Xi Chen, Anindya De, Yuhao Li, Shivam Nadimpalli, Rocco A. Servedio:
Testing Intersecting and Union-Closed Families. CoRR abs/2311.11119 (2023) - 2022
- [i58]Eshwar Ram Arunachaleswaran, Anindya De, Sampath Kannan:
Reconstructing Ultrametric Trees from Noisy Experiments. CoRR abs/2206.07672 (2022) - [i57]Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha:
Approximate Trace Reconstruction from a Single Trace. CoRR abs/2211.03292 (2022) - 2021
- [i56]Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha:
Near-Optimal Average-Case Approximate Trace Reconstruction from Few Traces. CoRR abs/2107.11530 (2021) - [i55]Anindya De, Shivam Nadimpalli, Rocco A. Servedio:
Approximating Sumset Size. CoRR abs/2107.12367 (2021) - [i54]Anindya De, Shivam Nadimpalli, Rocco A. Servedio:
Convex Influences. CoRR abs/2109.03107 (2021) - [i53]Anindya De, Elchanan Mossel, Joe Neeman:
Robust testing of low-dimensional functions. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [i52]Anindya De, Elchanan Mossel, Joe Neeman:
Robust testing of low-dimensional functions. CoRR abs/2004.11642 (2020) - [i51]Anindya De, Sanjeev Khanna, Huan Li, Hesam Nikpey:
An Efficient PTAS for Stochastic Load Balancing with Poisson Jobs. CoRR abs/2006.12670 (2020) - [i50]Huck Bennett, Anindya De, Rocco A. Servedio, Emmanouil-Vasileios Vlatakis-Gkaragkounis:
Reconstructing weighted voting schemes from partial information about their power indices. CoRR abs/2007.09599 (2020) - [i49]Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha:
Polynomial-time trace reconstruction in the smoothed complexity model. CoRR abs/2008.12386 (2020) - [i48]Aidao Chen, Anindya De, Aravindan Vijayaraghavan:
Learning a mixture of two subspaces over finite fields. CoRR abs/2010.02841 (2020) - [i47]Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha:
Polynomial-time trace reconstruction in the low deletion rate regime. CoRR abs/2012.02844 (2020) - [i46]Anindya De, Shivam Nadimpalli, Rocco A. Servedio:
Quantitative Correlation Inequalities via Semigroup Interpolation. CoRR abs/2012.12216 (2020) - 2019
- [i45]Anindya De, Elchanan Mossel, Joe Neeman:
Junta correlation is testable. CoRR abs/1904.04216 (2019) - [i44]Clément L. Canonne, Anindya De, Rocco A. Servedio:
Learning from satisfying assignments under continuous distributions. CoRR abs/1907.01619 (2019) - [i43]Xue Chen, Anindya De:
Reconstruction under outliers for Fourier-sparse functions. CoRR abs/1907.04274 (2019) - [i42]Anindya De, Rocco A. Servedio:
Kruskal-Katona for convex sets, with applications. CoRR abs/1911.00178 (2019) - [i41]Xue Chen, Anindya De, Rocco A. Servedio:
Testing noisy linear functions for sparsity. CoRR abs/1911.00911 (2019) - 2018
- [i40]Anindya De, Elchanan Mossel, Joe Neeman:
Is your data low-dimensional? CoRR abs/1806.10057 (2018) - [i39]Anindya De, Philip M. Long, Rocco A. Servedio:
Learning Sums of Independent Random Variables with Sparse Collective Support. CoRR abs/1807.07013 (2018) - [i38]Anindya De, Ryan O'Donnell, Rocco A. Servedio:
Learning sparse mixtures of rankings from noisy information. CoRR abs/1811.01216 (2018) - [i37]Anindya De, Philip M. Long, Rocco A. Servedio:
Density estimation for shift-invariant multidimensional distributions. CoRR abs/1811.03744 (2018) - [i36]Eshan Chattopadhyay, Anindya De, Rocco A. Servedio:
Simple and efficient pseudorandom generators from Gaussian processes. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [i35]Anindya De, Elchanan Mossel, Joe Neeman:
Noise Stability is computable and low dimensional. CoRR abs/1701.01483 (2017) - [i34]Anindya De, Elchanan Mossel, Joe Neeman:
Non interactive simulation of correlated distributions is decidable. CoRR abs/1701.01485 (2017) - [i33]Anindya De, Ryan O'Donnell, Rocco A. Servedio:
Sharp bounds for population recovery. CoRR abs/1703.01474 (2017) - [i32]Anindya De:
Boolean function analysis meets stochastic optimization: An approximation scheme for stochastic knapsack. CoRR abs/1712.00918 (2017) - 2016
- [i31]Anindya De, Michael E. Saks, Sijian Tang:
Noisy population recovery in polynomial time. CoRR abs/1602.07616 (2016) - [i30]Anindya De, Ryan O'Donnell, Rocco A. Servedio:
Optimal mean-based algorithms for trace reconstruction. CoRR abs/1612.03148 (2016) - [i29]Anindya De, Michael E. Saks, Sijian Tang:
Noisy population recovery in polynomial time. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [i28]Constantinos Daskalakis, Anindya De, Gautam Kamath, Christos Tzamos:
A Size-Free CLT for Poisson Multinomials and its Applications. CoRR abs/1511.03641 (2015) - 2014
- [i27]Xi Chen, Anindya De, Rocco A. Servedio, Li-Yang Tan:
Boolean function monotonicity testing requires (almost) n1/2 non-adaptive queries. CoRR abs/1412.5657 (2014) - [i26]Anindya De:
Beyond the Central Limit Theorem: asymptotic expansions and pseudorandomness for combinatorial sums. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [i25]Constantinos Daskalakis, Anindya De, Ilias Diakonikolas, Ankur Moitra, Rocco A. Servedio:
A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage. CoRR abs/1307.3621 (2013) - [i24]Anindya De, Ilias Diakonikolas, Rocco A. Servedio:
Deterministic Approximate Counting for Degree-$2$ Polynomial Threshold Functions. CoRR abs/1311.7105 (2013) - [i23]Anindya De, Ilias Diakonikolas, Rocco A. Servedio:
Deterministic Approximate Counting for Juntas of Degree-$2$ Polynomial Threshold Functions. CoRR abs/1311.7115 (2013) - [i22]Anindya De, Rocco A. Servedio:
Efficient deterministic approximate counting for low-degree polynomial threshold functions. CoRR abs/1311.7178 (2013) - [i21]Anindya De, Ilias Diakonikolas, Rocco A. Servedio:
Deterministic Approximate Counting for Juntas of Degree-2 Polynomial Threshold Functions. Electron. Colloquium Comput. Complex. TR13 (2013) - [i20]Anindya De, Ilias Diakonikolas, Rocco A. Servedio:
Deterministic Approximate Counting for Degree-2 Polynomial Threshold Functions. Electron. Colloquium Comput. Complex. TR13 (2013) - [i19]Anindya De, Rocco A. Servedio:
Efficient deterministic approximate counting for low degree polynomial threshold functions. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [i18]Anindya De, Elchanan Mossel:
Explicit Optimal Hardness via Gaussian stability results. CoRR abs/1202.5258 (2012) - [i17]Anindya De, Ilias Diakonikolas, Vitaly Feldman, Rocco A. Servedio:
Nearly optimal solutions for the Chow Parameters Problem and low-weight approximation of halfspaces. CoRR abs/1206.0985 (2012) - [i16]Anindya De, Ilias Diakonikolas, Rocco A. Servedio:
A robust Khintchine inequality, and algorithms for computing optimal constants in Fourier analysis and high-dimensional geometry. CoRR abs/1207.2229 (2012) - [i15]Anindya De, Elchanan Mossel, Joe Neeman:
Majority is Stablest : Discrete and SoS. CoRR abs/1211.1001 (2012) - [i14]Anindya De, Ilias Diakonikolas, Rocco A. Servedio:
Inverse problems in approximate uniform generation. CoRR abs/1211.1722 (2012) - [i13]Anindya De, Ilias Diakonikolas, Rocco A. Servedio:
The Inverse Shapley Value Problem. CoRR abs/1212.5132 (2012) - [i12]Anindya De, Ilias Diakonikolas, Vitaly Feldman, Rocco A. Servedio:
Nearly optimal solutions for the Chow Parameters Problem and low-weight approximation of halfspaces. Electron. Colloquium Comput. Complex. TR12 (2012) - [i11]Anindya De, Ilias Diakonikolas, Rocco A. Servedio:
Inverse Problems in Approximate Uniform Generation. Electron. Colloquium Comput. Complex. TR12 (2012) - [i10]Anindya De, Ilias Diakonikolas, Rocco A. Servedio:
The Inverse Shapley Value Problem. Electron. Colloquium Comput. Complex. TR12 (2012) - [i9]Anindya De, Elchanan Mossel:
Explicit Optimal hardness via Gaussian stability results. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [i8]Anindya De:
Lower bounds in differential privacy. CoRR abs/1107.2183 (2011) - [i7]Anindya De, Thomas Watson:
Extractors and Lower Bounds for Locally Samplable Sources. Electron. Colloquium Comput. Complex. TR11 (2011) - 2009
- [i6]Anindya De, Christopher Portmann, Thomas Vidick, Renato Renner:
Trevisan's extractor in the presence of quantum side information. CoRR abs/0912.5514 (2009) - [i5]Anindya De, Omid Etesami, Luca Trevisan, Madhur Tulsiani:
Improved Pseudorandom Generators for Depth 2 Circuits. Electron. Colloquium Comput. Complex. TR09 (2009) - [i4]Anindya De, Luca Trevisan, Madhur Tulsiani:
Non-uniform attacks against one-way functions and PRGs. Electron. Colloquium Comput. Complex. TR09 (2009) - [i3]Anindya De, Thomas Vidick:
Near-optimal extractors against quantum storage. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [i2]Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi:
Fast Integer Multiplication using Modular Arithmetic. CoRR abs/0801.1416 (2008) - [i1]Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi:
Fast Integer Multiplication using Modular Arithmetic. Electron. Colloquium Comput. Complex. TR08 (2008)
Coauthor Index
[j10] [j8] [j7] [j5] [c54] [c53] [c52] [c51] [c49] [c48] [c46] [c45] [c44] [c41] [c40] [c39] [c38] [c37] [c35] [c32] [c30] [c29] [c26] [c25] [c21] [c17] [c16] [c15] [c14] [c13] [c12] [c10] [c9] [i64] [i63] [i62] [i61] [i60] [i59] [i57] [i56] [i55] [i54] [i50] [i49] [i47] [i46] [i44] [i42] [i41] [i39] [i38] [i37] [i36] [i33] [i30] [i27] [i25] [i24] [i23] [i22] [i21] [i20] [i19] [i17] [i16] [i14] [i13] [i12] [i11] [i10]
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-09-18 00:15 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:
