Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Papakonstantinou, Periklis A. - Institute for Theoretical Computer Science, Tsinghua University
How strong is Nisan's pseudo-random generator? Matei David Periklis A. Papakonstantinou Anastasios Sidiropoulos
Complexity and Algorithms for Well-Structured k-SAT Instances
Limits on the Stretch of Non-Adaptive Constructions of Pseudo-Random Generators
A Note on Width-Parameterized SAT: an exact machine-model characterization
Trade-off Lower Bounds for Stack Machines Matei David
Limits on the Stretch of Non-Adaptive Constructions of Pseudo-Random Generators
Computationally Limited Randomness Matei David1
On the Structure of Optimal Greedy Computation (for Job Scheduling)
Characterizing sets of jobs that admit optimal greedy-like Periklis A. Papakonstantinou
Constructions, Lower Bounds, and New Directions in Cryptography and Computational Complexity
On The Impossibility of Basing Identity Based Encryption on Trapdoor Permutations
Pseudorandomness for read-once formulas Andrej Bogdanov
