default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNeil Immerman
Person information
- affiliation: University of Massachusetts Amherst, USA
- award (1995): Gödel Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c67]Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta:
On the Number of Quantifiers Needed to Define Boolean Functions. MFCS 2024: 34:1-34:16- [i16]Neil Immerman:
What Juris Hartmanis taught me about Reductions. CoRR abs/2401.11282 (2024) - [i15]Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta, R. Ryan Williams:
Parallel Play Saves Quantifiers. CoRR abs/2402.10293 (2024) - [i14]Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta:
On the Number of Quantifiers Needed to Define Boolean Functions. CoRR abs/2407.00688 (2024) - 2023
- [i13]Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta:
A Finer Analysis of Multi-Structural Games and Beyond. CoRR abs/2301.13329 (2023) - 2021
- [c66]Neta Elad
, Sophie Rain, Neil Immerman, Laura Kovács, Mooly Sagiv:
Summing up Smart Transitions. CAV (1) 2021: 317-340 - [i12]Neta Elad, Sophie Rain, Neil Immerman, Laura Kovács, Mooly Sagiv:
Summing Up Smart Transitions. CoRR abs/2105.07663 (2021) - 2020
- [j48]Yotam M. Y. Feldman, Neil Immerman, Mooly Sagiv, Sharon Shoham:
Complexity and information in invariant inference. Proc. ACM Program. Lang. 4(POPL): 5:1-5:29 (2020) - [j47]Neil Immerman:
Complexity column. ACM SIGLOG News 7(1): 3 (2020) - [j46]Neil Immerman:
Complexity column. ACM SIGLOG News 7(3): 4 (2020) - [c65]Jason R. Koenig, Oded Padon, Neil Immerman, Alex Aiken:
First-order quantified separators. PLDI 2020: 703-717 - [c64]Cibele Freire, Wolfgang Gatterbauer, Neil Immerman, Alexandra Meliou:
New Results for the Complexity of Resilience for Binary Conjunctive Queries with Self-Joins. PODS 2020: 271-284
2010 – 2019
- 2019
- [j45]Yotam M. Y. Feldman, Oded Padon, Neil Immerman, Mooly Sagiv, Sharon Shoham:
Bounded Quantifier Instantiation for Checking Inductive Invariants. Log. Methods Comput. Sci. 15(3) (2019) - [i11]Cibele Freire, Wolfgang Gatterbauer, Neil Immerman, Alexandra Meliou:
New Results for the Complexity of Resilience for Binary Conjunctive Queries with Self-Joins. CoRR abs/1907.01129 (2019) - [i10]Neil Immerman, Rik Sengupta:
The k-Dimensional Weisfeiler-Leman Algorithm. CoRR abs/1907.09582 (2019) - [i9]Yotam M. Y. Feldman, Neil Immerman, Mooly Sagiv, Sharon Shoham:
Complexity and Information in Invariant Inference. CoRR abs/1910.12256 (2019) - 2018
- [j44]Neil Immerman:
Complexity column. ACM SIGLOG News 5(3): 21 (2018) - [j43]Neil Immerman:
Complexity column. ACM SIGLOG News 5(4): 3 (2018) - 2017
- [j42]Neil Immerman:
Complexity column. ACM SIGLOG News 4(2): 28 (2017) - [j41]Neil Immerman:
Complexity column. ACM SIGLOG News 4(3): 27 (2017) - [c63]Yotam M. Y. Feldman, Oded Padon, Neil Immerman, Mooly Sagiv, Sharon Shoham:
Bounded Quantifier Instantiation for Checking Inductive Invariants. TACAS (1) 2017: 76-95 - [i8]Yotam M. Y. Feldman, Oded Padon, Neil Immerman, Mooly Sagiv, Sharon Shoham:
Bounded Quantifier Instantiation for Checking Inductive Invariants. CoRR abs/1710.08668 (2017) - 2016
- [j40]Neil Immerman:
Complexity column. ACM SIGLOG News 3(1): 22 (2016) - [j39]Neil Immerman:
Complexity column. ACM SIGLOG News 3(2): 29 (2016) - [j38]Neil Immerman:
Complexity column. ACM SIGLOG News 3(3): 20 (2016) - [c62]Oded Padon, Neil Immerman, Sharon Shoham, Aleksandr Karbyshev, Mooly Sagiv:
Decidability of inferring inductive invariants. POPL 2016: 217-231 - 2015
- [j37]Cibele Freire, Wolfgang Gatterbauer, Neil Immerman, Alexandra Meliou:
The Complexity of Resilience and Responsibility for Self-Join-Free Conjunctive Queries. Proc. VLDB Endow. 9(3): 180-191 (2015) - [c61]Oded Padon, Neil Immerman, Aleksandr Karbyshev, Ori Lahav, Mooly Sagiv, Sharon Shoham:
Decentralizing SDN Policies. POPL 2015: 663-676 - [i7]Cibele Freire, Wolfgang Gatterbauer, Neil Immerman, Alexandra Meliou:
A Characterization of the Complexity of Resilience and Responsibility for Self-join-free Conjunctive Queries. CoRR abs/1507.00674 (2015) - 2014
- [j36]Neil Immerman:
Complexity column. ACM SIGLOG News 1(1): 5 (2014) - [c60]Shachar Itzhaky, Anindya Banerjee, Neil Immerman, Ori Lahav, Aleksandar Nanevski, Mooly Sagiv:
Modular reasoning about heap paths via effectively propositional formulas. POPL 2014: 385-396 - [c59]Haopeng Zhang, Yanlei Diao, Neil Immerman:
On complexity and optimization of expensive queries in complex event processing. SIGMOD Conference 2014: 217-228 - 2013
- [j35]Haopeng Zhang, Yanlei Diao, Neil Immerman:
Recognizing patterns in streams with imprecise timestamps. Inf. Syst. 38(8): 1187-1211 (2013) - [j34]Wentian Lu, Gerome Miklau, Neil Immerman:
Auditing a database under retention policies. VLDB J. 22(2): 203-228 (2013) - [c58]Shachar Itzhaky, Anindya Banerjee, Neil Immerman, Aleksandar Nanevski, Mooly Sagiv:
Effectively-Propositional Reasoning about Reachability in Linked Data Structures. CAV 2013: 756-772 - [c57]Shachar Itzhaky, Sumit Gulwani, Neil Immerman, Mooly Sagiv:
Solving Geometry Problems Using a Combination of Symbolic and Numerical Reasoning. LPAR 2013: 457-472 - [i6]Daniel S. Bernstein, Shlomo Zilberstein, Neil Immerman:
The Complexity of Decentralized Control of Markov Decision Processes. CoRR abs/1301.3836 (2013) - 2012
- [j33]Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein:
Applicability conditions for plans with loops: Computability results and algorithms. Artif. Intell. 191-192: 1-19 (2012) - [c56]Marco Carmosino, Neil Immerman, Charles Jordan:
Experimental Descriptive Complexity. Logic and Program Semantics 2012: 24-34 - [c55]Christoph Reichenbach, Yannis Smaragdakis, Neil Immerman:
PQL: A Purely-Declarative Java Extension for Parallel Programming. ECOOP 2012: 53-78 - 2011
- [j32]Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein:
A new representation and associated algorithms for generalized planning. Artif. Intell. 175(2): 615-647 (2011) - [c54]Siddharth Srivastava, Shlomo Zilberstein, Neil Immerman, Hector Geffner:
Qualitative Numeric Planning. AAAI 2011: 1010-1016 - [c53]Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein:
Termination and Correctness Analysis of Cyclic Control. AAAI 2011: 1567-1570 - [c52]Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein, Tianjiao Zhang:
Directed Search for Generalized Plans Using Classical Planners. ICAPS 2011 - 2010
- [j31]Haopeng Zhang, Yanlei Diao, Neil Immerman:
Recognizing Patterns in Streams with Imprecise Timestamps. Proc. VLDB Endow. 3(1): 244-255 (2010) - [c51]Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein:
Computing Applicability Conditions for Plans with Loops. ICAPS 2010: 161-168 - [c50]Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein:
Merging example plans into generalized plans for non-deterministic environments. AAMAS 2010: 1341-1348 - [c49]Michael S. Crouch, Neil Immerman, J. Eliot B. Moss:
Finding Reductions Automatically. Fields of Logic and Computation 2010: 181-200 - [c48]Shachar Itzhaky, Sumit Gulwani, Neil Immerman, Mooly Sagiv:
A simple inductive synthesis methodology and its applications. OOPSLA 2010: 36-46 - [c47]Christoph Reichenbach, Neil Immerman, Yannis Smaragdakis, Edward Aftandilian, Samuel Z. Guyer:
What can the GC compute efficiently?: a language for heap assertions at GC time. OOPSLA 2010: 256-269
2000 – 2009
- 2009
- [j30]Tal Lev-Ami, Neil Immerman, Thomas W. Reps, Mooly Sagiv, Siddharth Srivastava, Greta Yorsh:
Simulating reachability using first-order logic with applications to verification of linked data structures. Log. Methods Comput. Sci. 5(2) (2009) - [j29]Philipp Weis, Neil Immerman:
Structure Theorem and Strict Alternation Hierarchy for FO^2 on Words. Log. Methods Comput. Sci. 5(3) (2009) - [j28]Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer:
The complexity of satisfiability problems: Refining Schaefer's theorem. J. Comput. Syst. Sci. 75(4): 245-254 (2009) - [c46]Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein:
Abstract Planning with Unknown Object Quantities and Properties. SARA 2009 - 2008
- [j27]Rajeev Alur, Marcelo Arenas, Pablo Barceló, Kousha Etessami, Neil Immerman, Leonid Libkin:
First-Order and Temporal Logics for Nested Words. Log. Methods Comput. Sci. 4(4) (2008) - [c45]Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein:
Learning Generalized Plans Using Abstract Counting. AAAI 2008: 991-997 - [c44]Daniel Gyllstrom, Jagrati Agrawal, Yanlei Diao, Neil Immerman:
On Supporting Kleene Closure over Event Streams. ICDE 2008: 1391-1393 - [c43]Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein:
Using Abstraction for Generalized Planning. ISAIM 2008 - [c42]Jagrati Agrawal, Yanlei Diao, Daniel Gyllstrom, Neil Immerman:
Efficient pattern matching over event streams. SIGMOD Conference 2008: 147-160 - [i5]Rajeev Alur, Marcelo Arenas, Pablo Barceló, Kousha Etessami, Neil Immerman, Leonid Libkin:
First-Order and Temporal Logics for Nested Words. CoRR abs/0811.0537 (2008) - 2007
- [c41]Philipp Weis, Neil Immerman:
Structure Theorem and Strict Alternation Hierarchy for FO2 on Words. CSL 2007: 343-357 - [c40]Rajeev Alur, Marcelo Arenas, Pablo Barceló, Kousha Etessami, Neil Immerman, Leonid Libkin:
First-Order and Temporal Logics for Nested Words. LICS 2007: 151-160 - [c39]Tal Lev-Ami, Mooly Sagiv, Neil Immerman, Thomas W. Reps:
Constructing Specialized Shape Analyses for Uniform Change. VMCAI 2007: 215-233 - [i4]Philipp Weis, Neil Immerman:
Structure Theorem and Strict Alternation Hierarchy for FO^2 on Words. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [c38]Tal Lev-Ami, Neil Immerman, Shmuel Sagiv:
Abstraction for Shape Analysis with Fast and Precise Transformers. CAV 2006: 547-561 - [i3]Philipp Weis, Neil Immerman:
Structure Theorem and Strict Alternation Hierarchy for FO2 on Words. Circuits, Logic, and Games 2006 - 2005
- [j26]David A. Mix Barrington, Neil Immerman, Clemens Lautemann, Nicole Schweikardt, Denis Thérien:
First-order expressibility of languages with neutral letters or: The Crane Beach conjecture. J. Comput. Syst. Sci. 70(2): 101-127 (2005) - [c37]Tal Lev-Ami, Neil Immerman, Thomas W. Reps, Shmuel Sagiv, Siddharth Srivastava, Greta Yorsh:
Simulating Reachability Using First-Order Logic with Applications to Verification of Linked Data Structures. CADE 2005: 99-115 - [c36]Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer:
The Complexity of Satisfiability Problems: Refining Schaefer's Theorem. MFCS 2005: 71-82 - 2004
- [c35]Neil Immerman, Alexander Moshe Rabinovich, Thomas W. Reps, Shmuel Sagiv, Greta Yorsh:
Verification via Structure Simulation. CAV 2004: 281-294 - [c34]Neil Immerman, Alexander Moshe Rabinovich, Thomas W. Reps, Shmuel Sagiv, Greta Yorsh:
The Boundary Between Decidability and Undecidability for Transitive-Closure Logics. CSL 2004: 160-174 - [i2]Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer:
The Complexity of Satisfiability Problems: Refining Schaefer's Theorem. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j25]Micah Adler, Neil Immerman:
An n! lower bound on formula size. ACM Trans. Comput. Log. 4(3): 296-314 (2003) - [c33]Sudarshan Vasudevan, Brian DeCleene, Neil Immerman, James F. Kurose, Donald F. Towsley:
Leader Election Algorithms for Wireless Ad Hoc Networks. DISCEX (1) 2003: 261-272 - 2002
- [j24]Susan Landau, Neil Immerman:
Embedding Linkages on an Integer Lattice. Algorithmica 32(3): 423-436 (2002) - [j23]Daniel S. Bernstein, Robert Givan, Neil Immerman, Shlomo Zilberstein:
The Complexity of Decentralized Control of Markov Decision Processes. Math. Oper. Res. 27(4): 819-840 (2002) - [c32]Matthew Hertz, Neil Immerman, J. Eliot B. Moss:
Framework for Analyzing Garbage Collection. IFIP TCS 2002: 230-242 - [c31]William Hesse, Neil Immerman:
Complete Problems for Dynamic Complexity Classes. LICS 2002: 313- - 2001
- [j22]Joseph Y. Halpern, Robert Harper, Neil Immerman, Phokion G. Kolaitis, Moshe Y. Vardi, Victor Vianu:
On the unusual effectiveness of logic in computer science. Bull. Symb. Log. 7(2): 213-236 (2001) - [j21]Neil Immerman, Jonathan F. Buss, David A. Mix Barrington:
Number of Variables Is Equivalent to Space. J. Symb. Log. 66(3): 1217-1230 (2001) - [c30]David A. Mix Barrington, Neil Immerman, Clemens Lautemann, Nicole Schweikardt, Denis Thérien:
The Crane Beach Conjecture. LICS 2001: 187-196 - [c29]Micah Adler, Neil Immerman:
An n! Lower Bound on Formula Size. LICS 2001: 197-206 - [p1]Neil Immerman:
Progress in Descriptive Complexity. Current Trends in Theoretical Computer Science 2001: 71-82 - 2000
- [j20]Kousha Etessami, Neil Immerman:
Tree Canonization and Transitive Closure. Inf. Comput. 157(1-2): 2-24 (2000) - [j19]Natasha Alechina, Neil Immerman:
Reachability Logic: An Efficient Fragment of Transitive Closure Logic. Log. J. IGPL 8(3): 325-337 (2000) - [c28]Daniel S. Bernstein, Shlomo Zilberstein, Neil Immerman:
The Complexity of Decentralized Control of Markov Decision Processes. UAI 2000: 32-37
1990 – 1999
- 1999
- [b2]Neil Immerman:
Descriptive complexity. Graduate texts in computer science, Springer 1999, ISBN 978-1-4612-6809-3, pp. I-XVI, 1-268 - [j18]Neil Immerman:
Progress in Descriptive Complexity. Bull. EATCS 67: 72-81 (1999) - 1998
- [c27]Neil Immerman:
Descriptive Complexity and Model Checking. FSTTCS 1998: 1-5 - 1997
- [j17]Sushant Patnaik, Neil Immerman:
Dyn-FO: A Parallel, Dynamic Complexity Class. J. Comput. Syst. Sci. 55(2): 199-209 (1997) - [j16]Eric Allender, José L. Balcázar, Neil Immerman:
A First-Order Isomorphism Theorem. SIAM J. Comput. 26(2): 557-567 (1997) - [c26]Neil Immerman, Moshe Y. Vardi:
Model Checking and Transitive-Closure Logic. CAV 1997: 291-302 - 1996
- [j15]Neil Immerman, Sushant Patnaik, David W. Stemple:
The Expressiveness of a Family of Finite Set Languages. Theor. Comput. Sci. 155(1): 111-140 (1996) - [c25]J. Antonio Medina, Neil Immerman:
A Generalization of Fagin's Theorem. LICS 1996: 2-12 - [e1]Neil Immerman, Phokion G. Kolaitis:
Descriptive Complexity and Finite Models, Proceedings of a DIMACS Workshop 1996, Princeton, New Jersey, USA, January 14-17, 1996. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 31, DIMACS/AMS 1996, ISBN 978-0-8218-0517-6 [contents] - 1995
- [j14]Neil Immerman, Susan Landau:
The Complexity of Iterated Multiplication. Inf. Comput. 116(1): 103-116 (1995) - [j13]Kousha Etessami, Neil Immerman:
Reachability and the Power of Local Ordering. Theor. Comput. Sci. 148(2): 261-279 (1995) - [c24]Kousha Etessami, Neil Immerman:
Tree Canonization and Transitive Closure. LICS 1995: 331-341 - 1994
- [c23]David A. Mix Barrington, Neil Immerman:
Time, Hardware, and Uniformity. SCT 1994: 176-185 - [c22]Yuri Gurevich, Neil Immerman, Saharon Shelah:
McColm's Conjecture. LICS 1994: 10-19 - [c21]J. Antonio Medina, Neil Immerman:
A Syntactic Characterization of NP-Completeness. LICS 1994: 241-250 - [c20]Sushant Patnaik, Neil Immerman:
Dyn-FO: A Parallel, Dynamic Complexity Class. PODS 1994: 210-221 - [c19]Kousha Etessami, Neil Immerman:
Reachability and the Power of Local Ordering. STACS 1994: 123-135 - [i1]Yuri Gurevich, Neil Immerman, Saharon Shelah:
McColm conjecture. CoRR abs/math/9411235 (1994) - 1993
- [c18]Eric Allender, José L. Balcázar, Neil Immerman:
A First-Order Isomorphism Theorem. STACS 1993: 163-174 - 1992
- [j12]Jin-yi Cai, Martin Fürer, Neil Immerman:
An optimal lower bound on the number of variables for graph identification. Comb. 12(4): 389-410 (1992) - 1991
- [c17]Neil Immerman:
DSPACE[nk] = VAR[k+1]. SCT 1991: 334-340 - [c16]Neil Immerman, Sushant Patnaik, David W. Stemple:
The Expressiveness of a Family of Finite Set Languages. PODS 1991: 37-52 - 1990
- [j11]David A. Mix Barrington, Neil Immerman, Howard Straubing:
On Uniformity within NC¹. J. Comput. Syst. Sci. 41(3): 274-306 (1990)
1980 – 1989
- 1989
- [j10]Neil Immerman, Dexter Kozen:
Definability with Bounded Number of Bound Variables. Inf. Comput. 83(2): 121-139 (1989) - [j9]Neil Immerman:
Expressibility and Parallel Complexity. SIAM J. Comput. 18(3): 625-638 (1989) - [j8]Neil Immerman, Stephen R. Mahaney:
Relativizing Relativized Computations. Theor. Comput. Sci. 68(3): 267-276 (1989) - [c15]Neil Immerman, Susan Landau:
The Complexity of Iterated Multiplication. SCT 1989: 104-111 - [c14]Neil Immerman:
Descriptive and Computational Complexity. FCT 1989: 244-245 - [c13]Jin-yi Cai, Martin Fürer, Neil Immerman:
An Optimal Lower Bound on the Number of Variables for Graph Identification. FOCS 1989: 612-617 - 1988
- [j7]Neil Immerman:
Nondeterministic Space is Closed Under Complementation. SIAM J. Comput. 17(5): 935-938 (1988) - [c12]David A. Mix Barrington, Neil Immerman, Howard Straubing:
On uniformity within NC1. SCT 1988: 47-59 - [c11]Neil Immerman:
Nondeterministic space is closed under complementation. SCT 1988: 112-115 - 1987
- [j6]Michael J. Fischer, Neil Immerman:
Interpreting Logics of Knowledge in Propositional Dynamic Logic with Converse. Inf. Process. Lett. 25(3): 175-181 (1987) - [j5]Neil Immerman:
Languages that Capture Complexity Classes. SIAM J. Comput. 16(4): 760-778 (1987) - [c10]Neil Immerman:
Expressibility as a complexity measure: results and directions. SCT 1987: 194-202 - [c9]Neil Immerman, Dexter Kozen:
Definability with Bounded Number of Bound Variables. LICS 1987: 236-244 - 1986
- [j4]Neil Immerman:
Relational Queries Computable in Polynomial Time. Inf. Control. 68(1-3): 86-104 (1986) - [c8]Michael J. Fischer, Neil Immerman:
Foundations of Knowledge for Distributed Systems. TARK 1986: 171-185 - 1985
- [j3]Juris Hartmanis, Neil Immerman, Vivian Sewelson:
Sparse Sets in NP-P: EXPTIME versus NEXPTIME. Inf. Control. 65(2/3): 158-181 (1985) - [c7]Juris Hartmanis, Neil Immerman:
On Complete Problems for NP$\cap$CoNP. ICALP 1985: 250-259 - 1983
- [c6]Neil Immerman:
Languages Which Capture Complexity Classes (Preliminary Report). STOC 1983: 347-354 - [c5]Juris Hartmanis, Vivian Sewelson, Neil Immerman:
Sparse Sets in NP-P: EXPTIME versus NEXPTIME. STOC 1983: 382-391 - 1982
- [j2]Neil Immerman:
Upper and Lower Bounds for First Order Expressibility. J. Comput. Syst. Sci. 25(1): 76-98 (1982) - [c4]Neil Immerman:
Relational Queries Computable in Polynomial Time (Extended Abstract). STOC 1982: 147-152 - 1981
- [j1]Neil Immerman:
Number of Quantifiers is Better Than Number of Tape Cells. J. Comput. Syst. Sci. 22(3): 384-406 (1981) - 1980
- [b1]Neil Immerman:
First Order Expressibility as a New Complexity Measure. Cornell University, USA, 1980 - [c3]Neil Immerman:
Upper and Lower Bounds for First Order Expressibility. FOCS 1980: 74-82
1970 – 1979
- 1979
- [c2]Neil Immerman:
Length of Predicate Calculus Formulas as a New Complexity Measure. FOCS 1979: 337-347 - 1978
- [c1]Juris Hartmanis, Neil Immerman, Stephen R. Mahaney:
One-Way Log-Tape Reductions. FOCS 1978: 65-72
Coauthor Index
Shmuel Sagiv
aka: Mooly Sagiv
aka: Mooly Sagiv
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 22:19 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:
