Luke Friedman

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 4

Top Topics

Resource Bounded

Top Venues

Log. Methods Comput. Sci.

Publications

Long Zhao, Nitesh Bharadwaj Gundavarapu, Liangzhe Yuan, Hao Zhou, Shen Yan, Jennifer J. Sun, Luke Friedman, Rui Qian, Tobias Weyand, Yue Zhao, Rachel Hornung, Florian Schroff, Ming-Hsuan Yang, David A. Ross, Huisheng Wang, Hartwig Adam, Mikhail Sirotenko, Ting Liu, Boqing Gong
VideoPrism: A Foundational Visual Encoder for Video Understanding. CoRR (2024)
Warren R. Morningstar, Alex Bijamov, Chris Duvarney, Luke Friedman, Neha Mukund Kalibhat, Luyang Liu, Philip Andrew Mansfield, Renan A. Rojas-Gomez, Karan Singhal, Bradley Green, Sushant Prakash
Augmentations vs Algorithms: What Works in Self-Supervised Learning. CoRR (2024)
Luke Friedman, Sameer Ahuja, David Allen, Terry Tan, Hakim Sidahmed, Changbo Long, Jun Xie, Gabriel Schubiner, Ajay Patel, Harsh Lara, Brian Chu, Zexi Chen, Manoj Tiwari
Leveraging Large Language Models in Conversational Recommender Systems. CoRR (2023)
Liangzhe Yuan, Nitesh Bharadwaj Gundavarapu, Long Zhao, Hao Zhou, Yin Cui, Lu Jiang, Xuan Yang, Menglin Jia, Tobias Weyand, Luke Friedman, Mikhail Sirotenko, Huisheng Wang, Florian Schroff, Hartwig Adam, Ming-Hsuan Yang, Ting Liu, Boqing Gong
VideoGLUE: Video General Understanding Evaluation of Foundation Models. CoRR (2023)
Eric Allender, Harry Buhrman, Luke Friedman, Bruno Loff
Reductions to the set of random strings: The resource-bounded case. Log. Methods Comput. Sci. 10 (3) (2014)
Luke Friedman
A Framework for Proving Proof Complexity Lower Bounds on Random CNFs Using Encoding Techniques. Electron. Colloquium Comput. Complex. 20 (2013)
Luke Friedman, Yixin Xu
Exponential Lower Bounds for Refuting Random Formulas Using Ordered Binary Decision Diagrams. CSR (2013)
Eric Allender, Luke Friedman, William I. Gasarch
Limits on the computational power of random strings. Inf. Comput. 222 (2013)
Luke Friedman, Yixin Xu
Exponential Lower Bounds for Refuting Random Formulas Using Ordered Binary Decision Diagrams. Electron. Colloquium Comput. Complex. 20 (2013)
Eric Allender, George Davie, Luke Friedman, Samuel Hopkins, Iddo Tzameret
Kolmogorov Complexity, Circuits, and the Strength of Formal Theories of Arithmetic. Chic. J. Theor. Comput. Sci. 2013 (2013)
Eric Allender, Harry Buhrman, Luke Friedman, Bruno Loff
Reductions to the Set of Random Strings: The Resource-Bounded Case. MFCS (2012)
Eric Allender, Harry Buhrman, Luke Friedman, Bruno Loff
Reductions to the set of random strings: the resource-bounded case. Electron. Colloquium Comput. Complex. 19 (2012)
Eric Allender, George Davie, Luke Friedman, Samuel Hopkins, Iddo Tzameret
Kolmogorov Complexity, Circuits, and the Strength of Formal Theories of Arithmetic. Electron. Colloquium Comput. Complex. 19 (2012)
Eric Allender, Luke Friedman, William I. Gasarch
Limits on the Computational Power of Random Strings. ICALP (1) (2011)
Eric Allender, Luke Friedman, William I. Gasarch
Exposition of the Muchnik-Positselsky Construction of a Prefix Free Entropy Function that is not Complete under Truth-Table Reductions. Electron. Colloquium Comput. Complex. 17 (2010)
Eric Allender, Luke Friedman, William I. Gasarch
Limits on the Computational Power of Random Strings. Electron. Colloquium Comput. Complex. 17 (2010)