default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander Golovnev
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
[j11]Chi-Ning Chou
, Alexander Golovnev, Madhu Sudan, Santhoshini Velusamy:
Sketching Approximability of All Finite CSPs. J. ACM 71(2): 15:1-15:74 (2024)- [c43]Alexander Golovnev, Zeyu Guo, Pooya Hatami, Satyajeet Nagargoje, Chao Yan:
Hilbert Functions and Low-Degree Randomness Extractors. APPROX/RANDOM 2024: 41:1-41:24 - [c42]Huck Bennett, Karthik Gajulapalli, Alexander Golovnev, Philip G. Warton:
Matrix Multiplication Verification Using Coding Theory. APPROX/RANDOM 2024: 42:1-42:13 - [c41]Karthik Gajulapalli, Alexander Golovnev, Samuel King:
On the Power of Adaptivity for Function Inversion. ITC 2024: 5:1-5:10 - [c40]Vahid R. Asadi, Alexander Golovnev, Tom Gur, Igor Shinkar, Sathyawageeswar Subramanian:
Quantum Worst-Case to Average-Case Reductions for All Linear Problems. SODA 2024: 2535-2567 - [i54]Alexander Golovnev, Zeyu Guo, Pooya Hatami, Satyajeet Nagargoje, Chao Yan:
Hilbert Functions and Low-Degree Randomness Extractors. CoRR abs/2405.10277 (2024) - [i53]Karthik Gajulapalli, Alexander Golovnev, Samuel King:
On the Power of Adaptivity for Function Inversion. Electron. Colloquium Comput. Complex. TR24 (2024) - [i52]Alexander Golovnev, Zeyu Guo, Pooya Hatami, Satyajeet Nagargoje, Chao Yan:
Hilbert Functions and Low-Degree Randomness Extractors. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [j10]Magnus Gausdal Find, Alexander Golovnev, Edward A. Hirsch, Alexander S. Kulikov:
Improving 3N Circuit Complexity Lower Bounds. Comput. Complex. 32(2): 13 (2023) - [c39]Alexander Golovnev, Siyao Guo, Spencer Peters, Noah Stephens-Davidowitz:
The (Im)possibility of Simple Search-To-Decision Reductions for Approximation Problems. APPROX/RANDOM 2023: 10:1-10:20 - [c38]Karthik Gajulapalli, Alexander Golovnev, Satyajeet Nagargoje, Sidhant Saraogi:
Range Avoidance for Constant Depth Circuits: Hardness and Algorithms. APPROX/RANDOM 2023: 65:1-65:18 - [c37]Alexander Golovnev, Jonathan Lee, Srinath T. V. Setty, Justin Thaler, Riad S. Wahby:
Brakedown: Linear-Time and Field-Agnostic SNARKs for R1CS. CRYPTO (2) 2023: 193-226 - [c36]Alexander Golovnev, Siyao Guo, Spencer Peters, Noah Stephens-Davidowitz:
Revisiting Time-Space Tradeoffs for Function Inversion. CRYPTO (2) 2023: 453-481 - [c35]Tatiana Belova, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Denil Sharipov:
Polynomial formulations as a barrier for reduction-based hardness proofs. SODA 2023: 3245-3281 - [c34]Alexander Golovnev, Tom Gur, Igor Shinkar:
Derandomization of Cell Sampling. SOSA 2023: 278-284 - [c33]Divesh Aggarwal, Huck Bennett, Zvika Brakerski, Alexander Golovnev, Rajendra Kumar, Zeyong Li, Spencer Peters, Noah Stephens-Davidowitz, Vinod Vaikuntanathan:
Lattice Problems beyond Polynomial Time. STOC 2023: 1516-1526 - [i51]Karthik Gajulapalli, Alexander Golovnev, Satyajeet Nagargoje, Sidhant Saraogi:
Range Avoidance for Constant-Depth Circuits: Hardness and Algorithms. CoRR abs/2303.05044 (2023) - [i50]Huck Bennett, Karthik Gajulapalli, Alexander Golovnev, Philip G. Warton:
Matrix Multiplication Verification Using Coding Theory. CoRR abs/2309.16176 (2023) - [i49]Eldon Chung, Alexander Golovnev, Zeyong Li, Maciej Obremski, Sidhant Saraogi, Noah Stephens-Davidowitz:
On the randomized complexity of range avoidance, with applications to cryptography and metacomplexity. Electron. Colloquium Comput. Complex. TR23 (2023) - [i48]Karthik Gajulapalli, Alexander Golovnev, Satyajeet Nagargoje, Sidhant Saraogi:
Range Avoidance for Constant-Depth Circuits: Hardness and Algorithms. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j9]Alexander Golovnev, Ishay Haviv:
The (Generalized) Orthogonality Dimension of (Generalized) Kneser Graphs: Bounds and Applications. Theory Comput. 18: 1-22 (2022) - [c32]Chi-Ning Chou, Alexander Golovnev, Amirbehshad Shahrasbi, Madhu Sudan, Santhoshini Velusamy:
Sketching Approximability of (Weak) Monarchy Predicates. APPROX/RANDOM 2022: 35:1-35:17 - [c31]Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Ameya Velingker, Santhoshini Velusamy:
Linear space streaming lower bounds for approximating CSPs. STOC 2022: 275-288 - [c30]Vahid R. Asadi, Alexander Golovnev, Tom Gur, Igor Shinkar:
Worst-case to average-case reductions via additive combinatorics. STOC 2022: 1566-1574 - [i47]Vahid R. Asadi, Alexander Golovnev, Tom Gur, Igor Shinkar:
Worst-Case to Average-Case Reductions via Additive Combinatorics. CoRR abs/2202.08996 (2022) - [i46]Chi-Ning Chou, Alexander Golovnev, Amirbehshad Shahrasbi, Madhu Sudan, Santhoshini Velusamy:
Sketching Approximability of (Weak) Monarchy Predicates. CoRR abs/2205.02345 (2022) - [i45]Divesh Aggarwal, Huck Bennett, Zvika Brakerski, Alexander Golovnev, Rajendra Kumar, Zeyong Li, Spencer Peters, Noah Stephens-Davidowitz, Vinod Vaikuntanathan:
Lattice Problems Beyond Polynomial Time. CoRR abs/2211.11693 (2022) - [i44]Vahid R. Asadi, Alexander Golovnev, Tom Gur, Igor Shinkar, Sathyawageeswar Subramanian:
Quantum Worst-Case to Average-Case Reductions for All Linear Problems. CoRR abs/2212.03348 (2022) - [i43]Vahid R. Asadi, Alexander Golovnev, Tom Gur, Igor Shinkar:
Worst-Case to Average-Case Reductions via Additive Combinatorics. Electron. Colloquium Comput. Complex. TR22 (2022) - [i42]Vahid R. Asadi, Alexander Golovnev, Tom Gur, Igor Shinkar, Sathyawageeswar Subramanian:
Quantum Worst-Case to Average-Case Reductions for All Linear Problems. Electron. Colloquium Comput. Complex. TR22 (2022) - [i41]Chi-Ning Chou, Alexander Golovnev, Amirbehshad Shahrasbi, Madhu Sudan, Santhoshini Velusamy:
Sketching Approximability of (Weak) Monarchy Predicates. Electron. Colloquium Comput. Complex. TR22 (2022) - [i40]Alexander Golovnev, Siyao Guo, Spencer Peters, Noah Stephens-Davidowitz:
Revisiting Time-Space Tradeoffs for Function Inversion. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c29]Alexander Golovnev, Ishay Haviv:
The (Generalized) Orthogonality Dimension of (Generalized) Kneser Graphs: Bounds and Applications. CCC 2021: 8:1-8:15 - [c28]Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Santhoshini Velusamy:
Approximability of all finite CSPs with linear sketches. FOCS 2021: 1197-1208 - [c27]Alexander Golovnev, Alexander S. Kulikov, R. Ryan Williams:
Circuit Depth Reductions. ITCS 2021: 24:1-24:20 - [c26]Divesh Aggarwal, Huck Bennett, Alexander Golovnev, Noah Stephens-Davidowitz:
Fine-grained hardness of CVP(P) - Everything that we can prove (and nothing else). SODA 2021: 1816-1835 - [i39]Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Santhoshini Velusamy:
Classification of the streaming approximability of Boolean CSPs. CoRR abs/2102.12351 (2021) - [i38]Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Santhoshini Velusamy:
Approximability of all finite CSPs in the dynamic streaming setting. CoRR abs/2105.01161 (2021) - [i37]Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Ameya Velingker, Santhoshini Velusamy:
Linear Space Streaming Lower Bounds for Approximating CSPs. CoRR abs/2106.13078 (2021) - [i36]Alexander Golovnev, Tom Gur, Igor Shinkar:
Derandomization of Cell Sampling. CoRR abs/2108.05970 (2021) - [i35]Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Santhoshini Velusamy:
Classification of the streaming approximability of Boolean CSPs. Electron. Colloquium Comput. Complex. TR21 (2021) - [i34]Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Santhoshini Velusamy:
Approximability of all finite CSPs in the dynamic streaming setting. Electron. Colloquium Comput. Complex. TR21 (2021) - [i33]Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Ameya Velingker, Santhoshini Velusamy:
Linear Space Streaming Lower Bounds for Approximating CSPs. Electron. Colloquium Comput. Complex. TR21 (2021) - [i32]Alexander Golovnev, Siyao Guo, Spencer Peters, Noah Stephens-Davidowitz:
On the (im)possibility of branch-and-bound search-to-decision reductions for approximate optimization. Electron. Colloquium Comput. Complex. TR21 (2021) - [i31]Alexander Golovnev, Jonathan Lee, Srinath T. V. Setty, Justin Thaler, Riad S. Wahby:
Brakedown: Linear-time and post-quantum SNARKs for R1CS. IACR Cryptol. ePrint Arch. 2021: 1043 (2021) - 2020
- [c25]Pierrick Gaudry, Alexander Golovnev:
Breaking the Encryption Scheme of the Moscow Internet Voting System. Financial Cryptography 2020: 32-49 - [c24]Chi-Ning Chou, Alexander Golovnev, Santhoshini Velusamy:
Optimal Streaming Approximations for all Boolean Max-2CSPs and Max-ksat. FOCS 2020: 330-341 - [c23]Alexander Golovnev, Gleb Posobin, Oded Regev, Omri Weinstein:
Polynomial Data Structure Lower Bounds in the Group Model. FOCS 2020: 740-751 - [c22]Alexander Golovnev, Siyao Guo, Thibaut Horel, Sunoo Park, Vinod Vaikuntanathan:
Data structures meet cryptography: 3SUM with preprocessing. STOC 2020: 294-307 - [i30]Alexander Golovnev, Ishay Haviv:
The (Generalized) Orthogonality Dimension of (Generalized) Kneser Graphs: Bounds and Applications. CoRR abs/2002.08580 (2020) - [i29]Chi-Ning Chou, Alexander Golovnev, Santhoshini Velusamy:
Optimal Streaming Approximations for all Boolean Max-2CSPs. CoRR abs/2004.11796 (2020) - [i28]Alexander Golovnev, Gleb Posobin, Oded Regev, Omri Weinstein:
Polynomial Data Structure Lower Bounds in the Group Model. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c21]Alexander Golovnev, Alexander S. Kulikov, Alexander Logunov, Ivan Mihajlin, Maksim Nikolaev:
Collapsing Superstring Conjecture. APPROX-RANDOM 2019: 26:1-26:23 - [c20]Alexander Golovnev, Mika Göös, Daniel Reichman, Igor Shinkar:
String Matching: Communication, Circuits, and Learning. APPROX-RANDOM 2019: 56:1-56:20 - [c19]Alexander Golovnev, Rahul Ilango, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova, Avishay Tal:
AC0[p] Lower Bounds Against MCSP via the Coin Problem. ICALP 2019: 66:1-66:15 - [c18]Alexander Golovnev, Dávid Pál, Balázs Szörényi:
The information-theoretic value of unlabeled data in semi-supervised learning. ICML 2019: 2328-2336 - [c17]Zeev Dvir, Alexander Golovnev, Omri Weinstein:
Static data structure lower bounds imply rigidity. STOC 2019: 967-978 - [i27]Alexander Golovnev, Dávid Pál, Balázs Szörényi:
The information-theoretic value of unlabeled data in semi-supervised learning. CoRR abs/1901.05515 (2019) - [i26]Róbert Busa-Fekete, Krzysztof Dembczynski, Alexander Golovnev, Kalina Jasinska, Mikhail Kuznetsov, Maxim Sviridenko, Chao Xu:
On the computational complexity of the probabilistic label tree algorithms. CoRR abs/1906.00294 (2019) - [i25]Alexander Golovnev, Siyao Guo, Thibaut Horel, Sunoo Park, Vinod Vaikuntanathan:
3SUM with Preprocessing: Algorithms, Lower Bounds and Cryptographic Applications. CoRR abs/1907.08355 (2019) - [i24]Divesh Aggarwal, Huck Bennett, Alexander Golovnev, Noah Stephens-Davidowitz:
Fine-grained hardness of CVP(P) - Everything that we can prove (and nothing else). CoRR abs/1911.02440 (2019) - [i23]Alexander Golovnev, Rahul Ilango, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova, Avishay Tal:
AC0[p] Lower Bounds against MCSP via the Coin Problem. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j8]Alexander Golovnev, Edward A. Hirsch, Alexander Knop, Alexander S. Kulikov:
On the limits of gate elimination. J. Comput. Syst. Sci. 96: 107-119 (2018) - [j7]Alexander Golovnev, Alexander S. Kulikov, Alexander V. Smal, Suguru Tamaki:
Gate elimination: Circuit size lower bounds and #SAT upper bounds. Theor. Comput. Sci. 719: 46-63 (2018) - [j6]Alexander Golovnev, Oded Regev, Omri Weinstein:
The Minrank of Random Graphs. IEEE Trans. Inf. Theory 64(11): 6990-6995 (2018) - [i22]Alexander Golovnev, Alexander S. Kulikov, Alexander Logunov, Ivan Mihajlin:
Collapsing Superstring Conjecture. CoRR abs/1809.08669 (2018) - [i21]Zeev Dvir, Alexander Golovnev, Omri Weinstein:
Static Data Structure Lower Bounds Imply Rigidity. CoRR abs/1811.02725 (2018) - [i20]Alexander Golovnev, Alexander S. Kulikov:
Circuit Depth Reductions. CoRR abs/1811.04828 (2018) - [i19]Zeev Dvir, Alexander Golovnev, Omri Weinstein:
Static Data Structure Lower Bounds Imply Rigidity. Electron. Colloquium Comput. Complex. TR18 (2018) - [i18]Alexander Golovnev, Alexander S. Kulikov:
Circuit Depth Reductions. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [b1]Alexander Golovnev:
Circuit Complexity: New Techniques and Their Limitations. New York University, USA, 2017 - [j5]Marek Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki, Arkadiusz Socala:
Tight Lower Bounds on Graph Embedding Problems. J. ACM 64(3): 18:1-18:22 (2017) - [c16]Alexander Golovnev, Oded Regev, Omri Weinstein:
The Minrank of Random Graphs. APPROX-RANDOM 2017: 46:1-46:13 - [c15]Huck Bennett, Alexander Golovnev, Noah Stephens-Davidowitz:
On the Quantitative Hardness of CVP. FOCS 2017: 13-24 - [i17]Huck Bennett, Alexander Golovnev, Noah Stephens-Davidowitz:
On the Quantitative Hardness of CVP. CoRR abs/1704.03928 (2017) - [i16]Alexander Golovnev, Daniel Reichman, Igor Shinkar:
Detecting Patterns Can Be Hard: Circuit Lower Bounds for the String Matching Problem. CoRR abs/1709.02034 (2017) - 2016
- [j4]Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin:
Families with Infants: Speeding Up Algorithms for NP-Hard Problems Using FFT. ACM Trans. Algorithms 12(3): 35:1-35:17 (2016) - [c14]Magnus Gausdal Find, Alexander Golovnev, Edward A. Hirsch, Alexander S. Kulikov:
A Better-Than-3n Lower Bound for the Circuit Complexity of an Explicit Function. FOCS 2016: 89-98 - [c13]Alexander Golovnev, Alexander S. Kulikov:
Weighted Gate Elimination: Boolean Dispersers for Quadratic Varieties Imply Improved Circuit Lower Bounds. ITCS 2016: 405-411 - [c12]Alexander Golovnev, Alexander S. Kulikov, Alexander V. Smal, Suguru Tamaki:
Circuit Size Lower Bounds and #SAT Upper Bounds Through a General Framework. MFCS 2016: 45:1-45:16 - [c11]Alexander Golovnev, Edward A. Hirsch, Alexander Knop, Alexander S. Kulikov:
On the Limits of Gate Elimination. MFCS 2016: 46:1-46:13 - [c10]Marek Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki, Arkadiusz Socala:
Tight Bounds for Graph Homomorphism and Subgraph Isomorphism. SODA 2016: 1643-1649 - [i15]Marek Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki, Arkadiusz Socala:
Tight Lower Bounds on Graph Embedding Problems. CoRR abs/1602.05016 (2016) - [i14]Alexander Golovnev, Oded Regev, Omri Weinstein:
The Minrank of Random Graphs. CoRR abs/1607.04842 (2016) - [i13]Alexander Golovnev, Edward A. Hirsch, Alexander Knop, Alexander S. Kulikov:
On the Limits of Gate Elimination. Electron. Colloquium Comput. Complex. TR16 (2016) - [i12]Alexander Golovnev, Alexander S. Kulikov, Alexander Smal, Suguru Tamaki:
Circuit size lower bounds and #SAT upper bounds through a general framework. Electron. Colloquium Comput. Complex. TR16 (2016) - [i11]Alexander Golovnev, Oded Regev, Omri Weinstein:
The Minrank of Random Graphs. Electron. Colloquium Comput. Complex. TR16 (2016) - [i10]Yevgeniy Dodis, Chaya Ganesh, Alexander Golovnev, Ari Juels, Thomas Ristenpart:
A Formal Treatment of Backdoored Pseudorandom Generators. IACR Cryptol. ePrint Arch. 2016: 306 (2016) - 2015
- [c9]Yevgeniy Dodis, Chaya Ganesh, Alexander Golovnev, Ari Juels, Thomas Ristenpart:
A Formal Treatment of Backdoored Pseudorandom Generators. EUROCRYPT (1) 2015: 101-126 - [c8]Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin:
Lower Bounds for the Graph Homomorphism Problem. ICALP (1) 2015: 481-493 - [c7]Maciej Skorski, Alexander Golovnev, Krzysztof Pietrzak:
Condensed Unpredictability. ICALP (1) 2015: 1046-1057 - [c6]Divesh Aggarwal, Alexander Golovnev:
A note on lower bounds for non-interactive message authentication using weak keys. ITW Fall 2015: 249-251 - [i9]Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin:
Lower Bounds for the Graph Homomorphism Problem. CoRR abs/1502.05447 (2015) - [i8]Maciej Skorski, Alexander Golovnev, Krzysztof Pietrzak:
Condensed Unpredictability. CoRR abs/1504.07621 (2015) - [i7]Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin:
Tight Bounds for Subgraph Isomorphism and Graph Homomorphism. CoRR abs/1507.03738 (2015) - [i6]Magnus Gausdal Find, Alexander Golovnev, Edward A. Hirsch, Alexander S. Kulikov:
A better-than-3n lower bound for the circuit complexity of an explicit function. Electron. Colloquium Comput. Complex. TR15 (2015) - [i5]Alexander Golovnev, Alexander S. Kulikov:
Weighted gate elimination: Boolean dispersers for quadratic varieties imply improved circuit lower bounds. Electron. Colloquium Comput. Complex. TR15 (2015) - [i4]Divesh Aggarwal, Alexander Golovnev:
A Note on Lower Bounds for Non-interactive Message Authentication Using Weak Keys. IACR Cryptol. ePrint Arch. 2015: 324 (2015) - [i3]Maciej Skorski, Alexander Golovnev, Krzysztof Pietrzak:
Condensed Unpredictability. IACR Cryptol. ePrint Arch. 2015: 384 (2015) - 2014
- [j3]Alexander Golovnev:
Approximating Asymmetric TSP in exponential Time. Int. J. Found. Comput. Sci. 25(1): 89-100 (2014) - [j2]Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin:
Solving SCS for bounded length strings in fewer than 2n steps. Inf. Process. Lett. 114(8): 421-425 (2014) - [j1]Alexander Golovnev, Konstantin Kutzkov:
New exact algorithms for the 2-constraint satisfaction problem. Theor. Comput. Sci. 526: 18-27 (2014) - [c5]Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin:
Families with Infants: A General Approach to Solve Hard Partition Problems. ICALP (1) 2014: 551-562 - [i2]Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin:
Families with infants: speeding up algorithms for NP-hard problems using FFT. CoRR abs/1410.2209 (2014) - 2013
- [c4]Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin:
Approximating Shortest Superstring Problem Using de Bruijn Graphs. CPM 2013: 120-129 - [c3]Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin:
Solving 3-Superstring in 3 n/3 Time. MFCS 2013: 480-491 - [i1]Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin:
Families with infants: a general approach to solve hard partition problems. CoRR abs/1311.2456 (2013) - 2012
- [c2]Ivan Bliznets, Alexander Golovnev:
A New Algorithm for Parameterized MAX-SAT. IPEC 2012: 37-48 - 2011
- [c1]Alexander Golovnev:
New Upper Bounds for MAX-2-SAT and MAX-2-CSP w.r.t. the Average Variable Degree. IPEC 2011: 106-117
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:20 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:
