default search action
Ronen Shaltiel
Person information
- affiliation: University of Haifa, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c49]Marshall Ball
, Ronen Shaltiel, Jad Silbak:
Non-malleable Codes with Optimal Rate for Poly-Size Circuits. EUROCRYPT (4) 2024: 33-54 - [c48]Ronen Shaltiel
Explicit Codes for Poly-Size Circuits and Functions That Are Hard to Sample on Low Entropy Distributions. STOC 2024: 2028-2038 - [i38]Noga Ron-Zewi, Ronen Shaltiel, Nithin Varma:
Query complexity lower bounds for local list-decoding and hard-core predicates (even for small rate and huge lists). CoRR abs/2409.01708 (2024) - [i37]Marshall Ball, Ronen Shaltiel, Jad Silbak:
Extractors for Samplable Distributions with Low Min-Entropy. Electron. Colloquium Comput. Complex. TR24 (2024) - [i36]Ronen Shaltiel:
Multiplicative Extractors for Samplable Distributions. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [j30]Ronen Shaltiel:
Is it possible to improve Yao's XOR lemma using reductions that exploit the efficiency of their oracle? Comput. Complex. 32(1): 5 (2023) - [i35]Ronen Shaltiel, Emanuele Viola:
On Hardness Assumptions Needed for "Extreme High-End" PRGs and Fast Derandomization. CoRR abs/2311.11663 (2023) - [i34]Marshall Ball
Non-malleable codes with optimal rate for poly-size circuits. Electron. Colloquium Comput. Complex. TR23 (2023) - [i33]Ronen Shaltiel, Jad Silbak:
Explicit Codes for Poly-Size Circuits and Functions that are Hard to Sample on Low Entropy Distributions. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [c47]Ronen Shaltiel, Jad Silbak:
Error Correcting Codes that Achieve BSC Capacity Against Channels that are Poly-Size Circuits. FOCS 2022: 13-23 - [c46]Ronen Shaltiel, Emanuele Viola:
On Hardness Assumptions Needed for "Extreme High-End" PRGs and Fast Derandomization. ITCS 2022: 116:1-116:17 - [i32]Markus Bläser, Valentine Kabanets, Ronen Shaltiel, Jacobo Torán:
Algebraic and Analytic Methods in Computational Complexity (Dagstuhl Seminar 22371). Dagstuhl Reports 12(9): 41-59 (2022) - [i31]Ronen Shaltiel, Jad Silbak:
Error Correcting Codes that Achieve BSC Capacity Against Channels that are Poly-Size Circuits. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j29]Ronen Shaltiel, Jad Silbak:
Explicit List-Decodable Codes with Optimal Rate for Computationally Bounded Channels. Comput. Complex. 30(1): 3 (2021) - [c45]Noga Ron-Zewi
Query Complexity Lower Bounds for Local List-Decoding and Hard-Core Predicates (Even for Small Rate and Huge Lists). ITCS 2021: 33:1-33:18 - [c44]Ronen Shaltiel, Jad Silbak:
Explicit uniquely decodable codes for space bounded channels that achieve list-decoding capacity. STOC 2021: 1516-1526 - [i30]Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak:
Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols. CoRR abs/2105.00765 (2021) - [i29]Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak:
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation. CoRR abs/2105.00770 (2021) - [i28]Ronen Shaltiel, Emanuele Viola:
On Hardness Assumptions Needed for "Extreme High-End" PRGs and Fast Derandomization. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j28]Iftach Haitner
Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols. SIAM J. Comput. 49(6): 1041-1082 (2020) - [c43]Ronen Shaltiel:
Is It Possible to Improve Yao's XOR Lemma Using Reductions That Exploit the Efficiency of Their Oracle? APPROX-RANDOM 2020: 10:1-10:20 - [i27]Noga Ron-Zewi, Ronen Shaltiel, Nithin Varma:
Query complexity lower bounds for local list-decoding and hard-core predicates (even for small rate and huge lists). Electron. Colloquium Comput. Complex. TR20 (2020) - [i26]Ronen Shaltiel:
Is it possible to improve Yao's XOR lemma using reductions that exploit the efficiency of their oracle? Electron. Colloquium Comput. Complex. TR20 (2020) - [i25]Ronen Shaltiel, Jad Silbak:
Explicit Uniquely Decodable Codes for Space Bounded Channels That Achieve List-Decoding Capacity. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j27]Shiri Chechik, Ronen Shaltiel:
Special Issue: APPROX-RANDOM 2016: Guest Editors' Foreword. Theory Comput. 15: 1-3 (2019) - [c42]Jad Silbak, Swastik Kopparty, Ronen Shaltiel:
Quasilinear Time List-Decodable Codes for Space Bounded Channels. FOCS 2019: 302-333 - [c41]Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak:
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation. TCC (1) 2019: 531-560 - [i24]Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak:
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation. Electron. Colloquium Comput. Complex. TR19 (2019) - [i23]Ronen Shaltiel, Swastik Kopparty, Jad Silbak:
Quasilinear time list-decodable codes for space bounded channels. Electron. Colloquium Comput. Complex. TR19 (2019) - [i22]Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak:
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation. IACR Cryptol. ePrint Arch. 2019: 616 (2019) - 2018
- [c40]Iftach Haitner, Kobbi Nissim, Eran Omri
Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols. FOCS 2018: 136-147 - [c39]Aryeh Grinberg, Ronen Shaltiel, Emanuele Viola:
Indistinguishability by Adaptive Procedures with Advice, and Lower Bounds on Hardness Amplification Proofs. FOCS 2018: 956-966 - [i21]Aryeh Grinberg, Ronen Shaltiel, Emanuele Viola:
Indistinguishability by adaptive procedures with advice, and lower bounds on hardness amplification proofs. Electron. Colloquium Comput. Complex. TR18 (2018) - [i20]Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak:
Computational Two-Party Correlation. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j26]Sergei Artemenko, Ronen Shaltiel:
Pseudorandom Generators with Optimal Seed Length for Non-Boolean Poly-Size Circuits. ACM Trans. Comput. Theory 9(2): 6:1-6:26 (2017) - 2016
- [j25]Benny Applebaum, Sergei Artemenko, Ronen Shaltiel, Guang Yang:
Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterministic Reductions. Comput. Complex. 25(2): 349-418 (2016) - [c38]Ronen Shaltiel, Jad Silbak:
Explicit List-Decodable Codes with Optimal Rate for Computationally Bounded Channels. APPROX-RANDOM 2016: 45:1-45:38 - [c37]Sergei Artemenko, Russell Impagliazzo
Pseudorandomness When the Odds are Against You. CCC 2016: 9:1-9:35 - [i19]Sergei Artemenko, Russell Impagliazzo, Valentine Kabanets, Ronen Shaltiel:
Pseudorandomness when the odds are against you. Electron. Colloquium Comput. Complex. TR16 (2016) - [i18]Ronen Shaltiel, Jad Silbak:
Explicit List-Decodable Codes with Optimal Rate for Computationally Bounded Channels. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j24]Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman:
Mining Circuit Lower Bound Proofs for Meta-Algorithms. Comput. Complex. 24(2): 333-392 (2015) - [c36]Benny Applebaum, Sergei Artemenko, Ronen Shaltiel, Guang Yang:
Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterministic Reductions (Extended Abstract). CCC 2015: 582-600 - [c35]Iftach Haitner, Yuval Ishai, Eran Omri
Parallel Hashing via List Recoverability. CRYPTO (2) 2015: 173-190 - [i17]Benny Applebaum, Sergei Artemenko, Ronen Shaltiel, Guang Yang:
Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterminsitic Reductions. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j23]Sergei Artemenko, Ronen Shaltiel:
Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification. Comput. Complex. 23(1): 43-83 (2014) - [c34]Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman:
Mining Circuit Lower Bound Proofs for Meta-algorithms. CCC 2014: 262-273 - [c33]Sergei Artemenko, Ronen Shaltiel:
Pseudorandom generators with optimal seed length for non-boolean poly-size circuits. STOC 2014: 99-108 - 2013
- [j22]Ronen Shaltiel:
Derandomized Parallel Repetition Theorems for Free Games. Comput. Complex. 22(3): 565-594 (2013) - [j21]Bill Fefferman, Ronen Shaltiel, Christopher Umans, Emanuele Viola:
On Beating the Hybrid Argument. Theory Comput. 9: 809-843 (2013) - [i16]Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman:
Mining Circuit Lower Bound Proofs for Meta-Algorithms. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j20]Jeff Kinne
Pseudorandom Generators, Typically-Correct Derandomization, and Circuit Lower Bounds. Comput. Complex. 21(1): 3-61 (2012) - [j19]Ariel Gabizon, Ronen Shaltiel:
Increasing the output length of zero-error dispersers. Random Struct. Algorithms 40(1): 74-104 (2012) - [c32]Ariel Gabizon, Ronen Shaltiel:
Invertible Zero-Error Dispersers and Defective Memory with Stuck-At Errors. APPROX-RANDOM 2012: 553-564 - [c31]Bill Fefferman, Ronen Shaltiel, Christopher Umans, Emanuele Viola:
On beating the hybrid argument. ITCS 2012: 468-483 - 2011
- [j18]Ronen Shaltiel:
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma. Comput. Complex. 20(1): 87-143 (2011) - [c30]Sergei Artemenko, Ronen Shaltiel:
Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification. APPROX-RANDOM 2011: 377-388 - [c29]Ronen Shaltiel:
Dispersers for Affine Sources with Sub-polynomial Entropy. FOCS 2011: 247-256 - [c28]Ronen Shaltiel:
An Introduction to Randomness Extractors. ICALP (2) 2011: 21-41 - [i15]Sergei Artemenko, Ronen Shaltiel:
Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification. Electron. Colloquium Comput. Complex. TR11 (2011) - [i14]Ronen Shaltiel:
Dispersers for affine sources with sub-polynomial entropy. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [j17]Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson:
Simulating independence: New constructions of condensers, ramsey graphs, dispersers, and extractors. J. ACM 57(4): 20:1-20:52 (2010) - [j16]Ronen Shaltiel, Emanuele Viola:
Hardness Amplification Proofs Require Majority. SIAM J. Comput. 39(7): 3122-3154 (2010) - [j15]Ronen Shaltiel:
Typically-correct derandomization. SIGACT News 41(2): 57-72 (2010) - [c27]Ronen Shaltiel:
Derandomized Parallel Repetition Theorems for Free Games. CCC 2010: 28-37 - [e1]Maria J. Serna
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 13th International Workshop, APPROX 2010, and 14th International Workshop, RANDOM 2010, Barcelona, Spain, September 1-3, 2010. Proceedings. Lecture Notes in Computer Science 6302, Springer 2010, ISBN 978-3-642-15368-6 [contents] - [i13]Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson:
Simulating Independence: New Constructions of Condensers, Ramsey Graphs, Dispersers, and Extractors. Electron. Colloquium Comput. Complex. TR10 (2010) - [i12]Bill Fefferman, Ronen Shaltiel, Christopher Umans, Emanuele Viola:
On beating the hybrid argument. Electron. Colloquium Comput. Complex. TR10 (2010) - [i11]Jeff Kinne, Dieter van Melkebeek, Ronen Shaltiel:
Pseudorandom Generators, Typically-Correct Derandomization, and Circuit Lower Bounds. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j14]Tal Moran, Ronen Shaltiel, Amnon Ta-Shma
Non-interactive Timestamping in the Bounded-Storage Model. J. Cryptol. 22(2): 189-226 (2009) - [j13]Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli, Ronen Shaltiel:
Reducing Complexity Assumptions for Statistically-Hiding Commitment. J. Cryptol. 22(3): 283-310 (2009) - [j12]Ronen Shaltiel, Christopher Umans:
Low-End Uniform Hardness versus Randomness Tradeoffs for AM. SIAM J. Comput. 39(3): 1006-1037 (2009) - [c26]Boaz Barak, Anup Rao, Ran Raz, Ricky Rosen, Ronen Shaltiel:
Strong Parallel Repetition Theorem for Free Projection Games. APPROX-RANDOM 2009: 352-365 - [c25]Jeff Kinne
Pseudorandom Generators and Typically-Correct Derandomization. APPROX-RANDOM 2009: 574-587 - [c24]Ronen Shaltiel:
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma. CCC 2009: 114-125 - [c23]Iftach Haitner, Alon Rosen, Ronen Shaltiel:
On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols. TCC 2009: 220-237 - 2008
- [j11]Ronen Shaltiel:
How to get more mileage from randomness extractors. Random Struct. Algorithms 33(2): 157-186 (2008) - [c22]Ariel Gabizon, Ronen Shaltiel:
Increasing the Output Length of Zero-Error Dispersers. APPROX-RANDOM 2008: 430-443 - [c21]Ronen Shaltiel, Emanuele Viola:
Hardness amplification proofs require majority. STOC 2008: 589-598 - 2007
- [j10]Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances. Comput. Complex. 16(4): 412-441 (2007) - [j9]Yan Zong Ding, Danny Harnik, Alon Rosen, Ronen Shaltiel:
Constant-Round Oblivious Transfer in the Bounded Storage Model. J. Cryptol. 20(2): 165-202 (2007) - [c20]Ronen Shaltiel, Christopher Umans:
Low-end uniform hardness vs. randomness tradeoffs for AM. STOC 2007: 430-439 - [i10]Ronen Shaltiel, Christopher Umans:
Low-end uniform hardness vs. randomness tradeoffs for AM. Electron. Colloquium Comput. Complex. TR07 (2007) - [i9]Ronen Shaltiel, Emanuele Viola:
Hardness amplification proofs require majority. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j8]Ronen Shaltiel, Christopher Umans:
Pseudorandomness for Approximate Counting and Sampling. Comput. Complex. 15(4): 298-341 (2006) - [j7]Russell Impagliazzo
Reducing The Seed Length In The Nisan-Wigderson Generator. Comb. 26(6): 647-681 (2006) - [j6]Omer Reingold, Ronen Shaltiel, Avi Wigderson:
Extracting Randomness via Repeated Condensing. SIAM J. Comput. 35(5): 1185-1209 (2006) - [j5]Ariel Gabizon, Ran Raz
Deterministic Extractors for Bit-Fixing Sources by Obtaining an Independent Seed. SIAM J. Comput. 36(4): 1072-1094 (2006) - [c19]Ronen Shaltiel:
How to Get More Mileage from Randomness Extractors. CCC 2006: 46-60 - [c18]Boaz Barak, Anup Rao, Ronen Shaltiel, Avi Wigderson:
2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction. STOC 2006: 671-680 - 2005
- [j4]Ronen Shaltiel, Christopher Umans:
Simple extractors for all min-entropies and a new pseudorandom generator. J. ACM 52(2): 172-216 (2005) - [c17]Ronen Shaltiel, Christopher Umans:
Pseudorandomness for Approximate Counting and Sampling. CCC 2005: 212-226 - [c16]Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances. CCC 2005: 243-257 - [c15]Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli, Ronen Shaltiel:
Reducing Complexity Assumptions for Statistically-Hiding Commitment. EUROCRYPT 2005: 58-77 - [c14]Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson:
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors. STOC 2005: 1-10 - [i8]Ariel Gabizon, Ran Raz, Ronen Shaltiel:
Deterministic Extractors for Bit-fixing Sources by Obtaining an Independent Seed. Electron. Colloquium Comput. Complex. TR05 (2005) - [i7]Ronen Shaltiel:
How to get more mileage from randomness extractors. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [c13]Tal Moran, Ronen Shaltiel, Amnon Ta-Shma
Non-interactive Timestamping in the Bounded Storage Model. CRYPTO 2004: 460-476 - [c12]Ariel Gabizon, Ran Raz
Deterministic Extractors for Bit-Fixing Sources by Obtaining an Independent Seed. FOCS 2004: 394-403 - [c11]Cynthia Dwork, Ronen Shaltiel, Adam D. Smith, Luca Trevisan:
List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge Argument. TCC 2004: 101-120 - [c10]Yan Zong Ding, Danny Harnik, Alon Rosen, Ronen Shaltiel:
Constant-Round Oblivious Transfer in the Bounded Storage Model. TCC 2004: 446-472 - [i6]Ronen Shaltiel, Christopher Umans:
Pseudorandomness for Approximate Counting and Sampling. Electron. Colloquium Comput. Complex. TR04 (2004) - [i5]Iftach Haitner, Ronen Shaltiel:
Statistical Zero-Knowledge Arguments for NP Using Approximable-Preimage-Size One-Way Functions. Electron. Colloquium Comput. Complex. TR04 (2004) - [i4]Iftach Haitner, Ronen Shaltiel:
Statistical Zero-Knowledge Arguments for NP Using Approximable-Preimage-Size One-Way Functions. IACR Cryptol. ePrint Arch. 2004: 335 (2004) - 2003
- [j3]Ronen Shaltiel:
Towards proving strong direct product theorems. Comput. Complex. 12(1-2): 1-22 (2003) - [j2]Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
Uniform hardness versus randomness tradeoffs for Arthur-Merlin games. Comput. Complex. 12(3-4): 85-130 (2003) - [c9]Boaz Barak, Ronen Shaltiel, Eran Tromer:
True Random Number Generators Secure in a Changing Environment. CHES 2003: 166-180 - [c8]Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
Uniform hardness vs. randomness tradeoffs for Arthur-Merlin games. CCC 2003: 33-47 - [c7]Boaz Barak, Ronen Shaltiel, Avi Wigderson:
Computational Analogues of Entropy. RANDOM-APPROX 2003: 200-215 - 2002
- [j1]Ronen Shaltiel:
Recent Developments in Explicit Constructions of Extractors. Bull. EATCS 77: 67-95 (2002) - [c6]Ziv Bar-Yossef, Luca Trevisan
Streaming Computation of Combinatorial Objects. CCC 2002: 165-174 - 2001
- [b1]Ronen Shaltiel:
Explicit constructions of pseudo-random generators and extractors (בניות מפורשות של יצרנים פסאודו-אקראיים ומזקקי אקראיות.). Hebrew University of Jerusalem, Israel, 2001 - [c5]Ronen Shaltiel:
Towards Proving Strong Direct Product Theorems. CCC 2001: 107-117 - [c4]Ronen Shaltiel, Christopher Umans:
Simple Extractors for All Min-Entropies and a New Pseudo-Random Generator. FOCS 2001: 648-657 - [i3]Ronen Shaltiel:
Towards proving strong direct product theorems. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [c3]Omer Reingold, Ronen Shaltiel, Avi Wigderson:
Extracting Randomness via Repeated Condensing. FOCS 2000: 22-31 - [c2]Russell Impagliazzo
Extractors and pseudo-random generators with optimal seed length. STOC 2000: 1-10 - [i2]Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson:
Extractors and pseudo-random generators with optimal seed length. Electron. Colloquium Comput. Complex. TR00 (2000) - [i1]Omer Reingold, Ronen Shaltiel, Avi Wigderson:
Extracting Randomness via Repeated Condensing. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [c1]Russell Impagliazzo
Near-Optimal Conversion of Hardness into Pseudo-Randomness. FOCS 1999: 181-190
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-12-18 18:27 CET 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: