- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| c10 |      | Joshua Brody, Shiteng Chen, Periklis A. Papakonstantinou, Hao Song, Xiaoming Sun: Space-bounded communication complexity. ITCS 2013: 159-172 |
| 2012 | ||
| c9 | | Andrej Bogdanov, Periklis A. Papakonstantinou, Andrew Wan: Pseudorandomness for Linear Length Branching Programs and Stack Machines. APPROX-RANDOM 2012: 447-458 |
| c8 | | Periklis A. Papakonstantinou, Guang Yang: A Remark on One-Wayness versus Pseudorandomness. COCOON 2012: 482-494 |
| i7 | | Periklis A. Papakonstantinou, Guang Yang: A remark on one-wayness versus pseudorandomness. Electronic Colloquium on Computational Complexity (ECCC) 19: 5 (2012) |
| i6 | | Eric Allender, Shiteng Chen, Tiancheng Lou, Periklis A. Papakonstantinou, Bangsheng Tang: Time-space tradeoffs for width-parameterized SAT: Algorithms and lower bounds. Electronic Colloquium on Computational Complexity (ECCC) 19: 27 (2012) |
| i5 | | Periklis A. Papakonstantinou, Charles Rackoff, Yevgeniy Vahlis: How powerful are the DDH hard groups? Electronic Colloquium on Computational Complexity (ECCC) 19: 167 (2012) |
| i4 | | Periklis A. Papakonstantinou, Charles Rackoff, Yevgeniy Vahlis: How powerful are the DDH hard groups? IACR Cryptology ePrint Archive 2012: 653 (2012) |
| 2011 | ||
| j5 | | Matei David, Periklis A. Papakonstantinou, Anastasios Sidiropoulos: How strong is Nisanʼs pseudo-random generator? Inf. Process. Lett. 111(16): 804-808 (2011) |
| c7 | | Andrej Bogdanov, Periklis A. Papakonstantinou, Andrew Wan: Pseudorandomness for Read-Once Formulas. FOCS 2011: 240-246 |
| c6 | | Matei David, Phuong Nguyen, Periklis A. Papakonstantinou, Anastasios Sidiropoulos: Computationally Limited Randomness. ICS 2011: 522-536 |
| c5 | | Josh Bronson, Ali Juma, Periklis A. Papakonstantinou: Limits on the Stretch of Non-adaptive Constructions of Pseudo-Random Generators. TCC 2011: 504-521 |
| i3 | | Shiteng Chen, Tiancheng Lou, Periklis A. Papakonstantinou, Bangsheng Tang: Width-parameterized SAT: Time-Space Tradeoffs. CoRR abs/1108.2385 (2011) |
| i2 | | Andrej Bogdanov, Periklis A. Papakonstantinou, Andrew Wan: Pseudorandomness for read-once formulas. Electronic Colloquium on Computational Complexity (ECCC) 18: 117 (2011) |
| 2010 | ||
| j4 | | Periklis A. Papakonstantinou, Charles Rackoff: Characterizing sets of jobs that admit optimal greedy-like algorithms. J. Scheduling 13(2): 163-176 (2010) |
| c4 | | Matei David, Periklis A. Papakonstantinou: Trade-Off Lower Bounds for Stack Machines. IEEE Conference on Computational Complexity 2010: 163-171 |
| 2009 | ||
| j3 | | Christophe Meyer, Periklis A. Papakonstantinou: On the complexity of constructing Golomb Rulers. Discrete Applied Mathematics 157(4): 738-748 (2009) |
| j2 | | Periklis A. Papakonstantinou: A note on width-parameterized SAT: An exact machine-model characterization. Inf. Process. Lett. 110(1): 8-12 (2009) |
| c3 | | Periklis A. Papakonstantinou: On the Structure of Optimal Greedy Computation (for Job Scheduling). MFCS 2009: 612-623 |
| i1 | | Matei David, Periklis A. Papakonstantinou, Anastasios Sidiropoulos: Polynomial Time with Restricted Use of Randomness. Electronic Colloquium on Computational Complexity (ECCC) 16: 39 (2009) |
| 2008 | ||
| c2 | | Dan Boneh, Periklis A. Papakonstantinou, Charles Rackoff, Yevgeniy Vahlis, Brent Waters: On the Impossibility of Basing Identity Based Encryption on Trapdoor Permutations. FOCS 2008: 283-292 |
| c1 | | Konstantinos Georgiou, Periklis A. Papakonstantinou: Complexity and Algorithms for Well-Structured k-SAT Instances. SAT 2008: 105-118 |
| 2006 | ||
| j1 | | Periklis A. Papakonstantinou: Hierarchies for classes of priority algorithms for Job Scheduling. Theor. Comput. Sci. 352(1-3): 181-189 (2006) |
Colors in the list of coauthors
Last update Wed May 22 15:09:01 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page