The following pages link to Luca Trevisan (Q190553):
Displaying 9 items.
- Pseudorandom generators without the XOR lemma (Q5943089) (← links)
- Expansion and flooding in dynamic random networks with node churn (Q6051059) (← links)
- Structure in approximation classes (Q6085751) (← links)
- Minimum vertex cover, distributed decision-making, and communication complexity (Q6184364) (← links)
- Cut sparsification of the Clique beyond the Ramanujan bound: a separation of cut versus spectral sparsification (Q6575228) (← links)
- Bond percolation in small-world graphs with power-law distribution (Q6590083) (← links)
- A Ihara-Bass formula for non-Boolean matrices and strong refutations of random CSPs (Q6640364) (← links)
- New SDP roundings and certifiable approximation for cubic optimization (Q6645442) (← links)
- The minority dynamics and the power of synchronicity (Q6645513) (← links)