default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoachim Niehren
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
[j33]Antonio Al Serhali, Joachim Niehren
:
Complete Subhedge Projection for Stepwise Hedge Automata. Algorithms 17(8): 339 (2024)- [j32]Florent Capelli, Nicolas Crosetti, Joachim Niehren, Jan Ramon:
Linear Programs with Conjunctive Database Queries. Log. Methods Comput. Sci. 20(1) (2024) - 2023
- [c87]Joachim Niehren, Cédric Lhoussaine, Athénaïs Vaginay:
Core SBML and Its Formal Semantics. CMSB 2023: 124-143 - [c86]Antonio Al Serhali, Joachim Niehren:
Subhedge Projection for Stepwise Hedge Automata. FCT 2023: 16-31 - [c85]Antonio Al Serhali, Joachim Niehren:
Earliest Query Answering for Deterministic Stepwise Hedge Automata. CIAA 2023: 53-65 - [e2]Jun Pang, Joachim Niehren:
Computational Methods in Systems Biology - 21st International Conference, CMSB 2023, Luxembourg City, Luxembourg, September 13-15, 2023, Proceedings. Lecture Notes in Computer Science 14137, Springer 2023, ISBN 978-3-031-42696-4 [contents] - 2022
- [j31]Iovka Boneva, Joachim Niehren, Momar Sakho:
Regular matching and inclusion on compressed tree patterns with constrained context variables. Inf. Comput. 286: 104776 (2022) - [c84]Joachim Niehren, Athénaïs Vaginay, Cristian Versari:
Abstract Simulation of Reaction Networks via Boolean Networks. CMSB 2022: 21-40 - [c83]Florent Capelli, Nicolas Crosetti, Joachim Niehren, Jan Ramon:
Linear Programs with Conjunctive Queries. ICDT 2022: 5:1-5:19 - [c82]Joachim Niehren, Momar Sakho, Antonio Al Serhali:
Schema-Based Automata Determinization. GandALF 2022: 49-65 - [c81]Joachim Niehren, Sylvain Salvati, Rustam Azimov:
Jumping Evaluation of Nested Regular Path Queries. ICLP Technical Communications / Doctoral Consortium 2022: 79-92 - [i4]Florent Capelli, Nicolas Crosetti, Joachim Niehren, Jan Ramon:
Linear Programs with Conjunctive Database Queries. CoRR abs/2210.16694 (2022) - 2021
- [j30]Joachim Niehren, Momar Sakho:
Determinization and Minimization of Automata for Nested Words Revisited. Algorithms 14(3): 68 (2021) - [j29]Emilie Allart, Joachim Niehren, Cristian Versari:
Exact Boolean Abstraction of Linear Equation Systems. Comput. 9(11): 113 (2021) - [j28]Emilie Allart, Joachim Niehren, Cristian Versari:
Computing difference abstractions of linear equation systems. Theor. Comput. Sci. 893: 72-104 (2021) - 2020
- [c80]Iovka Boneva, Joachim Niehren, Momar Sakho:
Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata. CSR 2020: 169-183
2010 – 2019
- 2019
- [j27]Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen:
Logics for unordered trees with data constraints. J. Comput. Syst. Sci. 104: 149-164 (2019) - [c79]Emilie Allart, Joachim Niehren, Cristian Versari:
Computing Difference Abstractions of Metabolic Networks Under Kinetic Constraints. CMSB 2019: 266-285 - [c78]Iovka Boneva, Joachim Niehren, Momar Sakho:
Regular Matching and Inclusion on Compressed Tree Patterns with Context Variables. LATA 2019: 343-355 - [e1]Joachim Niehren, David Sabel:
Proceedings Fifth International Workshop on Rewriting Techniques for Program Transformations and Evaluation, WPTE@FSCD 2018, Oxford, England, 8th July 2018. EPTCS 289, 2019 [contents] - [i3]Florent Capelli, Nicolas Crosetti, Joachim Niehren, Jan Ramon:
Dependency Weighted Aggregation on Factorized Databases. CoRR abs/1901.03633 (2019) - 2018
- [c77]Iovka Boneva, Joachim Niehren, Momar Sakho:
Certain Query Answering on Compressed String Patterns: From Streams to Hyperstreams. RP 2018: 117-132 - 2017
- [j26]Guillaume Madelaine, Elisa Tonello, Cédric Lhoussaine, Joachim Niehren:
Simplification of Reaction Networks, Confluence and Elementary Modes. Comput. 5(1): 14 (2017) - [j25]Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen:
Automata for unordered trees. Inf. Comput. 253: 304-335 (2017) - [c76]Vincent Hugot, Adrien Boiret, Joachim Niehren:
Equivalence of Symbolic Tree Transducers. DLT 2017: 109-121 - 2016
- [j24]Guillaume Madelaine, Cédric Lhoussaine, Joachim Niehren, Elisa Tonello:
Structural simplification of chemical reaction networks in partial steady states. Biosyst. 149: 34-49 (2016) - [j23]Joachim Niehren, Cristian Versari, Mathias John, François Coutte, Philippe Jacques:
Predicting changes of reaction networks with partial kinetic information. Biosyst. 149: 113-124 (2016) - [c75]Guillaume Madelaine, Elisa Tonello, Cédric Lhoussaine, Joachim Niehren:
Normalizing Chemical Reaction Networks by Confluent Structural Simplification. CMSB 2016: 201-215 - [c74]Adrien Boiret, Aurélien Lemay, Joachim Niehren:
Learning Top-Down Tree Transducers with Regular Domain Inspection. ICGI 2016: 54-65 - [c73]Tom Sebastian, Joachim Niehren:
Projection for Nested Word Automata Speeds up XPath Evaluation on XML Streams. SOFSEM 2016: 602-614 - 2015
- [j22]Manfred Schmidt-Schauß, David Sabel, Joachim Niehren, Jan Schwinghammer:
Observational program calculi and the correctness of translations. Theor. Comput. Sci. 577: 98-124 (2015) - [j21]Denis Debarbieux, Olivier Gauwin, Joachim Niehren, Tom Sebastian, Mohamed Zergaoui:
Early nested word automata for XPath query answering on XML streams. Theor. Comput. Sci. 578: 100-125 (2015) - [c72]Guillaume Madelaine, Cédric Lhoussaine, Joachim Niehren:
Structural Simplification of Chemical Reaction Networks Preserving Deterministic Semantics. CMSB 2015: 133-144 - [c71]Joachim Niehren, Mathias John, Cristian Versari, François Coutte, Philippe Jacques:
Qualitative Reasoning for Reaction Networks with Partial Kinetic Information. CMSB 2015: 157-169 - [c70]Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen:
Logics for Unordered Trees with Data Constraints on Siblings. LATA 2015: 175-187 - [c69]Antoine Ndione, Aurélien Lemay, Joachim Niehren:
Sublinear DTD Validity. LATA 2015: 739-751 - [c68]Pavel Labath, Joachim Niehren:
A Uniform Programmning Language for Implementing XML Standards. SOFSEM 2015: 543-554 - 2014
- [c67]Guillaume Madelaine, Cédric Lhoussaine, Joachim Niehren:
Attractor Equivalence: An Observational Semantics for Reaction Networks. FMMB 2014: 82-101 - [c66]Grégoire Laurence, Aurélien Lemay, Joachim Niehren, Slawek Staworko, Marc Tommasi:
Learning Sequential Tree-to-Word Transducers. LATA 2014: 490-502 - [c65]Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen:
Deterministic Automata for Unordered Trees. GandALF 2014: 189-202 - 2013
- [j20]Joachim Niehren, Jérôme Champavère, Aurélien Lemay, Rémi Gilleron:
Query induction with schema-guided pruning strategies. J. Mach. Learn. Res. 14(1): 927-964 (2013) - [j19]Antoine Ndione, Aurélien Lemay, Joachim Niehren:
Approximate membership for regular languages modulo the edit distance. Theor. Comput. Sci. 487: 37-49 (2013) - [c64]Mathias John, Mirabelle Nebut, Joachim Niehren:
Knockout Prediction for Reaction Networks with Partial Kinetic Information. VMCAI 2013: 355-374 - [c63]Denis Debarbieux, Olivier Gauwin, Joachim Niehren, Tom Sebastian, Mohamed Zergaoui:
Early Nested Word Automata for XPath Query Answering on XML Streams. CIAA 2013: 292-305 - 2012
- [c62]Adrien Boiret, Aurélien Lemay, Joachim Niehren:
Learning Rational Functions. Developments in Language Theory 2012: 273-283 - 2011
- [j18]Olivier Gauwin, Joachim Niehren, Sophie Tison:
Queries on Xml streams with bounded delay and concurrency. Inf. Comput. 209(3): 409-442 (2011) - [c61]Mathias John, Cédric Lhoussaine, Joachim Niehren, Cristian Versari:
Biochemical Reaction Rules with Constraints. ESOP 2011: 338-357 - [c60]Grégoire Laurence, Aurélien Lemay, Joachim Niehren, Slawek Staworko, Marc Tommasi:
Normalization of Sequential Top-Down Tree-to-Word Transducers. LATA 2011: 354-365 - [c59]Olivier Gauwin, Joachim Niehren:
Streamable Fragments of Forward XPath. CIAA 2011: 3-15 - 2010
- [j17]Mathias John, Cédric Lhoussaine, Joachim Niehren, Adelinde M. Uhrmacher:
The Attributed Pi-Calculus with Priorities. Trans. Comp. Sys. Biology 12: 13-76 (2010) - [c58]Aurélien Lemay, Sebastian Maneth, Joachim Niehren:
A learning algorithm for top-down XML transformations. PODS 2010: 285-296
2000 – 2009
- 2009
- [j16]Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren:
Efficient inclusion checking for deterministic tree automata and XML Schemas. Inf. Comput. 207(11): 1181-1208 (2009) - [c57]Mathias John, Cédric Lhoussaine, Joachim Niehren:
Dynamic Compartments in the Imperative pi-Calculus. CMSB 2009: 235-250 - [c56]Olivier Gauwin, Joachim Niehren, Sophie Tison:
Earliest Query Answering for Deterministic Nested Word Automata. FCT 2009: 121-132 - [c55]Slawomir Staworko, Grégoire Laurence, Aurélien Lemay, Joachim Niehren:
Equivalence of Deterministic Nested Word to Word Transducers. FCT 2009: 310-322 - [c54]Olivier Gauwin, Joachim Niehren, Sophie Tison:
Bounded Delay and Concurrency for Earliest Query Answering. LATA 2009: 350-361 - [c53]Joachim Niehren:
Streaming Tree Automata and XPath. NCMA 2009: 15-16 - 2008
- [j15]Olivier Gauwin, Joachim Niehren, Yves Roos:
Streaming tree automata. Inf. Process. Lett. 109(1): 13-17 (2008) - [c52]Mathias John, Cédric Lhoussaine, Joachim Niehren, Adelinde M. Uhrmacher:
The Attributed Pi Calculus. CMSB 2008: 83-102 - [c51]Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren:
Schema-Guided Induction of Monadic Queries. ICGI 2008: 15-28 - [c50]Manfred Schmidt-Schauß, Joachim Niehren, Jan Schwinghammer, David Sabel:
Adequacy of Compositional Translations for Observational Semantics. IFIP TCS 2008: 521-535 - [c49]Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren:
Efficient Inclusion Checking for Deterministic Tree Automata and DTDs. LATA 2008: 184-195 - [c48]Olivier Gauwin, Anne-Cécile Caron, Joachim Niehren, Sophie Tison:
Complexity of Earliest Query Answering with Streaming Tree Automata. PLAN-X 2008 - [c47]Marco Kuhlmann, Joachim Niehren:
Logics and Automata for Totally Ordered Trees. RTA 2008: 217-231 - 2007
- [j14]Katrin Erk, Joachim Niehren:
Dominance constraints in stratified context unification. Inf. Process. Lett. 101(4): 141-147 (2007) - [j13]Wim Martens, Joachim Niehren:
On the minimization of XML Schemas and tree automata for unranked trees. J. Comput. Syst. Sci. 73(4): 550-583 (2007) - [j12]Julien Carme, Rémi Gilleron, Aurélien Lemay, Joachim Niehren:
Interactive learning of node selecting tree transducer. Mach. Learn. 66(1): 33-67 (2007) - [c46]Céline Kuttler, Cédric Lhoussaine, Joachim Niehren:
A Stochastic Pi Calculus for Concurrent Objects. AB 2007: 232-246 - [c45]Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison:
Polynomial time fragments of XPath with variables. PODS 2007: 205-214 - [c44]Joachim Niehren, David Sabel, Manfred Schmidt-Schauß, Jan Schwinghammer:
Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures. MFPS 2007: 313-337 - 2006
- [j11]Joachim Niehren, Jan Schwinghammer, Gert Smolka:
A concurrent lambda calculus with futures. Theor. Comput. Sci. 364(3): 338-356 (2006) - [j10]Céline Kuttler, Joachim Niehren:
Gene Regulation in the Pi Calculus: Simulating Cooperativity at the Lambda Switch. Trans. Comp. Sys. Biology 7: 24-55 (2006) - [c43]Aurélien Lemay, Joachim Niehren, Rémi Gilleron:
Learning n-Ary Node Selecting Tree Transducers from Completely Annotated Examples. ICGI 2006: 253-267 - [c42]Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison:
Composing Monadic Queries in Trees. PLAN-X 2006: 61-70 - 2005
- [c41]Jordi Levy, Joachim Niehren, Mateu Villaret:
Well-Nested Context Unification. CADE 2005: 149-163 - [c40]Joachim Niehren, Laurent Planque, Jean-Marc Talbot, Sophie Tison:
N-Ary Queries by Tree Automata. DBPL 2005: 217-231 - [c39]Wim Martens, Joachim Niehren:
Minimizing Tree Automata for Unranked Trees. DBPL 2005: 232-246 - [c38]Joachim Niehren, Tim Priesnitz, Zhendong Su:
Complexity of Subtype Satisfiability over Posets. ESOP 2005: 357-373 - [c37]Joachim Niehren, Jan Schwinghammer, Gert Smolka:
A Concurrent Lambda Calculus with Futures. FroCoS 2005: 248-263 - [c36]Joachim Niehren, Mateu Villaret:
Describing Lambda Terms in Context Unification. LACL 2005: 221-237 - [i2]Joachim Niehren, Laurent Planque, Jean-Marc Talbot, Sophie Tison:
N-ary Queries by Tree Automata. Foundations of Semistructured Data 2005 - 2004
- [c35]Ruth Fuchss, Alexander Koller, Joachim Niehren, Stefan Thater:
Minimal Recursion Semantics as Dominance Constraints: Translation, Evaluation, and Analysis. ACL 2004: 247-254 - [c34]Julien Carme, Aurélien Lemay, Joachim Niehren:
Learning Node Selecting Tree Transducer from Completely Annotated Examples. ICGI 2004: 91-102 - [c33]Ralph Debusmann, Denys Duchier, Joachim Niehren:
The XDG Grammar Development Kit. MOZ 2004: 188-199 - [c32]Julien Carme, Joachim Niehren, Marc Tommasi:
Querying Unranked Trees with Stepwise Tree Automata. RTA 2004: 105-118 - [c31]Manuel Bodirsky, Denys Duchier, Joachim Niehren, Sebastian Miele:
A new algorithm for normal dominance constraints. SODA 2004: 59-67 - 2003
- [j9]Joachim Niehren, Tim Priesnitz:
Non-structural subtype entailment in automata theory. Inf. Comput. 186(2): 319-354 (2003) - [j8]Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel:
An efficient graph algorithm for dominance constraints. J. Algorithms 48(1): 194-219 (2003) - [c30]Joachim Niehren, Stefan Thater:
Bridging the Gap Between Underspecification Formalisms: Minimal Recursion Semantics as Dominance Constraints. ACL 2003: 367-374 - [c29]Katrin Erk, Joachim Niehren:
Well-Nested Parallelism Constraints for Ellipsis Resolution. EACL 2003: 115-122 - [c28]Alexander Koller, Joachim Niehren, Stefan Thater:
Underspecification formalisms: Hole semantics as dominance constraints. EACL 2003: 195-202 - 2002
- [c27]Joachim Niehren, Mateu Villaret:
Parallelism and Tree Regular Constraints. LPAR 2002: 311-326 - [c26]Zhendong Su, Alexander Aiken, Joachim Niehren, Tim Priesnitz, Ralf Treinen:
The first-order theory of subtyping constraints. POPL 2002: 203-216 - 2001
- [j7]Martin Müller, Joachim Niehren, Ralf Treinen:
The first-order theory of ordering constraints over feature trees. Discret. Math. Theor. Comput. Sci. 4(2): 193-234 (2001) - [j6]Markus Egg, Alexander Koller, Joachim Niehren:
The Constraint Language for Lambda Structures. J. Log. Lang. Inf. 10(4): 457-485 (2001) - [c25]Manuel Bodirsky, Katrin Erk, Alexander Koller, Joachim Niehren:
Underspecified Beta Reduction. ACL 2001: 74-81 - [c24]Manuel Bodirsky, Katrin Erk, Alexander Koller, Joachim Niehren:
Beta Reduction Constraints. RTA 2001: 31-46 - [c23]Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel:
An efficient algorithm for the configuration problem of dominance graphs. SODA 2001: 815-824 - [c22]Joachim Niehren, Tim Priesnitz:
Non-structural Subtype Entailment in Automata Theory. TACS 2001: 360-384 - 2000
- [j5]Martin Müller, Joachim Niehren, Andreas Podelski:
Ordering Constraints over Feature Trees. Constraints An Int. J. 5(1/2): 7-41 (2000) - [j4]Alexander Koller, Joachim Niehren, Kristina Striegnitz:
Relaxing Underspecified Semantic Representations for Reinterpretation. Grammars 3(2/3): 217-241 (2000) - [j3]Martin Müller, Joachim Niehren:
Ordering Constraints over Feature Trees Expressed in Second-Order Monadic Logic. Inf. Comput. 159(1-2): 22-58 (2000) - [j2]Joachim Niehren, Sophie Tison, Ralf Treinen:
On rewrite constraints and context unification. Inf. Process. Lett. 74(1-2): 35-40 (2000) - [j1]Joachim Niehren:
Uniform confluence in concurrent computation. J. Funct. Program. 10(5): 453-499 (2000) - [c21]Alexander Koller, Kurt Mehlhorn, Joachim Niehren:
A Polynomial-Time Fragment of Dominance Constraints. ACL 2000: 376-383 - [c20]Denys Duchier, Joachim Niehren:
Dominance Constraints with Set Operators. Computational Logic 2000: 326-341 - [c19]Alexander Koller, Joachim Niehren:
On Underspecified Processing of Dynamic Semantics. COLING 2000: 460-466 - [c18]Katrin Erk, Joachim Niehren:
Parallelism Constraints. RTA 2000: 110-126
1990 – 1999
- 1999
- [c17]Joachim Niehren, Tim Priesnitz:
Entailment of Non-structural Subtype Constraints. ASIAN 1999: 251-265 - [c16]Joachim Niehren, Martin Müller, Jean-Marc Talbot:
Entailment of Atomic Set Constraints is PSPACE-Complete. LICS 1999: 285-294 - 1998
- [c15]Markus Egg, Joachim Niehren, Peter Ruhrberg, Feiyu Xu:
Constraints over Lambda-Structures in Semantic Underspecification. COLING-ACL 1998: 353-359 - [c14]Alexander Koller, Joachim Niehren, Ralf Treinen:
Dominance Constraints: Algorithms and Complexity. LACL 1998: 106-125 - [c13]Joachim Niehren, Alexander Koller:
Dominance Constraints in Context Unification. LACL 1998: 199-218 - [c12]Martin Müller, Joachim Niehren, Ralf Treinen:
The First-Order Theory of Ordering Constraints over Feature Trees. LICS 1998: 432-443 - [c11]Martin Müller, Joachim Niehren:
Ordering Constraints over Feature Trees Expressed in Second-Order Monadic Logic. RTA 1998: 196-210 - 1997
- [c10]Joachim Niehren, Manfred Pinkal, Peter Ruhrberg:
A Uniform Approach to Underspecification and Parallelism. ACL 1997: 410-417 - [c9]Joachim Niehren, Manfred Pinkal, Peter Ruhrberg:
On Equality Up-to Constraints over Finite Trees, Context Unification, and One-Step Rewriting. CADE 1997: 34-48 - [c8]Martin Müller, Joachim Niehren, Andreas Podelski:
Ordering Constraints over Feature Trees. CP 1997: 297-311 - [c7]Martin Müller, Joachim Niehren, Andreas Podelski:
Inclusion Constraints over Non-empty Sets of Trees. TAPSOFT 1997: 345-356 - 1996
- [c6]Joachim Niehren:
Functional Computation as Concurrent Computation. POPL 1996: 333-343 - 1995
- [c5]Joachim Niehren, Martin Müller:
Constraints for Free in Concurrent Computation. ASIAN 1995: 171-186 - [c4]Joachim Niehren, Martin Müller:
Constraints for Free in Concurrent Computing. CCP 1995: 2:1-2:19 - [i1]Martin Müller, Joachim Niehren:
Weak subsumption Constraints for Type Diagnosis: An Incremental Algorithm. CoRR abs/cmp-lg/9506002 (1995) - 1994
- [b1]Joachim Niehren:
Funktionale Berechnung in einem uniform nebenläufigen Kalkül mit logischen Variablen. Saarland University, Saarbrücken, Germany, 1994, pp. 1-145 - [c3]Joachim Niehren, Gert Smolka:
A Confluent Relational Calculus for Higher-Order Programming with Constraints. CCL 1994: 89-104 - 1993
- [c2]Joachim Niehren, Andreas Podelski, Ralf Treinen:
Equational and Membership Constraints for Finite Trees. RTA 1993: 106-120 - [c1]Joachim Niehren, Andreas Podelski:
Feature Automata and Recognizable Sets of Feature Trees. TAPSOFT 1993: 356-375
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-10-07 21:22 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:
