default search action
John Case
Person information
- affiliation: University of Delaware, Newark, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
- [c63]Clay Woody, John Case, Dereck Kennedy, John Caddell:
Leveraging Iterative Design of Experiments to Innovate in a High-Risk Production Environment: A US Army Aviation Case Study. SysCon 2020: 1-7
2010 – 2019
- 2018
- [j67]John Case, Sanjay Jain
, Frank Stephan
Effectivity questions for Kleene's recursion theorem. Theor. Comput. Sci. 733: 55-70 (2018) - 2017
- [r2]John Case, Sanjay Jain:
Connections Between Inductive Inference and Machine Learning. Encyclopedia of Machine Learning and Data Mining 2017: 261-272 - 2016
- [j66]John Case, Michael Ralston:
Non-Obfuscated Unprovable Programs & Many Resultant Subtleties. Log. Methods Comput. Sci. 12(2) (2016) - [j65]John Case, Timo Kötzing:
Strongly non-U-shaped language learning results by general techniques. Inf. Comput. 251: 1-15 (2016) - [j64]John Case, Timo Kötzing:
Topological separations in inductive inference. Theor. Comput. Sci. 620: 33-45 (2016) - [c62]John Case, James S. Royer:
Program Size Complexity of Correction Grammars in the Ershov Hierarchy. CiE 2016: 240-250 - 2014
- [j63]John Case, Sanjay Jain, Yuh Shin Ong, Pavel Semukhin
Automatic learners with feedback queries. J. Comput. Syst. Sci. 80(4): 806-820 (2014) - 2013
- [j62]John Case, Sanjay Jain, Samuel Seah, Frank Stephan
Automatic functions, linear time and learning. Log. Methods Comput. Sci. 9(3) (2013) - [j61]John Case, Timo Kötzing:
Memory-limited non-U-shaped learning with solved open problems. Theor. Comput. Sci. 473: 100-123 (2013) - [j60]Lorenzo Carlucci, John Case:
On the Necessity of U-Shaped Learning. Top. Cogn. Sci. 5(1): 56-88 (2013) - [c61]John Case, Timo Kötzing:
Topological Separations in Inductive Inference. ALT 2013: 128-142 - [c60]John Case, Michael Ralston:
Beyond Rogers' Non-constructively Computable Function. CiE 2013: 45-54 - [c59]John Case, Sanjay Jain, Frank Stephan
Effectivity Questions for Kleene's Recursion Theorem. LFCS 2013: 89-103 - 2012
- [j59]John Case, Sanjay Jain, Trong Dao Le, Yuh Shin Ong, Pavel Semukhin
Automatic learning of subclasses of pattern languages. Inf. Comput. 218: 17-35 (2012) - [j58]John Case, Timo Kötzing:
Learning secrets interactively. Dynamic modeling in inductive inference. Inf. Comput. 220: 60-73 (2012) - [j57]John Case:
Algorithmic Scientific Inference: Within Our Computable Expected Reality? Int. J. Unconv. Comput. 8(3): 192-206 (2012) - [j56]John Case, Samuel E. Moelius:
Program Self-Reference in Constructive Scott Subdomains. Theory Comput. Syst. 51(1): 22-49 (2012) - [c58]John Case, Sanjay Jain, Samuel Seah, Frank Stephan
Automatic Functions, Linear Time and Learning. CiE 2012: 96-106 - 2011
- [j55]John Case, Samuel E. Moelius:
Properties Complementary to Program Self-Reference. Fundam. Informaticae 111(3): 281-311 (2011) - [j54]John Case, Samuel E. Moelius:
Optimal language learning from positive data. Inf. Comput. 209(10): 1293-1311 (2011) - [j53]John Case, Sanjay Jain:
Rice and Rice-Shapiro Theorems for transfinite correction grammars. Math. Log. Q. 57(5): 504-516 (2011) - [c57]John Case, Sanjay Jain, Yuh Shin Ong, Pavel Semukhin
Automatic Learners with Feedback Queries. CiE 2011: 31-40 - [c56]John Case, Sanjay Jain, Trong Dao Le, Yuh Shin Ong, Pavel Semukhin
Automatic Learning of Subclasses of Pattern Languages. LATA 2011: 192-203 - [c55]John Case, Timo Kötzing:
Measuring Learning Complexity with Criteria Epitomizers. STACS 2011: 320-331 - 2010
- [j52]Leonor Becerra-Bonache, John Case, Sanjay Jain, Frank Stephan
Iterative learning of simple external contextual languages. Theor. Comput. Sci. 411(29-30): 2741-2756 (2010) - [c54]John Case, Timo Kötzing:
Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations. ALT 2010: 285-299 - [c53]John Case, Timo Kötzing:
Strongly Non-U-Shaped Learning Results by General Techniques. COLT 2010: 181-193 - [r1]John Case, Sanjay Jain:
Connections Between Inductive Inference and Machine Learning. Encyclopedia of Machine Learning 2010: 210-219
2000 – 2009
- 2009
- [j51]Lorenzo Carlucci, John Case, Sanjay Jain:
Learning correction grammars. J. Symb. Log. 74(2): 489-516 (2009) - [j50]John Case, Samuel E. Moelius:
Characterizing Programming Systems Allowing Program Self-Reference. Theory Comput. Syst. 45(4): 756-772 (2009) - [j49]John Case:
Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems. Theory Comput. Syst. 45(4): 773-786 (2009) - [j48]John Case, Samuel E. Moelius:
Parallelism increases iterative learning power. Theor. Comput. Sci. 410(19): 1863-1875 (2009) - [c52]John Case, Timo Kötzing:
Difficulties in Forcing Fairness of Polynomial Time Inductive Inference. ALT 2009: 263-277 - [c51]John Case, Samuel E. Moelius:
Program Self-reference in Constructive Scott Subdomains. CiE 2009: 89-98 - [c50]John Case, Samuel E. Moelius:
Independence Results for n-Ary Recursion Theorems. FCT 2009: 38-49 - 2008
- [j47]Ganesh Baliga
When unlearning helps. Inf. Comput. 206(5): 694-709 (2008) - [j46]Lorenzo Carlucci, John Case, Sanjay Jain, Frank Stephan
Non-U-shaped vacillatory and team learning. J. Comput. Syst. Sci. 74(4): 409-430 (2008) - [j45]John Case, Samuel E. Moelius:
U-shaped, iterative, and iterative-with-counter learning. Mach. Learn. 72(1-2): 63-88 (2008) - [j44]John Case, Takeshi Shinohara, Thomas Zeugmann, Sandra Zilles:
Foreword. Theor. Comput. Sci. 397(1-3): 1-3 (2008) - [c49]Leonor Becerra-Bonache, John Case, Sanjay Jain, Frank Stephan
Iterative Learning of Simple External Contextual Languages. ALT 2008: 359-373 - [c48]John Case, Timo Kötzing:
Dynamically Delayed Postdictive Completeness and Consistency in Learning. ALT 2008: 389-403 - [c47]John Case, Timo Kötzing:
Dynamic Modeling in Inductive Inference. ALT 2008: 404-418 - [c46]John Case, Samuel E. Moelius:
Optimal Language Learning. ALT 2008: 419-433 - 2007
- [j43]Lorenzo Carlucci, John Case, Sanjay Jain, Frank Stephan
Results on memory-limited U-shaped learning. Inf. Comput. 205(10): 1551-1573 (2007) - [j42]Shai Ben-David, John Case, Thomas Zeugmann:
Foreword. Theor. Comput. Sci. 382(3): 167-169 (2007) - [c45]John Case, Timo Kötzing, Todd Paddock:
Feasible Iteration of Feasible Learning Functionals. ALT 2007: 34-48 - [c44]John Case, Samuel E. Moelius:
Parallelism Increases Iterative Learning Power. ALT 2007: 49-63 - [c43]John Case:
Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems. CiE 2007: 115-124 - [c42]John Case, Samuel E. Moelius:
Characterizing Programming Systems Allowing Program Self-reference. CiE 2007: 125-134 - [c41]John Case, Samuel E. Moelius:
U-Shaped, Iterative, and Iterative-with-Counter Learning. COLT 2007: 172-186 - [c40]Lorenzo Carlucci, John Case, Sanjay Jain:
Learning Correction Grammars. COLT 2007: 203-217 - [c39]John Case, Samuel E. Moelius:
Properties Complementary to Program Self-reference. MFCS 2007: 253-263 - [c38]John Case, Samuel E. Moelius:
Cautious virus detection in the extreme. PLAS 2007: 47-52 - 2006
- [j41]John Case, Keh-Jiann Chen, Sanjay Jain, Wolfgang Merkle, James S. Royer:
Generality's price: Inescapable deficiencies in machine-learned programs. Ann. Pure Appl. Log. 139(1-3): 303-326 (2006) - [j40]John Case, Sanjay Jain, Eric Martin, Arun Sharma
Identifying Clusters from Positive Data. SIAM J. Comput. 36(1): 28-55 (2006) - [j39]John Case, Sanjay Jain, Rüdiger Reischuk, Frank Stephan
Learning a subclass of regular patterns in polynomial time. Theor. Comput. Sci. 364(1): 115-131 (2006) - [c37]Lorenzo Carlucci, John Case, Sanjay Jain, Frank Stephan:
Memory-Limited U-Shaped Learning. COLT 2006: 244-258 - 2005
- [j38]John Case, Sanjay Jain, Franco Montagna, Giulia Simi, Andrea Sorbi:
On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms. J. Comput. Syst. Sci. 71(3): 308-332 (2005) - [c36]Lorenzo Carlucci, John Case, Sanjay Jain, Frank Stephan
Non U-Shaped Vacillatory and Team Learning. ALT 2005: 241-255 - 2004
- [j37]John Case, Efim B. Kinber, Arun Sharma
On the classification of recursive languages. Inf. Comput. 192(1): 15-40 (2004) - [j36]John Case, Sanjay Jain, Frank Stephan
Robust learning--rich and poor. J. Comput. Syst. Sci. 69(2): 123-165 (2004) - [j35]Andris Ambainis, John Case, Sanjay Jain, Mandayam Suraj:
Parsimony hierarchies for inductive inference. J. Symb. Log. 69(1): 287-327 (2004) - [j34]John Case:
Off-Loading Memory to the Environment: A Quantitative Example. Minds Mach. 14(3): 387-389 (2004) - [c35]John Case, Sanjay Jain, Eric Martin, Arun Sharma, Frank Stephan:
Identifying Clusters from Positive Data. ICGI 2004: 103-114 - [c34]Hsing-Kuo Pao, John Case:
Computing Entropy for Ortholog Detection. International Conference on Computational Intelligence 2004: 89-92 - [e2]Shai Ben-David, John Case, Akira Maruoka:
Algorithmic Learning Theory, 15th International Conference, ALT 2004, Padova, Italy, October 2-5, 2004, Proceedings. Lecture Notes in Computer Science 3244, Springer 2004, ISBN 978-3-540-23356-5 [contents] - [i2]John Case, Sanjay Jain, Rüdiger Reischuk, Frank Stephan, Thomas Zeugmann:
A Polynomial Time Learner for a Subclass of Regular Patterns. Electron. Colloquium Comput. Complex. TR04 (2004) - [i1]John Case, Sanjay Jain, Eric Martin, Arun Sharma, Frank Stephan:
Identifying Clusters from Positive Data. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [c33]John Case, Sanjay Jain, Rüdiger Reischuk, Frank Stephan, Thomas Zeugmann:
Learning a Subclass of Regular Patterns in Polynomial Time. ALT 2003: 234-246 - [c32]John Case, Keh-Jiann Chen, Sanjay Jain, Wolfgang Merkle, James S. Royer:
Generality's Price: Inescapable Deficiencies in Machine-Learned Programs. COLT 2003: 684-698 - [c31]John Case, Sanjay Jain, Franco Montagna, Giulia Simi, Andrea Sorbi:
On Learning to Coordinate: Random Bits Help, Insightful Normal Forms, and Competency Isomorphisms. COLT 2003: 699-713 - 2002
- [j33]John Case, Matthias Ott, Arun Sharma
Learning to Win Process-Control Games Watching Game-Masters. Inf. Comput. 174(1): 1-19 (2002) - [j32]John Case, Sanjay Jain, Mandayam Suraj:
Control structures in hypothesis spaces: the influence on learning. Theor. Comput. Sci. 270(1-2): 287-308 (2002) - 2001
- [j31]John Case, Dayanand S. Rajan, Anil M. Shende:
Lattice computers for approximating Euclidean space. J. ACM 48(1): 110-144 (2001) - [j30]John Case, Sanjay Jain:
Synthesizing Learners Tolerating Computable Noisy Data. J. Comput. Syst. Sci. 62(3): 413-441 (2001) - [j29]John Case, Keh-Jiann Chen, Sanjay Jain:
Costs of general purpose learning. Theor. Comput. Sci. 259(1-2): 455-473 (2001) - [j28]John Case, Sanjay Jain, Arun Sharma
Synthesizing noise-tolerant language learners. Theor. Comput. Sci. 261(1): 31-56 (2001) - [j27]John Case, Sanjay Jain, Susanne Kaufmann, Arun Sharma
Predictive learning models for concept drift. Theor. Comput. Sci. 268(2): 323-349 (2001) - [c30]John Case, Sanjay Jain, Frank Stephan, Rolf Wiehagen:
Robust Learning - Rich and Poor. COLT/EuroCOLT 2001: 143-159 - [c29]Ming Ouyang, John Case, Joan Burnside:
Divide and Conquer Machine Learning for a Genomics Analogy Problem (Progress Report). Discovery Science 2001: 290-303 - 2000
- [j26]John Case, Sanjay Jain, Matthias Ott, Arun Sharma
Robust Learning Aided by Context. J. Comput. Syst. Sci. 60(2): 234-257 (2000) - [j25]John Case, Sanjay Jain, Frank Stephan
Vacillatory and BC learning on noisy data. Theor. Comput. Sci. 241(1-2): 115-141 (2000) - [c28]Ganesh Baliga
Unlearning Helps. ICALP 2000: 844-855
1990 – 1999
- 1999
- [j24]Ganesh Baliga
The Synthesis of Language Learners. Inf. Comput. 152(1): 16-43 (1999) - [j23]John Case, Sanjay Jain, Steffen Lange, Thomas Zeugmann:
Incremental Concept Learning for Bounded Data Mining. Inf. Comput. 152(1): 74-110 (1999) - [j22]John Case, Mark A. Fulk:
Maximal Machine Learnable Classes. J. Comput. Syst. Sci. 58(1): 211-214 (1999) - [j21]John Case:
The Power of Vacillation in Language Learning. SIAM J. Comput. 28(6): 1941-1969 (1999) - [c27]John Case, Keh-Jiann Chen, Sanjay Jain:
Costs of General Purpose Learning. STACS 1999: 424-433 - 1998
- [c26]John Case, Matthias Ott, Arun Sharma, Frank Stephan:
Learning to Win Process-Control Games Watching Game-Masters. ALT 1998: 31-45 - [c25]John Case, Sanjay Jain:
Synthesizing Learners Tolerating Computable Noisy Data. ALT 1998: 205-219 - [c24]John Case, Sanjay Jain, Susanne Kaufmann, Arun Sharma, Frank Stephan:
Predictive Learning Models for Concept Drift. ALT 1998: 276-290 - [c23]John Case, Sanjay Jain, Matthias Ott, Arun Sharma, Frank Stephan:
Robust Learning Aided by Context. COLT 1998: 44-55 - 1997
- [j20]John Case, Susanne Kaufmann, Efim B. Kinber, Martin Kummer:
Learning Recursive Functions from Approximations. J. Comput. Syst. Sci. 55(1): 183-196 (1997) - [c22]John Case, Sanjay Jain, Arun Sharma
Synthesizing Noise-Tolerant Language Learners. ALT 1997: 228-243 - [c21]John Case, Sanjay Jain, Mandayam Suraj:
Control Structures in Hypothesis Spaces: The Influence on Learning. EuroCOLT 1997: 286-300 - [c20]John Case, Efim B. Kinber, Arun Sharma, Frank Stephan:
On the Classification of Computable Languages. STACS 1997: 225-236 - 1996
- [j19]John Case, Sanjay Jain, Arun Sharma
Machine Induction Without Revolutionary Changes in Hypothesis Size. Inf. Comput. 128(2): 73-86 (1996) - [j18]Ganesh Baliga
Learnability: Admissible, Co-Finite, and Hypersimple Languages. J. Comput. Syst. Sci. 53(1): 26-32 (1996) - [j17]John Case, Sanjay Jain, Arun Sharma:
Anomalous Learning Helps Succinctness. Theor. Comput. Sci. 164(1&2): 13-28 (1996) - [c19]John Case, Sanjay Jain, Frank Stephan:
Vacillatory and BC Learning on Noisy Data. ALT 1996: 285-298 - [c18]Ganesh Baliga
Synthesizing Enumeration Techniques for Language Learning. COLT 1996: 169-180 - 1995
- [j16]John Case, Sanjay Jain, Arun Sharma
Complexity Issues for Vacillatory Function Identification. Inf. Comput. 116(2): 174-192 (1995) - [j15]Ganesh Baliga, John Case, Sanjay Jain:
Language Learning with Some Negative Information. J. Comput. Syst. Sci. 51(2): 273-285 (1995) - [c17]John Case, Sanjay Jain, Arun Sharma:
Machine Induction Without Revolutionary Paradigm Shifts. ALT 1995: 153-168 - [c16]John Case, Susanne Kaufmann, Efim B. Kinber, Martin Kummer:
Learning recursive functions from approximations. EuroCOLT 1995: 140-153 - [c15]John Case, Mandayam Suraj, Sanjay Jain:
Not-So-Nearly-Minimal-Size Program Inference. GOSLER Final Report 1995: 76-95 - 1994
- [b1]James S. Royer, John Case:
Subrecursive programming systems - complexity and succinctness. Progress in theoretical computer science, Birkhäuser 1994, ISBN 978-3-7643-3767-4, pp. I-VII, 1-252 - [j14]John Case, Sanjay Jain, Arun Sharma:
Vacillatory Learning of Nearly Minimal Size Grammars. J. Comput. Syst. Sci. 49(2): 189-207 (1994) - [j13]John Case:
Infinitary self-reference in learning theory. J. Exp. Theor. Artif. Intell. 6(1): 3-16 (1994) - [j12]John Case, Dayanand S. Rajan, Anil M. Shende:
Spatial/kinematic domain and lattice computers. J. Exp. Theor. Artif. Intell. 6(1): 17-40 (1994) - [j11]Ganesh Baliga
Machine Learning of Higher-Order Programs. J. Symb. Log. 59(2): 486-500 (1994) - [j10]John Case, Sanjay Jain, Suzanne Ngo Manguelle:
Refinements of inductive inference by Popperian and reliable machines. Kybernetika 30(1): 23-52 (1994) - [c14]Ganesh Baliga
Learning with Higher Order Additional Information. AII/ALT 1994: 64-75 - 1993
- [c13]Ganesh Baliga
Learnability: Admissible, Co-finite, and Hypersimple Languages. ICALP 1993: 289-300 - [c12]Ganesh Baliga
Language Learning With Some Negative Information. STACS 1993: 672-681 - 1992
- [j9]John Case, Sanjay Jain, Arun Sharma:
On Learning Limiting Programs. Int. J. Found. Comput. Sci. 3(1): 93-115 (1992) - [j8]John Case, Keh-Jiann Chen, Sanjay Jain:
Strong separation of learning classes. J. Exp. Theor. Artif. Intell. 4(4): 281-293 (1992) - [c11]John Case, Dayanand S. Rajan, Anil M. Shende:
Representing the Spatial/Kinematic Domain and Lattice Computers. AII 1992: 1-25 - [c10]John Case, Keh-Jiann Chen, Sanjay Jain:
Strong Separation of Learning Classes. AII 1992: 129-139 - [c9]John Case, Sanjay Jain, Arun Sharma:
On Learning Limiting Programs. COLT 1992: 193-202 - [c8]Ganesh Baliga
Machine Learning of Higher Order Programs. LFCS 1992: 9-20 - 1991
- [j7]John Case:
Effectivizing Inseparability. Math. Log. Q. 37(7): 97-111 (1991) - [c7]John Case, Sanjay Jain, Arun Sharma:
Complexity Issues for Vacillatory Function Identification. FSTTCS 1991: 121-140 - 1990
- [c6]John Case, Sanjay Jain, Arun Sharma:
Anomalous Learning Helps Succinctness (Extended Abstract). ALT 1990: 282-288 - [c5]John Case, Dayanand S. Rajan, Anil M. Shende:
Optimally Representing Euclidean Space Discretely for Analogically Simulating Physical Phenomena. FSTTCS 1990: 190-203 - [e1]Mark A. Fulk, John Case:
Proceedings of the Third Annual Workshop on Computational Learning Theory, COLT 1990, University of Rochester, Rochester, NY, USA, August 6-8, 1990. Morgan Kaufmann 1990, ISBN 1-55860-146-5 [contents]
1980 – 1989
- 1989
- [c4]Sanjay Jain, Arun Sharma, John Case:
Convergence to Nearly Minimal Size Grammars by Vacillating Learning Machines. COLT 1989: 189-199 - 1988
- [c3]John Case:
The Power of Vacillation. COLT 1988: 196-205 - 1983
- [j6]John Case:
Pseudo-Extending Computable Functions. Inf. Control. 56(1/2): 100-111 (1983) - [j5]John Case, Carl Smith:
Comparison of Identification Criteria for Machine Inductive Inference. Theor. Comput. Sci. 25: 193-220 (1983) - 1982
- [c2]John Case, Christopher Lynes:
Machine Inductive Inference and Language Identification. ICALP 1982: 107-115
1970 – 1979
- 1978
- [j4]Dan Moore, John Case:
The Complexity of Total Order Structures. J. Comput. Syst. Sci. 17(2): 253-269 (1978) - [c1]John Case, Carl Smith:
Anomaly Hierarchies of Mechanized Inductive Inference. STOC 1978: 314-319 - 1976
- [j3]John Case:
Sortability and Extensibility of the Graphs of Recursively Enumerable Partial and Total Orders. Math. Log. Q. 22(1): 1-18 (1976) - 1974
- [j2]John Case:
Periodicity in Generations of Automata. Math. Syst. Theory 8(1): 15-32 (1974) - 1971
- [j1]John Case:
A Note on Degrees of Self-Describing Turing Machines. J. ACM 18(2): 329-338 (1971)
Coauthor Index
[j67] [r2] [j63] [j62] [c59] [j59] [c58] [j53] [c57] [c56] [j52] [r1] [j51] [j46] [c49] [j43] [c40] [j41] [j40] [j39] [c37] [j38] [c36] [j36] [j35] [c35] [i2] [i1] [c33] [c32] [c31] [j32] [j30] [j29] [j28] [j27] [c30] [j26] [j25] [j24] [j23] [c27] [c25] [c24] [c23] [c22] [c21] [j19] [j17] [c19] [c18] [j16] [j15] [c17] [c15] [j14] [j11] [j10] [c12] [j9] [j8] [c10] [c9] [c8] [c7] [c6] [c4]
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-04-24 22:48 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: