Dan Gutfreund

1.1k total citations
24 papers, 301 citations indexed

About

Dan Gutfreund is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Vision and Pattern Recognition. According to data from OpenAlex, Dan Gutfreund has authored 24 papers receiving a total of 301 indexed citations (citations by other indexed papers that have themselves been cited), including 18 papers in Artificial Intelligence, 8 papers in Computational Theory and Mathematics and 6 papers in Computer Vision and Pattern Recognition. Recurrent topics in Dan Gutfreund's work include Complexity and Algorithms in Graphs (8 papers), Cryptography and Data Security (6 papers) and Reinforcement Learning in Robotics (4 papers). Dan Gutfreund is often cited by papers focused on Complexity and Algorithms in Graphs (8 papers), Cryptography and Data Security (6 papers) and Reinforcement Learning in Robotics (4 papers). Dan Gutfreund collaborates with scholars based in United States, Israel and United Kingdom. Dan Gutfreund's co-authors include Amnon Ta‐Shma, Ronen Shaltiel, Hana Chockler, Noam Slonim, Daniel Hershcovich, Tamar Lavee, Ruty Rinott, Ehud Aharoni, Ran Levy and Akash Srivastava and has published in prestigious journals such as Machine Learning, Computer-Aided Design and Information Processing Letters.

In The Last Decade

Dan Gutfreund

23 papers receiving 273 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Dan Gutfreund United States	10	227	117	46	34	29	24	301
Jaime Carbonell United States	7	243 1.1×	34 0.3×	30 0.7×	45 1.3×	51 1.8×	12	342
Rodrigo Toro Icarte Canada	7	294 1.3×	109 0.9×	28 0.6×	37 1.1×	29 1.0×	12	361
Ron Alford United States	12	344 1.5×	36 0.3×	38 0.8×	32 0.9×	88 3.0×	27	395
Toryn Q. Klassen Canada	7	280 1.2×	106 0.9×	24 0.5×	32 0.9×	23 0.8×	14	334
Rüdiger Ehlers Germany	12	135 0.6×	225 1.9×	9 0.2×	25 0.7×	32 1.1×	32	319
Henrik Großkreutz Germany	9	182 0.8×	47 0.4×	77 1.7×	49 1.4×	30 1.0×	21	253
Piotr Wasilewski Poland	8	63 0.3×	128 1.1×	49 1.1×	48 1.4×	13 0.4×	37	227
Yingke Chen China	9	121 0.5×	53 0.5×	18 0.4×	66 1.9×	18 0.6×	27	221
Juan Carlos Santamaria United States	4	211 0.9×	32 0.3×	12 0.3×	35 1.0×	20 0.7×	8	260

Countries citing papers authored by Dan Gutfreund

Since Specialization

Citations

This map shows the geographic impact of Dan Gutfreund's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Dan Gutfreund with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Dan Gutfreund more than expected).

Fields of papers citing papers by Dan Gutfreund

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Dan Gutfreund. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Dan Gutfreund. The network helps show where Dan Gutfreund may publish in the future.

Co-authorship network of co-authors of Dan Gutfreund

This figure shows the co-authorship network connecting the top 25 collaborators of Dan Gutfreund. A scholar is included among the top collaborators of Dan Gutfreund based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Dan Gutfreund. Dan Gutfreund is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Chen, Zhenfang, et al.. (2024). Visual Chain-of-Thought Prompting for Knowledge-Based Visual Reasoning. Proceedings of the AAAI Conference on Artificial Intelligence. 38(2). 1254–1262. 6 indexed citations

Srivastava, Akash, et al.. (2023). Beyond Statistical Similarity: Rethinking Metrics for Deep Generative Models in Engineering Design. Computer-Aided Design. 165. 103609–103609. 19 indexed citations

Shu, Tianmin, et al.. (2023). Zero-Shot Linear Combinations of Grounded Social Interactions with Linear Social MDPs. Proceedings of the AAAI Conference on Artificial Intelligence. 37(1). 94–101.

Zhou, Guangyao, Lirui Wang, Joshua B. Tenenbaum, et al.. (2023). 3D Neural Embedding Likelihood: Probabilistic Inverse Graphics for Robust 6D Pose Estimation. 21568–21579. 2 indexed citations

Shu, Tianmin, et al.. (2022). Incorporating Rich Social Interactions Into MDPs. 2022 International Conference on Robotics and Automation (ICRA). 7395–7401. 3 indexed citations

Gan, Chuang, Yi Gu, J. Schwartz, et al.. (2022). Finding Fallen Objects Via Asynchronous Audio-Visual Integration. 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). 10513–10523. 9 indexed citations

Srivastava, Akash, et al.. (2021). A Bayesian-Symbolic Approach to Reasoning and Learning in Intuitive Physics. Neural Information Processing Systems. 34. 4 indexed citations

Monfort, Mathew, et al.. (2018). A Large Scale Multi-Label Action Dataset for Video Understanding. 1 indexed citations

Zhao, Handong, Quanfu Fan, Dan Gutfreund, & Yun Fu. (2018). Semantically Guided Visual Question Answering. 1852–1860. 8 indexed citations

10.

Gutfreund, Dan, Yoav Katz, & Noam Slonim. (2016). Automatic Arguments Construction - From Search Engine to Research Engine.. National Conference on Artificial Intelligence. 3 indexed citations

11.

Gutfreund, Dan, Aryeh Kontorovich, Ran Levy, & Michal Rosen‐Zvi. (2015). Boosting conditional probability estimators. Annals of Mathematics and Artificial Intelligence. 79(1-3). 129–144. 1 indexed citations

12.

Slonim, Noam, Ehud Aharoni, Carlos Alzate, et al.. (2014). Claims on demand -- an initial demonstration of a system for automatic detection and polarity identification of context dependent claims in massive corpora. International Conference on Computational Linguistics. 6–9. 4 indexed citations

13.

Aharoni, Ehud, Tamar Lavee, Daniel Hershcovich, et al.. (2014). A Benchmark Dataset for Automatic Detection of Claims and Evidence in the Context of Controversial Topics. 64–68. 77 indexed citations

14.

Gutfreund, Dan, et al.. (2011). Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds. Computational Complexity. 20(2). 329–366. 8 indexed citations

15.

Gutfreund, Dan, Ronen Shaltiel, & Amnon Ta‐Shma. (2007). If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances. Computational Complexity. 16(4). 412–441. 23 indexed citations

16.

Goldwasser, Shafi, Dan Gutfreund, Alexander Healy, Tali Kaufman, & Guy N. Rothblum. (2007). Verifying and decoding in constant depth. 440–449. 20 indexed citations

17.

Gutfreund, Dan & Amnon Ta‐Shma. (2006). New connections between derandomization, worst-case complexity and average-case complexity. 13. 2 indexed citations

18.

Gutfreund, Dan, Ronen Shaltiel, & Amnon Ta‐Shma. (2004). Uniform hardness vs. randomness tradeoffs for Arthur-Merlin games. 76. 33–47. 13 indexed citations

19.

Chockler, Hana & Dan Gutfreund. (2004). A lower bound for testing juntas. Information Processing Letters. 90(6). 301–305. 23 indexed citations

20.

Gutfreund, Dan, Ronen Shaltiel, & Amnon Ta‐Shma. (2003). Uniform hardness versus randomness tradeoffs for Arthur-Merlin games. Computational Complexity. 12(3-4). 28 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact