List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Depth reduction for composites SIAM Journal on Computing | 2019-05-07 | Paper |
| Space-bounded communication complexity Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
| Correlation lower bounds from correlation upper bounds Information Processing Letters | 2016-05-10 | Paper |
| Width-parametrized SAT: time-space tradeoffs Theory of Computing | 2015-02-03 | Paper |
| Tradeoff lower lounds for stack machines Computational Complexity | 2014-09-25 | Paper |
| Cryptography with Streaming Algorithms Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
| Pseudorandomness for Read-Once Formulas 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
| How strong is Nisan's pseudo-random generator? Information Processing Letters | 2013-04-04 | Paper |
| Pseudorandomness for Linear Length Branching Programs and Stack Machines Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
| A remark on one-wayness versus pseudorandomness Lecture Notes in Computer Science | 2012-09-25 | Paper |
| Limits on the stretch of non-adaptive constructions of pseudo-random generators Theory of Cryptography | 2011-05-19 | Paper |
| A note on width-parameterized SAT: an exact machine-model characterization Information Processing Letters | 2010-09-02 | Paper |
| Characterizing sets of jobs that admit optimal greedy-like algorithms Journal of Scheduling | 2010-04-21 | Paper |
| On the Structure of Optimal Greedy Computation (for Job Scheduling) Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
| On the complexity of constructing Golomb rulers Discrete Applied Mathematics | 2009-06-30 | Paper |
| Complexity and Algorithms for Well-Structured k-SAT Instances Theory and Applications of Satisfiability Testing – SAT 2008 | 2008-05-27 | Paper |
| Hierarchies for classes of priority algorithms for job scheduling Theoretical Computer Science | 2006-03-24 | Paper |
Research outcomes over time
This page was built for person: Periklis A. Papakonstantinou
