default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLuca Trevisan 0001
Person information
- affiliation: Bocconi University, Milan, Italy
- affiliation: University of California, Berkeley, USA
- affiliation (former): Stanford University, CA, USA
- affiliation (former): Columbia University, New York, NY, USA
- affiliation (PhD): Sapienza University of Rome, Italy
- affiliation (former): University of Geneva, Switzerland
Other persons with the same name
- Luca Trevisan 0002
![[0000-0003-4054-5470]](/https://dblp.org/img/orcid-mark.12x12.png "0000-0003-4054-5470")
— Consorzio RFX, Padova, Italy (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j57]Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi:
Bond percolation in small-world graphs with power-law distribution. Theor. Comput. Sci. 1011: 114717 (2024)- [c101]Jun-Ting Hsieh, Pravesh K. Kothari, Lucas Pesenti, Luca Trevisan:
New SDP Roundings and Certifiable Approximation for Cubic Optimization. SODA 2024: 2337-2362 - [c100]Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Robin Vacus, Isabella Ziccardi:
The Minority Dynamics and the Power of Synchronicity. SODA 2024: 4155-4176 - 2023
- [j56]Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi:
Expansion and flooding in dynamic random networks with node churn. Random Struct. Algorithms 63(1): 61-101 (2023) - [c99]Tommaso d'Orsi, Luca Trevisan:
A Ihara-Bass Formula for Non-Boolean Matrices and Strong Refutations of Random CSPs. CCC 2023: 27:1-27:16 - [c98]Luca Becchetti, Andrea Clementi, Amos Korman, Francesco Pasquale, Luca Trevisan, Robin Vacus:
On the Role of Memory in Robust Opinion Dynamics. IJCAI 2023: 29-37 - [c97]Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi:
Bond Percolation in Small-World Graphs with Power-Law Distribution. SAND 2023: 3:1-3:22 - [i92]Luca Becchetti, Andrea Clementi, Amos Korman, Francesco Pasquale, Luca Trevisan, Robin Vacus:
On the Role of Memory in Robust Opinion Dynamics. CoRR abs/2302.08600 (2023) - [i91]Jun-Ting Hsieh, Pravesh K. Kothari, Lucas Pesenti, Luca Trevisan:
New SDP Roundings and Certifiable Approximation for Cubic Optimization. CoRR abs/2310.00393 (2023) - [i90]Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Robin Vacus, Isabella Ziccardi:
The Minority Dynamics and the Power of Synchronicity. CoRR abs/2310.13558 (2023) - 2022
- [j55]Pasin Manurangsi, Preetum Nakkiran, Luca Trevisan:
Near-Optimal NP-Hardness of Approximating Max k-CSPR. Adv. Math. Commun. 18: 1-29 (2022) - [c96]Flavio Chierichetti, Alessandro Panconesi, Giuseppe Re, Luca Trevisan:
Spectral Robustness for Correlation Clustering Reconstruction in Semi-Adversarial Models. AISTATS 2022: 10852-10880 - [c95]Luca Becchetti, Andrea Clementi, Riccardo Denni, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi:
Percolation and Epidemic Processes in One-Dimensional Small-World Networks - (Extended Abstract). LATIN 2022: 476-492 - [c94]Antares Chen, Jonathan Shi, Luca Trevisan:
Cut Sparsification of the Clique Beyond the Ramanujan Bound: A Separation of Cut Versus Spectral Sparsification. SODA 2022: 3693-3731 - [i89]Tommaso d'Orsi, Luca Trevisan:
A Ihara-Bass Formula for Non-Boolean Matrices and Strong Refutations of Random CSPs. CoRR abs/2204.10881 (2022) - [i88]Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi:
Bond Percolation in Small-World Graphs with Power-Law Distribution. CoRR abs/2205.08774 (2022) - [i87]Luca Becchetti, Arthur Carvalho Walraven da Cunha, Andrea Clementi, Francesco D'Amore, Hicham Lesfari, Emanuele Natale, Luca Trevisan:
On the Multidimensional Random Subset Sum Problem. CoRR abs/2207.13944 (2022) - 2021
- [j54]Luca Trevisan:
Introducing The Theory Blogs Column. Bull. EATCS 135 (2021) - [j53]Charles Carlson, Alexandra Kolla, Ray Li, Nitya Mani, Benny Sudakov, Luca Trevisan:
Lower Bounds for Max-Cut in H-Free Graphs via Semidefinite Programming. SIAM J. Discret. Math. 35(3): 1557-1568 (2021) - [c93]Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi:
Expansion and Flooding in Dynamic Random Networks with Node Churn. ICDCS 2021: 976-986 - [i86]Luca Becchetti, Andrea Clementi, Riccardo Denni, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi:
Sharp Thresholds for a SIR Model on One-Dimensional Small-World Networks. CoRR abs/2103.16398 (2021) - [i85]Flavio Chierichetti, Alessandro Panconesi, Giuseppe Re, Luca Trevisan:
Correlation Clustering Reconstruction in Semi-Adversarial Models. CoRR abs/2108.04729 (2021) - 2020
- [j52]Parinya Chalermsook, Marek Cygan, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai, Luca Trevisan:
From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More. SIAM J. Comput. 49(4): 772-810 (2020) - [j51]Luca Becchetti, Andrea E. F. Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan:
Find Your Place: Simple Distributed Algorithms for Community Detection. SIAM J. Comput. 49(4): 821-864 (2020) - [c92]Samuel B. Hopkins, Tselil Schramm, Luca Trevisan:
Subexponential LPs Approximate Max-Cut. FOCS 2020: 943-953 - [c91]Andrea Clementi, Luciano Gualà, Emanuele Natale, Francesco Pasquale, Giacomo Scornavacca, Luca Trevisan:
Consensus vs Broadcast, with and Without Noise (Extended Abstract). ITCS 2020: 42:1-42:13 - [c90]Charles Carlson, Alexandra Kolla, Ray Li, Nitya Mani, Benny Sudakov, Luca Trevisan:
Lower Bounds for Max-Cut via Semidefinite Programming. LATIN 2020: 479-490 - [c89]Theo McKenzie, Hermish Mehta, Luca Trevisan:
A New Algorithm for the Robust Semi-random Independent Set Problem. SODA 2020: 738-746 - [c88]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan:
Finding a Bounded-Degree Expander Inside a Dense One. SODA 2020: 1320-1336 - [i84]Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi:
Expansion and Flooding in Dynamic Random Networks with Node Churn. CoRR abs/2007.14681 (2020) - [i83]Antares Chen, Jonathan Shi, Luca Trevisan:
Cut Sparsification of the Clique Beyond the Ramanujan Bound. CoRR abs/2008.05648 (2020)
2010 – 2019
- 2019
- [c87]Nikhil Bansal, Ola Svensson, Luca Trevisan:
New Notions and Constructions of Sparsification for Graphs and Hypergraphs. FOCS 2019: 910-928 - [c86]Charles Carlson, Alexandra Kolla, Nikhil Srivastava, Luca Trevisan:
Optimal Lower Bounds for Sketching Graph Cuts. SODA 2019: 2565-2569 - [i82]Nikhil Bansal, Ola Svensson, Luca Trevisan:
New Notions and Constructions of Sparsification for Graphs and Hypergraphs. CoRR abs/1905.01495 (2019) - [i81]Jess Banks, Luca Trevisan:
Vector Colorings of Random, Ramanujan, and Large-Girth Irregular Graphs. CoRR abs/1907.02539 (2019) - [i80]Samuel B. Hopkins, Tselil Schramm, Luca Trevisan:
Subexponential LPs Approximate Max-Cut. CoRR abs/1911.10304 (2019) - 2018
- [c85]Pasin Manurangsi, Luca Trevisan:
Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut. APPROX-RANDOM 2018: 20:1-20:17 - [c84]Luca Becchetti, Andrea Clementi, Pasin Manurangsi, Emanuele Natale, Francesco Pasquale, Prasad Raghavendra, Luca Trevisan:
Average Whenever You Meet: Opportunistic Protocols for Community Detection. ESA 2018: 7:1-7:13 - [c83]Nikhil Srivastava, Luca Trevisan:
An Alon-Boppana Type Bound for Weighted Graphs and Lowerbounds for Spectral Sparsification. SODA 2018: 1306-1315 - [i79]Andrea Clementi, Luciano Gualà, Emanuele Natale, Francesco Pasquale, Giacomo Scornavacca, Luca Trevisan:
Consensus Needs Broadcast in Noiseless Models but can be Exponentially Easier in the Presence of Noise. CoRR abs/1807.05626 (2018) - [i78]Pasin Manurangsi, Luca Trevisan:
Mildly Exponential Time Approximation Algorithms for Vertex Cover, Uniform Sparsest Cut and Related Problems. CoRR abs/1807.09898 (2018) - [i77]Theo McKenzie, Hermish Mehta, Luca Trevisan:
A New Algorithm for the Robust Semi-random Independent Set Problem. CoRR abs/1808.03633 (2018) - [i76]Charles Carlson, Alexandra Kolla, Luca Trevisan:
A Ramsey-type Theorem on the Max-Cut Value of d-Regular Graphs. CoRR abs/1810.10044 (2018) - [i75]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan:
Finding a Bounded-Degree Expander Inside a Dense One. CoRR abs/1811.10316 (2018) - 2017
- [j50]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri, Luca Trevisan:
Simple dynamics for plurality consensus. Distributed Comput. 30(4): 293-306 (2017) - [c82]Parinya Chalermsook, Marek Cygan, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai, Luca Trevisan:
From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More. FOCS 2017: 743-754 - [c81]Michele Borassi, Pierluigi Crescenzi, Luca Trevisan:
An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs. SODA 2017: 920-939 - [c80]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan:
Find Your Place: Simple Distributed Algorithms for Community Detection. SODA 2017: 940-959 - [i74]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Prasad Raghavendra, Luca Trevisan:
Friend or Foe? Population Protocols can perform Community Detection. CoRR abs/1703.05045 (2017) - [i73]Nikhil Srivastava, Luca Trevisan:
An Alon-Boppana Type Bound for Weighted Graphs and Lowerbounds for Spectral Sparsification. CoRR abs/1707.06364 (2017) - [i72]Parinya Chalermsook, Marek Cygan, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai, Luca Trevisan:
From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More. CoRR abs/1708.04218 (2017) - [i71]Charles Carlson, Alexandra Kolla, Nikhil Srivastava, Luca Trevisan:
Optimal Lower Bounds for Sketching Graph Cuts. CoRR abs/1712.10261 (2017) - 2016
- [j49]Reid Andersen, Shayan Oveis Gharan, Yuval Peres, Luca Trevisan:
Almost Optimal Local Graph Clustering Using Evolving Sets. J. ACM 63(2): 15:1-15:31 (2016) - [c79]Pasin Manurangsi, Preetum Nakkiran, Luca Trevisan:
Near-Optimal UGC-hardness of Approximating Max k-CSP_R. APPROX-RANDOM 2016: 15:1-15:28 - [c78]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan:
Stabilizing Consensus with Many Opinions. SODA 2016: 620-635 - [c77]Guy Kindler, Alexandra Kolla, Luca Trevisan:
Approximation of non-boolean 2CSP. SODA 2016: 1705-1714 - [r2]Luca Trevisan:
Learning Heavy Fourier Coefficients of Boolean Functions. Encyclopedia of Algorithms 2016: 1078-1081 - [i70]Michele Borassi, Pierluigi Crescenzi, Luca Trevisan:
An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs. CoRR abs/1604.01445 (2016) - 2015
- [j48]Naman Agarwal, Guy Kindler, Alexandra Kolla, Luca Trevisan:
Unique Games on the Hypercube. Chic. J. Theor. Comput. Sci. 2015 (2015) - [j47]Andrea Clementi, Riccardo Silvestri, Luca Trevisan:
Information spreading in dynamic graphs. Distributed Comput. 28(1): 55-73 (2015) - [j46]Aran Nayebi, Scott Aaronson, Aleksandrs Belovs, Luca Trevisan:
Quantum lower bound for inverting a permutation with advice. Quantum Inf. Comput. 15(11&12): 901-913 (2015) - [j45]Shayan Oveis Gharan, Luca Trevisan:
A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs. Theory Comput. 11: 241-256 (2015) - [c76]Boaz Barak, Ankur Moitra, Ryan O'Donnell, Prasad Raghavendra, Oded Regev, David Steurer, Luca Trevisan, Aravindan Vijayaraghavan, David Witmer, John Wright:
Beating the Random Assignment on Constraint Satisfaction Problems of Bounded Degree. APPROX-RANDOM 2015: 110-123 - [i69]Guy Kindler, Alexandra Kolla, Luca Trevisan:
Approximation of non-boolean 2CSP. CoRR abs/1504.00681 (2015) - [i68]Boaz Barak, Ankur Moitra, Ryan O'Donnell, Prasad Raghavendra, Oded Regev, David Steurer, Luca Trevisan, Aravindan Vijayaraghavan, David Witmer, John Wright:
Beating the random assignment on constraint satisfaction problems of bounded degree. CoRR abs/1505.03424 (2015) - [i67]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan:
Stabilizing Consensus with Many Opinions. CoRR abs/1508.06782 (2015) - [i66]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan:
Find Your Place: Simple Distributed Algorithms for Community Detection. CoRR abs/1511.03927 (2015) - [i65]Pasin Manurangsi, Preetum Nakkiran, Luca Trevisan:
Near-Optimal UGC-hardness of Approximating Max k-CSP_R. CoRR abs/1511.06558 (2015) - [i64]Boaz Barak, Ankur Moitra, Ryan O'Donnell, Prasad Raghavendra, Oded Regev, David Steurer, Luca Trevisan, Aravindan Vijayaraghavan, David Witmer, John Wright:
Beating the random assignment on constraint satisfaction problems of bounded degree. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j44]James R. Lee, Shayan Oveis Gharan, Luca Trevisan:
Multiway Spectral Partitioning and Higher-Order Cheeger Inequalities. J. ACM 61(6): 37:1-37:30 (2014) - [j43]Lap Chi Lau, Tal Malkin, Ryan O'Donnell, Luca Trevisan:
Special Section on the Fifty-First Annual IEEE Symposium on Foundations of Computer Science (FOCS 2010). SIAM J. Comput. 43(1): 255 (2014) - [j42]James Cook, Omid Etesami, Rachel Miller, Luca Trevisan:
On the One-Way Function Candidate Proposed by Goldreich. ACM Trans. Comput. Theory 6(3): 14:1-14:35 (2014) - [c75]Shayan Oveis Gharan, Luca Trevisan:
Partitioning into Expanders. SODA 2014: 1256-1266 - [c74]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri, Luca Trevisan:
Simple dynamics for plurality consensus. SPAA 2014: 247-256 - [i63]Naman Agarwal, Guy Kindler, Alexandra Kolla, Luca Trevisan:
Unique Games on the Hypercube. CoRR abs/1405.1374 (2014) - [i62]Aran Nayebi, Scott Aaronson, Aleksandrs Belovs, Luca Trevisan:
Quantum lower bound for inverting a permutation with advice. CoRR abs/1408.3193 (2014) - [i61]Aran Nayebi, Scott Aaronson, Aleksandrs Belovs, Luca Trevisan:
Quantum lower bound for inverting a permutation with advice. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [c73]Shayan Oveis Gharan, Luca Trevisan:
A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs. APPROX-RANDOM 2013: 303-316 - [c72]Luca Trevisan, Tongke Xue:
A Derandomized Switching Lemma and an Improved Derandomization of AC0. CCC 2013: 242-247 - [c71]Tsz Chiu Kwok, Lap Chi Lau, Yin Tat Lee, Shayan Oveis Gharan, Luca Trevisan:
Improved Cheeger's inequality: analysis of spectral partitioning algorithms through higher order spectral gap. STOC 2013: 11-20 - [e3]T.-H. Hubert Chan, Lap Chi Lau, Luca Trevisan:
Theory and Applications of Models of Computation, 10th International Conference, TAMC 2013, Hong Kong, China, May 20-22, 2013. Proceedings. Lecture Notes in Computer Science 7876, Springer 2013, ISBN 978-3-642-38235-2 [contents] - [i60]Tsz Chiu Kwok, Lap Chi Lau, Yin Tat Lee, Shayan Oveis Gharan, Luca Trevisan:
Improved Cheeger's Inequality: Analysis of Spectral Partitioning Algorithms through Higher Order Spectral Gap. CoRR abs/1301.5584 (2013) - [i59]Luca Trevisan:
Is Cheeger-type Approximation Possible for Nonuniform Sparsest Cut? CoRR abs/1303.2730 (2013) - [i58]Shayan Oveis Gharan, Luca Trevisan:
Improved ARV Rounding in Small-set Expanders and Graphs of Bounded Threshold Rank. CoRR abs/1304.2060 (2013) - [i57]Shayan Oveis Gharan, Luca Trevisan:
Partitioning into Expanders. CoRR abs/1309.3223 (2013) - [i56]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri, Luca Trevisan:
Simple Dynamics for Majority Consensus. CoRR abs/1310.2858 (2013) - 2012
- [j41]Luca Trevisan:
Pseudorandomness and derandomization. XRDS 18(3): 27-31 (2012) - [j40]Luca Trevisan:
Max Cut and the Smallest Eigenvalue. SIAM J. Comput. 41(6): 1769-1786 (2012) - [c70]Parikshit Gopalan, Raghu Meka, Omer Reingold, Luca Trevisan, Salil P. Vadhan:
Better Pseudorandom Generators from Milder Pseudorandom Restrictions. FOCS 2012: 120-129 - [c69]Shayan Oveis Gharan, Luca Trevisan:
Approximating the Expansion Profile and Almost Optimal Local Graph Clustering. FOCS 2012: 187-196 - [c68]Andrea Clementi, Riccardo Silvestri, Luca Trevisan:
Information spreading in dynamic graphs. PODC 2012: 37-46 - [c67]James R. Lee, Shayan Oveis Gharan, Luca Trevisan:
Multi-way spectral partitioning and higher-order cheeger inequalities. STOC 2012: 1117-1130 - [i55]Shayan Oveis Gharan, Luca Trevisan:
Approximating the Expansion Profile and Almost Optimal Local Graph Clustering. CoRR abs/1204.2021 (2012) - [i54]Parikshit Gopalan, Raghu Meka, Omer Reingold, Luca Trevisan, Salil P. Vadhan:
Better Pseudorandom Generators from Milder Pseudorandom Restrictions. CoRR abs/1210.0049 (2012) - [i53]Shayan Oveis Gharan, Luca Trevisan:
A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs. CoRR abs/1212.1831 (2012) - [i52]Shayan Oveis Gharan, Luca Trevisan:
A Universal upper bound on Graph Diameter based on Laplacian Eigenvalues. CoRR abs/1212.2701 (2012) - [i51]James Cook, Omid Etesami, Rachel Miller, Luca Trevisan:
On the One-Way Function Candidate Proposed by Goldreich. Electron. Colloquium Comput. Complex. TR12 (2012) - [i50]Parikshit Gopalan, Raghu Meka, Omer Reingold, Luca Trevisan, Salil P. Vadhan:
Better pseudorandom generators from milder pseudorandom restrictions. Electron. Colloquium Comput. Complex. TR12 (2012) - [i49]Luca Trevisan:
A Derandomized Switching Lemma and an Improved Derandomization of AC0. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [c66]Luca Trevisan:
Dense Model Theorems and Their Applications. TCC 2011: 55-57 - [p2]Oded Goldreich, Madhu Sudan, Luca Trevisan:
From Logarithmic Advice to Single-Bit Advice. Studies in Complexity and Cryptography 2011: 109-113 - [i48]Andrea Clementi, Riccardo Silvestri, Luca Trevisan:
Information Spreading in Dynamic Graphs. CoRR abs/1111.0583 (2011) - [i47]James R. Lee, Shayan Oveis Gharan, Luca Trevisan:
Multi-way spectral partitioning and higher-order Cheeger inequalities. CoRR abs/1111.1055 (2011) - 2010
- [c65]Anindya De, Omid Etesami, Luca Trevisan, Madhur Tulsiani:
Improved Pseudorandom Generators for Depth 2 Circuits. APPROX-RANDOM 2010: 504-517 - [c64]Luca Trevisan:
The Program-Enumeration Bottleneck in Average-Case Complexity Theory. CCC 2010: 88-95 - [c63]Anindya De, Luca Trevisan, Madhur Tulsiani:
Time Space Tradeoffs for Attacks against One-Way Functions and PRGs. CRYPTO 2010: 649-665 - [i46]Luca Trevisan:
The Program-Enumeration Bottleneck in Average-Case Complexity Theory. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j39]Chandra Chekuri, Luca Trevisan:
Foreword. Algorithmica 55(1): 111-112 (2009) - [j38]Alex Samorodnitsky, Luca Trevisan:
Gowers Uniformity, Influence of Variables, and PCPs. SIAM J. Comput. 39(1): 323-360 (2009) - [j37]Luca Trevisan:
Guest column: additive combinatorics and theoretical computer science. SIGACT News 40(2): 50-66 (2009) - [c62]Anindya De, Luca Trevisan:
Extractors Using Hardness Amplification. APPROX-RANDOM 2009: 462-475 - [c61]Shachar Lovett, Omer Reingold, Luca Trevisan, Salil P. Vadhan:
Pseudorandom Bit Generators That Fool Modular Sums. APPROX-RANDOM 2009: 615-630 - [c60]Luca Trevisan, Madhur Tulsiani, Salil P. Vadhan:
Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution. CCC 2009: 126-136 - [c59]Luca Trevisan:
Max cut and the smallest eigenvalue. STOC 2009: 263-272 - [c58]James Cook, Omid Etesami, Rachel Miller, Luca Trevisan:
Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms. TCC 2009: 521-538 - [i45]Anindya De, Omid Etesami, Luca Trevisan, Madhur Tulsiani:
Improved Pseudorandom Generators for Depth 2 Circuits. Electron. Colloquium Comput. Complex. TR09 (2009) - [i44]Anindya De, Luca Trevisan, Madhur Tulsiani:
Non-uniform attacks against one-way functions and PRGs. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j36]Luca Trevisan:
Approximation Algorithms for Unique Games. Theory Comput. 4(1): 111-128 (2008) - [c57]Luca Trevisan:
Average-case Complexity. FOCS 2008: 11 - [c56]Omer Reingold, Luca Trevisan, Madhur Tulsiani, Salil P. Vadhan:
Dense Subsets of Pseudorandom Sets. FOCS 2008: 76-85 - [r1]Luca Trevisan:
Learning Heavy Fourier Coefficients of Boolean Functions. Encyclopedia of Algorithms 2008 - [i43]Luca Trevisan:
Max Cut and the Smallest Eigenvalue. CoRR abs/0806.1978 (2008) - [i42]Omer Reingold, Luca Trevisan, Madhur Tulsiani, Salil P. Vadhan:
Dense Subsets of Pseudorandom Sets. Electron. Colloquium Comput. Complex. TR08 (2008) - [i41]Luca Trevisan, Madhur Tulsiani, Salil P. Vadhan:
Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [j35]Luca Trevisan, Salil P. Vadhan:
Pseudorandomness and Average-Case Complexity Via Uniform Reductions. Comput. Complex. 16(4): 331-364 (2007) - [c55]Grant Schoenebeck, Luca Trevisan, Madhur Tulsiani:
A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover. CCC 2007: 205-216 - [c54]Ran Canetti, Ronald L. Rivest, Madhu Sudan, Luca Trevisan, Salil P. Vadhan, Hoeteck Wee:
Amplifying Collision Resistance: A Complexity-Theoretic Treatment. CRYPTO 2007: 264-283 - [c53]Luca Trevisan:
Fun with Sub-linear Time Algorithms. FUN 2007: 15 - [c52]Grant Schoenebeck, Luca Trevisan, Madhur Tulsiani:
Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cut. STOC 2007: 302-310 - 2006
- [j34]Oded Goldreich, Howard J. Karloff, Leonard J. Schulman, Luca Trevisan:
Lower bounds for linear locally decodable codes and private information retrieval. Comput. Complex. 15(3): 263-296 (2006) - [j33]Andrej Bogdanov, Luca Trevisan:
Average-Case Complexity. Found. Trends Theor. Comput. Sci. 2(1) (2006) - [j32]Elchanan Mossel, Amir Shpilka, Luca Trevisan:
On epsilon-biased generators in NC0. Random Struct. Algorithms 29(1): 56-81 (2006) - [j31]Andrej Bogdanov, Luca Trevisan:
On Worst-Case to Average-Case Reductions for NP Problems. SIAM J. Comput. 36(4): 1119-1159 (2006) - [c51]Alex Samorodnitsky, Luca Trevisan:
Gowers uniformity, influence of variables, and PCPs. STOC 2006: 11-20 - [c50]Omer Reingold, Luca Trevisan, Salil P. Vadhan:
Pseudorandom walks on regular digraphs and the RL vs. L problem. STOC 2006: 457-466 - [i40]Luca Trevisan:
Pseudorandomness and Combinatorial Constructions. CoRR abs/cs/0601100 (2006) - [i39]Andrej Bogdanov, Luca Trevisan:
Average-Case Complexity. CoRR abs/cs/0606037 (2006) - [i38]Andrej Bogdanov, Luca Trevisan:
Average-Case Complexity. Electron. Colloquium Comput. Complex. TR06 (2006) - [i37]Luca Trevisan:
Pseudorandomness and Combinatorial Constructions. Electron. Colloquium Comput. Complex. TR06 (2006) - [i36]Grant Schoenebeck, Luca Trevisan, Madhur Tulsiani:
A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover. Electron. Colloquium Comput. Complex. TR06 (2006) - [i35]Grant Schoenebeck, Luca Trevisan, Madhur Tulsiani:
Tight Integrality Gaps for Lovasz-Schrijver LP Relaxations of Vertex Cover and Max Cut. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j30]Luca Trevisan, Salil P. Vadhan, David Zuckerman:
Compression of Samplable Sources. Comput. Complex. 14(3): 186-227 (2005) - [j29]Christian Schallhart, Luca Trevisan:
Approximating Succinct MaxSat. J. Log. Comput. 15(4): 551-557 (2005) - [j28]Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan:
Approximating the Minimum Spanning Tree Weight in Sublinear Time. SIAM J. Comput. 34(6): 1370-1379 (2005) - [j27]Rosario Gennaro, Yael Gertner, Jonathan Katz, Luca Trevisan:
Bounds on the Efficiency of Generic Cryptographic Constructions. SIAM J. Comput. 35(1): 217-246 (2005) - [j26]Maria J. Serna, Luca Trevisan, Fatos Xhafa:
The approximability of non-Boolean satisfiability problems and restricted integer programming. Theor. Comput. Sci. 332(1-3): 123-139 (2005) - [c49]Venkatesan Guruswami, Luca Trevisan:
The Complexity of Making Unique Choices: Approximating 1-in- k SAT. APPROX-RANDOM 2005: 99-110 - [c48]Luca Trevisan:
Approximation Algorithms for Unique Games. FOCS 2005: 197-205 - [c47]Luca Trevisan:
On uniform amplification of hardness in NP. STOC 2005: 31-38 - [c46]Lance Fortnow, Rahul Santhanam, Luca Trevisan:
Hierarchies for semantic classes. STOC 2005: 348-355 - [c45]Henry C. Lin, Luca Trevisan, Hoeteck Wee:
On Hardness Amplification of One-Way Functions. TCC 2005: 34-49 - [e2]Chandra Chekuri, Klaus Jansen, José D. P. Rolim, Luca Trevisan:
Approximation, Randomization and Combinatorial Optimization, Algorithms and Techniques, 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005 and 9th InternationalWorkshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings. Lecture Notes in Computer Science 3624, Springer 2005, ISBN 3-540-28239-4 [contents] - [i34]Alex Samorodnitsky, Luca Trevisan:
Gowers Uniformity, Influence of Variables, and PCPs. CoRR abs/math/0510264 (2005) - [i33]Luca Trevisan, Salil P. Vadhan, David Zuckerman:
Compression of Samplable Sources. Electron. Colloquium Comput. Complex. TR05 (2005) - [i32]Andrej Bogdanov, Luca Trevisan:
On Worst-Case to Average-Case Reductions for NP Problems. Electron. Colloquium Comput. Complex. TR05 (2005) - [i31]Omer Reingold, Luca Trevisan, Salil P. Vadhan:
Pseudorandom Walks in Biregular Graphs and the RL vs. L Problem. Electron. Colloquium Comput. Complex. TR05 (2005) - [i30]Luca Trevisan:
Approximation Algorithms for Unique Games. Electron. Colloquium Comput. Complex. TR05 (2005) - [i29]Alex Samorodnitsky, Luca Trevisan:
Gowers Uniformity, Influence of Variables, and PCPs. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j25]Luca Trevisan:
On Local Versus Global Satisfiability. SIAM J. Discret. Math. 17(4): 541-547 (2004) - [c44]Luca Trevisan:
A Note on Approximate Counting for k-DNF. APPROX-RANDOM 2004: 417-426 - [c43]Luca Trevisan, Salil P. Vadhan, David Zuckerman:
Compression of Samplable Sources. CCC 2004: 1-14 - [c42]Andrej Bogdanov, Luca Trevisan:
Lower Bounds for Testing Bipartiteness in Dense Graphs. CCC 2004: 75-81 - [c41]Omer Reingold, Luca Trevisan, Salil P. Vadhan:
Notions of Reducibility between Cryptographic Primitives. TCC 2004: 1-20 - [c40]Cynthia Dwork, Ronen Shaltiel, Adam D. Smith, Luca Trevisan:
List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge Argument. TCC 2004: 101-120 - [p1]Luca Trevisan:
Pseudorandomness - Part II. Computational Complexity Theory 2004: 287-314 - [i28]Luca Trevisan:
Inapproximability of Combinatorial Optimization Problems. CoRR cs.CC/0409043 (2004) - [i27]Luca Trevisan:
Some Applications of Coding Theory in Computational Complexity. CoRR cs.CC/0409044 (2004) - [i26]Luca Trevisan:
Some Applications of Coding Theory in Computational Complexity. Electron. Colloquium Comput. Complex. TR04 (2004) - [i25]Luca Trevisan:
Inapproximability of Combinatorial Optimization Problems. Electron. Colloquium Comput. Complex. TR04 (2004) - [i24]Oded Goldreich, Madhu Sudan, Luca Trevisan:
From logarithmic advice to single-bit advice. Electron. Colloquium Comput. Complex. TR04 (2004) - [i23]Lance Fortnow, Rahul Santhanam, Luca Trevisan:
Promise Hierarchies. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j24]Oded Goldreich, Luca Trevisan:
Three theorems regarding testing graph properties. Random Struct. Algorithms 23(1): 23-57 (2003) - [c39]Luca Trevisan:
Error-Correcting Codes in Complexity Theory. CIAC 2003: 4 - [c38]Luca Trevisan:
List-Decoding Using The XOR Lemma. FOCS 2003: 126-135 - [c37]Elchanan Mossel, Amir Shpilka, Luca Trevisan:
On e-Biased Generators in NC0. FOCS 2003: 136-145 - [c36]Andrej Bogdanov, Luca Trevisan:
On Worst-Case to Average-Case Reductions for NP Problems. FOCS 2003: 308-317 - [i22]Luca Trevisan:
An epsilon-Biased Generator in NC0. Electron. Colloquium Comput. Complex. TR03 (2003) - [i21]Luca Trevisan:
List Decoding Using the XOR Lemma. Electron. Colloquium Comput. Complex. TR03 (2003) - [i20]Elchanan Mossel, Amir Shpilka, Luca Trevisan:
On epsilon-Biased Generators in NC0. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [c35]Luca Trevisan, Salil P. Vadhan:
Pseudorandomness and Average-Case Complexity via Uniform Reductions. CCC 2002: 129-138 - [c34]Ziv Bar-Yossef, Luca Trevisan, Omer Reingold, Ronen Shaltiel:
Streaming Computation of Combinatorial Objects. CCC 2002: 165-174 - [c33]Oded Goldreich, Howard J. Karloff, Leonard J. Schulman, Luca Trevisan:
Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval. CCC 2002: 175-183 - [c32]Andrej Bogdanov, Kenji Obata, Luca Trevisan:
A Lower Bound for Testing 3-Colorability in Bounded-Degree Graphs. FOCS 2002: 93-102 - [c31]Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, Luca Trevisan:
Counting Distinct Elements in a Data Stream. RANDOM 2002: 1-10 - [i19]Andrej Bogdanov, Luca Trevisan:
Lower Bounds for Testing Bipartiteness in Dense Graphs. Electron. Colloquium Comput. Complex. TR02 (2002) - [i18]Luca Trevisan:
A Note on Deterministic Approximate Counting for k-DNF. Electron. Colloquium Comput. Complex. TR02 (2002) - 2001
- [j23]Josep Díaz, Jordi Petit, Maria J. Serna, Luca Trevisan:
Approximating layout problems on random graphs. Discret. Math. 235(1-3): 245-253 (2001) - [j22]Pierluigi Crescenzi, Riccardo Silvestri, Luca Trevisan:
On Weighted vs Unweighted Versions of Combinatorial Optimization Problems. Inf. Comput. 167(1): 10-26 (2001) - [j21]Luca Trevisan:
Extractors and pseudorandom generators. J. ACM 48(4): 860-879 (2001) - [j20]Madhu Sudan, Luca Trevisan, Salil P. Vadhan:
Pseudorandom Generators without the XOR Lemma. J. Comput. Syst. Sci. 62(2): 236-266 (2001) - [c30]Oded Goldreich, Luca Trevisan:
Three Theorems Regarding Testing Graph Properties. FOCS 2001: 460-469 - [c29]Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan:
Approximating the Minimum Spanning Tree Weight in Sublinear Time. ICALP 2001: 190-200 - [c28]Luca Trevisan:
Error-Correcting Codes and Pseudorandom Projections. RANDOM-APPROX 2001: 7-9 - [c27]Luca Trevisan:
Non-approximability results for optimization problems on bounded degree instances. STOC 2001: 453-461 - [e1]Michel X. Goemans, Klaus Jansen, José D. P. Rolim, Luca Trevisan:
Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 Berkeley, CA, USA, August 18-20, 2001, Proceedings. Lecture Notes in Computer Science 2129, Springer 2001, ISBN 3-540-42470-9 [contents] - [i17]Oded Goldreich, Luca Trevisan:
Three Theorems regarding Testing Graph Properties. Electron. Colloquium Comput. Complex. TR01 (2001) - [i16]Oded Goldreich, Howard J. Karloff, Leonard J. Schulman, Luca Trevisan:
Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [j19]Luca Trevisan:
Erratum: A Correction to "Parallel Approximation Algorithms by Positive Linear Programming". Algorithmica 27(2): 115-119 (2000) - [j18]Luca Trevisan:
Approximating Satisfiable Satisfiability Problems. Algorithmica 28(1): 145-172 (2000) - [j17]Luca Trevisan:
Interactive and probabilistic proof-checking. Ann. Pure Appl. Log. 104(1-3): 325-342 (2000) - [j16]Pierluigi Crescenzi, Luca Trevisan:
On Approximation Scheme Preserving Reducibility and Its Applications. Theory Comput. Syst. 33(1): 1-16 (2000) - [j15]Luca Trevisan, Gregory B. Sorkin, Madhu Sudan, David P. Williamson:
Gadgets, Approximation, and Linear Programming. SIAM J. Comput. 29(6): 2074-2097 (2000) - [j14]Luca Trevisan:
When Hamming Meets Euclid: The Approximability of Geometric TSP and Steiner Tree. SIAM J. Comput. 30(2): 475-485 (2000) - [j13]Sanjeev Khanna, Madhu Sudan, Luca Trevisan, David P. Williamson:
The Approximability of Constraint Satisfaction Problems. SIAM J. Comput. 30(6): 1863-1920 (2000) - [j12]Michele Boreale, Luca Trevisan:
A complexity analysis of bisimilarity for value-passing processes. Theor. Comput. Sci. 238(1-2): 313-345 (2000) - [c26]Luca Trevisan:
A Survey of Optimal PCP Characterizations of NP. CCC 2000: 146- - [c25]Luca Trevisan, Salil P. Vadhan:
Extracting Randomness from Samplable Distributions. FOCS 2000: 32-42 - [c24]Rosario Gennaro, Luca Trevisan:
Lower Bounds on the Efficiency of Generic Cryptographic Constructions. FOCS 2000: 305-313 - [c23]Jonathan Katz, Luca Trevisan:
On the efficiency of local decoding procedures for error-correcting codes. STOC 2000: 80-86 - [c22]Alex Samorodnitsky, Luca Trevisan:
A PCP characterization of NP with optimal amortized query complexity. STOC 2000: 191-199 - [i15]Rosario Gennaro, Luca Trevisan:
Lower Bounds on the Efficiency of Generic Cryptographic Constructions. Electron. Colloquium Comput. Complex. TR00 (2000) - [i14]Rosario Gennaro, Luca Trevisan:
Lower Bounds on the Efficiency of Generic Cryptographic Constructions. IACR Cryptol. ePrint Arch. 2000: 17 (2000)
1990 – 1999
- 1999
- [j11]Pierluigi Crescenzi, Viggo Kann, Riccardo Silvestri, Luca Trevisan:
Structure in Approximation Classes. SIAM J. Comput. 28(5): 1759-1782 (1999) - [j10]Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan:
Weak Random Sources, Hitting Sets, and BPP Simulations. SIAM J. Comput. 28(6): 2103-2116 (1999) - [j9]Pierluigi Crescenzi, Luca Trevisan:
Max NP-completeness Made Easy. Theor. Comput. Sci. 225(1-2): 65-79 (1999) - [j8]Andrea E. F. Clementi, Luca Trevisan:
Improved Non-Approximability Results for Minimum Vertex Cover with Density Constraints. Theor. Comput. Sci. 225(1-2): 113-128 (1999) - [c21]Madhu Sudan, Luca Trevisan, Salil P. Vadhan:
Pseudorandom Generators without the XOR Lemma (Abstract). CCC 1999: 4 - [c20]Luca Trevisan:
Construction of Extractors Using Pseudo-Random Generators (Extended Abstract). STOC 1999: 141-148 - [c19]Madhu Sudan, Luca Trevisan, Salil P. Vadhan:
Pseudorandom Generators Without the XOR Lemma (Extended Abstract). STOC 1999: 537-546 - 1998
- [j7]Luca Trevisan:
Parallel Approximation Algorithms by Positive Linear Programming. Algorithmica 21(1): 72-88 (1998) - [j6]Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan:
Recent Advances Towards Proving P = BPP. Bull. EATCS 64 (1998) - [j5]José D. P. Rolim, Luca Trevisan:
A Case Study of De-randomization Methods for Combinatorial Approximation Algorithms. J. Comb. Optim. 2(3): 219-236 (1998) - [j4]Luca Trevisan, Fatos Xhafa:
The Parallel Complexity of Positive Linear Programming. Parallel Process. Lett. 8(4): 527-533 (1998) - [c18]Venkatesan Guruswami, Daniel Lewin, Madhu Sudan, Luca Trevisan:
A Tight Characterization of NP with 3 Query PCPs. FOCS 1998: 8-17 - [c17]Madhu Sudan, Luca Trevisan:
Probabilistically Checkable Proofs with Low Amortized Query Complexity. FOCS 1998: 18-27 - [c16]Maria J. Serna, Luca Trevisan, Fatos Xhafa:
The (Parallel) Approximability of Non-Boolean Satisfiability Problems and Restricted Integer Programming. STACS 1998: 488-498 - [c15]Luca Trevisan:
Recycling Queries in PCPs and in Linearity Tests (Extended Abstract). STOC 1998: 299-308 - [i13]Luca Trevisan:
Recycling Queries in PCPs and in Linearity Tests. Electron. Colloquium Comput. Complex. TR98 (1998) - [i12]Venkatesan Guruswami, Daniel Lewin, Madhu Sudan, Luca Trevisan:
A tight characterization of NP with 3 query PCPs. Electron. Colloquium Comput. Complex. TR98 (1998) - [i11]Madhu Sudan, Luca Trevisan:
Probabilistically checkable proofs with low amortized query complexity. Electron. Colloquium Comput. Complex. TR98 (1998) - [i10]Luca Trevisan:
Constructions of Near-Optimal Extractors Using Pseudo-Random Generators. Electron. Colloquium Comput. Complex. TR98 (1998) - [i9]Madhu Sudan, Luca Trevisan, Salil P. Vadhan:
Pseudorandom generators without the XOR Lemma. Electron. Colloquium Comput. Complex. TR98 (1998) - 1997
- [j3]Marco Cesati, Luca Trevisan:
On the Efficiency of Polynomial Time Approximation Schemes. Inf. Process. Lett. 64(4): 165-171 (1997) - [c14]Sanjeev Khanna, Madhu Sudan, Luca Trevisan:
Constraint Satisfaction: The Approximability of Minimization Problems. CCC 1997: 282-296 - [c13]José D. P. Rolim, Luca Trevisan:
A case study of de-randomization methods for combinatorial approximation algorithms. Network Design: Connectivity and Facilities Location 1997: 319-334 - [c12]Luca Trevisan:
Approximating Satisfiable Satisfiability Problems (Extended Abstract). ESA 1997: 472-485 - [c11]Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan:
Weak Random Sources, Hitting Sets, and BPP Simulations. FOCS 1997: 264-272 - [c10]Luca Trevisan:
When Hamming Meets Euclid: The Approximability of Geometric TSP and MST (Extended Abstract). STOC 1997: 21-29 - [i8]Marco Cesati, Luca Trevisan:
On the Efficiency of Polynomial Time Approximation Schemes. Electron. Colloquium Comput. Complex. TR97 (1997) - [i7]Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan:
Weak Random Sources, Hitting Sets, and BPP Simulations. Electron. Colloquium Comput. Complex. TR97 (1997) - [i6]Luca Trevisan:
On Local versus Global Satisfiability. Electron. Colloquium Comput. Complex. TR97 (1997) - [i5]Pierluigi Crescenzi, Luca Trevisan:
MAX NP-Completeness Made Easy. Electron. Colloquium Comput. Complex. TR97 (1997) - 1996
- [j2]Luca Trevisan:
A Note on Minimum-Area Upward Drawing of Complete and Fibonacci Trees. Inf. Process. Lett. 57(5): 231-236 (1996) - [j1]Pierluigi Crescenzi, Luca Trevisan:
On the Distributed Decision-Making Complexity of the Minimum Vertex Cover Problem. RAIRO Theor. Informatics Appl. 30(5): 431-441 (1996) - [c9]Andrea E. F. Clementi, Luca Trevisan:
Improved Non-approximability Results for Vertex Cover with Density Constraints. COCOON 1996: 333-342 - [c8]Luca Trevisan:
Positive Linear Programming, Parallel Approximation and PCP's. ESA 1996: 62-75 - [c7]Luca Trevisan, Gregory B. Sorkin, Madhu Sudan, David P. Williamson:
Gadgets, Approximation, and Linear Programming (extended abstract). FOCS 1996: 617-626 - [c6]Pierluigi Crescenzi, Riccardo Silvestri, Luca Trevisan:
To Weight or Not to Weight: Where is the Question? ISTCS 1996: 68-77 - [c5]Michele Boreale, Luca Trevisan:
Bisimilarity Problems Requiring Exponential Time. MFCS 1996: 230-241 - [i4]Andrea E. F. Clementi, Luca Trevisan:
Improved Non-approximability Results for Minimum Vertex Cover with Density Constraints. Electron. Colloquium Comput. Complex. TR96 (1996) - [i3]Luca Trevisan:
On the Approximability of the Multi-dimensional Euclidean TSP. Electron. Colloquium Comput. Complex. TR96 (1996) - [i2]Sanjeev Khanna, Madhu Sudan, Luca Trevisan:
Constraint satisfaction: The approximability of minimization problems. Electron. Colloquium Comput. Complex. TR96 (1996) - [i1]Pierluigi Crescenzi, Viggo Kann, Riccardo Silvestri, Luca Trevisan:
Structure in Approximation Classes. Electron. Colloquium Comput. Complex. TR96 (1996) - 1995
- [c4]Pierluigi Crescenzi, Viggo Kann, Riccardo Silvestri, Luca Trevisan:
Structure in Approximation Classes (Extended Abstract). COCOON 1995: 539-548 - [c3]Michele Boreale, Luca Trevisan:
On the Complexity of Bisimilarity for Value-Passing Processes (Extended Abstract). FSTTCS 1995: 294-308 - 1994
- [c2]Pierluigi Crescenzi, Luca Trevisan:
On Approximation Scheme Preserving Reducability and Its Applications. FSTTCS 1994: 330-341 - [c1]Pierluigi Crescenzi, Luca Trevisan:
Minimum Vertex Cover, Distributed Decision-Making, and Communication Complexity (Extended Abstract). WG 1994: 130-139
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
