( en | de | ru )

 

Disambiguation of "Gutfreund, Dan"

Author of the publication

copydeleteadd this publication to your clipboard
On Approximating the Entropy of Polynomial Mappings.

, , , and . Electron. Colloquium Comput. Complex., (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ludmilla Gutfreund

Klaus Siegfried Gutfreund

Dan Tidten

Dan Bauer

Dan Wang

 

Other publications of authors with the same name

3D Neural Embedding Likelihood: Probabilistic Inverse Graphics for Robust 6D Pose Estimation., , , , , , , and . ICCV, page 21568-21579. IEEE, (2023)New connections between derandomization, worst-case complexity and average-case complexity., and . Electron. Colloquium Comput. Complex., (2006)On Approximating the Entropy of Polynomial Mappings., , , and . Electron. Colloquium Comput. Complex., (2010)Solving the Baby Intuitions Benchmark with a Hierarchically Bayesian Theory of Mind., , , , , and . CoRR, (2022)Multi-Moments in Time: Learning and Interpreting Models for Multi-Action Video Understanding., , , , , , , , , and . IEEE Trans. Pattern Anal. Mach. Intell., 44 (12): 9434-9445 (2022)Fooling Parity Tests with Parity Gates., and . APPROX-RANDOM, volume 3122 of Lecture Notes in Computer Science, page 381-392. Springer, (2004)ObjectNet: A large-scale bias-controlled dataset for pushing the limits of object recognition models., , , , , , , and . NeurIPS, page 9448-9458. (2019)Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds., and . CCC, page 38-49. IEEE Computer Society, (2010)Automatic Arguments Construction - From Search Engine to Research Engine., , and . AAAI Fall Symposia, AAAI Press, (2016)Verifying and decoding in constant depth., , , , and . STOC, page 440-449. ACM, (2007)