- David P. Woodruff, Peilin Zhong, 2016 IEEE 32nd International Conference on Data Engineering (ICDE), 2016, 847
- Pavel Hrube, Amir Yehudayoff, 2013 IEEE Conference on Computational Complexity, 2013, 10
- Ivo Kubjas, Vitaly Skachek, 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2017, 390
- Pavel Hrubes, Pavel Pudlak, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), 2017, 121
- Alexander Knop, Shachar Lovett, Sam McGuire, Weiqiang Yuan, Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021, 197
- Anna Gál, Ridwan Syed, 12730, Computer Science – Theory and Applications, 2021, 116
- Anna Gál, Jing-Tang Jang, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah, “Space-Efficient Approximations for Subset Sum”, ACM Trans. Comput. Theory, 8, no. 4, 2016, 1
- Dana Ron, Gilad Tsur, “Testing computability by width-two OBDDs”, Theoretical Computer Science, 420, 2012, 64
- Joshua Brody, Amit Chakrabarti, Ranganath Kondapally, David P. Woodruff, Grigory Yaroslavtsev, “Certifying Equality With Limited Interaction”, Algorithmica, 76, no. 3, 2016, 796
- P. Beame, T. Pitassi, N. Segerlind, A. Wigderson, 20th Annual IEEE Conference on Computational Complexity (CCC'05), 2005, 52