default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Lange
Person information
- affiliation: University of Kassel, School of Electrical Engineering and Computer Science, Germany
- affiliation: LMU Munich, Institute of Informatics, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j37]Florian Bruse, Martin Lange:
Model checking timed recursive CTL. Inf. Comput. 298: 105168 (2024)- [j36]Florian Bruse, Maurice Herwig, Martin Lange:
Weights of formal languages based on geometric series with an application to automatic grading. Theor. Comput. Sci. 983: 114295 (2024) - [c78]Maurice Herwig, Norbert Hundeshagen, John Hundhausen, Stefan Kablowski, Martin Lange:
Problem-Specific Visual Feedback in Discrete Modelling. DeLFI 2024 - [c77]Marco Sälzer
, Eric Alsmann, Florian Bruse, Martin Lange:
Verifying and Interpreting Neural Networks Using Finite Automata. DLT 2024: 266-281 - [c76]Florian Bruse, Martin Lange:
Computing All Minimal Ways to Reach a Context-Free Language. RP 2024: 38-53 - [i11]Marco Sälzer, Eric Alsmann, Martin Lange:
The Computational Complexity of Formal Reasoning for Encoder-Only Transformers. CoRR abs/2405.18548 (2024) - 2023
- [j35]Florian Bruse, Martin Lange:
The tail-recursive fragment of timed recursive CTL. Inf. Comput. 294: 105084 (2023) - [c75]Florian Bruse, Martin Lange, Sören Möller:
Formal Reasoning About Influence in Natural Sciences Experiments. CADE 2023: 153-169 - [c74]Marco Sälzer, Martin Lange:
Fundamental Limits in Formal Verification of Message-Passing Neural Networks. ICLR 2023 - [c73]Marco Sälzer, Eric Alsmann, Martin Lange:
On Challenges and Opportunities in the Translation of Deep Neural Networks into Finite Automata. OVERLAY@AI*IA 2023: 7-11 - [c72]Florian Bruse, Marit Kastaun, Martin Lange, Sören Möller:
The Calculus of Temporal Influence. TIME 2023: 10:1-10:19 - 2022
- [j34]Marco Sälzer, Martin Lange:
Reachability in Simple Neural Networks. Fundam. Informaticae 189(3-4): 241-259 (2022) - [j33]Florian Bruse, Jörg Kreiker, Martin Lange, Marco Sälzer:
Local higher-order fixpoint iteration. Inf. Comput. 289(Part): 104963 (2022) - [c71]Florian Bruse, Martin Lange, Étienne Lozes:
The Tail-Recursive Fragment of Timed Recursive CTL. TIME 2022: 5:1-5:16 - [c70]Florian Bruse, Maurice Herwig, Martin Lange:
A Similarity Measure for Formal Languages Based on Convergent Geometric Series. CIAA 2022: 80-92 - [c69]Florian Bruse, David Kronenberger, Martin Lange:
Capturing Bisimulation-Invariant Exponential-Time Complexity Classes. GandALF 2022: 17-33 - [i10]Marco Sälzer, Martin Lange:
Reachability In Simple Neural Networks. CoRR abs/2203.07941 (2022) - [i9]Marco Sälzer, Martin Lange:
We Cannot Guarantee Safety: The Undecidability of Graph Neural Network Verification. CoRR abs/2206.05070 (2022) - [i8]Marco Sälzer, Eric Alsmann, Florian Bruse, Martin Lange:
Verifying And Interpreting Neural Networks using Finite Automata. CoRR abs/2211.01022 (2022) - 2021
- [j32]Florian Bruse, Martin Lange, Étienne Lozes:
The Complexity of Model-Checking Tail-Recursive Higher-Order Fixpoint Logic. Fundam. Informaticae 178(1-2): 1-30 (2021) - [j31]Florian Bruse, Martin Lange:
Temporal logic with recursion. Inf. Comput. 281: 104804 (2021) - [c68]Florian Bruse, Martin Lange:
A Decidable Non-Regular Modal Fixpoint Logic. CONCUR 2021: 23:1-23:18 - [c67]Florian Bruse, Marco Sälzer, Martin Lange:
Finite Convergence of μ-Calculus Fixpoints on Genuinely Infinite Structures. MFCS 2021: 24:1-24:19 - [c66]Marco Sälzer, Martin Lange:
Reachability is NP-Complete Even for the Simplest Neural Networks. RP 2021: 149-164 - [c65]Norbert Hundeshagen, Martin Lange, Georg Siebert:
DiMo - Discrete Modelling Using Propositional Logic. SAT 2021: 242-250 - [c64]Norbert Hundeshagen, Martin Lange:
A Proposal for a Framework to Accompany Formal Methods Learning Tools - (Short Paper). FMTea 2021: 35-42 - [c63]Florian Bruse, Martin Lange:
Model Checking Timed Recursive CTL. TIME 2021: 12:1-12:14 - [c62]Eric Alsmann, Florian Bruse, Martin Lange:
Separating the Expressive Power of Propositional Dynamic and Modal Fixpoint Logics. EXPRESS/SOS 2021: 10-26 - [i7]Marco Sälzer, Martin Lange:
Reachability Is NP-Complete Even for the Simplest Neural Networks. CoRR abs/2108.13179 (2021) - 2020
- [j30]Daniel Kernberger, Martin Lange:
Model checking for hybrid branching-time logics. J. Log. Algebraic Methods Program. 110 (2020) - [j29]Daniel Kernberger, Martin Lange:
On the expressive power of hybrid branching-time logics. Theor. Comput. Sci. 813: 362-374 (2020) - [c61]Pawel Gawrychowski, Martin Lange, Narad Rampersad, Jeffrey O. Shallit, Marek Szykula:
Existential Length Universality. STACS 2020: 16:1-16:14 - [c60]Florian Bruse, Martin Lange:
Temporal Logic with Recursion. TIME 2020: 6:1-6:14 - [c59]Florian Bruse, Jörg Kreiker, Martin Lange, Marco Sälzer:
Local Higher-Order Fixpoint Iteration. GandALF 2020: 97-113
2010 – 2019
- 2019
- [c58]Martin Lange:
Specifying Program Properties Using Modal Fixpoint Logics: A Survey of Results. ICLA 2019: 42-51 - [c57]Christoph Eickhoff, Martin Lange, Simon-Lennert Raesch, Albert Zündorf:
EMFeR: Model Checking for Object Oriented (EMF) Models. MODELSWARD 2019: 511-518 - [e3]Klaus David, Kurt Geihs, Martin Lange, Gerd Stumme:
49. Jahrestagung der Gesellschaft für Informatik, 50 Jahre Gesellschaft für Informatik - Informatik für Gesellschaft, INFORMATIK 2019, Kassel, Germany, September 23-26, 2019. LNI P-294, GI 2019, ISBN 978-3-88579-688-6 [contents] - [e2]Claude Draude, Martin Lange, Bernhard Sick:
49. Jahrestagung der Gesellschaft für Informatik, 50 Jahre Gesellschaft für Informatik - Informatik für Gesellschaft, INFORMATIK 2019 - Workshops, Kassel, Germany, September 23-26, 2019. LNI P-295, GI 2019, ISBN 978-3-88579-689-3 [contents] - 2018
- [j28]Fabio Grandi, Martin Lange, Alessio Lomuscio:
22nd International Symposium on Temporal Representation and Reasoning (TIME 2015). Inf. Comput. 259(3): 303-304 (2018) - [j27]Milka Hutagalung, Norbert Hundeshagen, Dietrich Kuske, Martin Lange, Étienne Lozes:
Multi-buffer simulations: Decidability and complexity. Inf. Comput. 262: 280-310 (2018) - [c56]Daniel Kernberger, Martin Lange:
On the Expressive Power of Hybrid Branching-Time Logics. TIME 2018: 16:1-16:18 - 2017
- [c55]Florian Bruse, Martin Lange, Étienne Lozes:
Space-Efficient Fragments of Higher-Order Fixpoint Logic. RP 2017: 26-41 - [c54]Norbert Hundeshagen, Martin Lange:
Model Checking CTL over Restricted Classes of Automatic Structures. RP 2017: 87-100 - [c53]Daniel Kernberger, Martin Lange:
The Fully Hybrid mu-Calculus. TIME 2017: 17:1-17:16 - [c52]Arno Ehle, Norbert Hundeshagen, Martin Lange:
The Sequent Calculus Trainer with Automated Reasoning - Helping Students to Find Proofs. ThEdu@CADE 2017: 19-37 - 2016
- [b3]Stéphane Demri, Valentin Goranko, Martin Lange:
Temporal Logics in Computer Science: Finite-State Systems. Cambridge Tracts in Theoretical Computer Science, Cambridge University Press 2016, ISBN 9781107028364 - [c51]Daniel Kernberger, Martin Lange:
Model Checking for the Full Hybrid Computation Tree Logic. TIME 2016: 31-40 - [c50]Milka Hutagalung, Norbert Hundeshagen, Dietrich Kuske, Martin Lange, Étienne Lozes:
Two-Buffer Simulation Games. Cassting/SynCoP 2016: 27-38 - [c49]Florian Bruse, Daniel Kernberger, Martin Lange:
A Canonical Model Construction for Iteration-Free PDL with Intersection. GandALF 2016: 120-134 - [c48]Milka Hutagalung, Norbert Hundeshagen, Dietrich Kuske, Martin Lange, Étienne Lozes:
Multi-Buffer Simulations for Trace Language Inclusion. GandALF 2016: 213-227 - 2015
- [j26]Florian Bruse, Oliver Friedmann, Martin Lange:
On guarded transformation in the modal μ-calculus. Log. J. IGPL 23(2): 194-216 (2015) - [j25]Oliver Friedmann, Felix Klaedtke, Martin Lange:
Ramsey-Based Inclusion Checking for Visibly Pushdown Automata. ACM Trans. Comput. Log. 16(4): 34:1-34:24 (2015) - [c47]Martin Lange, Étienne Lozes:
Conjunctive Visibly-Pushdown Path Queries. FCT 2015: 327-338 - [c46]Martin Lange:
The Arity Hierarchy in the Polyadic μ-Calculus. FICS 2015: 105-116 - [e1]Fabio Grandi, Martin Lange, Alessio Lomuscio:
22nd International Symposium on Temporal Representation and Reasoning, TIME 2015, Kassel, Germany, September 23-25, 2015. IEEE Computer Society 2015, ISBN 978-1-4673-9317-1 [contents] - [i6]Arno Ehle, Norbert Hundeshagen, Martin Lange:
The Sequent Calculus Trainer - Helping Students to Correctly Construct Proofs. CoRR abs/1507.03666 (2015) - 2014
- [j24]Markus Latte, Martin Lange:
Branching-time logics with path relativisation. J. Comput. Syst. Sci. 80(2): 375-389 (2014) - [j23]Julian Gutierrez, Felix Klaedtke, Martin Lange:
The μ-calculus alternation hierarchy collapses over structures with restricted connectivity. Theor. Comput. Sci. 560: 292-306 (2014) - [j22]Martin Lange, Étienne Lozes, Manuel Vargas Guzmán:
Model-checking process equivalences. Theor. Comput. Sci. 560: 326-347 (2014) - [c45]Rüdiger Ehlers, Martin Lange:
A Tool That Incrementally Approximates Finite Satisfiability in Full Interval Temporal Logic. IJCAR 2014: 360-366 - [c44]Milka Hutagalung, Martin Lange:
Model Checking for String Problems. CSR 2014: 190-203 - [c43]Martin Lange, Étienne Lozes:
Capturing Bisimulation-Invariant Complexity Classes with Higher-Order Modal Fixpoint Logic. IFIP TCS 2014: 90-103 - [c42]Florian Bruse, Michael Falk, Martin Lange:
The Fixpoint-Iteration Algorithm for Parity Games. GandALF 2014: 116-130 - [c41]Milka Hutagalung, Martin Lange, Étienne Lozes:
Buffered Simulation Games for Büchi Automata. AFL 2014: 286-300 - 2013
- [j21]Oliver Friedmann, Markus Latte, Martin Lange:
Satisfiability Games for Branching-Time Logics. Log. Methods Comput. Sci. 9(4) (2013) - [j20]Oliver Friedmann, Martin Lange:
Deciding the unguarded modal µ-calculus. J. Appl. Non Class. Logics 23(4): 353-371 (2013) - [c40]Oliver Friedmann, Felix Klaedtke, Martin Lange:
Ramsey Goes Visibly Pushdown. ICALP (2) 2013: 224-237 - [c39]Milka Hutagalung, Martin Lange, Étienne Lozes:
Revealing vs. Concealing: More Simulation Games for Büchi Inclusion. LATA 2013: 347-358 - [i5]Florian Bruse, Oliver Friedmann, Martin Lange:
Guarded Transformation for the Modal mu-Calculus. CoRR abs/1305.0648 (2013) - 2012
- [j19]Oliver Friedmann, Martin Lange:
Two Local Strategy Iteration Schemes for Parity Game Solving. Int. J. Found. Comput. Sci. 23(3): 669-685 (2012) - [j18]Keijo Heljanko, Misa Keinänen, Martin Lange, Ilkka Niemelä:
Solving parity games by a reduction to SAT. J. Comput. Syst. Sci. 78(2): 430-440 (2012) - [c38]Markus Latte, Martin Lange:
Branching Time? Pruning Time! IJCAR 2012: 393-407 - [c37]Oliver Friedmann, Martin Lange:
Ramsey-Based Analysis of Parity Automata. TACAS 2012: 64-78 - [c36]Martin Lange, Étienne Lozes:
Model-Checking the Higher-Dimensional Modal mu-Calculus. FICS 2012: 39-46 - [c35]Martin Lange, Étienne Lozes, Manuel Vargas Guzmán:
Model-Checking Process Equivalences. GandALF 2012: 43-56 - [c34]Julian Gutierrez, Felix Klaedtke, Martin Lange:
The μ-Calculus Alternation Hierarchy Collapses over Structures with Restricted Connectivity. GandALF 2012: 113-126 - 2011
- [b2]Martin Hofmann, Martin Lange:
Automatentheorie und Logik. eXamen.press, Springer 2011, ISBN 978-3-642-18089-7, pp. I-X, 1-240 - [j17]Martin Lange:
P-hardness of the emptiness problem for visibly pushdown languages. Inf. Process. Lett. 111(7): 338-341 (2011) - [j16]Oliver Friedmann, Martin Lange:
More on balanced diets. J. Funct. Program. 21(2): 135-157 (2011) - [c33]Bahareh Badban, Martin Lange:
Exact Incremental Analysis of Timed Automata with an SMT-Solver. FORMATS 2011: 177-192 - [c32]Martin Lange:
Size-Change Termination and Satisfiability for Linear-Time Temporal Logics. FroCoS 2011: 28-39 - [c31]Roland Axelsson, Martin Lange:
Formal Language Constrained Reachability and Model Checking Propositional Dynamic Logics. RP 2011: 45-57 - [c30]Oliver Friedmann, Martin Lange:
The Modal μ-Calculus Caught Off Guard. TABLEAUX 2011: 149-163 - [i4]Martin Lange:
Tableaux(-like) Methods for the Satisfiability Problems of Temporal Logics. TABLEAUX (Workshops, Tutorials, and Short Papers) 2011: 78 - 2010
- [j15]Christian Dax, Felix Klaedtke, Martin Lange:
On regular temporal logics with past. Acta Informatica 47(4): 251-277 (2010) - [c29]Oliver Friedmann, Markus Latte, Martin Lange:
A Decision Procedure for CTL* Based on Tableaux and Automata. IJCAR 2010: 331-345 - [c28]Roland Axelsson, Matthew Hague, Stephan Kreutzer, Martin Lange, Markus Latte:
Extended Computation Tree Logic. LPAR (Yogyakarta) 2010: 67-81 - [c27]Martin Lange, Markus Latte:
A CTL-Based Logic for Program Abstractions. WoLLIC 2010: 19-33 - [c26]Oliver Friedmann, Martin Lange:
Local Strategy Improvement for Parity Game Solving. GANDALF 2010: 118-131 - [i3]Roland Axelsson, Matthew Hague, Stephan Kreutzer, Martin Lange, Markus Latte:
Extended Computation Tree Logic. CoRR abs/1006.3709 (2010)
2000 – 2009
- 2009
- [j14]Martin Lange, Hans Leiß:
To CNF or not to CNF? An Efficient Yet Presentable Version of the CYK Algorithm. Informatica Didact. 8 (2009) - [j13]Anders Søgaard, Martin Lange:
Polyadic Dynamic Logics for HPSG Parsing. J. Log. Lang. Inf. 18(2): 159-198 (2009) - [j12]Martin Lange:
Model Checking for Hybrid Logic. J. Log. Lang. Inf. 18(4): 465-491 (2009) - [c25]Oliver Friedmann, Martin Lange:
Solving Parity Games in Practice. ATVA 2009: 182-196 - [c24]Stephan Kreutzer, Martin Lange:
A Note on the Relation between Inflationary Fixpoints and Least Fixpoints of Higher Order. FICS 2009: 54-60 - [c23]Christian Dax, Felix Klaedtke, Martin Lange:
On Regular Temporal Logics with Past, . ICALP (2) 2009: 175-187 - [c22]Ahmet Kara, Volker Weber, Martin Lange, Thomas Schwentick:
On the Hybrid Extension of CTL and CTL+. MFCS 2009: 427-438 - [c21]Oliver Friedmann, Martin Lange:
A Solver for Modal Fixpoint Logics. M4M 2009: 99-111 - [i2]Ahmet Kara, Martin Lange, Thomas Schwentick, Volker Weber:
On the Hybrid Extension of CTL and CTL+. CoRR abs/0906.2541 (2009) - 2008
- [j11]Martin Lange:
A purely model-theoretic proof of the exponential succinctness gap between CTL+ and CTL. Inf. Process. Lett. 108(5): 308-312 (2008) - [j10]Kai Brünnler, Martin Lange:
Cut-free sequent systems for temporal logic. J. Log. Algebraic Methods Program. 76(2): 216-225 (2008) - [c20]Stephan Kreutzer, Martin Lange:
Non-regular fixed-point logics and games. Logic and Automata 2008: 423-456 - [c19]Roland Axelsson, Keijo Heljanko, Martin Lange:
Analyzing Context-Free Grammars Using an Incremental SAT Solver. ICALP (2) 2008: 410-422 - 2007
- [j9]Orna Grumberg, Martin Lange, Martin Leucker, Sharon Shoham:
When not losing is better than winning: Abstraction and refinement for the full mu-calculus. Inf. Comput. 205(8): 1130-1148 (2007) - [j8]Martin Lange:
Three notes on the complexity of model checking fixpoint logic with chop. RAIRO Theor. Informatics Appl. 41(2): 177-190 (2007) - [j7]Roland Axelsson, Martin Lange, Rafal Somla:
The Complexity of Model Checking Higher-Order Fixpoint Logic. Log. Methods Comput. Sci. 3(2) (2007) - [c18]Martin Lange:
Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness. CONCUR 2007: 90-104 - [c17]Roland Axelsson, Martin Lange:
Model Checking the First-Order Fragment of Higher-Order Fixpoint Logic. LPAR 2007: 62-76 - [i1]Roland Axelsson, Martin Lange, Rafal Somla:
The Complexity of Model Checking Higher-Order Fixpoint Logic. CoRR abs/0704.3931 (2007) - 2006
- [j6]Martin Lange:
The alternation hierarchy in fixpoint logic with chop is strict too. Inf. Comput. 204(9): 1346-1367 (2006) - [j5]Martin Lange, Rafal Somla:
Propositional dynamic logic of context-free programs and fixpoint logic with chop. Inf. Process. Lett. 100(2): 72-75 (2006) - [j4]Martin Lange:
Model checking propositional dynamic logic with all extras. J. Appl. Log. 4(1): 39-49 (2006) - [c16]Keijo Heljanko, Tommi A. Junttila, Misa Keinänen, Martin Lange, Timo Latvala:
Bounded Model Checking for Weak Alternating Büchi Automata. CAV 2006: 95-108 - [c15]Christian Dax, Martin Hofmann, Martin Lange:
A Proof System for the Linear Time µ-Calculus. FSTTCS 2006: 273-284 - 2005
- [j3]Martin Lange, Carsten Lutz:
2-ExpTime lower bounds for propositional dynamic logics with intersection. J. Symb. Log. 70(4): 1072-1086 (2005) - [j2]Martin Lange:
A quick axiomatisation of LTL with past. Math. Log. Q. 51(1): 83-88 (2005) - [c14]Martin Lange, Rafal Somla:
The Complexity of Model Checking Higher Order Fixpoint Logic. MFCS 2005: 640-651 - [c13]Orna Grumberg, Martin Lange, Martin Leucker, Sharon Shoham:
Don't Know in the µ-Calculus. VMCAI 2005: 233-249 - [c12]Martin Lange:
Weak Automata for the Linear Time µ-Calculus. VMCAI 2005: 267-281 - [c11]Markus Jehle, Jan Johannsen, Martin Lange, Nicolas Rachinsky:
Bounded Model Checking for All Regular Properties. BMC@CAV 2005: 3-18 - 2004
- [c10]Martin Lange:
A Lower Complexity Bound for Propositional Dynamic Logic with Intersection. Advances in Modal Logic 2004: 133-147 - [c9]Martin Lange:
Symbolic Model Checking of Non-regular Properties. CAV 2004: 83-95 - [c8]Christian Dax, Martin Lange:
Game Over: The Foci Approach to LTL Satisfiability and Model Checking. GDV@CAV 2004: 33-49 - [c7]Martin Lange, Hans-Wolfgang Loidl:
Parallel and Symbolic Model Checking for Fixpoint Logic with Chop. PDMC 2004: 125-138 - 2003
- [b1]Martin Lange:
Games for modal and temporal logics. University of Edinburgh, UK, 2003 - [c6]Jan Johannsen, Martin Lange:
CTL+ Is Complete for Double Exponential Time. ICALP 2003: 767-775 - 2002
- [j1]Martin Lange, Colin Stirling:
Model Checking Games for Branching Time Logics. J. Log. Comput. 12(4): 623-639 (2002) - [c5]Martin Lange:
Local Model Checking Games for Fixed Point Logic with Chop. CONCUR 2002: 240-254 - [c4]Martin Lange, Colin Stirling:
Model Checking Fixed Point Logic with Chop. FoSSaCS 2002: 250-263 - [c3]Martin Lange:
Alternating Context-Free Languages and Linear Time mu-Calculus with Sequential Composition. EXPRESS 2002: 70-86 - 2001
- [c2]Martin Lange, Colin Stirling:
Focus Games for Satisfiability and Completeness of Temporal Logic. LICS 2001: 357-365
1990 – 1999
- 1998
- [c1]Martin Lange, Martin Leucker, Thomas Noll, Stephan Tobies:
Truth - A verification platform for concurrent systems. Tool Support for System Specification, Development and Verification 1998: 150-159
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-01-20 22:51 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:
