default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGyörgy Turán
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[i17]Karine Chubarian, Johnny Joyce, György Turán:
Polynomial Threshold Functions of Bounded Tree-Width: Some Explainability and Complexity Aspects. CoRR abs/2501.08297 (2025)- 2024
- [c57]Yingyao Zhou, Natasha Devroye, György Turán, Milos Zefran:
Higher-order Interpretations of Deepcode, a Learned Feedback Code. Allerton 2024: 1-8 - [c56]Yingyao Zhou, Natasha Devroye, György Turán, Milos Zefran
:
Interpreting Deepcode, a Learned Feedback Code. ISIT 2024: 1403-1408 - [i16]Harish Naik, Jan Polster, Raj Shekhar, Tamás Horváth, György Turán:
Iterative Graph Neural Network Enhancement via Frequent Subgraph Mining of Explanations. CoRR abs/2403.07849 (2024) - [i15]Yingyao Zhou, Natasha Devroye, György Turán, Milos Zefran:
Interpreting Deepcode, a learned feedback code. CoRR abs/2404.17519 (2024) - [i14]Yingyao Zhou, Natasha Devroye, György Turán, Milos Zefran:
Higher-order Interpretations of Deepcode, a Learned Feedback Code. CoRR abs/2408.11907 (2024) - 2023
- [c55]Natasha Devroye, Abhijeet Mulgund, Raj Shekhar, György Turán, Milos Zefran, Yingyao Zhou:
Interpreting Training Aspects of Deep-Learned Error-Correcting Codes. ISIT 2023: 2374-2379 - [c54]Abhijeet Mulgund, Natasha Devroye, György Turán, Milos Zefran:
Decomposing the Training of Deep Learned Turbo codes via a Feasible MAP Decoder. ISTC 2023: 1-5 - [i13]Natasha Devroye, Abhijeet Mulgund, Raj Shekhar, György Turán, Milos Zefran, Yingyao Zhou:
Interpreting Training Aspects of Deep-Learned Error-Correcting Codes. CoRR abs/2305.04347 (2023) - 2022
- [j48]Péter Hajnal, Zhihao Liu, György Turán:
Nearest neighbor representations of Boolean functions. Inf. Comput. 285(Part): 104879 (2022) - [c53]Abhijeet Mulgund, Raj Shekhar, Natasha Devroye, György Turán, Milos Zefran:
Evaluating interpretations of deep-learned error-correcting codes. Allerton 2022: 1-8 - [c52]Natasha Devroye, Neshat Mohammadi, Abhijeet Mulgund, Harish Naik, Raj Shekhar, György Turán, Yeqi Wei, Milos Zefran:
Interpreting Deep-Learned Error-Correcting Codes. ISIT 2022: 2457-2462 - 2021
- [j47]Andrew S. Gordon, Rob Miller, Leora Morgenstern, György Turán:
Preface. Ann. Math. Artif. Intell. 89(1-2): 1-5 (2021) - 2020
- [c51]Vanda Balogh, Gábor Berend, Dimitrios I. Diochnos, György Turán:
Understanding the Semantic Content of Sparse Word Embeddings Using a Commonsense Knowledge Base. AAAI 2020: 7399-7406 - [c50]Karine Chubarian, György Turán:
Interpretability of Bayesian Network Classifiers: OBDD Approximation and Polynomial Threshold Functions. ISAIM 2020 - [c49]Karine Chubarian, György Turán:
Approximating bounded tree-width Bayesian network classifiers with OBDD. PGM 2020: 113-124 - [i12]Péter Hajnal, Zhihao Liu, György Turán:
Nearest neighbor representations of Boolean functions. CoRR abs/2004.01741 (2020) - [i11]Harish Naik, György Turán:
Explanation from Specification. CoRR abs/2012.07179 (2020)
2010 – 2019
- 2018
- [e3]Andrew S. Gordon, Rob Miller, György Turán:
Proceedings of the Thirteenth International Symposium on Commonsense Reasoning, COMMONSENSE 2017, London, UK, November 6-8, 2017. CEUR Workshop Proceedings 2052, CEUR-WS.org 2018 [contents] - 2017
- [j46]Lisa Hellerstein, Lev Reyzin, György Turán:
Foreword. Ann. Math. Artif. Intell. 79(1-3): 1-3 (2017) - [j45]Benjamin Fish, Rahul Kushwaha, György Turán:
Betweenness centrality profiles in trees. J. Complex Networks 5(5): 776-794 (2017) - [j44]Stellan Ohlsson, Robert H. Sloan, György Turán, Aaron Urasky:
Measuring an artificial intelligence system's performance on a Verbal IQ test for young children. J. Exp. Theor. Artif. Intell. 29(4): 679-693 (2017) - [j43]Kira V. Adaricheva, Giuseppe F. Italiano, Hans Kleine Büning, György Turán:
Foreword. Theor. Comput. Sci. 658: 263 (2017) - [j42]Robert H. Sloan, Despina Stasi, György Turán:
Hydras: Directed hypergraphs and Horn formulas. Theor. Comput. Sci. 658: 417-428 (2017) - 2016
- [c48]Jon Yaggie, György Turán:
Characterizability in Horn Belief Revision. JELIA 2016: 497-511 - [i10]Benjamin Fish, Rahul Kushwaha, György Turán:
Betweenness centrality profiles in trees. CoRR abs/1607.02334 (2016) - 2015
- [c47]György Turán, Jon Yaggie:
Characterizability in Belief Revision. AAAI Spring Symposia 2015 - [c46]Loizos Michael, Antonis C. Kakas, Rob Miller, György Turán:
Cognitive Programming. AIC 2015: 3-18 - [c45]György Turán, Jon Yaggie:
Characterizability in Belief Revision. IJCAI 2015: 3236-3242 - [c44]Benjamin Fish, Jeremy Kun, Ádám Dániel Lelkes, Lev Reyzin, György Turán:
On the Computational Complexity of MapReduce. DISC 2015: 1-15 - [i9]Robert H. Sloan, Despina Stasi, György Turán:
Hydras: Directed Hypergraphs and Horn Formulas. CoRR abs/1504.07753 (2015) - [i8]Stellan Ohlsson, Robert H. Sloan, György Turán, Aaron Urasky:
Measuring an Artificial Intelligence System's Performance on a Verbal IQ Test For Young Children. CoRR abs/1509.03390 (2015) - 2014
- [c43]Fatemeh Vafaee, György Turán, Peter C. Nelson, Tanya Y. Berger-Wolf:
Balancing the exploration and exploitation in an adaptive diversity guided genetic algorithm. IEEE Congress on Evolutionary Computation 2014: 2570-2577 - [c42]Szabolcs Iván, Ádám Dániel Lelkes, Judit Nagy-György, Balázs Szörényi, György Turán:
Biclique Coverings, Rectifier Networks and the Cost of ε-Removal. DCFS 2014: 174-185 - [c41]Fatemeh Vafaee, György Turán, Peter C. Nelson, Tanya Y. Berger-Wolf:
Among-site rate variation: adaptation of genetic algorithm mutation rates at each single site. GECCO 2014: 863-870 - [i7]György Turán, Jon Yaggie:
Non-characterizability of belief revision: an application of finite model theory. CoRR abs/1403.6512 (2014) - [i6]Szabolcs Iván, Ádám Dániel Lelkes, Judit Nagy-György, Balázs Szörényi, György Turán:
Biclique coverings, rectifier networks and the cost of $\varepsilon$-removal. CoRR abs/1406.0017 (2014) - [i5]Benjamin Fish, Jeremy Kun, Ádám Dániel Lelkes, Lev Reyzin, György Turán:
On the Computational Complexity of MapReduce. CoRR abs/1410.0245 (2014) - [i4]Kira V. Adaricheva, Giuseppe F. Italiano, Hans Kleine Büning, György Turán:
Horn formulas, directed hypergraphs, lattices and closure systems: related formalisms and applications (Dagstuhl Seminar 14201). Dagstuhl Reports 4(5): 1-26 (2014) - 2013
- [c40]Stellan Ohlsson, Robert H. Sloan, György Turán, Aaron Urasky:
Verbal IQ of a Four-Year Old Achieved by an AI System. AAAI (Late-Breaking Developments) 2013 - 2012
- [j41]Robert H. Sloan, Despina Stasi, György Turán:
Random Horn Formulas and Propagation Connectivity for Directed Hypergraphs. Discret. Math. Theor. Comput. Sci. 14(2): 29-36 (2012) - [j40]Dimitrios I. Diochnos, Robert H. Sloan, György Turán:
On multiple-instance learning of halfspaces. Inf. Process. Lett. 112(23): 933-936 (2012) - [c39]Stellan Ohlsson, Robert H. Sloan, György Turán, Daniel Uber, Aaron Urasky:
An Approach to Evaluate AI Commonsense Reasoning Systems. FLAIRS 2012 - [c38]Despina Stasi, Robert H. Sloan, György Turán:
Hydra formulas and directed hypergraphs: A preliminary report. ISAIM 2012 - [c37]Kira V. Adaricheva, Robert H. Sloan, Balázs Szörényi, György Turán:
Horn Belief Contraction: Remainders, Envelopes and Complexity. KR 2012 - [c36]Robert H. Sloan, Despina Stasi, György Turán:
Hydras: Directed Hypergraphs and Horn Formulas. WG 2012: 237-248 - [e2]Mária Bieliková, Gerhard Friedrich, Georg Gottlob, Stefan Katzenbeisser, György Turán:
SOFSEM 2012: Theory and Practice of Computer Science - 38th Conference on Current Trends in Theory and Practice of Computer Science, Špindlerův Mlýn, Czech Republic, January 21-27, 2012. Proceedings. Lecture Notes in Computer Science 7147, Springer 2012, ISBN 978-3-642-27659-0 [contents] - 2011
- [c35]Kira V. Adaricheva, Robert H. Sloan, Balázs Szörényi, György Turán:
Horn Belief Contraction: Remainders, Envelopes and Complexity. AAAI Spring Symposium: Logical Formalizations of Commonsense Reasoning 2011 - 2010
- [j39]Dhruv Mubayi, György Turán:
Finding bipartite subgraphs efficiently. Inf. Process. Lett. 110(5): 174-177 (2010) - [j38]Marina Langlois, Robert H. Sloan, György Turán:
Horn Upper Bounds and Renaming. J. Satisf. Boolean Model. Comput. 7(1): 1-15 (2010) - [j37]László Györfi, György Turán, Thomas Zeugmann:
Guest editors' foreword. Theor. Comput. Sci. 411(29-30): 2629-2631 (2010) - [c34]Fatemeh Vafaee, György Turán, Peter C. Nelson:
Optimizing genetic operator rates using a markov chain model of genetic algorithms. GECCO 2010: 721-728 - [c33]Amitava Bhattacharya, Bhaskar DasGupta, Dhruv Mubayi, György Turán:
On Approximate Horn Formula Minimization. ICALP (1) 2010: 438-450 - [p1]Robert H. Sloan, Balázs Szörényi, György Turán, Yves Crama, Peter L. Hammer:
Learning Boolean Functions with Queries. Boolean Models and Methods 2010: 221-256
2000 – 2009
- 2009
- [c32]Marina Langlois, Dhruv Mubayi, Robert H. Sloan, György Turán:
Combinatorial Problems for Horn Clauses. Graph Theory, Computational Intelligence and Thought 2009: 54-65 - [c31]Dimitrios I. Diochnos, György Turán:
On Evolvability: The Swapping Algorithm, Product Distributions, and Covariance. SAGA 2009: 74-88 - 2008
- [j36]Robert H. Sloan, Balázs Szörényi, György Turán:
Projective DNF formulae and their revision. Discret. Appl. Math. 156(4): 530-544 (2008) - [j35]Robert H. Sloan, Balázs Szörényi, György Turán:
On k-Term DNF with the Largest Number of Prime Implicants. SIAM J. Discret. Math. 21(4): 987-998 (2008) - [c30]Marina Langlois, Robert H. Sloan, Balázs Szörényi, György Turán:
Horn Complements: Towards Horn-to-Horn Belief Revision. AAAI 2008: 466-471 - [c29]Marina Langlois, Dhruv Mubayi, Robert H. Sloan, György Turán:
Combinatorial problems for Horn clauses. ISAIM 2008 - [e1]Yoav Freund, László Györfi, György Turán, Thomas Zeugmann:
Algorithmic Learning Theory, 19th International Conference, ALT 2008, Budapest, Hungary, October 13-16, 2008. Proceedings. Lecture Notes in Computer Science 5254, Springer 2008, ISBN 978-3-540-87986-2 [contents] - 2007
- [j34]Ferenc Gécseg, György Turán:
Kalmár Workshop on Logic and Computer Science - Preface. Acta Cybern. 18(1): 3-5 (2007) - [j33]Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robert H. Sloan, György Turán, Yi Zhang:
The inverse protein folding problem on 2D and 3D lattices. Discret. Appl. Math. 155(6-7): 719-732 (2007) - [j32]Robert H. Sloan, Balázs Szörényi, György Turán:
Revising threshold functions. Theor. Comput. Sci. 382(3): 198-208 (2007) - [c28]Marina Langlois, Robert H. Sloan, György Turán:
Horn Upper Bounds and Renaming. SAT 2007: 80-93 - 2006
- [j31]Zoltán Füredi, Robert H. Sloan, Ken Takata, György Turán:
On set systems with a threshold property. Discret. Math. 306(23): 3097-3111 (2006) - [j30]Dhruv Mubayi, György Turán, Yi Zhao:
The DNF exception problem. Theor. Comput. Sci. 352(1-3): 85-96 (2006) - [c27]György Turán:
On Learning and Logic. COLT 2006: 2-3 - [c26]Péter Hajnal, Zhihao Liu, György Turán:
Nearest Neighbor Representations of Boolean Functions. AI&M 2006 - [c25]Marina Langlois, Robert H. Sloan, György Turán:
Horn Upper Bounds of Random 3-CNF: A Computational Study. AI&M 2006 - 2005
- [i3]Robert H. Sloan, Balázs Szörényi, György Turán:
On k-term DNF with largest number of prime implicants. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j29]Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán:
Theory revision with queries: Horn, read-once, and parity formulas. Artif. Intell. 156(2): 139-176 (2004) - [j28]Martin Grohe, György Turán:
Learnability and Definability in Trees and Similar Structures. Theory Comput. Syst. 37(1): 193-220 (2004) - [c24]Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán:
New Revision Algorithms. ALT 2004: 395-409 - [c23]Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robert H. Sloan, György Turán, Yi Zhang:
The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices. CPM 2004: 244-253 - 2003
- [c22]Robert H. Sloan, Balázs Szörényi, György Turán:
Projective DNF Formulae and Their Revision. COLT 2003: 625-639 - [i2]Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán:
Theory Revision with Queries: Horn, Read-once, and Parity Formulas. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [j27]Judy Goldsmith, Robert H. Sloan, György Turán:
Theory Revision with Queries: DNF Formulas. Mach. Learn. 47(2-3): 257-295 (2002) - [c21]Martin Grohe, György Turán:
Learnability and Definability in Trees and Similar Structures. STACS 2002: 645-658 - 2001
- [j26]Tamás Horváth, György Turán:
Learning logic programs with structured background knowledge. Artif. Intell. 128(1-2): 31-97 (2001) - 2000
- [j25]György Turán:
Remarks on computational learning theory. Ann. Math. Artif. Intell. 28(1-4): 43-45 (2000) - [c20]Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán:
Improved Algorithms for Theory Revision with Queries. COLT 2000: 236-247
1990 – 1999
- 1999
- [c19]Robert H. Sloan, György Turán:
On Theory Revision with Queries. COLT 1999: 41-52 - 1998
- [j24]Robert H. Sloan, Ken Takata, György Turán:
On Frequent Sets of Boolean Matrices. Ann. Math. Artif. Intell. 24(1-4): 193-209 (1998) - [c18]Irene Tsapara, György Turán:
Learning Atomic Formulas with Prescribed Properties. COLT 1998: 166-174 - [i1]Robert H. Sloan, Ken Takata, György Turán:
On frequent sets of Boolean matrices. Electron. Colloquium Comput. Complex. TR98 (1998) - 1997
- [j23]György Turán, Farrokh Vatan:
On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-In. J. Comput. Syst. Sci. 54(1): 199-212 (1997) - [j22]Dana Angluin, Martins Krikis, Robert H. Sloan, György Turán:
Malicious Omissions and Errors in Answers to Membership Queries. Mach. Learn. 28(2-3): 211-255 (1997) - [c17]Tamás Horváth, Robert H. Sloan, György Turán:
Learning Logic Programs by Using the Product Homomorphism Method. COLT 1997: 10-20 - [c16]Robert H. Sloan, György Turán:
Learning from Incomplete Boundary Queries Using Split Graphs and Hypergraphs. EuroCOLT 1997: 38-50 - 1996
- [j21]György Turán, Farrokh Vatan:
A Size-Depth Trade-Off for the Analog Computation of Boolean Functions. Inf. Process. Lett. 59(5): 251-254 (1996) - [c15]Tamás Horváth, Robert H. Sloan, György Turán:
Learning Logic Programs with Random Classification Noise. Inductive Logic Programming Workshop 1996: 315-336 - 1995
- [j20]György Turán:
On the Complexity of Planar Boolean Circuits. Comput. Complex. 5(1): 24-42 (1995) - 1994
- [j19]Wolfgang Maass, György Turán:
Algorithms and Lower Bounds for On-Line Learning of Geometrical Concepts. Mach. Learn. 14(1): 251-269 (1994) - [c14]Robert H. Sloan, György Turán:
Learning with Queries but Incomplete Information (Extended Abstract). COLT 1994: 237-245 - [c13]György Turán, Farrokh Vatan:
On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-in (Extended Abstract). FOCS 1994: 553-564 - 1993
- [j18]Wolfgang Maass, Georg Schnitger, Endre Szemerédi, György Turán:
Two Tapes Versus One for Off-Line Turing Machines. Comput. Complex. 3: 392-401 (1993) - [j17]Hans Dietmar Gröger, György Turán:
A Liniear lower bound for the size of threshold circuits. Bull. EATCS 50: 220-221 (1993) - [j16]András Hajnal, Wolfgang Maass, Pavel Pudlák, Mario Szegedy, György Turán:
Threshold Circuits of Bounded Depth. J. Comput. Syst. Sci. 46(2): 129-154 (1993) - [c12]György Turán:
Lower Bounds for PAC Learning with Queries. COLT 1993: 384-391 - 1992
- [j15]Ulrich Faigle, Rainer Schrader, György Turán:
The Communication Complexity of Interval Orders. Discret. Appl. Math. 40(1): 19-28 (1992) - [j14]Wolfgang Maass, György Turán:
Lower Bound Methods and Separation Results for On-Line Learning Models. Mach. Learn. 9: 107-145 (1992) - 1991
- [c11]György Turán:
A Survey of Some Aspects of Computational Learning Theory (Extended Abstract). FCT 1991: 89-103 - [c10]Hans Dietmar Gröger, György Turán:
On Linear Decision Trees Computing Boolean Functions. ICALP 1991: 707-718 - 1990
- [c9]Wolfgang Maass, György Turán:
On the Complexity of Learning from Counterexamples and Membership Queries (abstract). COLT 1990: 391 - [c8]Wolfgang Maass, György Turán:
On the Complexity of Learning from Counterexamples and Membership Queries. FOCS 1990: 203-210
1980 – 1989
- 1989
- [j13]Ulrich Faigle, Walter Kern, György Turán:
On the performance of on-line algorithms for partition problems. Acta Cybern. 9(2): 107-119 (1989) - [j12]György Turán:
Lower Bounds for Synchronous Circuits and Planar Circuits. Inf. Process. Lett. 30(1): 37-40 (1989) - [c7]György Turán:
On Restricted Boolean Circuits. FCT 1989: 460-469 - [c6]Wolfgang Maass, György Turán:
On the Complexity of Learning From Counterexamples (Extended Abstract). FOCS 1989: 262-267 - 1988
- [j11]Ulrich Faigle, György Turán:
Sorting and Recognition Problems for Ordered Sets. SIAM J. Comput. 17(1): 100-113 (1988) - [j10]Samuel R. Buss, György Turán:
Resolution Proofs of Generalized Pigeonhole Principles. Theor. Comput. Sci. 62(3): 311-317 (1988) - [c5]András Hajnal, Wolfgang Maass, György Turán:
On the Communication Complexity of Graph Properties. STOC 1988: 186-191 - 1987
- [j9]William J. Cook, Collette R. Coullard, György Turán:
On the complexity of cutting-plane proofs. Discret. Appl. Math. 18(1): 25-38 (1987) - [j8]Ulrich Faigle, György Turán:
On the complexity of interval orders and semiorders. Discret. Math. 63(2-3): 131-141 (1987) - [j7]László Babai, Péter Hajnal, Endre Szemerédi, György Turán:
A Lower Bound for Read-Once-Only Branching Programs. J. Comput. Syst. Sci. 35(2): 153-162 (1987) - [j6]László Babai, György Turán:
The Complexity of Defining a Relation on a Finite Graph. Math. Log. Q. 33(3): 277-288 (1987) - [c4]András Hajnal, Wolfgang Maass, Pavel Pudlák, Mario Szegedy, György Turán:
Threshold circuits of bounded depth. FOCS 1987: 99-110 - 1986
- [j5]Ulrich Faigle, László Lovász, Rainer Schrader, György Turán:
Searching in Trees, Series-Parallel and Interval Orders. SIAM J. Comput. 15(4): 1075-1084 (1986) - [c3]Miklós Ajtai, László Babai, Péter Hajnal, János Komlós, Pavel Pudlák, Vojtech Rödl, Endre Szemerédi, György Turán:
Two lower bounds for branching programs. STOC 1986: 30-38 - 1985
- [c2]Ulrich Faigle, György Turán:
Sorting and Recognition Problems for Ordered Sets. STACS 1985: 109-118 - 1984
- [j4]György Turán:
On the succinct representation of graphs. Discret. Appl. Math. 8(3): 289-294 (1984) - [j3]György Turán:
On the definability of properties of finite graphs. Discret. Math. 49(3): 291-302 (1984) - [j2]György Turán:
The Critical Complexity of Graph Properties. Inf. Process. Lett. 18(3): 151-153 (1984) - 1983
- [j1]György Turán:
On the complexity of graph grammars. Acta Cybern. 6(3): 271-280 (1983) - 1981
- [c1]György Turán:
On Cellular Graph-Automata and Second-Order Definable Graph-Properties. FCT 1981: 384-393
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 2025-05-03 01:14 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:
