|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 6 occurrences of 6 keywords
|
|
|
|
|
Results
Found 17 publication records. Showing 17 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Periklis A. Papakonstantinou, Guang Yang |
A remark on one-wayness versus pseudorandomness.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2012 |
DBLP BibTeX RDF |
|
| 1 | 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) |
2012 |
DBLP BibTeX RDF |
|
| 1 | Matei David, Periklis A. Papakonstantinou, Anastasios Sidiropoulos |
How strong is Nisanʼs pseudo-random generator? |
Inf. Process. Lett. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrej Bogdanov, Periklis A. Papakonstantinou, Andrew Wan |
Pseudorandomness for read-once formulas. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Shiteng Chen, Tiancheng Lou, Periklis A. Papakonstantinou, Bangsheng Tang |
Width-parameterized SAT: Time-Space Tradeoffs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Josh Bronson, Ali Juma, Periklis A. Papakonstantinou |
Limits on the Stretch of Non-adaptive Constructions of Pseudo-Random Generators. |
TCC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Matei David, Phuong Nguyen, Periklis A. Papakonstantinou, Anastasios Sidiropoulos |
Computationally Limited Randomness. |
ICS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Andrej Bogdanov, Periklis A. Papakonstantinou, Andrew Wan |
Pseudorandomness for Read-Once Formulas. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Periklis A. Papakonstantinou, Charles Rackoff |
Characterizing sets of jobs that admit optimal greedy-like algorithms. |
J. Scheduling |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Matei David, Periklis A. Papakonstantinou |
Trade-Off Lower Bounds for Stack Machines. |
IEEE Conference on Computational Complexity |
2010 |
DBLP DOI BibTeX RDF |
AuxPDA, lower bound, streaming, communication complexity, stack, reversals, space bound |
| 1 | Periklis A. Papakonstantinou |
A note on width-parameterized SAT: An exact machine-model characterization. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Matei David, Periklis A. Papakonstantinou, Anastasios Sidiropoulos |
Polynomial Time with Restricted Use of Randomness. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Christophe Meyer, Periklis A. Papakonstantinou |
On the complexity of constructing Golomb Rulers. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Periklis A. Papakonstantinou |
On the Structure of Optimal Greedy Computation (for Job Scheduling). |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Konstantinos Georgiou, Periklis A. Papakonstantinou |
Complexity and Algorithms for Well-Structured k-SAT Instances. |
SAT |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Dan Boneh, Periklis A. Papakonstantinou, Charles Rackoff, Yevgeniy Vahlis, Brent Waters |
On the Impossibility of Basing Identity Based Encryption on Trapdoor Permutations. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Periklis A. Papakonstantinou |
Hierarchies for classes of priority algorithms for Job Scheduling. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #17 of 17 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")