The following pages link to Periklis A. Papakonstantinou (Q280947):
Displayed 17 items.
- Correlation lower bounds from correlation upper bounds (Q280948) (← links)
- Tradeoff lower lounds for stack machines (Q744614) (← links)
- Hierarchies for classes of priority algorithms for job scheduling (Q818127) (← links)
- Characterizing sets of jobs that admit optimal greedy-like algorithms (Q964871) (← links)
- A note on width-parameterized SAT: an exact machine-model characterization (Q990090) (← links)
- On the complexity of constructing Golomb rulers (Q1028469) (← links)
- How strong is Nisan's pseudo-random generator? (Q1944139) (← links)
- Cryptography with Streaming Algorithms (Q2874530) (← links)
- A Remark on One-Wayness versus Pseudorandomness (Q2914351) (← links)
- Space-bounded communication complexity (Q2986867) (← links)
- Limits on the Stretch of Non-adaptive Constructions of Pseudo-Random Generators (Q3000560) (← links)
- Pseudorandomness for Linear Length Branching Programs and Stack Machines (Q3167416) (← links)
- On the Structure of Optimal Greedy Computation (for Job Scheduling) (Q3182959) (← links)
- Complexity and Algorithms for Well-Structured k-SAT Instances (Q3502698) (← links)
- Depth Reduction for Composites (Q4634033) (← links)
- Pseudorandomness for Read-Once Formulas (Q5494968) (← links)
- (Q5497123) (← links)