# Dan Gutfreund

## contact information

Research Staff Member - Video Analytics

Cambridge Research Center, Cambridge, MA USA

Cambridge Research Center, Cambridge, MA USA

## links

**2018**

Moments in Time Dataset: one million videos for event understanding

Mathew Monfort, Bolei Zhou, Sarah Adel Bargal, Alex Andonian, Tom Yan, Kandan Ramakrishnan, Lisa Brown, Quanfu Fan, Dan Gutfruend, Carl Vondrick, Aude Oliva

Mathew Monfort, Bolei Zhou, Sarah Adel Bargal, Alex Andonian, Tom Yan, Kandan Ramakrishnan, Lisa Brown, Quanfu Fan, Dan Gutfruend, Carl Vondrick, Aude Oliva

*arXiv*, 2018
Semantically Guided Visual Question Answering

Handong Zhao, Quanfu Fan, Dan Gutfreund, Yun Fu

Handong Zhao, Quanfu Fan, Dan Gutfreund, Yun Fu

*WACV18*, 2018**2017**

Boosting conditional probability estimators

Dan Gutfreund, Aryeh Kontorovich, Ran Levy, Michal Rosen-Zvi

Dan Gutfreund, Aryeh Kontorovich, Ran Levy, Michal Rosen-Zvi

*Ann. Math. Artif. Intell.**79*(*1-3*), 129--144, 2017**2016**

Automatic Arguments Construction—From Search Engine to Research Engine

Gutfreund, Dan and Katz, Yoav and Slonim, Noam

Abstract

Gutfreund, Dan and Katz, Yoav and Slonim, Noam

*2016 AAAI Fall Symposium Series*Abstract

**2014**

Claims on demand - an initial demonstration of a system for automatic
detection and polarity identification of context dependent claims
in massive corpora

Noam Slonim, Ehud Aharoni, Carlos Alzate Perez, 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

Noam Slonim, Ehud Aharoni, Carlos Alzate Perez, 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

*COLING 2014, 25th International Conference on Computational Linguistics, Proceedings of the Conference System Demonstrations, August 23-29, 2014, Dublin, Ireland*,*pp. 6--9*
A benchmark dataset for automatic detection of claims and evidence in the context of controversial topics

Aharoni, Ehud and Polnarov, Anatoly and Lavee, Tamar and Hershcovich, Daniel and Levy, Ran and Rinott, Ruty and Gutfreund, Dan and Slonim, Noam

Abstract

Aharoni, Ehud and Polnarov, Anatoly and Lavee, Tamar and Hershcovich, Daniel and Levy, Ran and Rinott, Ruty and Gutfreund, Dan and Slonim, Noam

*Proceedings of the First Workshop on Argumentation Mining*,*pp. 64--68*, 2014Abstract

**2013**

Exploiting label dependencies for improved sample complexity

Chekina, Lena and Gutfreund, Dan and Kontorovich, Aryeh and Rokach, Lior and Shapira, Bracha

Abstract

Chekina, Lena and Gutfreund, Dan and Kontorovich, Aryeh and Rokach, Lior and Shapira, Bracha

*Machine learning**91*(*1*), 1--42, Springer, 2013Abstract

Succinct Permanent is NEXP-hard with Many Hard Instances

Dolev, Shlomi and Fandina, Nova and Gutfreund, Dan

Abstract

Dolev, Shlomi and Fandina, Nova and Gutfreund, Dan

*International Conference on Algorithms and Complexity*,*pp. 183--196*, 2013Abstract

**2011**

Derandomizing Arthur-Merlin Games and Approximate Counting Implies
Exponential-Size Lower Bounds

Baris Aydinlioglu, Dan Gutfreund, John M. Hitchcock, Akinori Kawachi

Baris Aydinlioglu, Dan Gutfreund, John M. Hitchcock, Akinori Kawachi

*Computational Complexity**20*(*2*), 329--366, 2011
On Approximating the Entropy of Polynomial Mappings.

Dvir, Zeev and Gutfreund, Dan and Rothblum, Guy N and Vadhan, Salil P

Abstract

Dvir, Zeev and Gutfreund, Dan and Rothblum, Guy N and Vadhan, Salil P

*ICS*,*pp. 460--475*, 2011Abstract

**2010**

Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds

Gutfreund, Dan and Kawachi, Akinori

Abstract

Gutfreund, Dan and Kawachi, Akinori

*Computational Complexity (CCC), 2010 IEEE 25th Annual Conference on*,*pp. 38--49*Abstract

**2008**

A (de)constructive approach to program checking

Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum

Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum

*Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008*,*pp. 143--152*
Limitations of Hardness vs. Randomness under Uniform Reductions

Dan Gutfreund, Salil P. Vadhan

Dan Gutfreund, Salil P. Vadhan

*Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 200*,*pp. 469--482*
The Complexity of Local List Decoding

Dan Gutfreund, Guy N. Rothblum

Dan Gutfreund, Guy N. Rothblum

*Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 200*,*pp. 455--468***2007**

Verifying and decoding in constant depth

Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum

Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum

*Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007*,*pp. 440--449*
Worst-Case to Average-Case Reductions Revisited

Dan Gutfreund, Amnon Ta-Shma

Dan Gutfreund, Amnon Ta-Shma

*Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22,*,*pp. 569--583*
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find
Their Hard Instances

Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma

Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma

*Computational Complexity**16*(*4*), 412--441, 2007**2006**

Worst-Case Vs. Algorithmic Average-Case Complexity in the Polynomial-Time
Hierarchy

Dan Gutfreund

Dan Gutfreund

*Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International*,*pp. 386--397***2005**

If NP Languages are Hard on the Worst-Case Then It is Easy to Find
Their Hard Instances

Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma

Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma

*20th Annual IEEE Conference on Computational Complexity (CCC 2005), 11-15 June 2005, San Jose, CA, USA*,*pp. 243--257***2004**

Fooling Parity Tests with Parity Gates

Dan Gutfreund, Emanuele Viola

Dan Gutfreund, Emanuele Viola

*Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques, 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International*,*pp. 381--392*
A lower bound for testing juntas

Hana Chockler, Dan Gutfreund

Hana Chockler, Dan Gutfreund

*Inf. Process. Lett.**90*(*6*), 301--305, 2004**2003**

Trading Help for Interaction in Statistical Zero-Knowledge Proofs

Michael Ben-Or, Danny Gutfreund

Michael Ben-Or, Danny Gutfreund

*J. Cryptology**16*(*2*), 95--116, 2003
Uniform hardness versus randomness tradeoffs for Arthur-Merlin games

Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma

Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma

*Computational Complexity**12*(*3-4*), 85--130, 2003**2000**

Increasing the Power of the Dealer in Non-interactive Zero-Knowledge
Proof Systems

Danny Gutfreund, Michael Ben-Or

Danny Gutfreund, Michael Ben-Or

*Advances in Cryptology - ASIACRYPT 2000, 6th International Conference on the Theory and Application of Cryptology and Information Security, Kyoto, Japan, December 3-7, 2000, Proceedings*,*pp. 429--442*