| 2024 | ICML | The Effect of Weight Precision on the Neuron Count in Deep ReLU Networks. | Songhua He, Periklis A. Papakonstantinou |
| 2021 | AMIA | Accurately and Privately Reporting Crowdsensed COVID-19 Data. | Hafiz Salman Asif, Periklis A. Papakonstantinou, Stephanie Shiau, Vivek K. Singh, Jaideep Vaidya |
| 2019 | CCS | How to Accurately and Privately Identify Anomalies. | Hafiz Salman Asif, Periklis A. Papakonstantinou, Jaideep Vaidya |
| 2016 | AAAI | Local Search for Hard SAT Formulas: The Strength of the Polynomial Law. | Sixue Liu, Periklis A. Papakonstantinou |
| 2016 | FOCS | Depth-Reduction for Composites. | Shiteng Chen, Periklis A. Papakonstantinou |
| 2016 | ICML | On the Power and Limits of Distance-Based Learning. | Periklis A. Papakonstantinou, Jia Xu, Guang Yang |
| 2014 | AAAI | Bagging by Design (on the Suboptimality of Bagging). | Periklis A. Papakonstantinou, Jia Xu, Zhu Cao |
| 2014 | CRYPTO | Cryptography with Streaming Algorithms. | Periklis A. Papakonstantinou, Guang Yang |
| 2012 | COCOON | A Remark on One-Wayness versus Pseudorandomness. | Periklis A. Papakonstantinou, Guang Yang |
| 2011 | FOCS | Pseudorandomness for Read-Once Formulas. | Andrej Bogdanov, Periklis A. Papakonstantinou, Andrew Wan |
| 2011 | TCC | Limits on the Stretch of Non-adaptive Constructions of Pseudo-Random Generators. | Josh Bronson, Ali Juma, Periklis A. Papakonstantinou |
| 2009 | MFCS | On the Structure of Optimal Greedy Computation (for Job Scheduling). | Periklis A. Papakonstantinou |
| 2008 | FOCS | On the Impossibility of Basing Identity Based Encryption on Trapdoor Permutations. | Dan Boneh, Periklis A. Papakonstantinou, Charles Rackoff, Yevgeniy Vahlis, Brent Waters |
| 2008 | SAT | Complexity and Algorithms for Well-Structured k-SAT Instances. | Konstantinos Georgiou, Periklis A. Papakonstantinou |