default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTali Kaufman
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
[c56]Louis Golowich, Tali Kaufman:
NLTS Hamiltonians and Strongly-Explicit SoS Lower Bounds from Low-Rate Quantum LDPC Codes. ITCS 2024: 54:1-54:23- [c55]Uriya A. First
, Tali Kaufman:
Cosystolic Expansion of Sheaves on Posets with Applications to Good 2-Query Locally Testable Codes and Lifted Codes. STOC 2024: 1446-1457 - [i53]Uriya A. First, Tali Kaufman:
Cosystolic Expansion of Sheaves on Posets with Applications to Good 2-Query Locally Testable Codes and Lifted Codes. CoRR abs/2403.19388 (2024) - 2023
- [j19]Tali Kaufman, Izhar Oppenheim:
High dimensional expanders and coset geometries. Eur. J. Comb. 111: 103696 (2023) - [c54]Roy Gotlib, Tali Kaufman:
Fine Grained Analysis of High Dimensional Random Walks. APPROX/RANDOM 2023: 49:1-49:22 - [c53]Roy Gotlib, Tali Kaufman:
List Agreement Expansion from Coboundary Expansion. ITCS 2023: 61:1-61:23 - [c52]Tali Kaufman, Ran J. Tessler:
Garland's Technique for Posets and High Dimensional Grassmannian Expanders. ITCS 2023: 78:1-78:22 - [i52]Roy Gotlib, Tali Kaufman:
No Where to Go But High: A Perspective on High Dimensional Expanders. CoRR abs/2304.10106 (2023) - [i51]Louis Golowich, Tali Kaufman:
NLTS Hamiltonians and Strongly-Explicit SoS Lower Bounds from Low-Rate Quantum LDPC Codes. CoRR abs/2311.09503 (2023) - [i50]Louis Golowich, Tali Kaufman:
NLTS Hamiltonians and Strongly-Explicit SoS Lower Bounds from Low-Rate Quantum LDPC Codes. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j18]Irit Dinur, Prahladh Harsha, Tali Kaufman, Noga Ron-Zewi:
From Local to Robust Testing via Agreement Testing. Theory Comput. 18: 1-25 (2022) - [c51]Tali Kaufman, David Mass:
Double Balanced Sets in High Dimensional Expanders. APPROX/RANDOM 2022: 3:1-3:17 - [c50]Tali Kaufman, Izhar Oppenheim:
High Dimensional Expansion Implies Amplified Local Testability. APPROX/RANDOM 2022: 5:1-5:10 - [c49]Jason Gaitonde, Max Hopkins, Tali Kaufman, Shachar Lovett, Ruizhe Zhang:
Eigenstripping, Spectral Decay, and Edge-Expansion on Posets. APPROX/RANDOM 2022: 16:1-16:24 - [c48]Tali Kaufman, Dor Minzer:
Improved Optimal Testing Results from Global Hypercontractivity. FOCS 2022: 98-109 - [c47]Mitali Bafna, Max Hopkins, Tali Kaufman, Shachar Lovett:
High Dimensional Expanders: Eigenstripping, Pseudorandomness, and Unique Games. SODA 2022: 1069-1128 - [c46]Tali Kaufman, Rasmus Kyng, Federico Soldà:
Scalar and Matrix Chernoff Bounds from ℓ∞-Independence. SODA 2022: 3732-3753 - [c45]Mitali Bafna, Max Hopkins, Tali Kaufman, Shachar Lovett:
Hypercontractivity on high dimensional expanders. STOC 2022: 185-194 - [c44]Amitay Kamber, Tali Kaufman:
Combinatorics via closed orbits: number theoretic Ramanujan graphs are not unique neighbor expanders. STOC 2022: 426-435 - [i49]Tali Kaufman, Dor Minzer:
Improved Optimal Testing Results from Global Hypercontractivity. CoRR abs/2202.08688 (2022) - [i48]Jason Gaitonde, Max Hopkins, Tali Kaufman, Shachar Lovett, Ruizhe Zhang:
Eigenstripping, Spectral Decay, and Edge-Expansion on Posets. CoRR abs/2205.00644 (2022) - [i47]Uriya A. First, Tali Kaufman:
Couboundary Expansion of Sheaves on Graphs and Weighted Mixing Lemmas. CoRR abs/2208.01776 (2022) - [i46]Uriya A. First, Tali Kaufman:
On Good 2-Query Locally Testable Codes from Sheaves on High Dimensional Expanders. CoRR abs/2208.01778 (2022) - [i45]Roy Gotlib, Tali Kaufman:
Beyond the Worst Case: Structured Convergence of High Dimensional Random Walks. CoRR abs/2208.03241 (2022) - [i44]Roy Gotlib, Tali Kaufman:
List Agreement Expansion from Coboundary Expansion. CoRR abs/2210.15714 (2022) - [i43]Tali Kaufman, David Mass:
Unique-Neighbor-Like Expansion and Group-Independent Cosystolic Expansion. CoRR abs/2211.09482 (2022) - [i42]Tali Kaufman, David Mass:
Double Balanced Sets in High Dimensional Expanders. CoRR abs/2211.09485 (2022) - 2021
- [j17]Tali Kaufman, Izhar Oppenheim:
Erratum to: High Order Random Walks: Beyond Spectral Gap. Comb. 41(5): 749-753 (2021) - [j16]Irit Dinur, Prahladh Harsha, Tali Kaufman, Inbal Livni Navon, Amnon Ta-Shma:
List-Decoding with Double Samplers. SIAM J. Comput. 50(2): 301-349 (2021) - [c43]Tali Kaufman, Izhar Oppenheim:
Coboundary and Cosystolic Expansion from Strong Symmetry. ICALP 2021: 84:1-84:16 - [c42]Tali Kaufman, David Mass:
Unique-Neighbor-Like Expansion and Group-Independent Cosystolic Expansion. ISAAC 2021: 56:1-56:17 - [c41]Tali Kaufman, Ran J. Tessler:
New cosystolic expanders from tensors imply explicit Quantum LDPC codes with Ω(√n logk n) distance. STOC 2021: 1317-1329 - [i41]Tali Kaufman, Ran J. Tessler:
Local to global high dimensional expansion and Garland's method for general posets. CoRR abs/2101.12621 (2021) - [i40]Tali Kaufman, Izhar Oppenheim:
High dimensional expansion implies amplified local testability. CoRR abs/2107.10488 (2021) - [i39]Tali Kaufman, Rasmus Kyng, Federico Soldà:
Scalar and Matrix Chernoff Bounds from 𝓁∞-Independence. CoRR abs/2111.02177 (2021) - [i38]Mitali Bafna, Max Hopkins, Tali Kaufman, Shachar Lovett:
Hypercontractivity on High Dimensional Expanders: a Local-to-Global Approach for Higher Moments. CoRR abs/2111.09444 (2021) - [i37]Mitali Bafna, Max Hopkins, Tali Kaufman, Shachar Lovett:
Hypercontractivity on High Dimensional Expanders: a Local-to-Global Approach for Higher Moments. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j15]Tali Kaufman, Izhar Oppenheim:
High Order Random Walks: Beyond Spectral Gap. Comb. 40(2): 245-281 (2020) - [c40]Tali Kaufman, Ella Sharakanski:
Chernoff Bound for High-Dimensional Expanders. APPROX-RANDOM 2020: 25:1-25:22 - [c39]Shai Evra, Tali Kaufman, Gilles Zémor:
Decodable quantum LDPC codes beyond the square root distance barrier using high dimensional expanders. FOCS 2020: 218-227 - [c38]Tali Kaufman, David Mass:
Local-To-Global Agreement Expansion via the Variance Method. ITCS 2020: 74:1-74:14 - [i36]Shai Evra, Tali Kaufman, Gilles Zémor:
Decodable quantum LDPC codes beyond the √n distance barrier using high dimensional expanders. CoRR abs/2004.07935 (2020) - [i35]Tali Kaufman, Ran J. Tessler:
Quantum LDPC codes with Ω(√n logkn) distance, for any k. CoRR abs/2008.09495 (2020) - [i34]Max Hopkins, Tali Kaufman, Shachar Lovett:
High Dimensional Expanders: Random Walks, Pseudorandomness, and Unique Games. CoRR abs/2011.04658 (2020) - [i33]Max Hopkins, Tali Kaufman, Shachar Lovett:
High Dimensional Expanders: Random Walks, Pseudorandomness, and Unique Games. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c37]Roy Gotlib, Tali Kaufman:
Testing Odd Direct Sums Using High Dimensional Expanders. APPROX-RANDOM 2019: 50:1-50:20 - [c36]Irit Dinur, Prahladh Harsha, Tali Kaufman, Noga Ron-Zewi:
From Local to Robust Testing via Agreement Testing. ITCS 2019: 29:1-29:18 - [c35]Irit Dinur, Prahladh Harsha, Tali Kaufman, Inbal Livni Navon, Amnon Ta-Shma:
List Decoding with Double Samplers. SODA 2019: 2134-2153 - [i32]Roy Gotlib, Tali Kaufman:
Testing Odd Direct Sums Using High Dimensional Expanders. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c34]Tali Kaufman, Izhar Oppenheim:
High Order Random Walks: Beyond Spectral Gap. APPROX-RANDOM 2018: 47:1-47:17 - [c33]Tali Kaufman, Izhar Oppenheim:
Construction of new local spectral high dimensional expanders. STOC 2018: 773-786 - [i31]Tali Kaufman, David Mass:
Good Distance Lattices from High Dimensional Expanders. CoRR abs/1803.02849 (2018) - [i30]Irit Dinur, Prahladh Harsha, Tali Kaufman, Inbal Livni Navon, Amnon Ta-Shma:
List Decoding with Double Samplers. CoRR abs/1808.00425 (2018) - [i29]Irit Dinur, Prahladh Harsha, Tali Kaufman, Inbal Livni Navon, Amnon Ta-Shma:
List Decoding with Double Samplers. Electron. Colloquium Comput. Complex. TR18 (2018) - [i28]Irit Dinur, Tali Kaufman, Noga Ron-Zewi:
From Local to Robust Testing via Agreement Testing. Electron. Colloquium Comput. Complex. TR18 (2018) - [i27]Tali Kaufman, David Mass:
Cosystolic Expanders over any Abelian Group. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c32]Irit Dinur, Tali Kaufman:
High Dimensional Expanders Imply Agreement Expanders. FOCS 2017: 974-985 - [c31]Tali Kaufman, David Mass:
High Dimensional Random Walks and Colorful Expansion. ITCS 2017: 4:1-4:27 - [i26]Irit Dinur, Tali Kaufman:
High dimensional expanders imply agreement expanders. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j14]Tali Kaufman, Avi Wigderson:
Symmetric LDPC codes and local testing. Comb. 36(1): 91-120 (2016) - [c30]Dominic Dotterrer, Tali Kaufman, Uli Wagner:
On Expansion and Topological Overlap. SoCG 2016: 35:1-35:10 - [c29]Shai Evra, Tali Kaufman:
Bounded degree cosystolic expanders of every dimension. STOC 2016: 36-48 - [i25]Tali Kaufman, David Mass:
High Dimensional Combinatorial Random Walks and Colorful Expansion. CoRR abs/1604.02947 (2016) - [i24]Tali Kaufman, David Mass:
Walking on the Edge and Cosystolic Expansion. CoRR abs/1606.01844 (2016) - 2015
- [i23]Dominic Dotterrer, Tali Kaufman, Uli Wagner:
On Expansion and Topological Overlap. CoRR abs/1506.04558 (2015) - [i22]Shai Evra, Tali Kaufman:
Systolic Expanders of Every Dimension. CoRR abs/1510.00839 (2015) - 2014
- [c28]Tali Kaufman, David Kazhdan, Alexander Lubotzky:
Ramanujan Complexes and Bounded Degree Topological Expanders. FOCS 2014: 484-493 - [c27]Tali Kaufman, Alexander Lubotzky:
High dimensional expanders and property testing. ITCS 2014: 501-506 - [i21]Tali Kaufman, David Kazhdan, Alexander Lubotzky:
Ramanujan Complexes and bounded degree topological expanders. CoRR abs/1408.6351 (2014) - [i20]Tali Kaufman, David Kazhdan, Alexander Lubotzky:
Isoperimetric Inequalities for Ramanujan Complexes and Topological Expanders. CoRR abs/1409.1397 (2014) - 2013
- [j13]Ido Ben-Eliezer, Tali Kaufman, Michael Krivelevich, Dana Ron:
Comparing the strength of query types in property testing: The case of k-colorability. Comput. Complex. 22(1): 89-135 (2013) - [j12]Elena Grigorescu, Tali Kaufman, Madhu Sudan:
2-Transitivity is Insufficient for Local Testability. Comput. Complex. 22(1): 137-158 (2013) - [i19]Tali Kaufman, Alexander Lubotzky:
High Dimensional Expanders and Property Testing. CoRR abs/1312.2367 (2013) - 2012
- [j11]Elena Grigorescu, Tali Kaufman, Madhu Sudan:
Succinct Representation of Codes with Applications to Testing. SIAM J. Discret. Math. 26(4): 1618-1634 (2012) - [j10]Elena Grigorescu, Tali Kaufman:
Explicit Low-Weight Bases for BCH Codes. IEEE Trans. Inf. Theory 58(1): 78-81 (2012) - [j9]Tali Kaufman, Shachar Lovett, Ely Porat:
Weight Distribution and List-Decoding Size of Reed-Muller Codes. IEEE Trans. Inf. Theory 58(5): 2689-2696 (2012) - [c26]Tali Kaufman, Alexander Lubotzky:
Edge transitive ramanujan graphs and symmetric LDPC good codes. STOC 2012: 359-366 - 2011
- [c25]Irit Dinur, Tali Kaufman:
Dense Locally Testable Codes Cannot Have Constant Rate and Distance. APPROX-RANDOM 2011: 507-518 - [c24]Oded Goldreich, Tali Kaufman:
Proximity Oblivious Testing and the Role of Invariances. APPROX-RANDOM 2011: 579-592 - [c23]Tali Kaufman, Shachar Lovett:
New Extension of the Weil Bound for Character Sums with Applications to Coding. FOCS 2011: 788-796 - [p3]Oded Goldreich, Tali Kaufman:
Proximity Oblivious Testing and the Role of Invariances. Studies in Complexity and Cryptography 2011: 173-190 - [i18]Tali Kaufman, Alexander Lubotzky:
Edge Transitive Ramanujan Graphs and Highly Symmetric LDPC Good Codes. CoRR abs/1108.2960 (2011) - [i17]Irit Dinur, Tali Kaufman:
Dense locally testable codes cannot have constant rate and distance. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [j8]Tali Kaufman, Simon Litsyn, Ning Xie:
Breaking the Epsilon-Soundness Bound of the Linearity Test over GF(2). SIAM J. Comput. 39(5): 1988-2003 (2010) - [j7]Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan, Michael Viderman:
Locally Testable Codes Require Redundant Testers. SIAM J. Comput. 39(7): 3230-3247 (2010) - [c22]Tali Kaufman, Michael Viderman:
Locally Testable vs. Locally Decodable Codes. APPROX-RANDOM 2010: 670-682 - [c21]Tali Kaufman, Avi Wigderson:
Symmetric LDPC Codes and Local Testing. ICS 2010: 406-421 - [c20]Tali Kaufman, Shachar Lovett, Ely Porat:
Weight Distribution and List-Decoding Size of Reed-Muller Codes. ICS 2010: 422-433 - [c19]Tali Kaufman:
Local computation in codes. ITW 2010: 1-5 - [p2]Ido Ben-Eliezer, Tali Kaufman, Michael Krivelevich, Dana Ron:
Comparing the Strength of Query Types in Property Testing: The Case of Testing k-Colorability. Property Testing 2010: 253-259 - [p1]Tali Kaufman, Avi Wigderson:
Symmetric LDPC Codes and Local Testing. Property Testing 2010: 312-319 - [i16]Irit Dinur, Tali Kaufman:
Dense locally testable codes cannot have constant rate and distance. CoRR abs/1012.2738 (2010) - [i15]Oded Goldreich, Tali Kaufman:
Proximity Oblivious Testing and the Role of Invariances. Electron. Colloquium Comput. Complex. TR10 (2010) - [i14]Tali Kaufman, Shachar Lovett:
Testing of exponentially large codes, by a new extension to Weil bound for character sums. Electron. Colloquium Comput. Complex. TR10 (2010) - [i13]Tali Kaufman, Michael Viderman:
Locally Testable vs. Locally Decodable Codes. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [c18]Elena Grigorescu, Tali Kaufman, Madhu Sudan:
Succinct Representation of Codes with Applications to Testing. APPROX-RANDOM 2009: 534-547 - [c17]Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan, Michael Viderman:
Locally Testable Codes Require Redundant Testers. CCC 2009: 52-61 - [i12]Elena Grigorescu, Tali Kaufman, Madhu Sudan:
Succinct Representation of Codes with Applications to Testing. CoRR abs/0905.2919 (2009) - [i11]Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan, Michael Viderman:
Locally Testable Codes Require Redundant Testers. Electron. Colloquium Comput. Complex. TR09 (2009) - [i10]Elena Grigorescu, Tali Kaufman, Madhu Sudan:
Succinct Representation of Codes with Applications to Testing. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j6]Noga Alon, Tali Kaufman, Michael Krivelevich, Dana Ron:
Testing Triangle-Freeness in General Graphs. SIAM J. Discret. Math. 22(2): 786-819 (2008) - [c16]Tali Kaufman, Simon Litsyn, Ning Xie:
Breaking the epsilon-Soundness Bound of the Linearity Test over GF(2). APPROX-RANDOM 2008: 498-511 - [c15]Elena Grigorescu, Tali Kaufman, Madhu Sudan:
2-Transitivity Is Insufficient for Local Testability. CCC 2008: 259-267 - [c14]Tali Kaufman, Shachar Lovett:
Worst Case to Average Case Reductions for Polynomials. FOCS 2008: 166-175 - [c13]Ido Ben-Eliezer, Tali Kaufman, Michael Krivelevich, Dana Ron:
Comparing the strength of query types in property testing: the case of testing k-colorability. SODA 2008: 1213-1222 - [c12]Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum:
A (de)constructive approach to program checking. STOC 2008: 143-152 - [c11]Tali Kaufman, Madhu Sudan:
Algebraic property testing: the role of invariance. STOC 2008: 403-412 - [i9]Tali Kaufman, Simon Litsyn, Ning Xie:
Breaking the ε-Soundness Bound of the Linearity Test over GF(2). Sublinear Algorithms 2008 - [i8]Tali Kaufman, Shachar Lovett:
The List-Decoding Size of Reed-Muller Codes. CoRR abs/0811.2356 (2008) - [i7]Elena Grigorescu, Tali Kaufman, Madhu Sudan:
2-Transitivity is Insufficient for Local Testability. Electron. Colloquium Comput. Complex. TR08 (2008) - [i6]Shachar Lovett, Tali Kaufman:
Worst case to Average case reductions for polynomials. Electron. Colloquium Comput. Complex. TR08 (2008) - [i5]Shachar Lovett, Tali Kaufman:
The List-Decoding Size of Reed-Muller Codes. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [j5]Noga Alon, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan:
Guessing secrets efficiently via list decoding. ACM Trans. Algorithms 3(4): 42 (2007) - [c10]Tali Kaufman, Madhu Sudan:
Sparse Random Linear Codes are Locally Decodable and Testable. FOCS 2007: 590-600 - [c9]Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum:
Verifying and decoding in constant depth. STOC 2007: 440-449 - [c8]Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Matulef, Ronitt Rubinfeld, Ning Xie:
Testing k-wise and almost k-wise independence. STOC 2007: 496-505 - [i4]Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum:
A (De)constructive Approach to Program Checking. Electron. Colloquium Comput. Complex. TR07 (2007) - [i3]Tali Kaufman, Simon Litsyn, Ning Xie:
Breaking the ε-Soundness Bound of the Linearity Test over GF(2). Electron. Colloquium Comput. Complex. TR07 (2007) - [i2]Tali Kaufman, Madhu Sudan:
Sparse Random Linear Codes are Locally Decodable and Testable. Electron. Colloquium Comput. Complex. TR07 (2007) - [i1]Tali Kaufman, Madhu Sudan:
Algebraic Property Testing: The Role of Invariance. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j4]Tali Kaufman, Dana Ron:
Testing Polynomials over General Fields. SIAM J. Comput. 36(3): 779-802 (2006) - [c7]Tali Kaufman, Simon Litsyn:
Long Extended BCH Codes Are Spanned by Minimum Weight Words. AAECC 2006: 285-294 - [c6]Noga Alon, Tali Kaufman, Michael Krivelevich, Dana Ron:
Testing triangle-freeness in general graphs. SODA 2006: 279-288 - 2005
- [b1]Tali Kaufman:
Property testing of graphs and codes. Tel Aviv University, Israel, 2005 - [j3]Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron:
Testing Reed-Muller codes. IEEE Trans. Inf. Theory 51(11): 4032-4039 (2005) - [j2]Tali Kaufman, Dana Ron:
A characterization of low-weight words that span generalized reed-muller codes. IEEE Trans. Inf. Theory 51(11): 4039-4043 (2005) - [c5]Tali Kaufman, Simon Litsyn:
Almost Orthogonal Linear Codes are Locally Testable. FOCS 2005: 317-326 - 2004
- [j1]Tali Kaufman, Michael Krivelevich, Dana Ron:
Tight Bounds for Testing Bipartiteness in General Graphs. SIAM J. Comput. 33(6): 1441-1483 (2004) - [c4]Tali Kaufman, Dana Ron:
Testing Polynomials over General Fields. FOCS 2004: 413-422 - 2003
- [c3]Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron:
Testing Low-Degree Polynomials over GF(2(. RANDOM-APPROX 2003: 188-199 - [c2]Tali Kaufman, Michael Krivelevich, Dana Ron:
Tight Bounds for Testing Bipartiteness in General Graphs. RANDOM-APPROX 2003: 341-353 - 2002
- [c1]Noga Alon, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan:
Guessing secrets efficiently via list decoding. SODA 2002: 254-262
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-06-21 21:41 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:
