The following pages link to Luca Trevisan (Q190553):
Displaying 50 items.
- (Q4437488) (← links)
- (Q4440423) (← links)
- (Q4470516) (← links)
- Gadgets, Approximation, and Linear Programming (Q4507337) (← links)
- When Hamming Meets Euclid: The Approximability of Geometric TSP and Steiner Tree (Q4507360) (← links)
- (Q4526966) (← links)
- (Q4535797) (← links)
- (Q4542548) (← links)
- Stabilizing Consensus with Many Opinions (Q4575624) (← links)
- Approximation of non-boolean 2CSP (Q4575701) (← links)
- An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs (Q4575797) (← links)
- Find Your Place: Simple Distributed Algorithms for Community Detection (Q4575798) (← links)
- Positive linear programming, parallel approximation and PCP's (Q4595478) (← links)
- An Alon-Boppana Type Bound for Weighted Graphs and Lowerbounds for Spectral Sparsification (Q4607973) (← links)
- Near-Optimal UGC-hardness of Approximating Max k-CSP_R (Q4636446) (← links)
- (Q4650573) (← links)
- On Local Versus Global Satisfiability (Q4652606) (← links)
- (Q4780778) (← links)
- Max Cut and the Smallest Eigenvalue (Q4910584) (← links)
- Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming (Q5001844) (← links)
- Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut (Q5009512) (← links)
- Average whenever you meet: opportunistic protocols for community detection (Q5009564) (← links)
- Near-optimal NP-hardness of approximating \textsc{Max} \(k\)-\(\mathrm{CSP}_R\) (Q5077145) (← links)
- From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701) (← links)
- Find Your Place: Simple Distributed Algorithms for Community Detection (Q5115703) (← links)
- A New Algorithm for the Robust Semi-random Independent Set Problem (Q5146814) (← links)
- Finding a Bounded-Degree Expander Inside a Dense One (Q5146853) (← links)
- Max cut and the smallest eigenvalue (Q5172720) (← links)
- Non-approximability results for optimization problems on bounded degree instances (Q5176001) (← links)
- Gowers Uniformity, Influence of Variables, and PCPs (Q5189548) (← links)
- Optimal Lower Bounds for Sketching Graph Cuts (Q5236348) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313044) (← links)
- Approximating the Minimum Spanning Tree Weight in Sublinear Time (Q5317201) (← links)
- Partitioning into Expanders (Q5384055) (← links)
- Multi-way spectral partitioning and higher-order cheeger inequalities (Q5415539) (← links)
- Extractors and pseudorandom generators (Q5441361) (← links)
- Some Applications of Coding Theory in Computational Complexity (Q5465364) (← links)
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (Q5479362) (← links)
- On ε‐biased generators in NC<sup>0</sup> (Q5486308) (← links)
- Pseudorandomness and Combinatorial Constructions (Q5491027) (← links)
- Improved Cheeger's inequality (Q5495771) (← links)
- (Q5500595) (← links)
- Approximating Succinct MaxSat (Q5696308) (← links)
- Bounds on the Efficiency of Generic Cryptographic Constructions (Q5700578) (← links)
- Theory of Cryptography (Q5711663) (← links)
- On Worst‐Case to Average‐Case Reductions for NP Problems (Q5757460) (← links)
- Consensus vs Broadcast, with and without Noise (Q5875742) (← links)
- Information spreading in dynamic graphs (Q5891966) (← links)
- Theory of Cryptography (Q5901762) (← links)
- Approximating layout problems on random graphs (Q5937937) (← links)
