Luca Trevisan
Luca Trevisan
Bestätigte E-Mail-Adresse bei unibocconi.it - Startseite
Titel
Zitiert von
Zitiert von
Jahr
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
4682002
Extractors and pseudorandom generators
L Trevisan
Journal of the ACM 48 (4), 860-879, 2001
438*2001
Pseudorandom generators without the XOR lemma
M Sudan, L Trevisan, S Vadhan
Journal of Computer and System Sciences 62 (2), 236-266, 2001
4002001
On the efficiency of local decoding procedures for error-correcting codes
J Katz, L Trevisan
Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000
2942000
Gadgets, approximation, and linear programming
L Trevisan, GB Sorkin, M Sudan, DP Williamson
SIAM Journal on Computing 29 (6), 2074-2097, 2000
2862000
Notions of reducibility between cryptographic primitives
O Reingold, L Trevisan, S Vadhan
Theory of Cryptography Conference, 1-20, 2004
2542004
Multiway spectral partitioning and higher-order cheeger inequalities
JR Lee, SO Gharan, L Trevisan
Journal of the ACM (JACM) 61 (6), 1-30, 2014
2432014
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
2272001
Extracting randomness from samplable distributions
L Trevisan, S Vadhan
Proceedings 41st Annual Symposium on Foundations of Computer Science, 32-42, 2000
1982000
The approximability of constraint satisfaction problems
S Khanna, M Sudan, L Trevisan, DP Williamson
SIAM Journal on Computing 30 (6), 1863-1920, 2001
1972001
Three theorems regarding testing graph properties
O Goldreich, L Trevisan
Random Structures & Algorithms 23 (1), 23-57, 2003
1852003
A PCP characterization of NP with optimal amortized query complexity
A Samorodnitsky, L Trevisan
Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000
1792000
Average-case complexity
A Bogdanov, L Trevisan
arXiv preprint cs/0606037, 2006
1632006
Some applications of coding theory in computational complexity
L Trevisan
arXiv preprint cs/0409044, 2004
1612004
Approximating the minimum spanning tree weight in sublinear time
B Chazelle, R Rubinfeld, L Trevisan
SIAM Journal on computing 34 (6), 1370-1379, 2005
158*2005
Structure in approximation classes
P Crescenzi, V Kann, R Silvestri, L Trevisan
SIAM Journal on Computing 28 (5), 1759-1782, 1999
154*1999
On worst-case to average-case reductions for NP problems
A Bogdanov, L Trevisan
SIAM Journal on Computing 36 (4), 1119-1159, 2006
1462006
Gowers uniformity, influence of variables, and PCPs
A Samorodnitsky, L Trevisan
SIAM Journal on Computing 39 (1), 323-360, 2009
1422009
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
1422000
Pseudorandomness and average-case complexity via uniform reductions
L Trevisan, S Vadhan
Computational Complexity 16 (4), 331-364, 2007
1342007
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20