default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJosé L. Balcázar
José Luis Balcázar
Person information
- affiliation: Polytechnic University of Catalonia, Barcelona, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[j46]Marie Ely Piceno
, Laura Rodríguez-Navas, José Luis Balcázar:
Co-occurrence patterns in diagnostic data. Comput. Intell. 37(4): 1499-1514 (2021)- 2020
- [j45]Cristina Tîrnauca, José L. Balcázar, Domingo Gómez-Pérez:
Closed-Set-Based Discovery of Representative Association Rules. Int. J. Found. Comput. Sci. 31(1): 143-156 (2020)
2010 – 2019
- 2019
- [j44]Albert Atserias, José L. Balcázar, Marie Ely Piceno:
Relative Entailment Among Probabilistic Implications. Log. Methods Comput. Sci. 15(1) (2019) - [c63]José Luis Balcázar, Marie Ely Piceno, Laura Rodríguez-Navas:
Hierarchical Visualization of Co-Occurrence Patterns on Diagnostic Data. CBMS 2019: 168-173 - [i8]Marie Ely Piceno, José Luis Balcázar:
Analysis of Co-Occurrence Patterns in Data through Modular and Clan Decompositions of Gaifman Graphs. CoRR abs/1910.05146 (2019) - 2018
- [j43]Cristina Tîrnauca, Domingo Gómez-Pérez, José L. Balcázar, José L. Montaña:
Global optimality in k-means clustering. Inf. Sci. 439-440: 79-94 (2018) - [c62]José Luis Balcázar, Marie Ely Piceno, Laura Rodríguez-Navas:
Decomposition of Quantitative Gaifman Graphs as a Data Analysis Tool. IDA 2018: 238-250 - [i7]José Luis Balcázar, Marie Ely Piceno, Laura Rodríguez-Navas:
Decomposition of quantitative Gaifman graphs as a data analysis tool. CoRR abs/1805.05235 (2018) - 2017
- [j42]Marta Arias, José L. Balcázar, Cristina Tîrnauca:
Learning definite Horn formulas from closure queries. Theor. Comput. Sci. 658: 346-356 (2017) - 2015
- [c61]José L. Balcázar:
Quantitative Redundancy in Partial Implications. ICFCA 2015: 3-20 - [c60]Albert Atserias, José L. Balcázar:
Entailment among Probabilistic Implications. LICS 2015: 621-632 - [i6]Albert Atserias, José L. Balcázar:
Entailment among probabilistic implications. CoRR abs/1501.04826 (2015) - [i5]Marta Arias, José L. Balcázar, Cristina Tîrnauca:
Learning Propositional Horn Formulas from Closure Queries. CoRR abs/1503.09025 (2015) - [i4]José L. Balcázar:
Quantitative Redundancy in Partial Implications. CoRR abs/1504.03620 (2015) - 2013
- [j41]José L. Balcázar:
Formal and computational properties of the confidence boost of association rules. ACM Trans. Knowl. Discov. Data 7(4): 19:1-19:41 (2013) - [c59]José L. Balcázar, Francis Dogbey:
Evaluation of Association Rule Quality Measures through Feature Extraction. IDA 2013: 68-79 - 2011
- [j40]Marta Arias, José L. Balcázar:
Construction and learnability of canonical Horn formulas. Mach. Learn. 85(3): 273-297 (2011) - [c58]Marta E. Zorrilla, Diego García-Saiz, José L. Balcázar:
Towards Parameter-free Data Mining: Mining Educational Data with Yacaree. EDM 2011: 363-364 - [c57]José L. Balcázar:
Parameter-free Association Rule Mining with Yacaree. EGC 2011: 251-254 - [c56]José L. Balcázar, Cristina Tîrnauca:
Closed-set-based Discovery of Representative Association Rules Revisited. EGC 2011: 635-646 - [c55]José L. Balcázar, Cristina Tîrnauca:
Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices. ICFCA 2011: 49-64 - [c54]Tom Diethe, José L. Balcázar, John Shawe-Taylor, Cristina Tîrnauca:
Preface. WAPA 2011: 1-4 - [e5]Tom Diethe, José L. Balcázar, John Shawe-Taylor, Cristina Tîrnauca:
Proceedings of the Second Workshop on Applications of Pattern Analysis, WAPA 2011, Castro Urdiales, Spain, October 19-21, 2011. JMLR Proceedings 17, JMLR.org 2011 [contents] - [i3]José L. Balcázar:
Formal and Computational Properties of the Confidence Boost of Association Rules. CoRR abs/1103.4778 (2011) - 2010
- [j39]José L. Balcázar:
Redundancy, Deduction Schemes, and Minimum-Size Bases for Association Rules. Log. Methods Comput. Sci. 6(2) (2010) - [j38]José L. Balcázar, Francesco Bonchi, Aristides Gionis, Michèle Sebag:
Guest editors' introduction: special issue of selected papers from ECML PKDD 2010. Data Min. Knowl. Discov. 21(2): 221-223 (2010) - [j37]José L. Balcázar, Albert Bifet, Antoni Lozano:
Mining frequent closed rooted trees. Mach. Learn. 78(1-2): 1-33 (2010) - [j36]José L. Balcázar, Francesco Bonchi, Aristides Gionis, Michèle Sebag:
Special issue for ECML PKDD 2010: Guest editors' introduction. Mach. Learn. 81(1): 1-4 (2010) - [c53]José L. Balcázar:
Objective Novelty of Association Rules : Measuring the Confidence Boost. EGC 2010: 297-302 - [c52]José L. Balcázar, Cristina Tîrnauca, Marta E. Zorrilla:
Filtering Association Rules with Negations on the Basis of Their Confidence Boost. KDIR 2010: 263-268 - [c51]José L. Balcázar:
Closure-Based Confidence Boost in Association Rules. WAPA 2010: 74-80 - [e4]José L. Balcázar, Francesco Bonchi, Aristides Gionis, Michèle Sebag:
Machine Learning and Knowledge Discovery in Databases, European Conference, ECML PKDD 2010, Barcelona, Spain, September 20-24, 2010, Proceedings, Part I. Lecture Notes in Computer Science 6321, Springer 2010, ISBN 978-3-642-15879-7 [contents] - [e3]José L. Balcázar, Francesco Bonchi, Aristides Gionis, Michèle Sebag:
Machine Learning and Knowledge Discovery in Databases, European Conference, ECML PKDD 2010, Barcelona, Spain, September 20-24, 2010, Proceedings, Part II. Lecture Notes in Computer Science 6322, Springer 2010, ISBN 978-3-642-15882-7 [contents] - [e2]José L. Balcázar, Francesco Bonchi, Aristides Gionis, Michèle Sebag:
Machine Learning and Knowledge Discovery in Databases, European Conference, ECML PKDD 2010, Barcelona, Spain, September 20-24, 2010, Proceedings, Part III. Lecture Notes in Computer Science 6323, Springer 2010, ISBN 978-3-642-15938-1 [contents] - [i2]José L. Balcázar, Cristina Tîrnauca:
Closed-set-based Discovery of Representative Association Rules Revisited. CoRR abs/1012.0735 (2010) - [i1]José L. Balcázar, Cristina Tîrnauca:
Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices. CoRR abs/1012.0742 (2010)
2000 – 2009
- 2009
- [c50]Marta Arias, José L. Balcázar:
Canonical Horn Representations and Query Learning. ALT 2009: 156-170 - [c49]José L. Balcázar:
Two Measures of Objective Novelty in Association Rule Mining. PAKDD Workshops 2009: 76-98 - 2008
- [j35]José L. Balcázar, Yang Dai, Junichi Tanaka, Osamu Watanabe:
Provably Fast Training Algorithms for Support Vector Machines. Theory Comput. Syst. 42(4): 568-595 (2008) - [c48]Marta Arias, José L. Balcázar:
Query Learning and Certificates in Lattices. ALT 2008: 303-315 - [c47]José L. Balcázar:
Deduction Schemes for Association Rules. Discovery Science 2008: 124-135 - [c46]José L. Balcázar, Albert Bifet, Antoni Lozano:
Mining Implications from Lattices of Closed Trees. EGC 2008: 373-384 - [c45]José L. Balcázar:
Minimum-Size Bases of Association Rules. ECML/PKDD (1) 2008: 86-101 - 2007
- [j34]José L. Balcázar, Jorge Castro, David Guijarro, Johannes Köbler, Wolfgang Lindner:
A general dimension for query learning. J. Comput. Syst. Sci. 73(6): 924-940 (2007) - [j33]José L. Balcázar, Gemma C. Garriga:
Horn axiomatizations for sequential data. Theor. Comput. Sci. 371(3): 247-264 (2007) - [c44]José L. Balcázar, Albert Bifet, Antoni Lozano:
Subtree Testing and Closed Tree Mining Through Natural Representations. DEXA Workshops 2007: 499-503 - [c43]José L. Balcázar, Albert Bifet, Antoni Lozano:
Mining Frequent Closed Unordered Trees Through Natural Representations. ICCS 2007: 347-359 - [c42]José L. Balcázar, Gemma C. Garriga:
Characterizing Implications of Injective Partial Orders. ICCS 2007: 492-495 - 2006
- [c41]José L. Balcázar, Philip M. Long, Frank Stephan:
Editors' Introduction. ALT 2006: 1-9 - [e1]José L. Balcázar, Philip M. Long, Frank Stephan:
Algorithmic Learning Theory, 17th International Conference, ALT 2006, Barcelona, Spain, October 7-10, 2006, Proceedings. Lecture Notes in Computer Science 4264, Springer 2006, ISBN 3-540-46649-5 [contents] - 2005
- [c40]Jaume Baixeries, José Luis Balcázar:
New Closure Operators and Lattice Representations for Multivalued Dependencies and Related Expressions. CLA 2005 - [c39]José L. Balcázar, Gemma Casas-Garriga:
On Horn Axiomatizations for Sequential Data. ICDT 2005: 215-229 - [c38]Jaume Baixeries, José L. Balcázar:
Characterization and Armstrong Relations for Degenerate Multivalued Dependencies Using Formal Concept Analysis. ICFCA 2005: 162-175 - 2004
- [c37]José L. Balcázar, Jaume Baixeries:
Characterizations of Multivalued Dependencies and Related Expressions. Discovery Science 2004: 306-313 - [c36]Gemma Casas-Garriga, José L. Balcázar:
Coproduct Transformations on Lattices of Closed Partial Orders. ICGT 2004: 336-351 - 2002
- [j32]José L. Balcázar, Jorge Castro, David Guijarro:
A New Abstract Combinatorial Dimension for Exact Learning via Queries. J. Comput. Syst. Sci. 64(1): 2-21 (2002) - [j31]José L. Balcázar, Jorge Castro, David Guijarro, Hans Ulrich Simon:
The consistency dimension and distribution-dependent learning from queries. Theor. Comput. Sci. 288(2): 197-215 (2002) - [c35]Jaume Baixeries, Gemma Casas-Garriga, José L. Balcázar:
A Best-First Strategy for Finding Frequent Sets. EGC 2002: 101-106 - 2001
- [c34]José L. Balcázar, Yang Dai, Osamu Watanabe:
A Random Sampling Technique for Training Support Vector Machines. ALT 2001: 119-134 - [c33]José L. Balcázar, Jorge Castro, David Guijarro:
A General Dimension for Exact Learning. COLT/EuroCOLT 2001: 354-367 - [c32]Inmaculada Fortes Ruiz, José L. Balcázar, Rafael Morales Bueno:
Bounding Negative Information in Frequent Sets Algorithms. Discovery Science 2001: 50-58 - [c31]José L. Balcázar, Yang Dai, Osamu Watanabe:
Provably Fast Training Algorithms for Support Vector Machines. ICDM 2001: 43-50 - 2000
- [j30]José L. Balcázar:
Editor's Foreword. J. Comput. Syst. Sci. 60(2): 336 (2000) - [c30]José L. Balcázar, Jorge Castro, David Guijarro:
Abstract Combinatorial Characterizations of Exact Learning via Queries. COLT 2000: 248-254
1990 – 1999
- 1999
- [c29]José L. Balcázar, Jorge Castro, David Guijarro, Hans Ulrich Simon:
The Consistency Dimension and Distribution-Dependent Learning from Queries (Extended Abstract). ALT 1999: 77-92 - [c28]José L. Balcázar:
The Consistency Dimension, Compactness, and Query Learning. CSL 1999: 2-13 - 1998
- [j29]José L. Balcázar, Montserrat Hermo:
The Structure of Logarithmic Advice Complexity Classes. Theor. Comput. Sci. 207(1): 217-244 (1998) - 1997
- [j28]Eric Allender, José L. Balcázar, Neil Immerman:
A First-Order Isomorphism Theorem. SIAM J. Comput. 26(2): 557-567 (1997) - [j27]José L. Balcázar, Ricard Gavaldà, Hava T. Siegelmann:
Computational power of neural networks: a characterization in terms of Kolmogorov complexity. IEEE Trans. Inf. Theory 43(4): 1175-1183 (1997) - [c27]José L. Balcázar, Josep Díaz, Ricard Gavaldà:
Algorithms for Learning Finite Automata from Queries: A Unified View. Advances in Algorithms, Languages, and Complexity 1997: 53-72 - [c26]José L. Balcázar, Ricard Gavaldà, Osamu Watanabe:
Coding Complexity: The Computational Complexity of Succinct Descriptions. Advances in Algorithms, Languages, and Complexity 1997: 73-91 - 1996
- [j26]José L. Balcázar:
The Complexity of Searching Implicit Graphs. Artif. Intell. 86(1): 171-188 (1996) - [j25]José L. Balcázar:
The Complexity of Searching Implicit Graphs. J. Int. Comput. Games Assoc. 19(4): 247 (1996) - [j24]José L. Balcázar, Josep Díaz, Ricard Gavaldà, Osamu Watanabe:
An Optimal Parallel Algorithm for Learning DFA. J. Univers. Comput. Sci. 2(3): 97-112 (1996) - 1995
- [b5]José L. Balcázar, Josep Díaz, Joaquim Gabarró:
Structural Complexity I, Second Edition. Texts in Theoretical Computer Science. An EATCS Series, Springer 1995, ISBN 978-3-642-79237-3, pp. 1-210 - [j23]Carme Àlvarez, José L. Balcázar, Birgit Jenner:
Adaptive Logspace Reducibility and Parallel Time. Math. Syst. Theory 28(2): 117-140 (1995) - [c25]Jorge Castro, José L. Balcázar:
Simple PAC Learning of Simple Decision Lists. ALT 1995: 239-248 - [c24]José L. Balcázar, Elvira Mayordomo:
A Note on Genericity and Bi-Immunity. SCT 1995: 193-196 - [c23]José L. Balcázar, Harry Buhrman, Montserrat Hermo:
Learnability of Kolmogorov-easy circuit expressions via queries. EuroCOLT 1995: 112-124 - [c22]José L. Balcázar:
The Complexity of Searching Succinctly Represented Graphs. ICALP 1995: 208-219 - 1994
- [j22]José L. Balcázar, Josep Díaz, Ricard Gavaldà, Osamu Watanabe:
The Query Complexity of Learning DFA. New Gener. Comput. 12(4): 337-358 (1994) - [c21]José L. Balcázar, Josep Díaz, Ricard Gavaldà, Osamu Watanabe:
An Optimal Parallel Algorithm for Learning DFA. COLT 1994: 208-217 - 1993
- [b4]José L. Balcázar:
Programacion metodica. McGraw-Hill 1993, ISBN 978-84-481-1957-7, pp. I-XVI, 1-416 - [c20]José L. Balcázar, Ricard Gavaldà, Hava T. Siegelmann, Eduardo D. Sontag:
Some Structural Complexity Aspects of Neural Computation. SCT 1993: 253-265 - [c19]Eric Allender, José L. Balcázar, Neil Immerman:
A First-Order Isomorphism Theorem. STACS 1993: 163-174 - 1992
- [j21]José L. Balcázar, Joaquim Gabarró, Miklos Santha:
Deciding Bisimilarity is P-Complete. Formal Aspects Comput. 4(6A): 638-648 (1992) - [j20]José L. Balcázar, Uwe Schöning:
Logarithmic Advice Classes. Theor. Comput. Sci. 99(2): 279-290 (1992) - [c18]José L. Balcázar, Josep Díaz, Ricard Gavaldà, Osamu Watanabe:
A Note on the Query Complexity of Learning DFA (Extended Abstract). ALT 1992: 53-62 - [c17]José L. Balcázar, Montserrat Hermo, Elvira Mayordomo:
Characterizations of Logarithmic Advice Complexity Classes. IFIP Congress (1) 1992: 315-321 - 1991
- [j19]Ramón Beivide, Enrique Herrada, José L. Balcázar, Agustin Arruabarrena:
Optimal Distance Networks of Low Degree for Parallel Computers. IEEE Trans. Computers 40(10): 1109-1124 (1991) - [j18]Ricard Gavaldà, José L. Balcázar:
Strong and Robustly Strong Polynomial-Time Reducibilities to Sparse Sets. Theor. Comput. Sci. 88(1): 1-14 (1991) - [c16]José L. Balcázar:
Adaptive Logspace and Depth-Bounded Reducibilities. SCT 1991: 240-254 - [c15]Carme Àlvarez, José L. Balcázar, Joaquim Gabarró, Miklos Santha:
Parallel Complexity in the Design and Analysis on Conurrent Systems. PARLE (1) 1991: 288-303 - [c14]Carme Àlvarez, José L. Balcázar, Birgit Jenner:
Functional Oracle Queries as a Measure of Parallel Time. STACS 1991: 422-433 - 1990
- [b3]José L. Balcázar, Josep Díaz, Joaquim Gabarró:
Structural Complexity I. EATCS Monographs on Theoretical Computer Science 11, Springer 1990, ISBN 978-3-642-97064-1, pp. i-ix, 1-191 - [b2]José L. Balcázar, Josep Díaz, Joaquim Gabarró:
Structural Complexity II. EATCS Monographs on Theoretical Computer Science 22, Springer 1990, ISBN 978-3-642-75359-6, pp. I-IX, 1-285 - [j17]José L. Balcázar:
Self-Reducibility. J. Comput. Syst. Sci. 41(3): 367-388 (1990) - [c13]Ricard Gavaldà, Leen Torenvliet, Osamu Watanabe, José L. Balcázar:
Generalized Kolmogorov Complexity in Relativized Separations (Extended Abstract). MFCS 1990: 269-276
1980 – 1989
- 1989
- [j16]José L. Balcázar, Joaquim Gabarró:
Nonuniform Complexity Classes Specified by Lower and Upper Bounds. RAIRO Theor. Informatics Appl. 23(2): 177-194 (1989) - [j15]Celestí Rosselló, José L. Balcázar, Ricardo Pena:
Deriving Specifications of Embeddings in Recursive Program Design. Struct. Program. 10(3): 133-145 (1989) - [c12]José L. Balcázar:
Nondeterministic Witnesses and Nonuniform Advice. SCT 1989: 259-269 - [c11]Antoni Lozano, José L. Balcázar:
The Complexity of Graph Problems fore Succinctly Represented Graphs. WG 1989: 277-286 - 1988
- [b1]José Luis Balcázar, Josep Díaz, Joaquim Gabarró:
Structural complexity, 1st Edition. EATCS monographs on theoretical computer science 11, Springer 1988, ISBN 0387186220, pp. I-IX, 1-191 - [j14]José L. Balcázar, David A. Russo:
Immunity and Simplicity in Relativizations of Probabilistic Complexity Classes. RAIRO Theor. Informatics Appl. 22(2): 227-244 (1988) - [c10]José L. Balcázar:
Logspace self-reducibility. SCT 1988: 40-46 - [c9]Ricard Gavaldà, José L. Balcázar:
Strong and Robustly Strong Polynomial Time Reducibilities to Sparse Sets. MFCS 1988: 300-308 - 1987
- [j13]José L. Balcázar, Josep Díaz, Joaquim Gabarró:
On Characterizations of the Class PSPACE/POLY. Theor. Comput. Sci. 52: 251-267 (1987) - [c8]Ramón Beivide, Enrique Herrada, José L. Balcázar, Jesús Labarta:
Optimized Mesh-Connected Networks for SIMD and MIMD Architectures. ISCA 1987: 163-170 - [c7]José L. Balcázar:
Self-Reducibility. STACS 1987: 136-147 - 1986
- [j12]José L. Balcázar, Ronald V. Book:
Sets with Small Generalized Kolmogorov Complexity. Acta Informatica 23(6): 679-688 (1986) - [j11]José L. Balcázar, Joaquim Gabarró:
Some comments about notations of orders of manitude. Bull. EATCS 30: 34-42 (1986) - [j10]José L. Balcázar:
On (Greek D)D_P²-Immunity. Inf. Process. Lett. 23(1): 25-28 (1986) - [j9]José L. Balcázar, Ronald V. Book, Uwe Schöning:
The polynomial-time hierarchy and sparse oracles. J. ACM 33(3): 603-617 (1986) - [j8]José L. Balcázar, Ronald V. Book, Uwe Schöning:
Sparse Sets, Lowness and Highness. SIAM J. Comput. 15(3): 739-747 (1986) - [c6]José L. Balcázar, Josep Díaz, Joaquim Gabarró:
On Non- uniform Polynomial Space. SCT 1986: 35-50 - [c5]José L. Balcázar, Ronald V. Book:
On Generalized Kolmogorov Complexity. STACS 1986: 334-340 - 1985
- [j7]José L. Balcázar, Josep Díaz, Joaquim Gabarró:
Examples of CFI-BI-immune and CF-levelable sets in logspace. Bull. EATCS 25: 11-13 (1985) - [j6]José L. Balcázar, Josep Díaz, Joaquim Gabarró:
Uniform Characterizations of Non-Uniform Complexity Measures. Inf. Control. 67(1-3): 53-69 (1985) - [j5]José L. Balcázar, Uwe Schöning:
Bi-Immune Sets for Complexity Classes. Math. Syst. Theory 18(1): 1-10 (1985) - [j4]José L. Balcázar:
Simplicity, Relativizations and Nondeterminism. SIAM J. Comput. 14(1): 148-157 (1985) - [j3]José L. Balcázar, Ronald V. Book, Uwe Schöning:
On Bounded Query Machines. Theor. Comput. Sci. 40: 237-243 (1985) - [c4]José L. Balcázar, Josep Díaz, Joaquim Gabarró:
On some "non-uniform" complexity measures. FCT 1985: 18-27 - 1984
- [j2]José L. Balcázar, Josep Díaz, Joaquim Gabarró:
Some results about Logspace complexity measures. Bull. EATCS 22: 8 (1984) - [c3]José L. Balcázar, Ronald V. Book, Timothy J. Long, Uwe Schöning, Alan L. Selman:
Sparse Oracles and Uniform Complexity Classes. FOCS 1984: 308-311 - [c2]José L. Balcázar:
Separating, Strongly Separating, and Collapsing Relativized Complexity Classes. MFCS 1984: 1-16 - [c1]José L. Balcázar, Ronald V. Book, Uwe Schöning:
Sparse Oracles, Lowness, and Highness. MFCS 1984: 185-193 - 1982
- [j1]José L. Balcázar, Josep Díaz:
A Note on a Theorem by Ladner. Inf. Process. Lett. 15(2): 84-86 (1982)
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-11-07 20:36 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:
