Luca Trevisan
Luca Trevisan
Verified email at - Homepage
TitleCited byYear
Counting distinct elements in a data stream
Z Bar-Yossef, TS Jayram, R Kumar, D Sivakumar, L Trevisan
International Workshop on Randomization and Approximation Techniques in …, 2002
Extractors and pseudorandom generators
L Trevisan
Journal of the ACM 48 (4), 860-879, 2001
Pseudorandom generators without the XOR lemma
M Sudan, L Trevisan, S Vadhan
Journal of Computer and System Sciences 62 (2), 236-266, 2001
Gadgets, approximation, and linear programming
L Trevisan, GB Sorkin, M Sudan, DP Williamson
SIAM Journal on Computing 29 (6), 2074-2097, 2000
On the efficiency of local decoding procedures for error-correcting codes
J Katz, L Trevisan
STOC, 80-86, 2000
Notions of reducibility between cryptographic primitives
O Reingold, L Trevisan, S Vadhan
Theory of Cryptography Conference, 1-20, 2004
Non-approximability results for optimization problems on bounded degree instances
L Trevisan
Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001
Multiway spectral partitioning and higher-order cheeger inequalities
JR Lee, SO Gharan, L Trevisan
Journal of the ACM (JACM) 61 (6), 37, 2014
The approximability of constraint satisfaction problems
S Khanna, M Sudan, L Trevisan, DP Williamson
SIAM Journal on Computing 30 (6), 1863-1920, 2001
Extracting randomness from samplable distributions
L Trevisan, S Vadhan
Proceedings 41st Annual Symposium on Foundations of Computer Science, 32-42, 2000
Three theorems regarding testing graph properties
O Goldreich, L Trevisan
Random Structures & Algorithms 23 (1), 23-57, 2003
A PCP characterization of NP with optimal amortized query complexity
A Samorodnitsky, L Trevisan
STOC, 191-199, 2000
Some applications of coding theory in computational complexity
L Trevisan
arXiv preprint cs/0409044, 2004
Structure in approximation classes
P Crescenzi, V Kann, R Silvestri, L Trevisan
SIAM Journal on Computing 28 (5), 1759-1782, 1999
Approximating the minimum spanning tree weight in sublinear time
B Chazelle, R Rubinfeld, L Trevisan
SIAM Journal on computing 34 (6), 1370-1379, 2005
Average-case complexity
A Bogdanov, L Trevisan
Foundations and TrendsŪ in Theoretical Computer Science 2 (1), 1-106, 2006
Gowers uniformity, influence of variables, and PCPs
A Samorodnitsky, L Trevisan
SIAM Journal on Computing 39 (1), 323-360, 2009
On worst-case to average-case reductions for NP problems
A Bogdanov, L Trevisan
SIAM Journal on Computing 36 (4), 1119-1159, 2006
Lower bounds on the efficiency of generic cryptographic constructions
R Gennaro, L Trevisan
Proceedings 41st Annual Symposium on Foundations of Computer Science, 305-313, 2000
On the efficiency of polynomial time approximation schemes
M Cesati, L Trevisan
Information Processing Letters 64 (4), 165-171, 1997
The system can't perform the operation now. Try again later.
Articles 1–20