default search action
Loris D'Antoni
Person information
- affiliation: University of California-San Diego, CA, USA
- affiliation (former): University of Wisconsin-Madison, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j21]Shaan Nagy
, Jinwoo Kim
Automating Unrealizability Logic: Hoare-Style Proof Synthesis for Infinite Sets of Programs. Proc. ACM Program. Lang. 8(OOPSLA2): 113-139 (2024) - [j20]Jiangyi Liu
Synthesizing Formal Semantics from Executable Interpreters. Proc. ACM Program. Lang. 8(OOPSLA2): 362-388 (2024) - [j19]Loris D'Antoni
Automatically Reducing Privilege for Access Control Policies. Proc. ACM Program. Lang. 8(OOPSLA2): 763-790 (2024) - [j18]Keith J. C. Johnson
Automating Pruning in Top-Down Enumeration for Program Synthesis Problems with Monotonic Semantics. Proc. ACM Program. Lang. 8(OOPSLA2): 935-961 (2024) - [j17]Brian Chang
Learned load balancing. Theor. Comput. Sci. 1003: 114611 (2024) - [c60]Keith J. C. Johnson, Andrew Reynolds, Thomas W. Reps, Loris D'Antoni:
The SemGuS Toolkit. CAV (3) 2024: 27-40 - [i45]Shaan Nagy, Jinwoo Kim, Loris D'Antoni, Thomas W. Reps:
Automating Unrealizability Logic: Hoare-style Proof Synthesis for Infinite Sets of Programs. CoRR abs/2401.13244 (2024) - [i44]Anna P. Meyer, Yuhao Zhang, Aws Albarghouthi, Loris D'Antoni:
Verified Training for Counterfactual Explanation Robustness under Data Shift. CoRR abs/2403.03773 (2024) - [i43]Yuhao Zhang, Aws Albarghouthi, Loris D'Antoni:
A One-Layer Decoder-Only Transformer is a Two-Layer RNN: With an Application to Certified Robustness. CoRR abs/2405.17361 (2024) - [i42]Kanghee Park, Jiayu Wang, Taylor Berg-Kirkpatrick, Nadia Polikarpova, Loris D'Antoni:
Grammar-Aligned Decoding. CoRR abs/2405.21047 (2024) - [i41]Keith J. C. Johnson, Andrew Reynolds, Thomas W. Reps, Loris D'Antoni:
The SemGuS Toolkit. CoRR abs/2406.01792 (2024) - [i40]Kanghee Park, Xuanyu Peng, Loris D'Antoni:
LOUD: Synthesizing Strongest and Weakest Specifications. CoRR abs/2408.12539 (2024) - [i39]Jiangyi Liu, Charlie Murphy, Anvay Grover, Keith J. C. Johnson, Thomas W. Reps, Loris D'Antoni:
Synthesizing Formal Semantics from Executable Interpreters. CoRR abs/2408.14668 (2024) - [i38]Charlie Murphy, Keith J. C. Johnson, Thomas W. Reps, Loris D'Antoni:
Verifying Solutions to Semantics-Guided Synthesis Problems. CoRR abs/2408.15475 (2024) - [i37]Keith J. C. Johnson, Rahul Krishnan, Thomas W. Reps, Loris D'Antoni:
Automating Pruning in Top-Down Enumeration for Program Synthesis Problems with Monotonic Semantics. CoRR abs/2408.15822 (2024) - [i36]Anna P. Meyer, Yea-Seul Kim, Aws Albarghouthi, Loris D'Antoni:
Perceptions of the Fairness Impacts of Multiplicity in Machine Learning. CoRR abs/2409.12332 (2024) - [i35]Jinwoo Kim, Shaan Nagy, Thomas W. Reps, Loris D'Antoni:
Semantics of Sets of Programs. CoRR abs/2410.16102 (2024) - 2023
- [j16]Samuel Drews, Aws Albarghouthi, Loris D'Antoni:
Proving Data-Poisoning Robustness in Decision Trees. Commun. ACM 66(2): 105-113 (2023) - [j15]Kanghee Park
Synthesizing Specifications. Proc. ACM Program. Lang. 7(OOPSLA2): 1787-1816 (2023) - [j14]Jinwoo Kim
Unrealizability Logic. Proc. ACM Program. Lang. 7(POPL): 659-688 (2023) - [c59]Anna P. Meyer
The Dataset Multiplicity Problem: How Unreliable Data Impacts Predictions. FAccT 2023: 193-204 - [c58]Kanghee Park, Keith J. C. Johnson, Loris D'Antoni, Thomas W. Reps:
Modular System Synthesis. FMCAD 2023: 257-267 - [c57]Brian Chang
Learned Load Balancing. ICDCN 2023: 177-187 - [c56]Loris D'Antoni:
Verifying Infinitely Many Programs at Once. SAS 2023: 3-9 - [i34]Kanghee Park, Loris D'Antoni, Thomas W. Reps:
Synthesizing Specifications. CoRR abs/2301.11117 (2023) - [i33]Yuhao Zhang, Aws Albarghouthi, Loris D'Antoni:
PECAN: A Deterministic Certified Defense Against Backdoor Attacks. CoRR abs/2301.11824 (2023) - [i32]Anna P. Meyer, Aws Albarghouthi, Loris D'Antoni:
The Dataset Multiplicity Problem: How Unreliable Data Impacts Predictions. CoRR abs/2304.10655 (2023) - [i31]Kanghee Park, Keith J. C. Johnson, Loris D'Antoni, Thomas W. Reps:
Modular System Synthesis. CoRR abs/2308.06956 (2023) - 2022
- [j13]Pankaj Kumar Kalita
Synthesizing abstract transformers. Proc. ACM Program. Lang. 6(OOPSLA2): 1291-1319 (2022) - [j12]Qinheping Hu
Solving Program Sketches with Large Integer Values. ACM Trans. Program. Lang. Syst. 44(2): 9:1-9:28 (2022) - [c55]Anvay Grover, Ruediger Ehlers, Loris D'Antoni:
Synthesizing Transducers from Complex Specifications. FMCAD 2022: 294-303 - [c54]Yuhao Zhang, Aws Albarghouthi, Loris D'Antoni:
BagFlip: A Certified Defense Against Data Poisoning. NeurIPS 2022 - [c53]Karuna Grewal, Loris D'Antoni, Justin Hsu:
P4BID: information flow control in p4. PLDI 2022: 46-60 - [d2]Pankaj Kumar Kalita
Synthesizing Abstract Transformers. Version 1.0. Zenodo, 2022 [all versions] - [d1]Pankaj Kumar Kalita
Synthesizing Abstract Transformers. Version 1.0. Zenodo, 2022 [all versions] - [i30]Tiago Ferreira, Harrison Brewton, Loris D'Antoni, Alexandra Silva:
Prognosis: Closed-Box Analysis of Network Protocol Implementations. CoRR abs/2201.02577 (2022) - [i29]Karuna Grewal, Loris D'Antoni, Justin Hsu:
P4BID: Information Flow Control in P4. CoRR abs/2204.03113 (2022) - [i28]Yuhao Zhang, Aws Albarghouthi, Loris D'Antoni:
BagFlip: A Certified Defense against Data Poisoning. CoRR abs/2205.13634 (2022) - [i27]Anna P. Meyer, Aws Albarghouthi, Loris D'Antoni:
Certifying Data-Bias Robustness in Linear Regression. CoRR abs/2206.03575 (2022) - [i26]Anvay Grover, Rüdiger Ehlers, Loris D'Antoni:
Synthesizing Transducers from Complex Specifications. CoRR abs/2208.05131 (2022) - [i25]Jinwoo Kim, Loris D'Antoni, Thomas W. Reps:
Unrealizability Logic. CoRR abs/2211.07117 (2022) - 2021
- [j11]Loris D'Antoni, Margus Veanes:
Automata modulo theories. Commun. ACM 64(5): 86-95 (2021) - [j10]Jinwoo Kim
Semantics-guided synthesis. Proc. ACM Program. Lang. 5(POPL): 1-32 (2021) - [c52]Loris D'Antoni, Qinheping Hu, Jinwoo Kim, Thomas W. Reps:
Programmable Program Synthesis. CAV (1) 2021: 84-109 - [c51]Qinheping Hu, John Cyphert
Synthesis with Asymptotic Resource Bounds. CAV (1) 2021: 783-807 - [c50]Yuhao Zhang, Aws Albarghouthi, Loris D'Antoni:
Certified Robustness to Programmable Transformations in LSTMs. EMNLP (1) 2021: 1068-1083 - [c49]Anna P. Meyer, Aws Albarghouthi, Loris D'Antoni:
Certifying Robustness to Programmable Data Bias in Decision Trees. NeurIPS 2021: 26276-26288 - [c48]Reudismam Rolim de Sousa, Gustavo Soares, Rohit Gheyi, Titus Barik, Loris D'Antoni:
Learning Quick Fixes from Code Repositories. SBES 2021: 74-83 - [c47]Tiago Ferreira
Prognosis: closed-box analysis of network protocol implementations. SIGCOMM 2021: 762-774 - [c46]Kausik Subramanian, Anubhavnidhi Abhashkumar, Loris D'Antoni, Aditya Akella:
D2R: Policy-Compliant Fast Reroute. SOSR 2021: 148-161 - [i24]Yuhao Zhang, Aws Albarghouthi, Loris D'Antoni:
Certified Robustness to Programmable Transformations in LSTMs. CoRR abs/2102.07818 (2021) - [i23]Qinheping Hu, John Cyphert, Loris D'Antoni, Thomas W. Reps:
Synthesis with Asymptotic Resource Bounds. CoRR abs/2103.04188 (2021) - [i22]Pankaj Kumar Kalita, Sujit Kumar Muduli, Loris D'Antoni, Thomas W. Reps, Subhajit Roy:
Synthesizing Abstract Transformers. CoRR abs/2105.00493 (2021) - [i21]Anna P. Meyer, Aws Albarghouthi, Loris D'Antoni:
Certifying Robustness to Programmable Data Bias in Decision Trees. CoRR abs/2110.04363 (2021) - 2020
- [c45]Loris D'Antoni, Martin Helfrich
Automata Tutor v3. CAV (2) 2020: 3-14 - [c44]Rong Pan, Qinheping Hu, Rishabh Singh, Loris D'Antoni:
Solving Program Sketches with Large Integer Values. ESOP 2020: 572-598 - [c43]Yuhao Zhang, Aws Albarghouthi, Loris D'Antoni:
Robustness to Programmable String Transformations via Augmented Abstract Training. ICML 2020: 11023-11032 - [c42]Kausik Subramanian, Anubhavnidhi Abhashkumar, Loris D'Antoni, Aditya Akella:
Detecting network load violations for distributed control planes. PLDI 2020: 974-988 - [c41]Samuel Drews, Aws Albarghouthi, Loris D'Antoni:
Proving data-poisoning robustness in decision trees. PLDI 2020: 1083-1097 - [c40]Qinheping Hu, John Cyphert
Exact and approximate methods for proving unrealizability of syntax-guided synthesis problems. PLDI 2020: 1128-1142 - [i20]Yuhao Zhang, Aws Albarghouthi, Loris D'Antoni:
Robustness to Programmable String Transformations via Augmented Abstract Training. CoRR abs/2002.09579 (2020) - [i19]Qinheping Hu, John Cyphert, Loris D'Antoni, Thomas W. Reps:
Exact and Approximate Methods for Proving Unrealizability of Syntax-Guided Synthesis Problems. CoRR abs/2004.00878 (2020) - [i18]Loris D'Antoni, Martin Helfrich, Jan Kretínský, Emanuel Ramneantu, Maximilian Weininger:
Automata Tutor v3. CoRR abs/2005.01419 (2020) - [i17]Jinwoo Kim, Qinheping Hu, Loris D'Antoni, Thomas W. Reps:
Semantics-Guided Synthesis. CoRR abs/2008.09836 (2020)
2010 – 2019
- 2019
- [j9]Rong Pan, Qinheping Hu, Gaowei Xu, Loris D'Antoni:
Automatic repair of regular expressions. Proc. ACM Program. Lang. 3(OOPSLA): 139:1-139:29 (2019) - [c39]Loris D'Antoni, Tiago Ferreira
Symbolic Register Automata. CAV (1) 2019: 3-21 - [c38]Samuel Drews, Aws Albarghouthi, Loris D'Antoni:
Efficient Synthesis with Probabilistic Constraints. CAV (1) 2019: 278-296 - [c37]Qinheping Hu, Jason Breck, John Cyphert
Proving Unrealizability for Syntax-Guided Synthesis. CAV (1) 2019: 335-352 - [c36]Qinheping Hu, Roopsha Samanta, Rishabh Singh, Loris D'Antoni:
Direct Manipulation for Imperative Programs. SAS 2019: 347-367 - [i16]Qinheping Hu, Jason Breck, John Cyphert, Loris D'Antoni, Thomas W. Reps:
Proving Unrealizability for Syntax-Guided Synthesis. CoRR abs/1905.05800 (2019) - [i15]Samuel Drews, Aws Albarghouthi, Loris D'Antoni:
Efficient Synthesis with Probabilistic Constraints. CoRR abs/1905.08364 (2019) - [i14]Samuel Drews, Aws Albarghouthi, Loris D'Antoni:
Proving Data-Poisoning Robustness in Decision Trees. CoRR abs/1912.00981 (2019) - [i13]Kausik Subramanian, Anubhavnidhi Abhashkumar, Loris D'Antoni, Aditya Akella:
D2R: Dataplane-Only Policy-Compliant Routing Under Failures. CoRR abs/1912.02402 (2019) - 2018
- [j8]Kausik Subramanian, Loris D'Antoni, Aditya Akella:
Synthesis of Fault-Tolerant Distributed Router Configurations. Proc. ACM Meas. Anal. Comput. Syst. 2(1): 22:1-22:26 (2018) - [c35]Qinheping Hu, Loris D'Antoni:
Syntax-Guided Synthesis with Quantitative Syntactic Objectives. CAV (1) 2018: 386-403 - [c34]George Argyros, Loris D'Antoni:
The Learnability of Symbolic Automata. CAV (1) 2018: 427-445 - [c33]Kausik Subramanian, Loris D'Antoni, Aditya Akella:
Synthesis of Fault-Tolerant Distributed Router Configurations. SIGMETRICS (Abstracts) 2018: 87-89 - [c32]Loris D'Antoni, Zachary Kincaid, Fang Wang:
A Symbolic Decision Procedure for Symbolic Alternating Finite Automata. MFPS 2018: 79-99 - [i12]Reudismam Rolim
Learning Quick Fixes from Code Repositories. CoRR abs/1803.03806 (2018) - [i11]Qinheping Hu, Isaac Evavold, Roopsha Samanta, Rishabh Singh, Loris D'Antoni:
Program Repair via Direct State Manipulation. CoRR abs/1803.07522 (2018) - [i10]Loris D'Antoni, Tiago Ferreira, Matteo Sammartino, Alexandra Silva:
Symbolic Register Automata. CoRR abs/1811.06968 (2018) - 2017
- [j7]Rajeev Alur, Loris D'Antoni:
Streaming Tree Transducers. J. ACM 64(5): 31:1-31:55 (2017) - [j6]Aws Albarghouthi, Loris D'Antoni, Samuel Drews, Aditya V. Nori:
FairSquare: probabilistic verification of program fairness. Proc. ACM Program. Lang. 1(OOPSLA): 80:1-80:30 (2017) - [c31]Loris D'Antoni, Margus Veanes:
The Power of Symbolic Automata and Transducers. CAV (1) 2017: 47-67 - [c30]Aws Albarghouthi, Loris D'Antoni, Samuel Drews:
Repairing Decision-Making Programs Under Uncertainty. CAV (1) 2017: 181-200 - [c29]Ryo Suzuki, Gustavo Soares, Elena L. Glassman, Andrew Head, Loris D'Antoni, Björn Hartmann:
Exploring the Design Space of Automatically Synthesized Hints for Introductory Programming Assignments. CHI Extended Abstracts 2017: 2951-2958 - [c28]Reudismam Rolim
Learning syntactic program transformations from examples. ICSE 2017: 404-415 - [c27]David Merrell, Aws Albarghouthi, Loris D'Antoni:
Weighted Model Integration with Orthogonal Transformations. IJCAI 2017: 4610-4616 - [c26]Andrew Head
Writing Reusable Code Feedback at Scale with Mixed-Initiative Program Synthesis. L@S 2017: 89-98 - [c25]Qinheping Hu, Loris D'Antoni:
Automatic program inversion using symbolic transducers. PLDI 2017: 376-389 - [c24]Peter Ohmann, Alexander Brooks, Loris D'Antoni, Ben Liblit
Control-flow recovery from partial failure reports. PLDI 2017: 390-405 - [c23]Loris D'Antoni, Margus Veanes:
Monadic second-order logic on finite sequences. POPL 2017: 232-245 - [c22]Kausik Subramanian, Loris D'Antoni, Aditya Akella:
Genesis: synthesizing forwarding tables in multi-tenant networks. POPL 2017: 572-585 - [c21]Loris D'Antoni, Rishabh Singh, Michael Vaughn:
NoFAQ: synthesizing command repairs from examples. ESEC/SIGSOFT FSE 2017: 582-592 - [c20]Samuel Drews, Loris D'Antoni:
Learning Symbolic Automata. TACAS (1) 2017: 173-189 - [c19]Loris D'Antoni, Margus Veanes:
Forward Bisimulations for Nondeterministic Symbolic Finite Automata. TACAS (1) 2017: 518-534 - [c18]Ryo Suzuki, Gustavo Soares, Andrew Head, Elena L. Glassman, Ruan Reis, Melina Mongiovi
TraceDiff: Debugging unexpected code behavior using trace divergences. VL/HCC 2017: 107-115 - [i9]Aws Albarghouthi, Loris D'Antoni, Samuel Drews, Aditya V. Nori:
Quantifying Program Bias. CoRR abs/1702.05437 (2017) - [i8]Ryo Suzuki, Gustavo Soares, Andrew Head, Elena L. Glassman, Ruan Reis, Melina Mongiovi
TraceDiff: Debugging Unexpected Code Behavior Using Trace Divergences. CoRR abs/1708.03786 (2017) - 2016
- [c17]Loris D'Antoni, Roopsha Samanta, Rishabh Singh:
Qlose: Program Repair with Quantitative Objectives. CAV (2) 2016: 383-401 - [c16]Loris D'Antoni, Margus Veanes:
Minimization of Symbolic Tree Automata. LICS 2016: 873-882 - [c15]Vaibhav Gogte, Aasheesh Kolli, Michael J. Cafarella, Loris D'Antoni, Thomas F. Wenisch:
HARE: Hardware accelerator for regular expressions. MICRO 2016: 44:1-44:12 - [i7]Loris D'Antoni, Rishabh Singh, Michael Vaughn:
NoFAQ: Synthesizing Command Repairs from Examples. CoRR abs/1608.08219 (2016) - [i6]Reudismam Rolim de Sousa, Gustavo Soares, Loris D'Antoni, Oleksandr Polozov, Sumit Gulwani, Rohit Gheyi, Ryo Suzuki, Bjoern Hartmann:
Learning Syntactic Program Transformations from Examples. CoRR abs/1608.09000 (2016) - [i5]Loris D'Antoni, Zachary Kincaid, Fang Wang:
A Symbolic Decision Procedure for Symbolic Alternating Finite Automata. CoRR abs/1610.01722 (2016) - [i4]Aws Albarghouthi, Loris D'Antoni, Samuel Drews, Aditya V. Nori:
Fairness as a Program Property. CoRR abs/1610.06067 (2016) - 2015
- [j5]Loris D'Antoni, Matthew Weavery, Alexander Weinert, Rajeev Alur:
Automata Tutor and what we learned from building an online teaching tool. Bull. EATCS 117 (2015) - [j4]Loris D'Antoni
Extended symbolic finite automata and transducers. Formal Methods Syst. Des. 47(1): 93-119 (2015) - [j3]Loris D'Antoni, Dileep Kini, Rajeev Alur, Sumit Gulwani, Mahesh Viswanathan, Björn Hartmann:
How Can Automatic Feedback Help Students Construct Automata? ACM Trans. Comput. Hum. Interact. 22(2): 9:1-9:24 (2015) - [j2]Loris D'Antoni
Fast: A Transducer-Based Language for Tree Manipulation. ACM Trans. Program. Lang. Syst. 38(1): 1:1-1:32 (2015) - [c14]Loris D'Antoni, Margus Veanes:
Symbolic WS1S. LPAR (short papers) 2015: 59-66 - [c13]Rajeev Alur, Loris D'Antoni, Mukund Raghothaman
DReX: A Declarative Language for Efficiently Evaluating Regular String Transformations. POPL 2015: 125-137 - [c12]Robert A. Cochran, Loris D'Antoni, Benjamin Livshits, David Molnar, Margus Veanes:
Program Boosting: Program Synthesis via Crowd-Sourcing. POPL 2015: 677-688 - 2014
- [c11]Loris D'Antoni, Rajeev Alur:
Symbolic Visibly Pushdown Automata. CAV 2014: 209-225 - [c10]Loris D'Antoni, Margus Veanes, Benjamin Livshits, David Molnar:
Fast: a transducer-based language for tree manipulation. PLDI 2014: 384-394 - [c9]Loris D'Antoni, Margus Veanes:
Minimization of symbolic automata. POPL 2014: 541-554 - 2013
- [j1]Barzan Mozafari, Kai Zeng
High-performance complex event processing over hierarchical data. ACM Trans. Database Syst. 38(4): 21 (2013) - [c8]Loris D'Antoni, Margus Veanes:
Equivalence of Extended Symbolic Finite Transducers. CAV 2013: 624-639 - [c7]Loris D'Antoni, Alan M. Dunn, Suman Jana, Tadayoshi Kohno, Benjamin Livshits, David Molnar, Alexander Moshchuk, Eyal Ofek, Franziska Roesner, T. Scott Saponas, Margus Veanes, Helen J. Wang:
Operating System Support for Augmented Reality Applications. HotOS 2013 - [c6]Loris D'Antoni, Marco Gaboardi
Sensitivity analysis using type-based constraints. FPCDSL@ICFP 2013: 43-50 - [c5]Rajeev Alur, Loris D'Antoni, Sumit Gulwani, Dileep Kini, Mahesh Viswanathan:
Automated Grading of DFA Constructions. IJCAI 2013: 1976-1982 - [c4]Rajeev Alur, Loris D'Antoni, Jyotirmoy V. Deshmukh, Mukund Raghothaman
Regular Functions and Cost Register Automata. LICS 2013: 13-22 - [c3]Loris D'Antoni, Margus Veanes:
Static Analysis of String Encoders and Decoders. VMCAI 2013: 209-228 - 2012
- [c2]Rajeev Alur, Loris D'Antoni:
Streaming Tree Transducers. ICALP (2) 2012: 42-53 - [i3]Loris D'Antoni:
In the Maze of Data Languages. CoRR abs/1208.5980 (2012) - 2011
- [i2]Rajeev Alur, Loris D'Antoni:
Streaming Tree Transducers. CoRR abs/1104.2599 (2011) - [i1]Rajeev Alur, Loris D'Antoni, Jyotirmoy V. Deshmukh, Mukund Raghothaman, Yifei Yuan:
Regular Functions, Cost Register Automata, and Generalized Min-Cost Problems. CoRR abs/1111.0670 (2011)
2000 – 2009
- 2008
- [c1]Lorenzo Bettini
Global Progress in Dynamically Interleaved Multiparty Sessions. CONCUR 2008: 418-433
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-12-13 19:11 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: