default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYanhong A. Liu
Yanhong Annie Liu – Y. Annie Liu
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
[c71]Yanhong A. Liu, Scott D. Stoller:
Tutorial: Consensus Algorithms from Classical to Blockchain: Quickly Program, Configure, Run, and Check. ICDCSW 2024: 1-4- [c70]Yanhong A. Liu:
Incremental Computation: What Is the Essence? (Invited Contribution). PEPM 2024: 39-52 - [i23]David Scott Warren, Yanhong A. Liu:
Programming with High-Level Abstractions, Proceedings of the 3rd Workshop on Logic and Practice of Programming. CoRR abs/2409.19211 (2024) - 2023
- [j21]Yanhong A. Liu
, Scott D. Stoller, Yi Tong, Bo Lin:
Integrating Logic Rules with Everything Else, Seamlessly. Theory Pract. Log. Program. 23(4): 678-695 (2023) - [c69]Kumar Shivam, Vishnu Paladugu, Yanhong A. Liu:
Specification and Runtime Checking of Derecho, A Protocol for Fast Replication for Cloud Services. ApPLIED@PODC 2023: 12:1-12:10 - [c68]Yanhong A. Liu, Scott D. Stoller, Yi Tong, K. Tuncay Tekle:
Benchmarking for Integrating Logic Rules with Everything Else. ICLP 2023: 12-26 - [e5]Yanhong Annie Liu, Elad Michael Schiller:
Proceedings of the 5th workshop on Advanced tools, programming languages, and PLatforms for Implementing and Evaluating algorithms for Distributed systems, ApPLIED 2023, Orlando, FL, USA, 19 June 2023. ACM 2023 [contents] - [i22]Kumar Shivam, Vishnu Paladugu, Yanhong A. Liu:
Specification and Runtime Checking of Derecho, A Protocol for Fast Replication for Cloud Services. CoRR abs/2305.12040 (2023) - [i21]Yanhong A. Liu, Scott D. Stoller, Yi Tong, Bo Lin:
Integrating Logic Rules with Everything Else, Seamlessly. CoRR abs/2305.19202 (2023) - [i20]Yanhong A. Liu:
Incremental Computation: What Is the Essence? CoRR abs/2312.07946 (2023) - 2022
- [j20]Yanhong A. Liu, Scott D. Stoller:
Recursive rules with aggregation: a simple unified semantics. J. Log. Comput. 32(8): 1659-1693 (2022) - [c67]Yanhong A. Liu, Scott D. Stoller:
Recursive Rules with Aggregation: A Simple Unified Semantics. LFCS 2022: 156-179 - [i19]Yanhong A. Liu, Scott D. Stoller, Yi Tong, Bo Lin, K. Tuncay Tekle:
Programming with rules and everything else, seamlessly. CoRR abs/2205.15204 (2022) - [i18]David Scott Warren, Peter Van Roy, Yanhong A. Liu:
Proceedings of the 2nd Workshop on Logic and Practice of Programming (LPOP). CoRR abs/2211.09923 (2022) - 2021
- [j19]Yanhong A. Liu, Scott D. Stoller:
Knowledge of uncertain worlds: programming with logical constraints. J. Log. Comput. 31(1): 193-212 (2021) - [j18]Alex Brik, Andrea Formisano, Yanhong Annie Liu, Joost Vennekens:
Introduction to the 37th International Conference on Logic Programming Special Issue I. Theory Pract. Log. Program. 21(5): 521-526 (2021) - [j17]Alex Brik, Andrea Formisano, Yanhong Annie Liu, Joost Vennekens:
Introduction to the 37th International Conference on Logic Programming Special Issue II. Theory Pract. Log. Program. 21(6): 698-699 (2021) - [c66]Saksham Chand, Yanhong A. Liu:
Brief Announcement: What's Live? Understanding Distributed Consensus. PODC 2021: 565-568 - [c65]Yanhong A. Liu, Matthew Castellana:
Discrete Math with Programming: A Principled Approach. SIGCSE 2021: 1156-1162 - [e4]Andrea Formisano, Yanhong Annie Liu, Bart Bogaerts, Alex Brik, Verónica Dahl, Carmine Dodaro, Paul Fodor, Gian Luca Pozzato, Joost Vennekens, Neng-Fa Zhou:
Proceedings 37th International Conference on Logic Programming (Technical Communications), ICLP Technical Communications 2021, Porto (virtual event), 20-27th September 2021. EPTCS 345, 2021 [contents] - 2020
- [j16]Yanhong A. Liu, Scott D. Stoller:
Founded semantics and constraint semantics of logic rules. J. Log. Comput. 30(8): 1609-1668 (2020) - [c64]Yanhong A. Liu, Scott D. Stoller:
Knowledge of Uncertain Worlds: Programming with Logical Constraints. LFCS 2020: 111-127 - [c63]Yanhong A. Liu, Scott D. Stoller:
Assurance of Distributed Algorithms and Systems: Runtime Checking of Safety and Liveness. RV 2020: 47-66 - [e3]Ekaterina Komendantskaya, Yanhong Annie Liu:
Practical Aspects of Declarative Languages - 22nd International Symposium, PADL 2020, New Orleans, LA, USA, January 20-21, 2020, Proceedings. Lecture Notes in Computer Science 12007, Springer 2020, ISBN 978-3-030-39196-6 [contents] - [i17]Saksham Chand, Yanhong A. Liu:
What's Live? Understanding Distributed Consensus. CoRR abs/2001.04787 (2020) - [i16]Yanhong A. Liu, Scott D. Stoller:
Recursive Rules with Aggregation: A Simple Unified Semantics. CoRR abs/2007.13053 (2020) - [i15]David Scott Warren, Yanhong A. Liu:
LPOP: Challenges and Advances in Logic and Practice of Programming. CoRR abs/2008.07901 (2020) - [i14]Yanhong A. Liu, Scott D. Stoller:
Assurance of Distributed Algorithms and Systems: Runtime Checking of Safety and Liveness. CoRR abs/2008.09735 (2020) - [i13]Yanhong A. Liu, Matthew Castellana:
Discrete Math with Programming: A Principled Approach. CoRR abs/2011.14059 (2020)
2010 – 2019
- 2019
- [c62]Christopher Kane, Bo Lin, Saksham Chand, Scott D. Stoller, Yanhong A. Liu:
High-Level Cryptographic Abstractions. PLAS@CCS 2019: 31-43 - [c61]Scott D. Stoller, Yanhong A. Liu:
Algorithm Diversity for Resilient Systems. DBSec 2019: 359-378 - [c60]Yanhong A. Liu, Scott D. Stoller:
From Classical to Blockchain Consensus: What Are the Exact Algorithms? PODC 2019: 544-545 - [c59]Yanhong A. Liu, Saksham Chand, Scott D. Stoller:
Moderately Complex Paxos Made Simple: High-Level Executable Specification of Distributed Algorithms. PPDP 2019: 15:1-15:15 - [c58]K. Tuncay Tekle, Yanhong A. Liu:
Extended Magic for Negation: Efficient Demand-Driven Evaluation of Stratified Datalog with Precise Complexity Guarantees. ICLP Technical Communications 2019: 241-254 - [i12]Scott D. Stoller, Yanhong A. Liu:
Algorithm Diversity for Resilient Systems. CoRR abs/1904.12409 (2019) - [i11]Yanhong A. Liu, Scott D. Stoller:
Knowledge of Uncertain Worlds: Programming with Logical Constraints. CoRR abs/1910.10346 (2019) - 2018
- [c57]Yanhong A. Liu, Scott D. Stoller:
Founded Semantics and Constraint Semantics of Logic Rules. LFCS 2018: 221-241 - [c56]Saksham Chand, Yanhong A. Liu:
Simpler Specifications and Easier Proofs of Distributed Algorithms Using History Variables. NFM 2018: 70-86 - [c55]Yanhong A. Liu:
Logical Clocks Are Not Fair: What Is Fair? ApPLIED@PODC 2018: 21-27 - [p2]Yanhong A. Liu:
Logic programming applications: what are the abstractions and implementations? Declarative Logic Programming 2018: 519-548 - [e2]Michael Kifer, Yanhong Annie Liu:
Declarative Logic Programming: Theory, Systems, and Applications. ACM Books 20, ACM / Morgan & Claypool 2018, ISBN 978-1-97000-199-0 [contents] - [i10]Yanhong A. Liu:
Logic Programming Applications: What Are the Abstractions and Implementations? CoRR abs/1802.07284 (2018) - [i9]Saksham Chand, Yanhong A. Liu:
Simpler Specifications and Easier Proofs of Distributed Algorithms Using History Variables. CoRR abs/1802.09687 (2018) - [i8]Christopher Kane, Bo Lin, Saksham Chand, Yanhong A. Liu:
High-level Cryptographic Abstractions. CoRR abs/1810.09065 (2018) - 2017
- [j15]Yanhong A. Liu, Scott D. Stoller, Bo Lin:
From Clarity to Efficiency for Distributed Algorithms. ACM Trans. Program. Lang. Syst. 39(3): 12:1-12:41 (2017) - [i7]Yanhong A. Liu, Saksham Chand, Scott D. Stoller:
Moderately Complex Paxos Made Simple: High-Level Specification of Distributed Algorithm. CoRR abs/1704.00082 (2017) - [i6]David Scott Warren, Yanhong A. Liu:
AppLP: A Dialogue on Applications of Logic Programming. CoRR abs/1704.02375 (2017) - 2016
- [j14]K. Tuncay Tekle, Yanhong A. Liu:
Precise complexity guarantees for pointer analysis via Datalog with extensions. Theory Pract. Log. Program. 16(5-6): 916-932 (2016) - [c54]Saksham Chand, Yanhong A. Liu, Scott D. Stoller:
Formal Verification of Multi-Paxos for Distributed Consensus. FM 2016: 119-136 - [c53]Jon Brandvein, Yanhong A. Liu:
Removing runtime overhead for optimized object queries. PEPM 2016: 73-84 - [c52]Yanhong A. Liu, Jon Brandvein, Scott D. Stoller, Bo Lin:
Demand-driven incremental object queries. PPDP 2016: 228-241 - [i5]Saksham Chand, Yanhong A. Liu, Scott D. Stoller:
Formal Verification of Multi-Paxos for Distributed Consensus. CoRR abs/1606.01387 (2016) - [i4]Yanhong A. Liu, Scott D. Stoller:
The Founded Semantics and Constraint Semantics of Logic Rules. CoRR abs/1606.06269 (2016) - [i3]K. Tuncay Tekle, Yanhong A. Liu:
Precise Complexity Guarantees for Pointer Analysis via Datalog with Extensions. CoRR abs/1608.01594 (2016) - 2015
- [i2]Yanhong A. Liu, Jon Brandvein, Scott D. Stoller, Bo Lin:
Demand-Driven Incremental Object Queries. CoRR abs/1511.04583 (2015) - 2014
- [i1]Yanhong A. Liu, Scott D. Stoller, Bo Lin:
From Clarity to Efficiency for Distributed Algorithms. CoRR abs/1412.8461 (2014) - 2013
- [j13]Yang Liu, Wei Chen, Yanhong A. Liu, Jun Sun, Shao Jie Zhang, Jin Song Dong:
Verifying Linearizability via Optimized Refinement Checking. IEEE Trans. Software Eng. 39(7): 1018-1039 (2013) - 2012
- [c51]Yanhong A. Liu, Scott D. Stoller, Bo Lin, Michael Gorbovitski:
From clarity to efficiency for distributed algorithms. OOPSLA 2012: 395-410 - [c50]Michael Gorbovitski, Yanhong A. Liu, Scott D. Stoller, Tom Rothamel:
Composing transformations for instrumentation and optimization. PEPM 2012: 53-62 - [c49]Yanhong A. Liu, Scott D. Stoller, Bo Lin:
High-Level Executable Specifications of Distributed Algorithms. SSS 2012: 95-110 - 2011
- [c48]K. Tuncay Tekle, Yanhong A. Liu:
More efficient datalog queries: subsumptive tabling beats magic sets. SIGMOD Conference 2011: 661-672 - 2010
- [c47]Michael Gorbovitski, Yanhong A. Liu, Scott D. Stoller, Tom Rothamel, K. Tuncay Tekle:
Alias analysis for optimization of dynamic languages. DLS 2010: 27-42 - [c46]K. Tuncay Tekle, Michael Gorbovitski, Yanhong A. Liu:
Graph queries through datalog optimizations. PPDP 2010: 25-34 - [c45]K. Tuncay Tekle, Yanhong A. Liu:
Precise complexity analysis for efficient datalog queries. PPDP 2010: 35-44
2000 – 2009
- 2009
- [j12]Yanhong A. Liu, Scott D. Stoller:
From datalog rules to efficient programs with time and space guarantees. ACM Trans. Program. Lang. Syst. 31(6): 21:1-21:38 (2009) - [c44]Yang Liu, Wei Chen, Yanhong A. Liu, Jun Sun:
Model Checking Linearizability via Refinement. FM 2009: 321-337 - [c43]Yanhong A. Liu, Michael Gorbovitski, Scott D. Stoller:
A language and framework for invariant-driven transformations. GPCE 2009: 55-64 - [c42]Shao Jie Zhang, Yang Liu, Jun Sun, Jin Song Dong, Wei Chen, Yanhong A. Liu:
Formal Verification of Scalable NonZero Indicators. SEKE 2009: 406-411 - 2008
- [c41]K. Tuncay Tekle, Katia Hristova, Yanhong A. Liu:
Generating Specialized Rules and Programs for Demand-Driven Analysis. AMAST 2008: 346-361 - [c40]Tom Rothamel, Yanhong A. Liu:
Generating incremental implementations of object-set queries. GPCE 2008: 55-66 - [c39]Michael Gorbovitski, Tom Rothamel, Yanhong A. Liu, Scott D. Stoller:
Efficient runtime invariant checking: a framework and case study. WODA 2008: 43-49 - [c38]Michael Gorbovitski, K. Tuncay Tekle, Tom Rothamel, Scott D. Stoller, Yanhong A. Liu:
Analysis and Transformations for Efficient Query-Based Debugging. SCAM 2008: 174-183 - [p1]Yanhong A. Liu, Jeffrey J. P. Tsai:
System Monitoring. Wiley Encyclopedia of Computer Science and Engineering 2008 - 2007
- [c37]Tom Rothamel, Yanhong A. Liu:
Efficient implementation of tuple pattern based retrieval. PEPM 2007: 81-90 - [c36]Katia Hristova, K. Tuncay Tekle, Yanhong A. Liu:
Efficient trust management policy analysis from rules. PPDP 2007: 211-220 - 2006
- [c35]Tom Rothamel, Yanhong A. Liu, Constance L. Heitmeyer, Elizabeth I. Leonard:
Generating optimized code from SCR specifications. LCTES 2006: 135-144 - [c34]Yanhong A. Liu, Scott D. Stoller:
Querying Complex Graphs. PADL 2006: 199-214 - [c33]Yanhong A. Liu, Chen Wang, Michael Gorbovitski, Tom Rothamel, Yongxi Cheng, Yingchao Zhao, Jing Zhang:
Core role-based access control: efficient implementations by transformations. PEPM 2006: 112-120 - [c32]Katia Hristova, Tom Rothamel, Yanhong A. Liu, Scott D. Stoller:
Efficient type inference for secure information flow. PLAS 2006: 85-94 - [c31]Katia Hristova, Yanhong A. Liu:
Improved Algorithm Complexities for Linear Temporal Logic Model Checking of Pushdown Systems. VMCAI 2006: 190-206 - 2005
- [j11]Yanhong A. Liu, Scott D. Stoller, Ning Li, Tom Rothamel:
Optimizing aggregate array computations in loops. ACM Trans. Program. Lang. Syst. 27(1): 91-125 (2005) - [c30]Michael Gorbovitski, Tom Rothamel, Yanhong A. Liu, Scott D. Stoller:
Implementing incrementalization across object abstraction. OOPSLA Companion 2005: 112-113 - [c29]Yanhong A. Liu, Scott D. Stoller, Michael Gorbovitski, Tom Rothamel, Yanni Ellen Liu:
Incrementalization across object abstraction. OOPSLA 2005: 473-486 - 2004
- [c28]Yanhong A. Liu, Tom Rothamel, Fuxiang Yu, Scott D. Stoller, Nanjun Hu:
Parametric regular path queries. PLDI 2004: 219-230 - 2003
- [j10]Yanhong A. Liu, Scott D. Stoller:
Dynamic Programming via Static Incrementalization. High. Order Symb. Comput. 16(1-2): 37-62 (2003) - [j9]Yanhong A. Liu, Scott D. Stoller:
Eliminating dead code on recursive data. Sci. Comput. Program. 47(2-3): 221-242 (2003) - [j8]Steven D. Johnson, Yanhong A. Liu, Yuchen Zhang:
A systematic incrementalization technique and its application to hardware design. Int. J. Softw. Tools Technol. Transf. 4(2): 211-223 (2003) - [c27]Yanhong A. Liu, Scott D. Stoller:
Optimizing Ackermann's function by incrementalization. PEPM 2003: 85-91 - [c26]Yanhong A. Liu, Scott D. Stoller:
From datalog rules to efficient programs with time and space guarantees. PPDP 2003: 172-183 - [c25]Leena Unnikrishnan, Scott D. Stoller, Yanhong A. Liu:
Optimized Live Heap Bound Analysis. VMCAI 2003: 70-85 - [c24]Yanhong A. Liu:
Iterate, Incrementalize, and Implement: A systematic approach to efficiency improvement and guarantees. ICC@LICS 2003: 45-47 - 2002
- [c23]Yanhong A. Liu, Fuxiang Yu:
Solving Regular Path Queries. MPC 2002: 195-208 - [c22]Gustavo Gomez, Yanhong A. Liu:
Automatic time-bound analysis for a higher-order language. PEPM 2002: 75-86 - [c21]Yanhong A. Liu, Scott D. Stoller:
Program optimization using indexed and recursive data structures. PEPM 2002: 108-118 - [c20]Radu Grosu, Erez Zadok, Scott A. Smolka, Rance Cleaveland, Yanhong A. Liu:
High-confidence operating systems. ACM SIGOPS European Workshop 2002: 205-208 - 2001
- [j7]Yanhong A. Liu, Scott D. Stoller, Tim Teitelbaum:
Strengthening invariants for efficient computation. Sci. Comput. Program. 41(2): 139-172 (2001) - [j6]Yanhong A. Liu, Gustavo Gomez:
Automatic Accurate Cost-Bound Analysis for High-Level Languages. IEEE Trans. Computers 50(12): 1295-1309 (2001) - [c19]Radu Grosu, Yanhong A. Liu, Scott A. Smolka, Scott D. Stoller, Jingyu Yan:
Automated Software Engineering Using Concurrent Class Machines. ASE 2001: 297- - [c18]Leena Unnikrishnan, Scott D. Stoller, Yanhong A. Liu:
Automatic Accurate Live Memory Analysis for Garbage-Collected Languages. LCTES/OM 2001: 102-111 - [c17]Leena Unnikrishnan, Scott D. Stoller, Yanhong A. Liu:
Automatic Accurate Live Memory Analysis for Garbage-Collected Languages. OM@PLDI 2001: 102-111 - [c16]Yanhong A. Liu, Ning Li, Scott D. Stoller:
Solving Regular Tree Grammar Based Constraints. SAS 2001: 213-233 - [c15]Scott D. Stoller, Yanhong A. Liu:
Transformations for Model Checking Distributed Java Programs. SPIN 2001: 192-199 - 2000
- [j5]Yanhong A. Liu:
Efficiency by Incrementalization: An Introduction. High. Order Symb. Comput. 13(4): 289-313 (2000) - [j4]Deepak Goyal, Y. Annie Liu:
Automated development of software for program analysis and transformation. ACM SIGSOFT Softw. Eng. Notes 25(1): 52-53 (2000) - [c14]Scott D. Stoller, Leena Unnikrishnan, Yanhong A. Liu:
Efficient Detection of Global Properties in Distributed Systems Using Partial-Order Methods. CAV 2000: 264-279 - [c13]Yanhong A. Liu, Scott D. Stoller:
From Recursion to Iteration: What are the Optimizations? PEPM 2000: 73-82
1990 – 1999
- 1999
- [j3]Yanhong A. Liu, Scott D. Stoller:
ETAPS '99 - Conference Report. ACM SIGPLAN Notices 34(6): 16-17 (1999) - [c12]Steven D. Johnson, Yanhong A. Liu, Yuchen Zhang:
A Systematic Incrementalization Technique and Its Application to Hardware Design. CHARME 1999: 334-337 - [c11]Yanhong A. Liu, Scott D. Stoller:
Dynamic Programming via Static Incrementalization. ESOP 1999: 288-305 - [c10]Yanhong A. Liu, Scott D. Stoller:
Eliminating Dead Code on Recursive Data. SAS 1999: 211-231 - [e1]Y. Annie Liu, Reinhard Wilhelm:
Proceedings of the ACM SIGPLAN 1999 Workshop on Languages, Compilers, and Tools for Embedded Systems (LCTES'99), Atlanta, Georgia, USA, May 5, 1999. ACM 1999, ISBN 1-58113-136-4 [contents] - 1998
- [j2]Yanhong A. Liu, Scott D. Stoller, Tim Teitelbaum:
Static Caching for Incremental Computation. ACM Trans. Program. Lang. Syst. 20(3): 546-585 (1998) - [c9]Scott D. Stoller, Yanhong A. Liu:
Efficient Symbolic Detection of Global Properties in Distributed Systems. CAV 1998: 357-368 - [c8]Yanhong A. Liu:
Dependence Analysis for Recursive Data. ICCL 1998: 206-215 - [c7]Yanhong A. Liu, Scott D. Stoller:
Loop Optimization for Aggregate Array Computations. ICCL 1998: 262-271 - [c6]Yuchen Zhang, Yanhong A. Liu:
Automating Derivation of Incremental Programs. ICFP 1998: 350 - [c5]Yanhong A. Liu, Gustavo Gomez:
Automatic Accurate Time-Bound Analysis for High-Level Languages. LCTES 1998: 31-40 - 1997
- [c4]Yanhong A. Liu:
Principled strength reduction. Algorithmic Languages and Calculi 1997: 357-381 - 1996
- [c3]Yanhong A. Liu, Scott D. Stoller, Tim Teitelbaum:
Discovering Auxiliary Information for Incremental Computation. POPL 1996: 157-170 - 1995
- [j1]Yanhong A. Liu, Tim Teitelbaum:
Systematic Derivation of Incremental Programs. Sci. Comput. Program. 24(1): 1-39 (1995) - [c2]Yanhong A. Liu:
CACHET: An Interactive, Incremental-Attribution-Based Program Transformation System for Deriving Incremental Programs. KBSE 1995: 19-26 - [c1]Yanhong A. Liu, Tim Teitelbaum:
Caching Intermediate Results for Program Improvement. PEPM 1995: 190-201
Coauthor Index
[c71] [j21] [c68] [i21] [j20] [c67] [i19] [j19] [j16] [c64] [c63] [i16] [i14] [c62] [c61] [c60] [c59] [i12] [i11] [c57] [j15] [i7] [c54] [c52] [i5] [i4] [i2] [i1] [c51] [c50] [c49] [c47] [j12] [c43] [c39] [c38] [c34] [c32] [j11] [c30] [c29] [c28] [j10] [j9] [c27] [c26] [c25] [c21] [j7] [c19] [c18] [c17] [c16] [c15] [c14] [c13] [j3] [c11] [c10] [j2] [c9] [c7] [c3]
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-18 19:28 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:
