default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIgor C. Oliveira
Igor Carboni Oliveira
2020 – today
- 2025
[c36]Marco Carmosino, Valentine Kabanets, Antonina Kolokolova, Igor C. Oliveira, Dimitrios Tsintsilidas:
Provability of the Circuit Size Hierarchy and Its Consequences. ITCS 2025: 30:1-30:22- 2024
- [c35]Shuichi Hirahara, Valentine Kabanets, Zhenjian Lu, Igor C. Oliveira:
Exact Search-To-Decision Reductions for Time-Bounded Kolmogorov Complexity. CCC 2024: 29:1-29:56 - [c34]Lijie Chen, Jiatu Li, Igor C. Oliveira:
Reverse Mathematics of Complexity Lower Bounds. FOCS 2024: 505-527 - [c33]Zhenjian Lu, Igor C. Oliveira, Hanlin Ren, Rahul Santhanam:
On the Complexity of Avoiding Heavy Elements. FOCS 2024: 2403-2412 - [c32]Igor C. Oliveira:
Polynomial-Time Pseudodeterministic Constructions (Invited Talk). STACS 2024: 1:1-1:1 - [c31]Shuichi Hirahara
, Zhenjian Lu, Igor C. Oliveira:
One-Way Functions and pKt Complexity. TCC (1) 2024: 253-286 - [i64]Lijie Chen, Jiatu Li, Igor C. Oliveira:
On the Unprovability of Circuit Size Bounds in Intuitionistic S12. CoRR abs/2404.11841 (2024) - [i63]Lijie Chen, Jiatu Li, Igor Carboni Oliveira:
Reverse Mathematics of Complexity Lower Bounds. Electron. Colloquium Comput. Complex. TR24 (2024) - [i62]Lijie Chen, Jiatu Li, Igor Carboni Oliveira:
On the Unprovability of Circuit Size Bounds in Intuitionistic S12. Electron. Colloquium Comput. Complex. TR24 (2024) - [i61]Marco Carmosino, Valentine Kabanets, Antonina Kolokolova, Igor Carboni Oliveira, Dimitrios Tsintsilidas:
Provability of the Circuit Size Hierarchy and Its Consequences. Electron. Colloquium Comput. Complex. TR24 (2024) - [i60]Shuichi Hirahara, Valentine Kabanets, Zhenjian Lu, Igor C. Oliveira:
Exact Search-to-Decision Reductions for Time-Bounded Kolmogorov Complexity. Electron. Colloquium Comput. Complex. TR24 (2024) - [i59]Shuichi Hirahara, Zhenjian Lu, Igor C. Oliveira:
One-Way Functions and pKt Complexity. Electron. Colloquium Comput. Complex. TR24 (2024) - [i58]Zhenjian Lu, Noam Mazor, Igor C. Oliveira, Rafael Pass:
Lower Bounds on the Overhead of Indistinguishability Obfuscation. Electron. Colloquium Comput. Complex. TR24 (2024) - [i57]Zhenjian Lu, Igor C. Oliveira, Hanlin Ren, Rahul Santhanam:
On the Complexity of Avoiding Heavy Elements. Electron. Colloquium Comput. Complex. TR24 (2024) - [i56]Shuichi Hirahara, Zhenjian Lu, Igor C. Oliveira:
One-Way Functions and pKt Complexity. IACR Cryptol. ePrint Arch. 2024: 1388 (2024) - [i55]Zhenjian Lu, Noam Mazor, Igor C. Oliveira, Rafael Pass:
Lower Bounds on the Overhead of Indistinguishability Obfuscation. IACR Cryptol. ePrint Arch. 2024: 1524 (2024) - 2023
- [c30]Bruno Pasqualotto Cavalar, Igor C. Oliveira:
Constant-Depth Circuits vs. Monotone Circuits. CCC 2023: 29:1-29:37 - [c29]Lijie Chen, Zhenjian Lu, Igor C. Oliveira, Hanlin Ren, Rahul Santhanam:
Polynomial-Time Pseudodeterministic Construction of Primes. FOCS 2023: 1261-1270 - [c28]Shuichi Hirahara, Rahul Ilango, Zhenjian Lu, Mikito Nanashima, Igor C. Oliveira:
A Duality between One-Way Functions and Average-Case Symmetry of Information. STOC 2023: 1039-1050 - [c27]Jiatu Li, Igor C. Oliveira:
Unprovability of Strong Complexity Lower Bounds in Bounded Arithmetic. STOC 2023: 1051-1057 - [i54]Bruno Pasqualotto Cavalar, Igor C. Oliveira:
Constant-depth circuits vs. monotone circuits. CoRR abs/2305.06821 (2023) - [i53]Lijie Chen, Zhenjian Lu, Igor C. Oliveira, Hanlin Ren, Rahul Santhanam:
Polynomial-Time Pseudodeterministic Construction of Primes. CoRR abs/2305.15140 (2023) - [i52]Jiatu Li, Igor Carboni Oliveira:
Unprovability of Strong Complexity Lower Bounds in Bounded Arithmetic. CoRR abs/2305.15235 (2023) - [i51]Lijie Chen, Zhenjian Lu, Igor Carboni Oliveira, Hanlin Ren, Rahul Santhanam:
Polynomial-Time Pseudodeterministic Construction of Primes. Electron. Colloquium Comput. Complex. TR23 (2023) - [i50]Bruno Pasqualotto Cavalar, Igor Carboni Oliveira:
Constant-depth circuits vs. monotone circuits. Electron. Colloquium Comput. Complex. TR23 (2023) - [i49]Shuichi Hirahara, Rahul Ilango, Zhenjian Lu, Mikito Nanashima, Igor Carboni Oliveira:
A Duality Between One-Way Functions and Average-Case Symmetry of Information. Electron. Colloquium Comput. Complex. TR23 (2023) - [i48]Jiatu Li, Igor Carboni Oliveira:
Unprovability of strong complexity lower bounds in bounded arithmetic. Electron. Colloquium Comput. Complex. TR23 (2023) - [i47]Shuichi Hirahara, Rahul Ilango, Zhenjian Lu, Mikito Nanashima, Igor C. Oliveira:
A Duality Between One-Way Functions and Average-Case Symmetry of Information. IACR Cryptol. ePrint Arch. 2023: 424 (2023) - 2022
- [j12]Igor C. Oliveira, Rahul Santhanam, Roei Tell:
Expander-Based Cryptography Meets Natural Proofs. Comput. Complex. 31(1): 4 (2022) - [j11]Zhenjian Lu, Igor C. Oliveira:
Theory and Applications of Probabilistic Kolmogorov Complexity. Bull. EATCS 137 (2022) - [j10]Lijie Chen, Shuichi Hirahara, Igor Carboni Oliveira, Ján Pich, Ninad Rajgopal, Rahul Santhanam:
Beyond Natural Proofs: Hardness Magnification and Locality. J. ACM 69(4): 25:1-25:49 (2022) - [c26]Halley Goldberg, Valentine Kabanets, Zhenjian Lu, Igor C. Oliveira:
Probabilistic Kolmogorov Complexity with Applications to Average-Case Complexity. CCC 2022: 16:1-16:60 - [c25]Zhenjian Lu, Igor C. Oliveira, Marius Zimand:
Optimal Coding Theorems in Time-Bounded Kolmogorov Complexity. ICALP 2022: 92:1-92:14 - [i46]Zhenjian Lu, Igor C. Oliveira, Marius Zimand:
Optimal Coding Theorems in Time-Bounded Kolmogorov Complexity. CoRR abs/2204.08312 (2022) - [i45]Zhenjian Lu, Igor C. Oliveira:
Theory and Applications of Probabilistic Kolmogorov Complexity. CoRR abs/2205.14718 (2022) - [i44]Halley Goldberg, Valentine Kabanets, Zhenjian Lu, Igor C. Oliveira:
Probabilistic Kolmogorov Complexity with Applications to Average-Case Complexity. Electron. Colloquium Comput. Complex. TR22 (2022) - [i43]Zhenjian Lu, Igor C. Oliveira:
Theory and Applications of Probabilistic Kolmogorov Complexity. Electron. Colloquium Comput. Complex. TR22 (2022) - [i42]Zhenjian Lu, Igor Carboni Oliveira, Marius Zimand:
Optimal Coding Theorems in Time-Bounded Kolmogorov Complexity. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j9]Igor C. Oliveira, Ján Pich, Rahul Santhanam:
Hardness Magnification Near State-of-the-Art Lower Bounds. Adv. Math. Commun. 17: 1-38 (2021) - [j8]Valentine Kabanets, Sajin Koroth, Zhenjian Lu, Dimitrios Myrisiotis, Igor C. Oliveira:
Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates. ACM Trans. Comput. Theory 13(4): 23:1-23:37 (2021) - [c24]Srinivasan Arunachalam, Alex B. Grilo, Tom Gur, Igor C. Oliveira, Aarthi Sundaram:
Quantum learning algorithms imply circuit lower bounds. FOCS 2021: 562-573 - [c23]Marco Carmosino, Valentine Kabanets, Antonina Kolokolova, Igor C. Oliveira:
LEARN-Uniform Circuit Lower Bounds and Provability in Bounded Arithmetic. FOCS 2021: 770-780 - [c22]Lijie Chen, Zhenjian Lu, Xin Lyu, Igor C. Oliveira:
Majority vs. Approximate Linear Sum and Average-Case Complexity Below NC¹. ICALP 2021: 51:1-51:20 - [c21]Zhenjian Lu, Igor C. Oliveira:
An Efficient Coding Theorem via Probabilistic Representations and Its Applications. ICALP 2021: 94:1-94:20 - [c20]Zhenjian Lu, Igor C. Oliveira, Rahul Santhanam:
Pseudodeterministic algorithms and the structure of probabilistic time. STOC 2021: 303-316 - [i41]Zhenjian Lu, Igor C. Oliveira, Rahul Santhanam:
Pseudodeterministic Algorithms and the Structure of Probabilistic Time. CoRR abs/2103.08539 (2021) - [i40]Marco Carmosino, Valentine Kabanets, Antonina Kolokolova, Igor C. Oliveira:
LEARN-Uniform Circuit Lower Bounds and Provability in Bounded Arithmetic. Electron. Colloquium Comput. Complex. TR21 (2021) - [i39]Lijie Chen, Zhenjian Lu, Xin Lyu, Igor Carboni Oliveira:
Majority vs. Approximate Linear Sum and Average-Case Complexity Below NC1. Electron. Colloquium Comput. Complex. TR21 (2021) - [i38]Zhenjian Lu, Igor Carboni Oliveira:
An Efficient Coding Theorem via Probabilistic Representations and its Applications. Electron. Colloquium Comput. Complex. TR21 (2021) - [i37]Zhenjian Lu, Igor Carboni Oliveira, Rahul Santhanam:
Pseudodeterministic Algorithms and the Structure of Probabilistic Time. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j7]Jan Bydzovsky, Jan Krajícek, Igor C. Oliveira:
Consistency of circuit lower bounds with bounded theories. Log. Methods Comput. Sci. 16(2) (2020) - [c19]Valentine Kabanets, Sajin Koroth, Zhenjian Lu, Dimitrios Myrisiotis, Igor C. Oliveira:
Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates. CCC 2020: 15:1-15:41 - [c18]Rahul Ilango, Bruno Loff, Igor C. Oliveira:
NP-Hardness of Circuit Minimization for Multi-Output Functions. CCC 2020: 22:1-22:36 - [c17]Lijie Chen, Shuichi Hirahara, Igor C. Oliveira, Ján Pich, Ninad Rajgopal, Rahul Santhanam:
Beyond Natural Proofs: Hardness Magnification and Locality. ITCS 2020: 70:1-70:48 - [i36]Valentine Kabanets, Sajin Koroth, Zhenjian Lu, Dimitrios Myrisiotis, Igor C. Oliveira:
Algorithms and Lower Bounds for de Morgan Formulas of Low-Communication Leaf Gates. CoRR abs/2002.08533 (2020) - [i35]Srinivasan Arunachalam, Alex B. Grilo, Tom Gur, Igor C. Oliveira, Aarthi Sundaram:
Quantum learning algorithms imply circuit lower bounds. CoRR abs/2012.01920 (2020) - [i34]Srinivasan Arunachalam, Alex Bredariol Grilo, Tom Gur, Igor C. Oliveira, Aarthi Sundaram:
Quantum learning algorithms imply circuit lower bounds. Electron. Colloquium Comput. Complex. TR20 (2020) - [i33]Rahul Ilango, Bruno Loff, Igor Carboni Oliveira:
NP-Hardness of Circuit Minimization for Multi-Output Functions. Electron. Colloquium Comput. Complex. TR20 (2020) - [i32]Valentine Kabanets, Sajin Koroth, Zhenjian Lu, Dimitrios Myrisiotis, Igor C. Oliveira:
Algorithms and Lower Bounds for de Morgan Formulas of Low-Communication Leaf Gates. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c16]Igor Carboni Oliveira, Rahul Santhanam, Srikanth Srinivasan:
Parity Helps to Compute Majority. CCC 2019: 23:1-23:17 - [c15]Igor Carboni Oliveira, Ján Pich, Rahul Santhanam:
Hardness Magnification near State-Of-The-Art Lower Bounds. CCC 2019: 27:1-27:29 - [c14]Igor Carboni Oliveira:
Randomness and Intractability in Kolmogorov Complexity. ICALP 2019: 32:1-32:14 - [c13]Igor Carboni Oliveira, Rahul Santhanam, Roei Tell:
Expander-Based Cryptography Meets Natural Proofs. ITCS 2019: 18:1-18:14 - [i31]Jan Bydzovsky, Jan Krajícek, Igor C. Oliveira:
Consistency of circuit lower bounds with bounded theories. CoRR abs/1905.12935 (2019) - [i30]Lijie Chen, Shuichi Hirahara, Igor C. Oliveira, Ján Pich, Ninad Rajgopal, Rahul Santhanam:
Beyond Natural Proofs: Hardness Magnification and Locality. CoRR abs/1911.08297 (2019) - [i29]Jan Bydzovsky, Igor Carboni Oliveira, Jan Krajícek:
Consistency of circuit lower bounds with bounded theories. Electron. Colloquium Comput. Complex. TR19 (2019) - [i28]Igor Carboni Oliveira:
Randomness and Intractability in Kolmogorov Complexity. Electron. Colloquium Comput. Complex. TR19 (2019) - [i27]Igor Carboni Oliveira, Lijie Chen, Shuichi Hirahara, Ján Pich, Ninad Rajgopal, Rahul Santhanam:
Beyond Natural Proofs: Hardness Magnification and Locality. Electron. Colloquium Comput. Complex. TR19 (2019) - [i26]Igor Carboni Oliveira, Rahul Santhanam, Srikanth Srinivasan:
Parity helps to compute Majority. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j6]Jan Krajícek, Igor C. Oliveira:
On monotone circuits with local oracles and clique lower bounds. Chic. J. Theor. Comput. Sci. 2018 (2018) - [c12]Igor Carboni Oliveira, Rahul Santhanam:
Pseudo-Derandomizing Learning and Approximation. APPROX-RANDOM 2018: 55:1-55:19 - [c11]Shuichi Hirahara, Igor C. Oliveira, Rahul Santhanam:
NP-hardness of Minimum Circuit Size Problem for OR-AND-MOD Circuits. CCC 2018: 5:1-5:31 - [c10]Igor Carboni Oliveira, Rahul Santhanam:
Hardness Magnification for Natural Problems. FOCS 2018: 65-76 - [c9]Ruiwen Chen, Igor C. Oliveira, Rahul Santhanam:
An Average-Case Lower Bound Against \mathsf ACC^0 ACC 0. LATIN 2018: 317-330 - [i25]Shuichi Hirahara, Igor Carboni Oliveira, Rahul Santhanam:
NP-hardness of Minimum Circuit Size Problem for OR-AND-MOD Circuits. Electron. Colloquium Comput. Complex. TR18 (2018) - [i24]Igor Carboni Oliveira, Ján Pich, Rahul Santhanam:
Hardness magnification near state-of-the-art lower bounds. Electron. Colloquium Comput. Complex. TR18 (2018) - [i23]Igor Carboni Oliveira, Rahul Santhanam:
Pseudo-derandomizing learning and approximation. Electron. Colloquium Comput. Complex. TR18 (2018) - [i22]Igor Carboni Oliveira, Rahul Santhanam:
Hardness Magnification for Natural Problems. Electron. Colloquium Comput. Complex. TR18 (2018) - [i21]Igor Carboni Oliveira, Rahul Santhanam, Roei Tell:
Expander-Based Cryptography Meets Natural Proofs. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j5]Jan Krajícek, Igor C. Oliveira:
Unprovability of circuit upper bounds in Cook's theory PV. Log. Methods Comput. Sci. 13(1) (2017) - [j4]Marcelo M. Gauy, Hiêp Hàn, Igor C. Oliveira:
Erdős-Ko-Rado for Random Hypergraphs: Asymptotics and Stability. Comb. Probab. Comput. 26(3): 406-422 (2017) - [c8]Igor C. Oliveira, Rahul Santhanam:
Conspiracies Between Learning Algorithms, Circuit Lower Bounds, and Pseudorandomness. CCC 2017: 18:1-18:49 - [c7]Igor C. Oliveira, Rahul Santhanam:
Pseudodeterministic constructions in subexponential time. STOC 2017: 665-677 - [c6]Xi Chen, Igor C. Oliveira, Rocco A. Servedio:
Addition is exponentially harder than counting for shallow monotone circuits. STOC 2017: 1232-1245 - [i20]Jan Krajícek, Igor C. Oliveira:
On monotone circuits with local oracles and clique lower bounds. CoRR abs/1704.06241 (2017) - [i19]Igor Carboni Oliveira, Ruiwen Chen, Rahul Santhanam:
An Average-Case Lower Bound against ACC^0. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j3]Igor C. Oliveira, Bhalchandra D. Thatte:
An Algebraic Formulation of the Graph Reconstruction Conjecture. J. Graph Theory 81(4): 351-363 (2016) - [c5]Xi Chen, Igor C. Oliveira, Rocco A. Servedio, Li-Yang Tan:
Near-optimal small-depth lower bounds for small distance connectivity. STOC 2016: 612-625 - [i18]Igor C. Oliveira, Rahul Santhanam:
Conspiracies between Learning Algorithms, Circuit Lower Bounds and Pseudorandomness. CoRR abs/1611.01190 (2016) - [i17]Igor C. Oliveira, Rahul Santhanam:
Pseudodeterministic Constructions in Subexponential Time. CoRR abs/1612.01817 (2016) - [i16]Jan Krajícek, Igor Carboni Oliveira:
Unprovability of circuit upper bounds in Cook's theory PV. Electron. Colloquium Comput. Complex. TR16 (2016) - [i15]Igor Carboni Oliveira, Rahul Santhanam:
Pseudodeterministic Constructions in Subexponential Time. Electron. Colloquium Comput. Complex. TR16 (2016) - [i14]Igor Carboni Oliveira, Rahul Santhanam:
Conspiracies between Learning Algorithms, Circuit Lower Bounds and Pseudorandomness. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [b1]Igor Carboni Oliveira:
Unconditional Lower Bounds in Complexity Theory. Columbia University, USA, 2015 - [c4]Eric Blais, Clément L. Canonne, Igor C. Oliveira, Rocco A. Servedio, Li-Yang Tan:
Learning Circuits with few Negations. APPROX-RANDOM 2015: 512-527 - [c3]Igor Carboni Oliveira, Rahul Santhanam:
Majority is Incompressible by AC^0[p] Circuits. CCC 2015: 124-157 - [c2]Siyao Guo, Tal Malkin, Igor C. Oliveira, Alon Rosen:
The Power of Negations in Cryptography. TCC (1) 2015: 36-65 - [i13]Xi Chen, Igor C. Oliveira, Rocco A. Servedio:
Addition is exponentially harder than counting for shallow monotone circuits. CoRR abs/1508.03061 (2015) - [i12]Xi Chen, Igor C. Oliveira, Rocco A. Servedio, Li-Yang Tan:
Near-optimal small-depth lower bounds for small distance connectivity. CoRR abs/1509.07476 (2015) - [i11]Xi Chen, Igor Carboni Oliveira, Rocco A. Servedio:
Addition is exponentially harder than counting for shallow monotone circuits. Electron. Colloquium Comput. Complex. TR15 (2015) - [i10]Igor Carboni Oliveira, Siyao Guo, Tal Malkin, Alon Rosen:
The Power of Negations in Cryptography. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [i9]Eric Blais, Clément L. Canonne, Igor C. Oliveira, Rocco A. Servedio, Li-Yang Tan:
Learning circuits with few negations. CoRR abs/1410.8420 (2014) - [i8]Eric Blais, Clément L. Canonne, Igor Carboni Oliveira, Rocco A. Servedio, Li-Yang Tan:
Learning circuits with few negations. Electron. Colloquium Comput. Complex. TR14 (2014) - [i7]Igor Carboni Oliveira, Rahul Santhanam:
Majority is incompressible by AC0[p] circuits. Electron. Colloquium Comput. Complex. TR14 (2014) - [i6]Siyao Guo, Tal Malkin, Igor C. Oliveira, Alon Rosen:
The Power of Negations in Cryptography. IACR Cryptol. ePrint Arch. 2014: 902 (2014) - 2013
- [c1]Adam R. Klivans, Pravesh Kothari, Igor C. Oliveira:
Constructing Hard Functions Using Learning Algorithms. CCC 2013: 86-97 - [i5]Igor C. Oliveira, Bhalchandra D. Thatte:
An algebraic formulation of the graph reconstruction conjecture. CoRR abs/1301.4121 (2013) - [i4]Igor C. Oliveira:
Algorithms versus Circuit Lower Bounds. CoRR abs/1309.0249 (2013) - [i3]Adam R. Klivans, Pravesh Kothari, Igor C. Oliveira:
Constructing Hard Functions from Learning Algorithms. Electron. Colloquium Comput. Complex. TR13 (2013) - [i2]Igor C. Oliveira:
Algorithms versus Circuit Lower Bounds. Electron. Colloquium Comput. Complex. TR13 (2013)
2000 – 2009
- 2009
- [j2]Igor Carboni Oliveira, Walter Alexandre Carnielli:
Erratum to "The Ricean Objection: An Analogue of Rice's Theorem for First-Order Theories" . Logic Journal of the IGPL, 16(6): 585-590(2008). Log. J. IGPL 17(6): 803-804 (2009) - [i1]Arnaldo Moura, Igor Carboni Oliveira:
A New Look at Some Classical Results in Computational Complexity. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j1]Igor Carboni Oliveira, Walter Alexandre Carnielli:
The Ricean Objection: An Analogue of Rice's Theorem for First-order Theories. Log. J. IGPL 16(6): 585-590 (2008)
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.
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.
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.
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 2025-02-13 00:49 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:
