- Pseudorandom Bit Generators That Fool Modular Sums
- On WorstCase to AverageCase Reductions for NP Problems Andrej Bogdanov # Luca Trevisan +
- Approximation Algorithms for Unique Games Luca Trevisan
- Pseudorandomness and Averagecase Complexity via Uniform Reductions Luca Trevisan # Salil Vadhan +
- A Lower Bound for Testing 3Colorability in Boundeddegree Graphs Andrej Bogdanov # Kenji Obata + Luca Trevisan #
- Construction of Extractors Using PseudoRandom Generators [Extended Abstract]
- A Case Study of Derandomization Methods for Combinatorial Approximation Algorithms \Lambda
- Approximating Satisfiable Satisfiability Problems # Luca Trevisan +
- Submitted to SIAM Journal on Computing
- Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval
- The Approximability of Constraint Satisfaction Problems \Lambda
- On Approximation Scheme Preserving Reducibility and Its Applications ?
- Compression of Samplable Sources Luca Trevisan #
- On Local versus Global Satisfiability [Preliminary Version]
- A Note on Approximate Counting for k-DNF Luca Trevisan
- Additive Combinatorics and Theoretical Computer Science Luca Trevisan
- On the Efficiency of Polynomial Time Approximation Schemes
- Lower Bounds on the Efficiency of Generic Cryptographic Constructions Rosario Gennaro
- The Parallel Complexity of Positive Linear Programming
- When Hamming Meets Euclid: The Approximability of Geometric TSP and MST
- A tight characterization of NP with 3 query PCPs Venkatesan Guruswami \Lambda Daniel Lewin \Lambda Madhu Sudan \Lambda Luca Trevisan \Lambday
- Approximating Satisfiable Satisfiability Problems
- Extracting Randomness from Samplable Distributions Luca Trevisan Salil Vadhan y
- Bounds on the E#ciency of Generic Cryptographic Constructions #
- Submitted to Theoretical Computer Science
- On Uniform Amplification of Hardness in NP Luca Trevisan
- Minimum Vertex Cover, Distributed DecisionMaking, and Communication
- Gadgets, Approximation, and Linear Programming [Extended Abstract]
- List-Decoding Using The XOR Lemma Luca Trevisan
- Interactive and Probabilistic ProofChecking Luca Trevisan #
- On Weighted vs Unweighted Versions of Combinatorial Optimization Problems #
- Gadgets, Approximation, and Linear Programming \Lambda Luca Trevisan y Gregory B. Sorkin z
- Improved Pseudorandom Generators for Depth 2 Circuits Omid Etesami
- Positive Linear Programming, Parallel Approximation and PCP's ?
- ListDecoding of Linear Functions and Analysis of a TwoRound ZeroKnowledge Argument
- Pseudorandom generators without the XOR Lemma \Lambda [Extended Abstract]
- Amplifying Collision Resistance: A Complexity-Theoretic Treatment
- Extractors Using Hardness Amplification Anindya De and Luca Trevisan
- The Complexity of Making Unique Choices: Approximating 1-in-k SAT
- Approximation Algorithms for Unique Games Luca Trevisan
- Three Theorems Regarding Testing Graph Properties*
- Some Applications of Coding Theory in Computational Complexity Luca Trevisan
- Parallel Approximation Algorithms by Positive Linear Programming \Lambda
- When Hamming Meets Euclid: The Approximability of Geometric TSP and Steiner Tree #
- On the Distributed DecisionMaking Complexity of the Minimum Vertex Cover Problem ; ?;??
- Weak Random Sources, Hitting Sets, and BPP Simulations \Lambda
- Recycling Queries in PCPs and in Linearity Tests [Extended Abstract]
- On Hardness Amplification of One-Way Henry Lin, Luca Trevisan , and Hoeteck Wee
- Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms
- Inapproximability of Combinatorial Optimization Problems Luca Trevisan #
- The (Parallel) Approximability of NonBoolean Satisfiability Problems and Restricted Integer
- A Complexity Analysis of Bisimilarity for ValuePassing Processes \Lambda
- On Worst-Case to Average-Case Reductions for NP Problems Andrej Bogdanov
- Notions of Reducibility between Cryptographic Primitives #
- Gowers Uniformity, Influence of Variables, and PCPs Alex Samorodnitsky
- On WorstCase to AverageCase Reductions for NP Problems Andrej Bogdanov
- ListDecoding Using The XOR Lemma Luca Trevisan #
- A PCP Characterization of NP with Optimal Amortized Query Complexity
- Max NPcompleteness Made Easy Pierluigi Crescenzi \Lambda Luca Trevisan y
- Extractors and Pseudorandom Generators Luca Trevisan y
- Weak Random Sources, Hitting Sets, and BPP Simulations
- Nonapproximability results for optimization problems on bounded degree instances
- Some Applications of Coding Theory in Computational Complexity Luca Trevisan #
- A Note on MinimumArea Upward Drawing of Complete and Fibonacci Trees
- Pseudorandom generators without the XOR Lemma \Lambda Madhu Sudan y Luca Trevisan z Salil Vadhan x
- On #Biased Generators in NC 0 Elchanan Mossel # Amir Shpilka + Luca Trevisan #
- Approximating the Minimum Spanning Tree Weight in Sublinear Time
- Max Cut and the Smallest Eigenvalue Luca Trevisan
- Lower Bounds for Testing Bipartiteness in Dense Graphs Andrej Bogdanov # Luca Trevisan +
- On the Efficiency of Local Decoding Procedures for ErrorCorrecting Codes
- Improved Nonapproximability Results for Vertex Cover with Density Constraints
- Extractors and Pseudorandom Generators Luca Trevisan
