Periklis A. Papakonstantinou

发表

Periklis A. Papakonstantinou, Andrew Wan, Andrej Bogdanov, 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

How strong is Nisanʼs pseudo-random generator?

Periklis A. Papakonstantinou, Matei David, Anastasios Sidiropoulos, 2011, Inf. Process. Lett..

Overlays and Limited Memory Communication

Periklis A. Papakonstantinou, Hao Song, Dominik Scheder, 2014, 2014 IEEE 29th Conference on Computational Complexity (CCC).

Characterizing sets of jobs that admit optimal greedy-like algorithms

Periklis A. Papakonstantinou, Charles Rackoff, C. Rackoff, 2010, J. Sched..

Space-bounded communication complexity

Periklis A. Papakonstantinou, Joshua Brody, Xiaoming Sun, 2013, ITCS '13.

Correlation lower bounds from correlation upper bounds

Periklis A. Papakonstantinou, Shiteng Chen, 2016, Inf. Process. Lett..

Width-parameterized SAT: Time-Space Tradeoffs pdf

Periklis A. Papakonstantinou, Eric Allender, Shiteng Chen, 2011, ArXiv.

The Depth Irreducibility Hypothesis

Periklis A. Papakonstantinou, 2014, Electron. Colloquium Comput. Complex..

Time-space tradeoffs for width-parameterized SAT: Algorithms and lower bounds

Periklis A. Papakonstantinou, Eric Allender, Shiteng Chen, 2012, Electron. Colloquium Comput. Complex..

Polynomial Time with Restricted Use of Randomness

Periklis A. Papakonstantinou, Matei David, Anastasios Sidiropoulos, 2009, Electron. Colloquium Comput. Complex..

Bagging by Design (on the Suboptimality of Bagging)

Periklis A. Papakonstantinou, Jia Xu, Zhu Cao, 2014, AAAI.

Overlays and Limited Memory Communication Mode(l)s

Periklis A. Papakonstantinou, Hao Song, Dominik Scheder, 2013, Electron. Colloquium Comput. Complex..

Pseudorandomness for Linear Length Branching Programs and Stack Machines

Periklis A. Papakonstantinou, Andrew Wan, Andrej Bogdanov, 2012, APPROX-RANDOM.

On the Power and Limits of Distance-Based Learning

Periklis A. Papakonstantinou, Guang Yang, Jia Xu, 2016, ICML.

On the complexity of constructing Golomb Rulers

Periklis A. Papakonstantinou, Christophe Meyer, Christophe Meyer, 2009, Discret. Appl. Math..

True Randomness from Big Data

Periklis A. Papakonstantinou, David P. Woodruff, Guang Yang, 2016, Scientific Reports.

Complexity and Algorithms for Well-Structured k-SAT Instances

Periklis A. Papakonstantinou, Konstantinos Georgiou, Konstantinos Georgiou, 2008, SAT.

A Guide for Private Outlier Analysis

Periklis A. Papakonstantinou, Jaideep Vaidya, Hafiz Asif, 2020, IEEE Letters of the Computer Society.

A note on width-parameterized SAT: An exact machine-model characterization

Periklis A. Papakonstantinou, 2009, Inf. Process. Lett..

Depth-Reduction for Composites

Periklis A. Papakonstantinou, Shiteng Chen, 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

Limits on the Stretch of Non-adaptive Constructions of Pseudo-Random Generators

Periklis A. Papakonstantinou, Ali Juma, Josh Bronson, 2011, TCC.

Local Search for Hard SAT Formulas: The Strength of the Polynomial Law

Periklis A. Papakonstantinou, Sixue Liu, S. Liu, 2016, AAAI.

Hierarchies for classes of priority algorithms for Job Scheduling

Periklis A. Papakonstantinou, 2006, Theor. Comput. Sci..

How powerful are the DDH hard groups?

Periklis A. Papakonstantinou, Yevgeniy Vahlis, Charles Rackoff, 2012, Electron. Colloquium Comput. Complex..

How to Accurately and Privately Identify Anomalies

Periklis A. Papakonstantinou, Jaideep Vaidya, Hafiz Salman Asif, 2019, CCS.

A Remark on One-Wayness versus Pseudorandomness

Periklis A. Papakonstantinou, Guang Yang, Guang Yang, 2012, COCOON.

On the Structure of Optimal Greedy Computation (for Job Scheduling)

Periklis A. Papakonstantinou, 2009, MFCS.

Computationally Limited Randomness

Periklis A. Papakonstantinou, Phuong Nguyen, Matei David, 2011, ICS.

Tradeoff lower lounds for stack machines

Periklis A. Papakonstantinou, Matei David, Matei David, 2014, computational complexity.

On the Impossibility of Basing Identity Based Encryption on Trapdoor Permutations

Periklis A. Papakonstantinou, Brent Waters, Dan Boneh, 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

Trade-Off Lower Bounds for Stack Machines

Periklis A. Papakonstantinou, Matei David, Matei David, 2010, 2010 IEEE 25th Annual Conference on Computational Complexity.

Depth Reduction for Composites

Periklis A. Papakonstantinou, Shiteng Chen, 2019, SIAM J. Comput..

Unidirectional Lambek Grammars in Polynomial Time

Periklis A. Papakonstantinou, Gerald Penn, Yevgeniy Vahlis, 2007 .

Constructions, Lower Bounds, and New Directions in Cryptography and Computational Complexity

Periklis A. Papakonstantinou, 2010 .

Width-Parameterized SAT: Time-Space Tradeoffs

Periklis A. Papakonstantinou, Eric Allender, Shiteng Chen, 2011 .

Circuits with composite moduli

Periklis A. Papakonstantinou, 2016 .

Intelligent Pandemic Surveillance via Privacy-Preserving Crowdsensing

Periklis A. Papakonstantinou, Jaideep Vaidya, Vivek Singh, 2022, IEEE Intelligent Systems.

Deep Neural Networks: The Missing Complexity Parameter

Periklis A. Papakonstantinou, Songhua He, 2022 .

Hide and Seek: Scaling Machine Learning for Combinatorial Optimization via the Probabilistic Method

Periklis A. Papakonstantinou, D. Achlioptas, Amrit Daswaney, 2022, ArXiv.

Cryptography with Streaming Algorithms

Periklis A. Papakonstantinou, Guang Yang, 2014, CRYPTO.

Width-Parameterized SAT : Time-Space Tradeoffs

Periklis A. Papakonstantinou, Bangsheng Tang, Shiteng Chen, 2015 .

Basic counting

Periklis A. Papakonstantinou, 2020 .

Arbitrarily Large Labelled Random Satisfiability Formulas for Machine Learning Training

Periklis A. Papakonstantinou, D. Achlioptas, Amrit Daswaney, 2022, 2211.15368.