default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDan Gutfreund
Danny Gutfreund
2020 – today
- 2025
[i28]Yu Wang, Dmitry Krotov, Yuanzhe Hu, Yifan Gao, Wangchunshu Zhou, Julian J. McAuley, Dan Gutfreund, Rogério Feris, Zexue He:
M+: Extending MemoryLLM with Scalable Long-Term Memory. CoRR abs/2502.00592 (2025)- [i27]Leonid Karlinsky, Assaf Arbelle, Abraham Daniels, Ahmed Nassar, Amit Alfassi, Bo Wu, Eli Schwartz, Dhiraj Joshi, Jovana Kondic, Nimrod Shabtay, Pengyuan Li, Roei Herzig, Shafiq Abedin, Shaked Perek, Sivan Harary, Udi Barzelay, Adi Raz Goldfarb, Aude Oliva, Ben Wieles, Bishwaranjan Bhattacharjee, Brandon Huang, Christoph Auer, Dan Gutfreund, David Beymer, David Wood, Hilde Kuehne, Jacob A. Hansen, Joseph Shtok, Ken Wong, Luis Angel D. Bathen, Mayank Mishra, Maksym Lysak, Michele Dolfi, Mikhail Yurochkin, Nikolaos Livathinos, Nimrod Harel, Ophir Azulai, Oshri Naparstek, Rafael Teixeira de Lima, Rameswar Panda, Sivan Doveh, Shubham Gupta, Subhro Das, Syed Zawad, Yusik Kim, Zexue He, Alexander Brooks, Gabe Goodhart, Anita Govindjee, Derek Leist, Ibrahim Ibrahim, Aya Soffer, David D. Cox, Kate Soule, Luis A. Lastras, Nirmit Desai, Shila Ofek-Koifman, Sriram Raghavan, Tanveer F. Syeda-Mahmood, Peter W. J. Staar, Tal Drory, Rogério Feris:
Granite Vision: a lightweight, open-source multimodal model for enterprise Intelligence. CoRR abs/2502.09927 (2025) - 2024
- [j13]Amin Heyrani Nobari, Akash Srivastava, Dan Gutfreund, Kai Xu, Faez Ahmed:
LInK: Learning Joint Representations of Design and Performance Spaces through Contrastive Learning for Mechanism Synthesis. Trans. Mach. Learn. Res. 2024 (2024) - [j12]Lyle Regenwetter, Giorgio Giannone, Akash Srivastava, Dan Gutfreund, Faez Ahmed:
Constraining Generative Models for Engineering Design with Negative Data. Trans. Mach. Learn. Res. 2024 (2024) - [c34]Zhenfang Chen, Qinhong Zhou, Yikang Shen, Yining Hong, Zhiqing Sun, Dan Gutfreund, Chuang Gan:
Visual Chain-of-Thought Prompting for Knowledge-Based Visual Reasoning. AAAI 2024: 1254-1262 - [c33]Eunjeong Hwang, Vered Shwartz, Dan Gutfreund, Veronika Thost:
A Graph per Persona: Reasoning about Subjective Natural Language Descriptions. ACL (Findings) 2024: 1928-1942 - [i26]Amin Heyrani Nobari, Akash Srivastava, Dan Gutfreund, Kai Xu, Faez Ahmed:
LInK: Learning Joint Representations of Design and Performance Spaces through Contrastive Learning for Mechanism Synthesis. CoRR abs/2405.20592 (2024) - 2023
- [j11]Lyle Regenwetter
, Akash Srivastava, Dan Gutfreund, Faez Ahmed:
Beyond Statistical Similarity: Rethinking Metrics for Deep Generative Models in Engineering Design. Comput. Aided Des. 165: 103609 (2023) - [c32]Ravi Tejwani, Yen-Ling Kuo, Tianmin Shu, Bennett Stankovits, Dan Gutfreund, Joshua B. Tenenbaum, Boris Katz, Andrei Barbu:
Zero-Shot Linear Combinations of Grounded Social Interactions with Linear Social MDPs. AAAI 2023: 94-101 - [c31]Guangyao Zhou, Nishad Gothoskar, Lirui Wang, Joshua B. Tenenbaum, Dan Gutfreund, Miguel Lázaro-Gredilla, Dileep George, Vikash K. Mansinghka:
3D Neural Embedding Likelihood: Probabilistic Inverse Graphics for Robust 6D Pose Estimation. ICCV 2023: 21568-21579 - [c30]David Mayo, Jesse Cummings, Xinyu Lin, Dan Gutfreund, Boris Katz, Andrei Barbu:
How hard are computer vision datasets? Calibrating dataset difficulty to viewing time. NeurIPS 2023 - [i25]Lyle Regenwetter, Akash Srivastava, Dan Gutfreund, Faez Ahmed:
Beyond Statistical Similarity: Rethinking Metrics for Deep Generative Models in Engineering Design. CoRR abs/2302.02913 (2023) - [i24]Guangyao Zhou, Nishad Gothoskar, Lirui Wang, Joshua B. Tenenbaum, Dan Gutfreund, Miguel Lázaro-Gredilla, Dileep George, Vikash K. Mansinghka:
3D Neural Embedding Likelihood for Robust Sim-to-Real Transfer in Inverse Graphics. CoRR abs/2302.03744 (2023) - [i23]Giorgio Giannone, Lyle Regenwetter, Akash Srivastava, Dan Gutfreund, Faez Ahmed:
Learning from Invalid Data: On Constraint Satisfaction in Generative Models. CoRR abs/2306.15166 (2023) - 2022
- [j10]Mathew Monfort, Bowen Pan, Kandan Ramakrishnan, Alex Andonian, Barry A. McNamara, Alex Lascelles, Quanfu Fan, Dan Gutfreund, Rogério Schmidt Feris, Aude Oliva:
Multi-Moments in Time: Learning and Interpreting Models for Multi-Action Video Understanding. IEEE Trans. Pattern Anal. Mach. Intell. 44(12): 9434-9445 (2022) - [c29]Chuang Gan, Yi Gu, Siyuan Zhou, Jeremy Schwartz, Seth Alter, James Traer, Dan Gutfreund, Joshua B. Tenenbaum, Josh H. McDermott, Antonio Torralba:
Finding Fallen Objects Via Asynchronous Audio-Visual Integration. CVPR 2022: 10513-10523 - [c28]Ravi Tejwani, Yen-Ling Kuo, Tianmin Shu, Bennett Stankovits, Dan Gutfreund, Joshua B. Tenenbaum, Boris Katz, Andrei Barbu:
Incorporating Rich Social Interactions Into MDPs. ICRA 2022: 7395-7401 - [c27]Chuang Gan, Siyuan Zhou, Jeremy Schwartz, Seth Alter, Abhishek Bhandwaldar, Dan Gutfreund, Daniel L. K. Yamins, James J. DiCarlo, Josh H. McDermott, Antonio Torralba, Joshua B. Tenenbaum:
The ThreeDWorld Transport Challenge: A Visually Guided Task-and-Motion Planning Benchmark Towards Physically Realistic Embodied AI. ICRA 2022: 8847-8854 - [i22]Chuang Gan, Yi Gu, Siyuan Zhou, Jeremy Schwartz, Seth Alter, James Traer, Dan Gutfreund, Joshua B. Tenenbaum, Josh H. McDermott, Antonio Torralba:
Finding Fallen Objects Via Asynchronous Audio-Visual Integration. CoRR abs/2207.03483 (2022) - [i21]Tan Zhi-Xuan, Nishad Gothoskar, Falk Pollok, Dan Gutfreund, Joshua B. Tenenbaum, Vikash K. Mansinghka:
Solving the Baby Intuitions Benchmark with a Hierarchically Bayesian Theory of Mind. CoRR abs/2208.02914 (2022) - [i20]Amin Heyrani Nobari, Akash Srivastava, Dan Gutfreund, Faez Ahmed:
LINKS: A dataset of a hundred million planar linkage mechanisms for data-driven kinematic design. CoRR abs/2208.14567 (2022) - 2021
- [j9]Noam Slonim, Yonatan Bilu, Carlos Alzate, Roy Bar-Haim, Ben Bogin, Francesca Bonin, Leshem Choshen, Edo Cohen-Karlik, Lena Dankin, Lilach Edelstein, Liat Ein-Dor, Roni Friedman-Melamed, Assaf Gavron, Ariel Gera, Martin Gleize, Shai Gretz, Dan Gutfreund, Alon Halfon, Daniel Hershcovich, Ron Hoory, Yufang Hou, Shay Hummel, Michal Jacovi, Charles Jochim, Yoav Kantor, Yoav Katz, David Konopnicki, Zvi Kons, Lili Kotlerman, Dalia Krieger, Dan Lahav, Tamar Lavee, Ran Levy, Naftali Liberman, Yosi Mass, Amir Menczel, Shachar Mirkin, Guy Moshkowich, Shila Ofek-Koifman, Matan Orbach, Ella Rabinovich, Ruty Rinott, Slava Shechtman, Dafna Sheinwald, Eyal Shnarch, Ilya Shnayderman, Aya Soffer, Artem Spector, Benjamin Sznajder, Assaf Toledo, Orith Toledo-Ronen, Elad Venezian, Ranit Aharonov:
An autonomous debating system. Nat. 591(7850): 379-384 (2021) - [c26]Tianmin Shu, Abhishek Bhandwaldar, Chuang Gan, Kevin A. Smith, Shari Liu, Dan Gutfreund, Elizabeth S. Spelke, Joshua B. Tenenbaum, Tomer D. Ullman:
AGENT: A Benchmark for Core Psychological Reasoning. ICML 2021: 9614-9625 - [c25]Chuang Gan, Jeremy Schwartz, Seth Alter, Damian Mrowca, Martin Schrimpf, James Traer, Julian De Freitas, Jonas Kubilius, Abhishek Bhandwaldar, Nick Haber, Megumi Sano, Kuno Kim, Elias Wang, Michael Lingelbach, Aidan Curtis, Kevin T. Feigelis, Daniel Bear, Dan Gutfreund, David D. Cox, Antonio Torralba, James J. DiCarlo, Josh Tenenbaum, Josh H. McDermott, Dan Yamins:
ThreeDWorld: A Platform for Interactive Multi-Modal Physical Simulation. NeurIPS Datasets and Benchmarks 2021 - [c24]Kai Xu, Akash Srivastava, Dan Gutfreund, Felix Sosa, Tomer D. Ullman, Josh Tenenbaum, Charles Sutton:
A Bayesian-Symbolic Approach to Reasoning and Learning in Intuitive Physics. NeurIPS 2021: 2478-2490 - [c23]Nishad Gothoskar, Marco F. Cusumano-Towner, Ben Zinberg, Matin Ghavamizadeh, Falk Pollok, Austin Garrett, Josh Tenenbaum, Dan Gutfreund, Vikash K. Mansinghka:
3DP3: 3D Scene Perception via Probabilistic Programming. NeurIPS 2021: 9600-9612 - [i19]Tianmin Shu, Abhishek Bhandwaldar, Chuang Gan, Kevin A. Smith, Shari Liu, Dan Gutfreund, Elizabeth S. Spelke, Joshua B. Tenenbaum, Tomer D. Ullman:
AGENT: A Benchmark for Core Psychological Reasoning. CoRR abs/2102.12321 (2021) - [i18]Chuang Gan, Siyuan Zhou, Jeremy Schwartz, Seth Alter, Abhishek Bhandwaldar, Dan Gutfreund, Daniel L. K. Yamins, James J. DiCarlo, Josh H. McDermott, Antonio Torralba, Joshua B. Tenenbaum:
The ThreeDWorld Transport Challenge: A Visually Guided Task-and-Motion Planning Benchmark for Physically Realistic Embodied AI. CoRR abs/2103.14025 (2021) - [i17]Ravi Tejwani, Yen-Ling Kuo, Tianmin Shu, Bennett Stankovits, Dan Gutfreund, Joshua B. Tenenbaum, Boris Katz, Andrei Barbu:
Incorporating Rich Social Interactions Into MDPs. CoRR abs/2110.10298 (2021) - [i16]Nishad Gothoskar, Marco F. Cusumano-Towner, Ben Zinberg, Matin Ghavamizadeh, Falk Pollok, Austin Garrett, Joshua B. Tenenbaum, Dan Gutfreund, Vikash K. Mansinghka:
3DP3: 3D Scene Perception via Probabilistic Programming. CoRR abs/2111.00312 (2021) - 2020
- [j8]Mathew Monfort, Carl Vondrick, Aude Oliva, Alex Andonian, Bolei Zhou, Kandan Ramakrishnan, Sarah Adel Bargal, Tom Yan, Lisa M. Brown, Quanfu Fan, Dan Gutfreund:
Moments in Time Dataset: One Million Videos for Event Understanding. IEEE Trans. Pattern Anal. Mach. Intell. 42(2): 502-508 (2020) - [i15]Chuang Gan, Jeremy Schwartz, Seth Alter, Martin Schrimpf, James Traer, Julian De Freitas, Jonas Kubilius, Abhishek Bhandwaldar, Nick Haber, Megumi Sano, Kuno Kim, Elias Wang, Damian Mrowca, Michael Lingelbach, Aidan Curtis, Kevin T. Feigelis, Daniel M. Bear, Dan Gutfreund, David D. Cox, James J. DiCarlo, Josh H. McDermott, Joshua B. Tenenbaum, Daniel L. K. Yamins:
ThreeDWorld: A Platform for Interactive Multi-Modal Physical Simulation. CoRR abs/2007.04954 (2020) - [i14]Akash Srivastava, Yamini Bansal, Yukun Ding, Cole L. Hurwitz, Kai Xu, Bernhard Egger, Prasanna Sattigeri, Josh Tenenbaum, David D. Cox, Dan Gutfreund:
Improving the Reconstruction of Disentangled Representation Learners via Multi-Stage Modelling. CoRR abs/2010.13187 (2020) - [i13]Abhijit Mishra, Md. Faisal Mahbub Chowdhury, Sagar Manohar, Dan Gutfreund, Karthik Sankaranarayanan:
Template Controllable keywords-to-text Generation. CoRR abs/2011.03722 (2020)
2010 – 2019
- 2019
- [c22]Kandan Ramakrishnan, Mathew Monfort, Barry A. McNamara, Alex Lascelles, Dan Gutfreund, Rogério Schmidt Feris, Aude Oliva:
Identifying Interpretable Action Concepts in Deep Networks. CVPR Workshops 2019: 12-15 - [c21]Angie W. Boggust, Kartik Audhkhasi, Dhiraj Joshi, David Harwath, Samuel Thomas, Rogério Schmidt Feris, Danny Gutfreund, Yang Zhang, Antonio Torralba, Michael Picheny, James R. Glass:
Grounding Spoken Words in Unlabeled Video. CVPR Workshops 2019: 29-32 - [c20]Tete Xiao, Quanfu Fan, Danny Gutfreund, Mathew Monfort, Aude Oliva, Bolei Zhou:
Reasoning About Human-Object Interactions Through Dual Attention Networks. ICCV 2019: 3918-3927 - [c19]Andrei Barbu, David Mayo, Julian Alverio, William Luo, Christopher Wang, Dan Gutfreund, Josh Tenenbaum, Boris Katz:
ObjectNet: A large-scale bias-controlled dataset for pushing the limits of object recognition models. NeurIPS 2019: 9448-9458 - [i12]Tete Xiao, Quanfu Fan, Dan Gutfreund, Mathew Monfort, Aude Oliva, Bolei Zhou:
Reasoning About Human-Object Interactions Through Dual Attention Networks. CoRR abs/1909.04743 (2019) - [i11]Mathew Monfort, Kandan Ramakrishnan, Alex Andonian, Barry A. McNamara, Alex Lascelles, Bowen Pan, Quanfu Fan, Dan Gutfreund, Rogério Schmidt Feris, Aude Oliva:
Multi-Moments in Time: Learning and Interpreting Models for Multi-Action Video Understanding. CoRR abs/1911.00232 (2019) - [i10]Akash Srivastava, Jessie C. Rosenberg, Dan Gutfreund, David D. Cox:
SimVAE: Simulator-Assisted Training forInterpretable Generative Models. CoRR abs/1911.08051 (2019) - 2018
- [c18]Handong Zhao, Quanfu Fan, Dan Gutfreund, Yun Fu:
Semantically Guided Visual Question Answering. WACV 2018: 1852-1860 - [i9]Mathew Monfort, Bolei Zhou, Sarah Adel Bargal, Alex Andonian, Tom Yan, Kandan Ramakrishnan, Lisa M. Brown, Quanfu Fan, Dan Gutfreund, Carl Vondrick, Aude Oliva:
Moments in Time Dataset: one million videos for event understanding. CoRR abs/1801.03150 (2018) - 2017
- [j7]Dan Gutfreund, Aryeh Kontorovich, Ran Levy, Michal Rosen-Zvi:
Boosting conditional probability estimators. Ann. Math. Artif. Intell. 79(1-3): 129-144 (2017) - 2016
- [c17]Dan Gutfreund, Yoav Katz, Noam Slonim:
Automatic Arguments Construction - From Search Engine to Research Engine. AAAI Fall Symposia 2016 - 2014
- [c16]Ehud Aharoni, Anatoly Polnarov, Tamar Lavee, Daniel Hershcovich, Ran Levy, Ruty Rinott, Dan Gutfreund, Noam Slonim:
A Benchmark Dataset for Automatic Detection of Claims and Evidence in the Context of Controversial Topics. ArgMining@ACL 2014: 64-68 - [c15]Noam Slonim, Ehud Aharoni, Carlos Alzate, Roy Bar-Haim, Yonatan Bilu, Lena Dankin, Iris Eiron, Daniel Hershcovich, Shay Hummel, Mitesh M. Khapra, Tamar Lavee, Ran Levy, Paul Matchen, Anatoly Polnarov, Vikas C. Raykar, Ruty Rinott, Amrita Saha, Naama Zwerdling, David Konopnicki, Dan Gutfreund:
Claims on demand - an initial demonstration of a system for automatic detection and polarity identification of context dependent claims in massive corpora. COLING (Demos) 2014: 6-9 - [c14]Dan Gutfreund, Aryeh Kontorovich, Ran Levy, Michal Rosen-Zvi:
Boosting Conditional Probability Estimators. ISAIM 2014 - 2013
- [j6]Lena Chekina, Dan Gutfreund, Aryeh Kontorovich, Lior Rokach, Bracha Shapira:
Exploiting label dependencies for improved sample complexity. Mach. Learn. 91(1): 1-42 (2013) - [c13]Shlomi Dolev, Nova Fandina, Dan Gutfreund:
Succinct Permanent Is NEXP-Hard with Many Hard Instances. CIAC 2013: 183-196 - 2012
- [i8]Shlomi Dolev, Nova Fandina, Dan Gutfreund:
Succinct Permanent is NEXP-hard with Many Hard Instances. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j5]Baris Aydinlioglu, Dan Gutfreund, John M. Hitchcock, Akinori Kawachi:
Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds. Comput. Complex. 20(2): 329-366 (2011) - [c12]Zeev Dvir, Dan Gutfreund, Guy N. Rothblum, Salil P. Vadhan:
On Approximating the Entropy of Polynomial Mappings. ICS 2011: 460-475 - 2010
- [c11]Dan Gutfreund, Akinori Kawachi:
Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds. CCC 2010: 38-49 - [i7]Zeev Dvir, Dan Gutfreund, Guy N. Rothblum, Salil P. Vadhan:
On Approximating the Entropy of Polynomial Mappings. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [i6]Dan Gutfreund, Akinori Kawachi:
Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [c10]Dan Gutfreund, Guy N. Rothblum:
The Complexity of Local List Decoding. APPROX-RANDOM 2008: 455-468 - [c9]Dan Gutfreund, Salil P. Vadhan:
Limitations of Hardness vs. Randomness under Uniform Reductions. APPROX-RANDOM 2008: 469-482 - [c8]Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum:
A (de)constructive approach to program checking. STOC 2008: 143-152 - [i5]Dan Gutfreund, Guy N. Rothblum:
The Complexity of Local List Decoding. Electron. Colloquium Comput. Complex. TR08 (2008) - [i4]Dan Gutfreund, Salil P. Vadhan:
Limitations of Hardness vs. Randomness under Uniform Reductions. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [j4]Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma:
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances. Comput. Complex. 16(4): 412-441 (2007) - [c7]Dan Gutfreund, Amnon Ta-Shma:
Worst-Case to Average-Case Reductions Revisited. APPROX-RANDOM 2007: 569-583 - [c6]Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum:
Verifying and decoding in constant depth. STOC 2007: 440-449 - [i3]Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum:
A (De)constructive Approach to Program Checking. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [c5]Dan Gutfreund:
Worst-Case Vs. Algorithmic Average-Case Complexity in the Polynomial-Time Hierarchy. APPROX-RANDOM 2006: 386-397 - [i2]Dan Gutfreund, Amnon Ta-Shma:
New connections between derandomization, worst-case complexity and average-case complexity. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [b1]Dan Gutfreund:
Derandomization, hard functions, and average-case complexity (דה-רנדומיזציה, פונקציות קשות וסיבוכיות ממוצעת.). Hebrew University of Jerusalem, Israel, 2005 - [c4]Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma:
If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances. CCC 2005: 243-257 - 2004
- [j3]Hana Chockler, Dan Gutfreund:
A lower bound for testing juntas. Inf. Process. Lett. 90(6): 301-305 (2004) - [c3]Dan Gutfreund, Emanuele Viola:
Fooling Parity Tests with Parity Gates. APPROX-RANDOM 2004: 381-392 - [i1]Emanuele Viola, Dan Gutfreund:
Fooling Parity Tests with Parity Gates. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j2]Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma:
Uniform hardness versus randomness tradeoffs for Arthur-Merlin games. Comput. Complex. 12(3-4): 85-130 (2003) - [j1]Michael Ben-Or, Danny Gutfreund:
Trading Help for Interaction in Statistical Zero-Knowledge Proofs. J. Cryptol. 16(2): 95-116 (2003) - [c2]Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma:
Uniform hardness vs. randomness tradeoffs for Arthur-Merlin games. CCC 2003: 33-47 - 2000
- [c1]Danny Gutfreund, Michael Ben-Or:
Increasing the Power of the Dealer in Non-interactive Zero-Knowledge Proof Systems. ASIACRYPT 2000: 429-442
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.
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.
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.
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-06-19 01:37 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:
