Periklis A. Papakonstantinou

Available identifiers

Publication	Date of Publication	Type
Depth Reduction for Composites	2019-05-07	Paper
Space-bounded communication complexity	2017-05-16	Paper
Correlation lower bounds from correlation upper bounds	2016-05-10	Paper
https://portal.mardi4nfdi.de/entity/Q5497123	2015-02-03	Paper
Tradeoff lower lounds for stack machines	2014-09-25	Paper
Cryptography with Streaming Algorithms	2014-08-07	Paper
Pseudorandomness for Read-Once Formulas	2014-07-30	Paper
How strong is Nisan's pseudo-random generator?	2013-04-04	Paper
Pseudorandomness for Linear Length Branching Programs and Stack Machines	2012-11-02	Paper
A Remark on One-Wayness versus Pseudorandomness	2012-09-25	Paper
Limits on the Stretch of Non-adaptive Constructions of Pseudo-Random Generators	2011-05-19	Paper
A note on width-parameterized SAT: an exact machine-model characterization	2010-09-02	Paper
Characterizing sets of jobs that admit optimal greedy-like algorithms	2010-04-21	Paper
On the Structure of Optimal Greedy Computation (for Job Scheduling)	2009-10-16	Paper
On the complexity of constructing Golomb rulers	2009-06-30	Paper
Complexity and Algorithms for Well-Structured k-SAT Instances	2008-05-27	Paper
Hierarchies for classes of priority algorithms for job scheduling	2006-03-24	Paper

This page was built for person: Periklis A. Papakonstantinou