Author Info
Name
Affiliation
Papers
DAN GUTFREUND
IBM Research, Haifa, Israel
23
Collaborators
Citations 
PageRank 
72
169
11.58
Referers 
Referees 
References 
324
230
281
Search Limit
100324
Title
Citations
PageRank
Year
Finding Fallen Objects Via Asynchronous Audio-Visual Integration.00.342022
The ThreeDWorld Transport Challenge: A Visually Guided Task-and-Motion Planning Benchmark Towards Physically Realistic Embodied AI00.342022
ThreeDWorld: A Platform for Interactive Multi-Modal Physical Simulation.00.342021
AGENT: A Benchmark for Core Psychological Reasoning00.342021
Moments in Time Dataset: one million videos for event understanding280.802020
Identifying Interpretable Action Concepts in Deep Networks.00.342019
ObjectNet: A large-scale bias-controlled dataset for pushing the limits of object recognition models20.362019
Boosting Conditional Probability Estimators.00.342017
Automatic Arguments Construction - From Search Engine to Research Engine.00.342016
Exploiting label dependencies for improved sample complexity110.512013
Succinct Permanent Is NEXP-Hard with Many Hard Instances.00.342012
On Approximating the Entropy of Polynomial Mappings.110.512010
Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds40.402009
Limitations of Hardness vs. Randomness under Uniform Reductions30.402008
The Complexity of Local List Decoding100.482008
A (de)constructive approach to program checking120.602008
Worst-Case to Average-Case Reductions Revisited80.482007
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances261.092007
Verifying and decoding in constant depth150.712007
New connections between derandomization, worst-case complexity and average-case complexity50.512006
Worst-case vs. algorithmic average-case complexity in the polynomial-time hierarchy30.432006
Fooling Parity Tests with Parity Gates.160.792004
A lower bound for testing juntas150.812004