default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Luca Trevisan
@article{DBLP:journals/sensors/ManduchiRTP24,
author = {Gabriele Manduchi and
Andrea Rigoni and
Luca Trevisan and
Tommaso Patton},
title = {A Versatile Board for Event-Driven Data Acquisition},
journal = {Sensors},
volume = {24},
number = {5},
pages = {1631},
year = {2024},
url = {https://doi.org/10.3390/s24051631},
doi = {10.3390/S24051631},
timestamp = {Sat, 04 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sensors/ManduchiRTP24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BecchettiCPTZ24,
author = {Luca Becchetti and
Andrea Clementi and
Francesco Pasquale and
Luca Trevisan and
Isabella Ziccardi},
title = {Bond percolation in small-world graphs with power-law distribution},
journal = {Theor. Comput. Sci.},
volume = {1011},
pages = {114717},
year = {2024},
url = {https://doi.org/10.1016/j.tcs.2024.114717},
doi = {10.1016/J.TCS.2024.114717},
timestamp = {Fri, 19 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BecchettiCPTZ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HsiehKPT24,
author = {Jun{-}Ting Hsieh and
Pravesh K. Kothari and
Lucas Pesenti and
Luca Trevisan},
editor = {David P. Woodruff},
title = {New {SDP} Roundings and Certifiable Approximation for Cubic Optimization},
booktitle = {Proceedings of the 2024 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2024, Alexandria, VA, USA, January 7-10, 2024},
pages = {2337--2362},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977912.83},
doi = {10.1137/1.9781611977912.83},
timestamp = {Thu, 04 Apr 2024 19:38:10 +0200},
biburl = {https://dblp.org/rec/conf/soda/HsiehKPT24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BecchettiCPTVZ24,
author = {Luca Becchetti and
Andrea Clementi and
Francesco Pasquale and
Luca Trevisan and
Robin Vacus and
Isabella Ziccardi},
editor = {David P. Woodruff},
title = {The Minority Dynamics and the Power of Synchronicity},
booktitle = {Proceedings of the 2024 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2024, Alexandria, VA, USA, January 7-10, 2024},
pages = {4155--4176},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977912.144},
doi = {10.1137/1.9781611977912.144},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BecchettiCPTVZ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BecchettiCPTZ23,
author = {Luca Becchetti and
Andrea Clementi and
Francesco Pasquale and
Luca Trevisan and
Isabella Ziccardi},
title = {Expansion and flooding in dynamic random networks with node churn},
journal = {Random Struct. Algorithms},
volume = {63},
number = {1},
pages = {61--101},
year = {2023},
url = {https://doi.org/10.1002/rsa.21133},
doi = {10.1002/RSA.21133},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BecchettiCPTZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/dOrsiT23,
author = {Tommaso d'Orsi and
Luca Trevisan},
editor = {Amnon Ta{-}Shma},
title = {A Ihara-Bass Formula for Non-Boolean Matrices and Strong Refutations
of Random CSPs},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {27:1--27:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.27},
doi = {10.4230/LIPICS.CCC.2023.27},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/dOrsiT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/BecchettiCKPTV23,
author = {Luca Becchetti and
Andrea Clementi and
Amos Korman and
Francesco Pasquale and
Luca Trevisan and
Robin Vacus},
title = {On the Role of Memory in Robust Opinion Dynamics},
booktitle = {Proceedings of the Thirty-Second International Joint Conference on
Artificial Intelligence, {IJCAI} 2023, 19th-25th August 2023, Macao,
SAR, China},
pages = {29--37},
publisher = {ijcai.org},
year = {2023},
url = {https://doi.org/10.24963/ijcai.2023/4},
doi = {10.24963/IJCAI.2023/4},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/BecchettiCKPTV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sand/BecchettiCPTZ23,
author = {Luca Becchetti and
Andrea Clementi and
Francesco Pasquale and
Luca Trevisan and
Isabella Ziccardi},
editor = {David Doty and
Paul G. Spirakis},
title = {Bond Percolation in Small-World Graphs with Power-Law Distribution},
booktitle = {2nd Symposium on Algorithmic Foundations of Dynamic Networks, {SAND}
2023, June 19-21, 2023, Pisa, Italy},
series = {LIPIcs},
volume = {257},
pages = {3:1--3:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.SAND.2023.3},
doi = {10.4230/LIPICS.SAND.2023.3},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/sand/BecchettiCPTZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-08600,
author = {Luca Becchetti and
Andrea Clementi and
Amos Korman and
Francesco Pasquale and
Luca Trevisan and
Robin Vacus},
title = {On the Role of Memory in Robust Opinion Dynamics},
journal = {CoRR},
volume = {abs/2302.08600},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.08600},
doi = {10.48550/ARXIV.2302.08600},
eprinttype = {arXiv},
eprint = {2302.08600},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-08600.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-00393,
author = {Jun{-}Ting Hsieh and
Pravesh K. Kothari and
Lucas Pesenti and
Luca Trevisan},
title = {New {SDP} Roundings and Certifiable Approximation for Cubic Optimization},
journal = {CoRR},
volume = {abs/2310.00393},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2310.00393},
doi = {10.48550/ARXIV.2310.00393},
eprinttype = {arXiv},
eprint = {2310.00393},
timestamp = {Wed, 18 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2310-00393.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-13558,
author = {Luca Becchetti and
Andrea Clementi and
Francesco Pasquale and
Luca Trevisan and
Robin Vacus and
Isabella Ziccardi},
title = {The Minority Dynamics and the Power of Synchronicity},
journal = {CoRR},
volume = {abs/2310.13558},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2310.13558},
doi = {10.48550/ARXIV.2310.13558},
eprinttype = {arXiv},
eprint = {2310.13558},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2310-13558.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sensors/FedulloMPTTVR22,
author = {Tommaso Fedullo and
Alberto Morato and
Giovanni Peserico and
Luca Trevisan and
Federico Tramarin and
Stefano Vitturi and
Luigi Rovati},
title = {An IoT Measurement System Based on LoRaWAN for Additive Manufacturing},
journal = {Sensors},
volume = {22},
number = {15},
pages = {5466},
year = {2022},
url = {https://doi.org/10.3390/s22155466},
doi = {10.3390/S22155466},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sensors/FedulloMPTTVR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/ManurangsiNT22,
author = {Pasin Manurangsi and
Preetum Nakkiran and
Luca Trevisan},
title = {Near-Optimal NP-Hardness of Approximating Max k-CSP\({}_{\mbox{R}}\)},
journal = {Theory Comput.},
volume = {18},
pages = {1--29},
year = {2022},
url = {https://theoryofcomputing.org/articles/v018a003/},
timestamp = {Thu, 02 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/toc/ManurangsiNT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aistats/ChierichettiPRT22,
author = {Flavio Chierichetti and
Alessandro Panconesi and
Giuseppe Re and
Luca Trevisan},
editor = {Gustau Camps{-}Valls and
Francisco J. R. Ruiz and
Isabel Valera},
title = {Spectral Robustness for Correlation Clustering Reconstruction in Semi-Adversarial
Models},
booktitle = {International Conference on Artificial Intelligence and Statistics,
{AISTATS} 2022, 28-30 March 2022, Virtual Event},
series = {Proceedings of Machine Learning Research},
volume = {151},
pages = {10852--10880},
publisher = {{PMLR}},
year = {2022},
url = {https://proceedings.mlr.press/v151/chierichetti22a.html},
timestamp = {Sat, 30 Sep 2023 09:34:08 +0200},
biburl = {https://dblp.org/rec/conf/aistats/ChierichettiPRT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/BecchettiCDPTZ22,
author = {Luca Becchetti and
Andrea Clementi and
Riccardo Denni and
Francesco Pasquale and
Luca Trevisan and
Isabella Ziccardi},
editor = {Armando Casta{\~{n}}eda and
Francisco Rodr{\'{\i}}guez{-}Henr{\'{\i}}quez},
title = {Percolation and Epidemic Processes in One-Dimensional Small-World
Networks - (Extended Abstract)},
booktitle = {{LATIN} 2022: Theoretical Informatics - 15th Latin American Symposium,
Guanajuato, Mexico, November 7-11, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13568},
pages = {476--492},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-20624-5\_29},
doi = {10.1007/978-3-031-20624-5\_29},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/latin/BecchettiCDPTZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChenST22,
author = {Antares Chen and
Jonathan Shi and
Luca Trevisan},
editor = {Joseph (Seffi) Naor and
Niv Buchbinder},
title = {Cut Sparsification of the Clique Beyond the Ramanujan Bound: {A} Separation
of Cut Versus Spectral Sparsification},
booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 -
12, 2022},
pages = {3693--3731},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977073.146},
doi = {10.1137/1.9781611977073.146},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/ChenST22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2204-10881,
author = {Tommaso d'Orsi and
Luca Trevisan},
title = {A Ihara-Bass Formula for Non-Boolean Matrices and Strong Refutations
of Random CSPs},
journal = {CoRR},
volume = {abs/2204.10881},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2204.10881},
doi = {10.48550/ARXIV.2204.10881},
eprinttype = {arXiv},
eprint = {2204.10881},
timestamp = {Thu, 28 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2204-10881.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2205-08774,
author = {Luca Becchetti and
Andrea Clementi and
Francesco Pasquale and
Luca Trevisan and
Isabella Ziccardi},
title = {Bond Percolation in Small-World Graphs with Power-Law Distribution},
journal = {CoRR},
volume = {abs/2205.08774},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2205.08774},
doi = {10.48550/ARXIV.2205.08774},
eprinttype = {arXiv},
eprint = {2205.08774},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2205-08774.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2207-13944,
author = {Luca Becchetti and
Arthur Carvalho Walraven da Cunha and
Andrea Clementi and
Francesco D'Amore and
Hicham Lesfari and
Emanuele Natale and
Luca Trevisan},
title = {On the Multidimensional Random Subset Sum Problem},
journal = {CoRR},
volume = {abs/2207.13944},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2207.13944},
doi = {10.48550/ARXIV.2207.13944},
eprinttype = {arXiv},
eprint = {2207.13944},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2207-13944.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/Trevisan21,
author = {Luca Trevisan},
title = {Introducing The Theory Blogs Column},
journal = {Bull. {EATCS}},
volume = {135},
year = {2021},
url = {http://bulletin.eatcs.org/index.php/beatcs/article/view/668},
timestamp = {Mon, 24 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eatcs/Trevisan21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/CarlsonKLMST21,
author = {Charles Carlson and
Alexandra Kolla and
Ray Li and
Nitya Mani and
Benny Sudakov and
Luca Trevisan},
title = {Lower Bounds for Max-Cut in H-Free Graphs via Semidefinite Programming},
journal = {{SIAM} J. Discret. Math.},
volume = {35},
number = {3},
pages = {1557--1568},
year = {2021},
url = {https://doi.org/10.1137/20M1333985},
doi = {10.1137/20M1333985},
timestamp = {Tue, 29 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/CarlsonKLMST21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdcs/BecchettiCPTZ21,
author = {Luca Becchetti and
Andrea Clementi and
Francesco Pasquale and
Luca Trevisan and
Isabella Ziccardi},
title = {Expansion and Flooding in Dynamic Random Networks with Node Churn},
booktitle = {41st {IEEE} International Conference on Distributed Computing Systems,
{ICDCS} 2021, Washington DC, USA, July 7-10, 2021},
pages = {976--986},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/ICDCS51616.2021.00097},
doi = {10.1109/ICDCS51616.2021.00097},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icdcs/BecchettiCPTZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2103-16398,
author = {Luca Becchetti and
Andrea Clementi and
Riccardo Denni and
Francesco Pasquale and
Luca Trevisan and
Isabella Ziccardi},
title = {Sharp Thresholds for a {SIR} Model on One-Dimensional Small-World
Networks},
journal = {CoRR},
volume = {abs/2103.16398},
year = {2021},
url = {https://arxiv.org/abs/2103.16398},
eprinttype = {arXiv},
eprint = {2103.16398},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2103-16398.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2108-04729,
author = {Flavio Chierichetti and
Alessandro Panconesi and
Giuseppe Re and
Luca Trevisan},
title = {Correlation Clustering Reconstruction in Semi-Adversarial Models},
journal = {CoRR},
volume = {abs/2108.04729},
year = {2021},
url = {https://arxiv.org/abs/2108.04729},
eprinttype = {arXiv},
eprint = {2108.04729},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2108-04729.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChalermsookCKLM20,
author = {Parinya Chalermsook and
Marek Cygan and
Guy Kortsarz and
Bundit Laekhanukit and
Pasin Manurangsi and
Danupon Nanongkai and
Luca Trevisan},
title = {From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable
Inapproximability: Clique, Dominating Set, and More},
journal = {{SIAM} J. Comput.},
volume = {49},
number = {4},
pages = {772--810},
year = {2020},
url = {https://doi.org/10.1137/18M1166869},
doi = {10.1137/18M1166869},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChalermsookCKLM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BecchettiCNPT20,
author = {Luca Becchetti and
Andrea E. F. Clementi and
Emanuele Natale and
Francesco Pasquale and
Luca Trevisan},
title = {Find Your Place: Simple Distributed Algorithms for Community Detection},
journal = {{SIAM} J. Comput.},
volume = {49},
number = {4},
pages = {821--864},
year = {2020},
url = {https://doi.org/10.1137/19M1243026},
doi = {10.1137/19M1243026},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BecchettiCNPT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/etfa/TrevisanVTM20,
author = {Luca Trevisan and
Stefano Vitturi and
Federico Tramarin and
Alberto Morato},
title = {An IIoT System to Monitor 3D-Printed Artifacts via LoRaWAN Embedded
Sensors},
booktitle = {25th {IEEE} International Conference on Emerging Technologies and
Factory Automation, {ETFA} 2020, Vienna, Austria, September 8-11,
2020},
pages = {1331--1334},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/ETFA46521.2020.9212019},
doi = {10.1109/ETFA46521.2020.9212019},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/etfa/TrevisanVTM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HopkinsST20,
author = {Samuel B. Hopkins and
Tselil Schramm and
Luca Trevisan},
editor = {Sandy Irani},
title = {Subexponential LPs Approximate Max-Cut},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {943--953},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00092},
doi = {10.1109/FOCS46700.2020.00092},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/HopkinsST20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/i2mtc/VitturiTMFT20,
author = {Stefano Vitturi and
Luca Trevisan and
Alberto Morato and
Guglielmo Frigo and
Federico Tramarin},
title = {Evaluation of LoRaWAN for Sensor Data Collection in an IIoT-based
Additive Manufacturing Project},
booktitle = {2020 {IEEE} International Instrumentation and Measurement Technology
Conference, {I2MTC} 2020, Dubrovnik, Croatia, May 25-28, 2020},
pages = {1--6},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/I2MTC43012.2020.9128684},
doi = {10.1109/I2MTC43012.2020.9128684},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/i2mtc/VitturiTMFT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/ClementiGNPST20,
author = {Andrea Clementi and
Luciano Gual{\`{a}} and
Emanuele Natale and
Francesco Pasquale and
Giacomo Scornavacca and
Luca Trevisan},
editor = {Thomas Vidick},
title = {Consensus vs Broadcast, with and Without Noise (Extended Abstract)},
booktitle = {11th Innovations in Theoretical Computer Science Conference, {ITCS}
2020, January 12-14, 2020, Seattle, Washington, {USA}},
series = {LIPIcs},
volume = {151},
pages = {42:1--42:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2020.42},
doi = {10.4230/LIPICS.ITCS.2020.42},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/ClementiGNPST20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/CarlsonKLMST20,
author = {Charles Carlson and
Alexandra Kolla and
Ray Li and
Nitya Mani and
Benny Sudakov and
Luca Trevisan},
editor = {Yoshiharu Kohayakawa and
Fl{\'{a}}vio Keidi Miyazawa},
title = {Lower Bounds for Max-Cut via Semidefinite Programming},
booktitle = {{LATIN} 2020: Theoretical Informatics - 14th Latin American Symposium,
S{\~{a}}o Paulo, Brazil, January 5-8, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12118},
pages = {479--490},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-61792-9\_38},
doi = {10.1007/978-3-030-61792-9\_38},
timestamp = {Tue, 29 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/latin/CarlsonKLMST20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/McKenzieMT20,
author = {Theo McKenzie and
Hermish Mehta and
Luca Trevisan},
editor = {Shuchi Chawla},
title = {A New Algorithm for the Robust Semi-random Independent Set Problem},
booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
pages = {738--746},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611975994.45},
doi = {10.1137/1.9781611975994.45},
timestamp = {Thu, 15 Jul 2021 13:48:53 +0200},
biburl = {https://dblp.org/rec/conf/soda/McKenzieMT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BecchettiCNPT20,
author = {Luca Becchetti and
Andrea Clementi and
Emanuele Natale and
Francesco Pasquale and
Luca Trevisan},
editor = {Shuchi Chawla},
title = {Finding a Bounded-Degree Expander Inside a Dense One},
booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
pages = {1320--1336},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611975994.80},
doi = {10.1137/1.9781611975994.80},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BecchettiCNPT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-14681,
author = {Luca Becchetti and
Andrea Clementi and
Francesco Pasquale and
Luca Trevisan and
Isabella Ziccardi},
title = {Expansion and Flooding in Dynamic Random Networks with Node Churn},
journal = {CoRR},
volume = {abs/2007.14681},
year = {2020},
url = {https://arxiv.org/abs/2007.14681},
eprinttype = {arXiv},
eprint = {2007.14681},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-14681.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-05648,
author = {Antares Chen and
Jonathan Shi and
Luca Trevisan},
title = {Cut Sparsification of the Clique Beyond the Ramanujan Bound},
journal = {CoRR},
volume = {abs/2008.05648},
year = {2020},
url = {https://arxiv.org/abs/2008.05648},
eprinttype = {arXiv},
eprint = {2008.05648},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-05648.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BansalST19,
author = {Nikhil Bansal and
Ola Svensson and
Luca Trevisan},
editor = {David Zuckerman},
title = {New Notions and Constructions of Sparsification for Graphs and Hypergraphs},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {910--928},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00059},
doi = {10.1109/FOCS.2019.00059},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BansalST19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CarlsonKST19,
author = {Charles Carlson and
Alexandra Kolla and
Nikhil Srivastava and
Luca Trevisan},
editor = {Timothy M. Chan},
title = {Optimal Lower Bounds for Sketching Graph Cuts},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {2565--2569},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.158},
doi = {10.1137/1.9781611975482.158},
timestamp = {Tue, 29 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/CarlsonKST19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-01495,
author = {Nikhil Bansal and
Ola Svensson and
Luca Trevisan},
title = {New Notions and Constructions of Sparsification for Graphs and Hypergraphs},
journal = {CoRR},
volume = {abs/1905.01495},
year = {2019},
url = {http://arxiv.org/abs/1905.01495},
eprinttype = {arXiv},
eprint = {1905.01495},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-01495.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-02539,
author = {Jess Banks and
Luca Trevisan},
title = {Vector Colorings of Random, Ramanujan, and Large-Girth Irregular Graphs},
journal = {CoRR},
volume = {abs/1907.02539},
year = {2019},
url = {http://arxiv.org/abs/1907.02539},
eprinttype = {arXiv},
eprint = {1907.02539},
timestamp = {Mon, 08 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-02539.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-10304,
author = {Samuel B. Hopkins and
Tselil Schramm and
Luca Trevisan},
title = {Subexponential LPs Approximate Max-Cut},
journal = {CoRR},
volume = {abs/1911.10304},
year = {2019},
url = {http://arxiv.org/abs/1911.10304},
eprinttype = {arXiv},
eprint = {1911.10304},
timestamp = {Tue, 03 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-10304.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ManurangsiT18,
author = {Pasin Manurangsi and
Luca Trevisan},
editor = {Eric Blais and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Steurer},
title = {Mildly Exponential Time Approximation Algorithms for Vertex Cover,
Balanced Separator and Uniform Sparsest Cut},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2018, August 20-22, 2018 - Princeton,
NJ, {USA}},
series = {LIPIcs},
volume = {116},
pages = {20:1--20:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.20},
doi = {10.4230/LIPICS.APPROX-RANDOM.2018.20},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/ManurangsiT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BecchettiCMNPRT18,
author = {Luca Becchetti and
Andrea Clementi and
Pasin Manurangsi and
Emanuele Natale and
Francesco Pasquale and
Prasad Raghavendra and
Luca Trevisan},
editor = {Yossi Azar and
Hannah Bast and
Grzegorz Herman},
title = {Average Whenever You Meet: Opportunistic Protocols for Community Detection},
booktitle = {26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22,
2018, Helsinki, Finland},
series = {LIPIcs},
volume = {112},
pages = {7:1--7:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ESA.2018.7},
doi = {10.4230/LIPICS.ESA.2018.7},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/BecchettiCMNPRT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/SrivastavaT18,
author = {Nikhil Srivastava and
Luca Trevisan},
editor = {Artur Czumaj},
title = {An Alon-Boppana Type Bound for Weighted Graphs and Lowerbounds for
Spectral Sparsification},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {1306--1315},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.85},
doi = {10.1137/1.9781611975031.85},
timestamp = {Tue, 02 Feb 2021 17:07:58 +0100},
biburl = {https://dblp.org/rec/conf/soda/SrivastavaT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-05626,
author = {Andrea Clementi and
Luciano Gual{\`{a}} and
Emanuele Natale and
Francesco Pasquale and
Giacomo Scornavacca and
Luca Trevisan},
title = {Consensus Needs Broadcast in Noiseless Models but can be Exponentially
Easier in the Presence of Noise},
journal = {CoRR},
volume = {abs/1807.05626},
year = {2018},
url = {http://arxiv.org/abs/1807.05626},
eprinttype = {arXiv},
eprint = {1807.05626},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-05626.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-09898,
author = {Pasin Manurangsi and
Luca Trevisan},
title = {Mildly Exponential Time Approximation Algorithms for Vertex Cover,
Uniform Sparsest Cut and Related Problems},
journal = {CoRR},
volume = {abs/1807.09898},
year = {2018},
url = {http://arxiv.org/abs/1807.09898},
eprinttype = {arXiv},
eprint = {1807.09898},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-09898.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-03633,
author = {Theo McKenzie and
Hermish Mehta and
Luca Trevisan},
title = {A New Algorithm for the Robust Semi-random Independent Set Problem},
journal = {CoRR},
volume = {abs/1808.03633},
year = {2018},
url = {http://arxiv.org/abs/1808.03633},
eprinttype = {arXiv},
eprint = {1808.03633},
timestamp = {Sun, 02 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-03633.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-10044,
author = {Charles Carlson and
Alexandra Kolla and
Luca Trevisan},
title = {A Ramsey-type Theorem on the Max-Cut Value of d-Regular Graphs},
journal = {CoRR},
volume = {abs/1810.10044},
year = {2018},
url = {http://arxiv.org/abs/1810.10044},
eprinttype = {arXiv},
eprint = {1810.10044},
timestamp = {Tue, 29 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-10044.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-10316,
author = {Luca Becchetti and
Andrea Clementi and
Emanuele Natale and
Francesco Pasquale and
Luca Trevisan},
title = {Finding a Bounded-Degree Expander Inside a Dense One},
journal = {CoRR},
volume = {abs/1811.10316},
year = {2018},
url = {http://arxiv.org/abs/1811.10316},
eprinttype = {arXiv},
eprint = {1811.10316},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-10316.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/BecchettiCNPST17,
author = {Luca Becchetti and
Andrea Clementi and
Emanuele Natale and
Francesco Pasquale and
Riccardo Silvestri and
Luca Trevisan},
title = {Simple dynamics for plurality consensus},
journal = {Distributed Comput.},
volume = {30},
number = {4},
pages = {293--306},
year = {2017},
url = {https://doi.org/10.1007/s00446-016-0289-4},
doi = {10.1007/S00446-016-0289-4},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dc/BecchettiCNPST17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChalermsookCKLM17,
author = {Parinya Chalermsook and
Marek Cygan and
Guy Kortsarz and
Bundit Laekhanukit and
Pasin Manurangsi and
Danupon Nanongkai and
Luca Trevisan},
editor = {Chris Umans},
title = {From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and
More},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {743--754},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.74},
doi = {10.1109/FOCS.2017.74},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChalermsookCKLM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BorassiCT17,
author = {Michele Borassi and
Pierluigi Crescenzi and
Luca Trevisan},
editor = {Philip N. Klein},
title = {An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics
for Metric Properties of Graphs},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {920--939},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.58},
doi = {10.1137/1.9781611974782.58},
timestamp = {Sun, 12 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BorassiCT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BecchettiCNPT17,
author = {Luca Becchetti and
Andrea Clementi and
Emanuele Natale and
Francesco Pasquale and
Luca Trevisan},
editor = {Philip N. Klein},
title = {Find Your Place: Simple Distributed Algorithms for Community Detection},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {940--959},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.59},
doi = {10.1137/1.9781611974782.59},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BecchettiCNPT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BecchettiCNPRT17,
author = {Luca Becchetti and
Andrea Clementi and
Emanuele Natale and
Francesco Pasquale and
Prasad Raghavendra and
Luca Trevisan},
title = {Friend or Foe? Population Protocols can perform Community Detection},
journal = {CoRR},
volume = {abs/1703.05045},
year = {2017},
url = {http://arxiv.org/abs/1703.05045},
eprinttype = {arXiv},
eprint = {1703.05045},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BecchettiCNPRT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/SrivastavaT17,
author = {Nikhil Srivastava and
Luca Trevisan},
title = {An Alon-Boppana Type Bound for Weighted Graphs and Lowerbounds for
Spectral Sparsification},
journal = {CoRR},
volume = {abs/1707.06364},
year = {2017},
url = {http://arxiv.org/abs/1707.06364},
eprinttype = {arXiv},
eprint = {1707.06364},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/SrivastavaT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-04218,
author = {Parinya Chalermsook and
Marek Cygan and
Guy Kortsarz and
Bundit Laekhanukit and
Pasin Manurangsi and
Danupon Nanongkai and
Luca Trevisan},
title = {From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and
More},
journal = {CoRR},
volume = {abs/1708.04218},
year = {2017},
url = {http://arxiv.org/abs/1708.04218},
eprinttype = {arXiv},
eprint = {1708.04218},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-04218.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1712-10261,
author = {Charles Carlson and
Alexandra Kolla and
Nikhil Srivastava and
Luca Trevisan},
title = {Optimal Lower Bounds for Sketching Graph Cuts},
journal = {CoRR},
volume = {abs/1712.10261},
year = {2017},
url = {http://arxiv.org/abs/1712.10261},
eprinttype = {arXiv},
eprint = {1712.10261},
timestamp = {Tue, 29 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1712-10261.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AndersenGPT16,
author = {Reid Andersen and
Shayan Oveis Gharan and
Yuval Peres and
Luca Trevisan},
title = {Almost Optimal Local Graph Clustering Using Evolving Sets},
journal = {J. {ACM}},
volume = {63},
number = {2},
pages = {15:1--15:31},
year = {2016},
url = {https://doi.org/10.1145/2856030},
doi = {10.1145/2856030},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AndersenGPT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ManurangsiNT16,
author = {Pasin Manurangsi and
Preetum Nakkiran and
Luca Trevisan},
editor = {Klaus Jansen and
Claire Mathieu and
Jos{\'{e}} D. P. Rolim and
Chris Umans},
title = {Near-Optimal UGC-hardness of Approximating Max k-CSP{\_}R},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2016, September 7-9, 2016, Paris,
France},
series = {LIPIcs},
volume = {60},
pages = {15:1--15:28},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2016.15},
doi = {10.4230/LIPICS.APPROX-RANDOM.2016.15},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/ManurangsiNT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BecchettiCNPT16,
author = {Luca Becchetti and
Andrea Clementi and
Emanuele Natale and
Francesco Pasquale and
Luca Trevisan},
editor = {Robert Krauthgamer},
title = {Stabilizing Consensus with Many Opinions},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
pages = {620--635},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974331.ch46},
doi = {10.1137/1.9781611974331.CH46},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BecchettiCNPT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KindlerKT16,
author = {Guy Kindler and
Alexandra Kolla and
Luca Trevisan},
editor = {Robert Krauthgamer},
title = {Approximation of non-boolean 2CSP},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
pages = {1705--1714},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974331.ch117},
doi = {10.1137/1.9781611974331.CH117},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/KindlerKT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Trevisan16,
author = {Luca Trevisan},
title = {Learning Heavy Fourier Coefficients of Boolean Functions},
booktitle = {Encyclopedia of Algorithms},
pages = {1078--1081},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_197},
doi = {10.1007/978-1-4939-2864-4\_197},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Trevisan16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BorassiCT16,
author = {Michele Borassi and
Pierluigi Crescenzi and
Luca Trevisan},
title = {An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics
for Metric Properties of Graphs},
journal = {CoRR},
volume = {abs/1604.01445},
year = {2016},
url = {http://arxiv.org/abs/1604.01445},
eprinttype = {arXiv},
eprint = {1604.01445},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BorassiCT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cjtcs/AgarwalKKT15,
author = {Naman Agarwal and
Guy Kindler and
Alexandra Kolla and
Luca Trevisan},
title = {Unique Games on the Hypercube},
journal = {Chic. J. Theor. Comput. Sci.},
volume = {2015},
year = {2015},
url = {http://cjtcs.cs.uchicago.edu/articles/2015/1/contents.html},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cjtcs/AgarwalKKT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/ClementiST15,
author = {Andrea Clementi and
Riccardo Silvestri and
Luca Trevisan},
title = {Information spreading in dynamic graphs},
journal = {Distributed Comput.},
volume = {28},
number = {1},
pages = {55--73},
year = {2015},
url = {https://doi.org/10.1007/s00446-014-0219-2},
doi = {10.1007/S00446-014-0219-2},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dc/ClementiST15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/qic/NayebiABT15,
author = {Aran Nayebi and
Scott Aaronson and
Aleksandrs Belovs and
Luca Trevisan},
title = {Quantum lower bound for inverting a permutation with advice},
journal = {Quantum Inf. Comput.},
volume = {15},
number = {11{\&}12},
pages = {901--913},
year = {2015},
url = {https://doi.org/10.26421/QIC15.11-12-1},
doi = {10.26421/QIC15.11-12-1},
timestamp = {Thu, 29 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/qic/NayebiABT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/GharanT15,
author = {Shayan Oveis Gharan and
Luca Trevisan},
title = {A New Regularity Lemma and Faster Approximation Algorithms for Low
Threshold Rank Graphs},
journal = {Theory Comput.},
volume = {11},
pages = {241--256},
year = {2015},
url = {https://doi.org/10.4086/toc.2015.v011a009},
doi = {10.4086/TOC.2015.V011A009},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/GharanT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BarakMORRSTVWW15,
author = {Boaz Barak and
Ankur Moitra and
Ryan O'Donnell and
Prasad Raghavendra and
Oded Regev and
David Steurer and
Luca Trevisan and
Aravindan Vijayaraghavan and
David Witmer and
John Wright},
editor = {Naveen Garg and
Klaus Jansen and
Anup Rao and
Jos{\'{e}} D. P. Rolim},
title = {Beating the Random Assignment on Constraint Satisfaction Problems
of Bounded Degree},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2015, August 24-26, 2015, Princeton,
NJ, {USA}},
series = {LIPIcs},
volume = {40},
pages = {110--123},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.110},
doi = {10.4230/LIPICS.APPROX-RANDOM.2015.110},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/BarakMORRSTVWW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KindlerKT15,
author = {Guy Kindler and
Alexandra Kolla and
Luca Trevisan},
title = {Approximation of non-boolean 2CSP},
journal = {CoRR},
volume = {abs/1504.00681},
year = {2015},
url = {http://arxiv.org/abs/1504.00681},
eprinttype = {arXiv},
eprint = {1504.00681},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KindlerKT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BarakMORRSTVWW15,
author = {Boaz Barak and
Ankur Moitra and
Ryan O'Donnell and
Prasad Raghavendra and
Oded Regev and
David Steurer and
Luca Trevisan and
Aravindan Vijayaraghavan and
David Witmer and
John Wright},
title = {Beating the random assignment on constraint satisfaction problems
of bounded degree},
journal = {CoRR},
volume = {abs/1505.03424},
year = {2015},
url = {http://arxiv.org/abs/1505.03424},
eprinttype = {arXiv},
eprint = {1505.03424},
timestamp = {Thu, 11 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BarakMORRSTVWW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BecchettiCNPT15,
author = {Luca Becchetti and
Andrea Clementi and
Emanuele Natale and
Francesco Pasquale and
Luca Trevisan},
title = {Stabilizing Consensus with Many Opinions},
journal = {CoRR},
volume = {abs/1508.06782},
year = {2015},
url = {http://arxiv.org/abs/1508.06782},
eprinttype = {arXiv},
eprint = {1508.06782},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BecchettiCNPT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BecchettiCNPT15a,
author = {Luca Becchetti and
Andrea Clementi and
Emanuele Natale and
Francesco Pasquale and
Luca Trevisan},
title = {Find Your Place: Simple Distributed Algorithms for Community Detection},
journal = {CoRR},
volume = {abs/1511.03927},
year = {2015},
url = {http://arxiv.org/abs/1511.03927},
eprinttype = {arXiv},
eprint = {1511.03927},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BecchettiCNPT15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ManurangsiNT15,
author = {Pasin Manurangsi and
Preetum Nakkiran and
Luca Trevisan},
title = {Near-Optimal UGC-hardness of Approximating Max k-CSP{\_}R},
journal = {CoRR},
volume = {abs/1511.06558},
year = {2015},
url = {http://arxiv.org/abs/1511.06558},
eprinttype = {arXiv},
eprint = {1511.06558},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ManurangsiNT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BarakMORRSTVWW15,
author = {Boaz Barak and
Ankur Moitra and
Ryan O'Donnell and
Prasad Raghavendra and
Oded Regev and
David Steurer and
Luca Trevisan and
Aravindan Vijayaraghavan and
David Witmer and
John Wright},
title = {Beating the random assignment on constraint satisfaction problems
of bounded degree},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR15-082}},
year = {2015},
url = {https://eccc.weizmann.ac.il/report/2015/082},
eprinttype = {ECCC},
eprint = {TR15-082},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BarakMORRSTVWW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LeeGT14,
author = {James R. Lee and
Shayan Oveis Gharan and
Luca Trevisan},
title = {Multiway Spectral Partitioning and Higher-Order Cheeger Inequalities},
journal = {J. {ACM}},
volume = {61},
number = {6},
pages = {37:1--37:30},
year = {2014},
url = {https://doi.org/10.1145/2665063},
doi = {10.1145/2665063},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/LeeGT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LauMOT14,
author = {Lap Chi Lau and
Tal Malkin and
Ryan O'Donnell and
Luca Trevisan},
title = {Special Section on the Fifty-First Annual {IEEE} Symposium on Foundations
of Computer Science {(FOCS} 2010)},
journal = {{SIAM} J. Comput.},
volume = {43},
number = {1},
pages = {255},
year = {2014},
url = {https://doi.org/10.1137/140973608},
doi = {10.1137/140973608},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/LauMOT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/CookEMT14,
author = {James Cook and
Omid Etesami and
Rachel Miller and
Luca Trevisan},
title = {On the One-Way Function Candidate Proposed by Goldreich},
journal = {{ACM} Trans. Comput. Theory},
volume = {6},
number = {3},
pages = {14:1--14:35},
year = {2014},
url = {https://doi.org/10.1145/2633602},
doi = {10.1145/2633602},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/CookEMT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GharanT14,
author = {Shayan Oveis Gharan and
Luca Trevisan},
editor = {Chandra Chekuri},
title = {Partitioning into Expanders},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
pages = {1256--1266},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973402.93},
doi = {10.1137/1.9781611973402.93},
timestamp = {Tue, 02 Feb 2021 17:07:40 +0100},
biburl = {https://dblp.org/rec/conf/soda/GharanT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/BecchettiCNPST14,
author = {Luca Becchetti and
Andrea Clementi and
Emanuele Natale and
Francesco Pasquale and
Riccardo Silvestri and
Luca Trevisan},
editor = {Guy E. Blelloch and
Peter Sanders},
title = {Simple dynamics for plurality consensus},
booktitle = {26th {ACM} Symposium on Parallelism in Algorithms and Architectures,
{SPAA} '14, Prague, Czech Republic - June 23 - 25, 2014},
pages = {247--256},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2612669.2612677},
doi = {10.1145/2612669.2612677},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/spaa/BecchettiCNPST14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AgarwalKKT14,
author = {Naman Agarwal and
Guy Kindler and
Alexandra Kolla and
Luca Trevisan},
title = {Unique Games on the Hypercube},
journal = {CoRR},
volume = {abs/1405.1374},
year = {2014},
url = {http://arxiv.org/abs/1405.1374},
eprinttype = {arXiv},
eprint = {1405.1374},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AgarwalKKT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/NayebiABT14,
author = {Aran Nayebi and
Scott Aaronson and
Aleksandrs Belovs and
Luca Trevisan},
title = {Quantum lower bound for inverting a permutation with advice},
journal = {CoRR},
volume = {abs/1408.3193},
year = {2014},
url = {http://arxiv.org/abs/1408.3193},
eprinttype = {arXiv},
eprint = {1408.3193},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/NayebiABT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/NayebiABT14,
author = {Aran Nayebi and
Scott Aaronson and
Aleksandrs Belovs and
Luca Trevisan},
title = {Quantum lower bound for inverting a permutation with advice},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-109}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/109},
eprinttype = {ECCC},
eprint = {TR14-109},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/NayebiABT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GharanT13,
author = {Shayan Oveis Gharan and
Luca Trevisan},
editor = {Prasad Raghavendra and
Sofya Raskhodnikova and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim},
title = {A New Regularity Lemma and Faster Approximation Algorithms for Low
Threshold Rank Graphs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques - 16th International Workshop, {APPROX} 2013, and 17th
International Workshop, {RANDOM} 2013, Berkeley, CA, USA, August 21-23,
2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8096},
pages = {303--316},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40328-6\_22},
doi = {10.1007/978-3-642-40328-6\_22},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/GharanT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/TrevisanX13,
author = {Luca Trevisan and
Tongke Xue},
title = {A Derandomized Switching Lemma and an Improved Derandomization of
{AC0}},
booktitle = {Proceedings of the 28th Conference on Computational Complexity, {CCC}
2013, K.lo Alto, California, USA, 5-7 June, 2013},
pages = {242--247},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/CCC.2013.32},
doi = {10.1109/CCC.2013.32},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/TrevisanX13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KwokLLGT13,
author = {Tsz Chiu Kwok and
Lap Chi Lau and
Yin Tat Lee and
Shayan Oveis Gharan and
Luca Trevisan},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Improved Cheeger's inequality: analysis of spectral partitioning algorithms
through higher order spectral gap},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {11--20},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488611},
doi = {10.1145/2488608.2488611},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KwokLLGT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/tamc/2013,
editor = {T.{-}H. Hubert Chan and
Lap Chi Lau and
Luca Trevisan},
title = {Theory and Applications of Models of Computation, 10th International
Conference, {TAMC} 2013, Hong Kong, China, May 20-22, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7876},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38236-9},
doi = {10.1007/978-3-642-38236-9},
isbn = {978-3-642-38235-2},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tamc/2013.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1301-5584,
author = {Tsz Chiu Kwok and
Lap Chi Lau and
Yin Tat Lee and
Shayan Oveis Gharan and
Luca Trevisan},
title = {Improved Cheeger's Inequality: Analysis of Spectral Partitioning Algorithms
through Higher Order Spectral Gap},
journal = {CoRR},
volume = {abs/1301.5584},
year = {2013},
url = {http://arxiv.org/abs/1301.5584},
eprinttype = {arXiv},
eprint = {1301.5584},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1301-5584.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1303-2730,
author = {Luca Trevisan},
title = {Is Cheeger-type Approximation Possible for Nonuniform Sparsest Cut?},
journal = {CoRR},
volume = {abs/1303.2730},
year = {2013},
url = {http://arxiv.org/abs/1303.2730},
eprinttype = {arXiv},
eprint = {1303.2730},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1303-2730.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-2060,
author = {Shayan Oveis Gharan and
Luca Trevisan},
title = {Improved {ARV} Rounding in Small-set Expanders and Graphs of Bounded
Threshold Rank},
journal = {CoRR},
volume = {abs/1304.2060},
year = {2013},
url = {http://arxiv.org/abs/1304.2060},
eprinttype = {arXiv},
eprint = {1304.2060},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1304-2060.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GharanT13,
author = {Shayan Oveis Gharan and
Luca Trevisan},
title = {Partitioning into Expanders},
journal = {CoRR},
volume = {abs/1309.3223},
year = {2013},
url = {http://arxiv.org/abs/1309.3223},
eprinttype = {arXiv},
eprint = {1309.3223},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GharanT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BecchettiCNPST13,
author = {Luca Becchetti and
Andrea Clementi and
Emanuele Natale and
Francesco Pasquale and
Riccardo Silvestri and
Luca Trevisan},
title = {Simple Dynamics for Majority Consensus},
journal = {CoRR},
volume = {abs/1310.2858},
year = {2013},
url = {http://arxiv.org/abs/1310.2858},
eprinttype = {arXiv},
eprint = {1310.2858},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BecchettiCNPST13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/crossroads/Trevisan12,
author = {Luca Trevisan},
title = {Pseudorandomness and derandomization},
journal = {{XRDS}},
volume = {18},
number = {3},
pages = {27--31},
year = {2012},
url = {https://doi.org/10.1145/2090276.2090287},
doi = {10.1145/2090276.2090287},
timestamp = {Fri, 03 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/crossroads/Trevisan12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Trevisan12,
author = {Luca Trevisan},
title = {Max Cut and the Smallest Eigenvalue},
journal = {{SIAM} J. Comput.},
volume = {41},
number = {6},
pages = {1769--1786},
year = {2012},
url = {https://doi.org/10.1137/090773714},
doi = {10.1137/090773714},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Trevisan12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GopalanMRTV12,
author = {Parikshit Gopalan and
Raghu Meka and
Omer Reingold and
Luca Trevisan and
Salil P. Vadhan},
title = {Better Pseudorandom Generators from Milder Pseudorandom Restrictions},
booktitle = {53rd Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2012, New Brunswick, NJ, USA, October 20-23, 2012},
pages = {120--129},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/FOCS.2012.77},
doi = {10.1109/FOCS.2012.77},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GopalanMRTV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GharanT12,
author = {Shayan Oveis Gharan and
Luca Trevisan},
title = {Approximating the Expansion Profile and Almost Optimal Local Graph
Clustering},
booktitle = {53rd Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2012, New Brunswick, NJ, USA, October 20-23, 2012},
pages = {187--196},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/FOCS.2012.85},
doi = {10.1109/FOCS.2012.85},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GharanT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/ClementiST12,
author = {Andrea Clementi and
Riccardo Silvestri and
Luca Trevisan},
editor = {Darek Kowalski and
Alessandro Panconesi},
title = {Information spreading in dynamic graphs},
booktitle = {{ACM} Symposium on Principles of Distributed Computing, {PODC} '12,
Funchal, Madeira, Portugal, July 16-18, 2012},
pages = {37--46},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2332432.2332439},
doi = {10.1145/2332432.2332439},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/podc/ClementiST12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LeeGT12,
author = {James R. Lee and
Shayan Oveis Gharan and
Luca Trevisan},
editor = {Howard J. Karloff and
Toniann Pitassi},
title = {Multi-way spectral partitioning and higher-order cheeger inequalities},
booktitle = {Proceedings of the 44th Symposium on Theory of Computing Conference,
{STOC} 2012, New York, NY, USA, May 19 - 22, 2012},
pages = {1117--1130},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2213977.2214078},
doi = {10.1145/2213977.2214078},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/LeeGT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1204-2021,
author = {Shayan Oveis Gharan and
Luca Trevisan},
title = {Approximating the Expansion Profile and Almost Optimal Local Graph
Clustering},
journal = {CoRR},
volume = {abs/1204.2021},
year = {2012},
url = {http://arxiv.org/abs/1204.2021},
eprinttype = {arXiv},
eprint = {1204.2021},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1204-2021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1210-0049,
author = {Parikshit Gopalan and
Raghu Meka and
Omer Reingold and
Luca Trevisan and
Salil P. Vadhan},
title = {Better Pseudorandom Generators from Milder Pseudorandom Restrictions},
journal = {CoRR},
volume = {abs/1210.0049},
year = {2012},
url = {http://arxiv.org/abs/1210.0049},
eprinttype = {arXiv},
eprint = {1210.0049},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1210-0049.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1212-1831,
author = {Shayan Oveis Gharan and
Luca Trevisan},
title = {A New Regularity Lemma and Faster Approximation Algorithms for Low
Threshold Rank Graphs},
journal = {CoRR},
volume = {abs/1212.1831},
year = {2012},
url = {http://arxiv.org/abs/1212.1831},
eprinttype = {arXiv},
eprint = {1212.1831},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1212-1831.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1212-2701,
author = {Shayan Oveis Gharan and
Luca Trevisan},
title = {A Universal upper bound on Graph Diameter based on Laplacian Eigenvalues},
journal = {CoRR},
volume = {abs/1212.2701},
year = {2012},
url = {http://arxiv.org/abs/1212.2701},
eprinttype = {arXiv},
eprint = {1212.2701},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1212-2701.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/CookEMT12,
author = {James Cook and
Omid Etesami and
Rachel Miller and
Luca Trevisan},
title = {On the One-Way Function Candidate Proposed by Goldreich},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-175}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/175},
eprinttype = {ECCC},
eprint = {TR12-175},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/CookEMT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GopalanMRTV12,
author = {Parikshit Gopalan and
Raghu Meka and
Omer Reingold and
Luca Trevisan and
Salil P. Vadhan},
title = {Better pseudorandom generators from milder pseudorandom restrictions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-123}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/123},
eprinttype = {ECCC},
eprint = {TR12-123},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GopalanMRTV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Trevisan12,
author = {Luca Trevisan},
title = {A Derandomized Switching Lemma and an Improved Derandomization of
{AC0}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-116}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/116},
eprinttype = {ECCC},
eprint = {TR12-116},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Trevisan12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/Trevisan11,
author = {Luca Trevisan},
editor = {Yuval Ishai},
title = {Dense Model Theorems and Their Applications},
booktitle = {Theory of Cryptography - 8th Theory of Cryptography Conference, {TCC}
2011, Providence, RI, USA, March 28-30, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6597},
pages = {55--57},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-19571-6\_4},
doi = {10.1007/978-3-642-19571-6\_4},
timestamp = {Tue, 14 May 2019 10:00:47 +0200},
biburl = {https://dblp.org/rec/conf/tcc/Trevisan11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/sp/goldreich2011/GoldreichST11,
author = {Oded Goldreich and
Madhu Sudan and
Luca Trevisan},
editor = {Oded Goldreich},
title = {From Logarithmic Advice to Single-Bit Advice},
booktitle = {Studies in Complexity and Cryptography. Miscellanea on the Interplay
between Randomness and Computation - In Collaboration with Lidor Avigad,
Mihir Bellare, Zvika Brakerski, Shafi Goldwasser, Shai Halevi, Tali
Kaufman, Leonid Levin, Noam Nisan, Dana Ron, Madhu Sudan, Luca Trevisan,
Salil Vadhan, Avi Wigderson, David Zuckerman},
series = {Lecture Notes in Computer Science},
volume = {6650},
pages = {109--113},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22670-0\_13},
doi = {10.1007/978-3-642-22670-0\_13},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/sp/goldreich2011/GoldreichST11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1111-0583,
author = {Andrea Clementi and
Riccardo Silvestri and
Luca Trevisan},
title = {Information Spreading in Dynamic Graphs},
journal = {CoRR},
volume = {abs/1111.0583},
year = {2011},
url = {http://arxiv.org/abs/1111.0583},
eprinttype = {arXiv},
eprint = {1111.0583},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1111-0583.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1111-1055,
author = {James R. Lee and
Shayan Oveis Gharan and
Luca Trevisan},
title = {Multi-way spectral partitioning and higher-order Cheeger inequalities},
journal = {CoRR},
volume = {abs/1111.1055},
year = {2011},
url = {http://arxiv.org/abs/1111.1055},
eprinttype = {arXiv},
eprint = {1111.1055},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1111-1055.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/DeETT10,
author = {Anindya De and
Omid Etesami and
Luca Trevisan and
Madhur Tulsiani},
editor = {Maria J. Serna and
Ronen Shaltiel and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim},
title = {Improved Pseudorandom Generators for Depth 2 Circuits},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 13th International Workshop, {APPROX} 2010, and 14th
International Workshop, {RANDOM} 2010, Barcelona, Spain, September
1-3, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6302},
pages = {504--517},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15369-3\_38},
doi = {10.1007/978-3-642-15369-3\_38},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/DeETT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Trevisan10,
author = {Luca Trevisan},
title = {The Program-Enumeration Bottleneck in Average-Case Complexity Theory},
booktitle = {Proceedings of the 25th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2010, Cambridge, Massachusetts, USA, June 9-12,
2010},
pages = {88--95},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/CCC.2010.18},
doi = {10.1109/CCC.2010.18},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Trevisan10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/DeTT10,
author = {Anindya De and
Luca Trevisan and
Madhur Tulsiani},
editor = {Tal Rabin},
title = {Time Space Tradeoffs for Attacks against One-Way Functions and PRGs},
booktitle = {Advances in Cryptology - {CRYPTO} 2010, 30th Annual Cryptology Conference,
Santa Barbara, CA, USA, August 15-19, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6223},
pages = {649--665},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-14623-7\_35},
doi = {10.1007/978-3-642-14623-7\_35},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/crypto/DeTT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Trevisan10,
author = {Luca Trevisan},
title = {The Program-Enumeration Bottleneck in Average-Case Complexity Theory},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-034}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/034},
eprinttype = {ECCC},
eprint = {TR10-034},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Trevisan10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChekuriT09,
author = {Chandra Chekuri and
Luca Trevisan},
title = {Foreword},
journal = {Algorithmica},
volume = {55},
number = {1},
pages = {111--112},
year = {2009},
url = {https://doi.org/10.1007/s00453-009-9324-1},
doi = {10.1007/S00453-009-9324-1},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ChekuriT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SamorodnitskyT09,
author = {Alex Samorodnitsky and
Luca Trevisan},
title = {Gowers Uniformity, Influence of Variables, and PCPs},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {1},
pages = {323--360},
year = {2009},
url = {https://doi.org/10.1137/070681612},
doi = {10.1137/070681612},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/SamorodnitskyT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/Trevisan09,
author = {Luca Trevisan},
title = {Guest column: additive combinatorics and theoretical computer science},
journal = {{SIGACT} News},
volume = {40},
number = {2},
pages = {50--66},
year = {2009},
url = {https://doi.org/10.1145/1556154.1556170},
doi = {10.1145/1556154.1556170},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigact/Trevisan09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/DeT09,
author = {Anindya De and
Luca Trevisan},
editor = {Irit Dinur and
Klaus Jansen and
Joseph Naor and
Jos{\'{e}} D. P. Rolim},
title = {Extractors Using Hardness Amplification},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5687},
pages = {462--475},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03685-9\_35},
doi = {10.1007/978-3-642-03685-9\_35},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/DeT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/LovettRTV09,
author = {Shachar Lovett and
Omer Reingold and
Luca Trevisan and
Salil P. Vadhan},
editor = {Irit Dinur and
Klaus Jansen and
Joseph Naor and
Jos{\'{e}} D. P. Rolim},
title = {Pseudorandom Bit Generators That Fool Modular Sums},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5687},
pages = {615--630},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03685-9\_46},
doi = {10.1007/978-3-642-03685-9\_46},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/LovettRTV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/TrevisanTV09,
author = {Luca Trevisan and
Madhur Tulsiani and
Salil P. Vadhan},
title = {Regularity, Boosting, and Efficiently Simulating Every High-Entropy
Distribution},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {126--136},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.41},
doi = {10.1109/CCC.2009.41},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/TrevisanTV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Trevisan09,
author = {Luca Trevisan},
editor = {Michael Mitzenmacher},
title = {Max cut and the smallest eigenvalue},
booktitle = {Proceedings of the 41st Annual {ACM} Symposium on Theory of Computing,
{STOC} 2009, Bethesda, MD, USA, May 31 - June 2, 2009},
pages = {263--272},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1536414.1536452},
doi = {10.1145/1536414.1536452},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Trevisan09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/CookEMT09,
author = {James Cook and
Omid Etesami and
Rachel Miller and
Luca Trevisan},
editor = {Omer Reingold},
title = {Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms},
booktitle = {Theory of Cryptography, 6th Theory of Cryptography Conference, {TCC}
2009, San Francisco, CA, USA, March 15-17, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5444},
pages = {521--538},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00457-5\_31},
doi = {10.1007/978-3-642-00457-5\_31},
timestamp = {Tue, 14 May 2019 10:00:47 +0200},
biburl = {https://dblp.org/rec/conf/tcc/CookEMT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DeETT09,
author = {Anindya De and
Omid Etesami and
Luca Trevisan and
Madhur Tulsiani},
title = {Improved Pseudorandom Generators for Depth 2 Circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR09-141}},
year = {2009},
url = {https://eccc.weizmann.ac.il/report/2009/141},
eprinttype = {ECCC},
eprint = {TR09-141},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DeETT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DeTT09,
author = {Anindya De and
Luca Trevisan and
Madhur Tulsiani},
title = {Non-uniform attacks against one-way functions and PRGs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR09-113}},
year = {2009},
url = {https://eccc.weizmann.ac.il/report/2009/113},
eprinttype = {ECCC},
eprint = {TR09-113},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DeTT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/Trevisan08,
author = {Luca Trevisan},
title = {Approximation Algorithms for Unique Games},
journal = {Theory Comput.},
volume = {4},
number = {1},
pages = {111--128},
year = {2008},
url = {https://doi.org/10.4086/toc.2008.v004a005},
doi = {10.4086/TOC.2008.V004A005},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/Trevisan08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Trevisan08,
author = {Luca Trevisan},
title = {Average-case Complexity},
booktitle = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2008, October 25-28, 2008, Philadelphia, PA, {USA}},
pages = {11},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/FOCS.2008.90},
doi = {10.1109/FOCS.2008.90},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Trevisan08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ReingoldTTV08,
author = {Omer Reingold and
Luca Trevisan and
Madhur Tulsiani and
Salil P. Vadhan},
title = {Dense Subsets of Pseudorandom Sets},
booktitle = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2008, October 25-28, 2008, Philadelphia, PA, {USA}},
pages = {76--85},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/FOCS.2008.38},
doi = {10.1109/FOCS.2008.38},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ReingoldTTV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Trevisan08,
author = {Luca Trevisan},
editor = {Ming{-}Yang Kao},
title = {Learning Heavy Fourier Coefficients of Boolean Functions},
booktitle = {Encyclopedia of Algorithms - 2008 Edition},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-0-387-30162-4\_197},
doi = {10.1007/978-0-387-30162-4\_197},
timestamp = {Thu, 27 Jun 2019 16:25:31 +0200},
biburl = {https://dblp.org/rec/reference/algo/Trevisan08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0806-1978,
author = {Luca Trevisan},
title = {Max Cut and the Smallest Eigenvalue},
journal = {CoRR},
volume = {abs/0806.1978},
year = {2008},
url = {http://arxiv.org/abs/0806.1978},
eprinttype = {arXiv},
eprint = {0806.1978},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0806-1978.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ReingoldTTV08,
author = {Omer Reingold and
Luca Trevisan and
Madhur Tulsiani and
Salil P. Vadhan},
title = {Dense Subsets of Pseudorandom Sets},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR08-045}},
year = {2008},
url = {https://eccc.weizmann.ac.il/eccc-reports/2008/TR08-045/index.html},
eprinttype = {ECCC},
eprint = {TR08-045},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ReingoldTTV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/TrevisanTV08,
author = {Luca Trevisan and
Madhur Tulsiani and
Salil P. Vadhan},
title = {Regularity, Boosting, and Efficiently Simulating Every High-Entropy
Distribution},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR08-103}},
year = {2008},
url = {https://eccc.weizmann.ac.il/eccc-reports/2008/TR08-103/index.html},
eprinttype = {ECCC},
eprint = {TR08-103},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/TrevisanTV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/TrevisanV07,
author = {Luca Trevisan and
Salil P. Vadhan},
title = {Pseudorandomness and Average-Case Complexity Via Uniform Reductions},
journal = {Comput. Complex.},
volume = {16},
number = {4},
pages = {331--364},
year = {2007},
url = {https://doi.org/10.1007/s00037-007-0233-x},
doi = {10.1007/S00037-007-0233-X},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/TrevisanV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/SchoenebeckTT07,
author = {Grant Schoenebeck and
Luca Trevisan and
Madhur Tulsiani},
title = {A Linear Round Lower Bound for Lovasz-Schrijver {SDP} Relaxations
of Vertex Cover},
booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
13-16 June 2007, San Diego, California, {USA}},
pages = {205--216},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/CCC.2007.2},
doi = {10.1109/CCC.2007.2},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/SchoenebeckTT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/CanettiRSTVW07,
author = {Ran Canetti and
Ronald L. Rivest and
Madhu Sudan and
Luca Trevisan and
Salil P. Vadhan and
Hoeteck Wee},
editor = {Alfred Menezes},
title = {Amplifying Collision Resistance: {A} Complexity-Theoretic Treatment},
booktitle = {Advances in Cryptology - {CRYPTO} 2007, 27th Annual International
Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2007,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4622},
pages = {264--283},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74143-5\_15},
doi = {10.1007/978-3-540-74143-5\_15},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/crypto/CanettiRSTVW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/Trevisan07,
author = {Luca Trevisan},
editor = {Pierluigi Crescenzi and
Giuseppe Prencipe and
Geppino Pucci},
title = {Fun with Sub-linear Time Algorithms},
booktitle = {Fun with Algorithms, 4th International Conference, {FUN} 2007, Castiglioncello,
Italy, June 3-5, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4475},
pages = {15},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-72914-3\_3},
doi = {10.1007/978-3-540-72914-3\_3},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/fun/Trevisan07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/SchoenebeckTT07,
author = {Grant Schoenebeck and
Luca Trevisan and
Madhur Tulsiani},
editor = {David S. Johnson and
Uriel Feige},
title = {Tight integrality gaps for Lovasz-Schrijver {LP} relaxations of vertex
cover and max cut},
booktitle = {Proceedings of the 39th Annual {ACM} Symposium on Theory of Computing,
San Diego, California, USA, June 11-13, 2007},
pages = {302--310},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1250790.1250836},
doi = {10.1145/1250790.1250836},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/SchoenebeckTT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GoldreichKST06,
author = {Oded Goldreich and
Howard J. Karloff and
Leonard J. Schulman and
Luca Trevisan},
title = {Lower bounds for linear locally decodable codes and private information
retrieval},
journal = {Comput. Complex.},
volume = {15},
number = {3},
pages = {263--296},
year = {2006},
url = {https://doi.org/10.1007/s00037-006-0216-3},
doi = {10.1007/S00037-006-0216-3},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GoldreichKST06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fttcs/BogdanovT06,
author = {Andrej Bogdanov and
Luca Trevisan},
title = {Average-Case Complexity},
journal = {Found. Trends Theor. Comput. Sci.},
volume = {2},
number = {1},
year = {2006},
url = {https://doi.org/10.1561/0400000004},
doi = {10.1561/0400000004},
timestamp = {Thu, 20 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fttcs/BogdanovT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MosselST06,
author = {Elchanan Mossel and
Amir Shpilka and
Luca Trevisan},
title = {On epsilon-biased generators in NC\({}^{\mbox{0}}\)},
journal = {Random Struct. Algorithms},
volume = {29},
number = {1},
pages = {56--81},
year = {2006},
url = {https://doi.org/10.1002/rsa.20112},
doi = {10.1002/RSA.20112},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/MosselST06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BogdanovT06,
author = {Andrej Bogdanov and
Luca Trevisan},
title = {On Worst-Case to Average-Case Reductions for {NP} Problems},
journal = {{SIAM} J. Comput.},
volume = {36},
number = {4},
pages = {1119--1159},
year = {2006},
url = {https://doi.org/10.1137/S0097539705446974},
doi = {10.1137/S0097539705446974},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BogdanovT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/SamorodnitskyT06,
author = {Alex Samorodnitsky and
Luca Trevisan},
editor = {Jon M. Kleinberg},
title = {Gowers uniformity, influence of variables, and PCPs},
booktitle = {Proceedings of the 38th Annual {ACM} Symposium on Theory of Computing,
Seattle, WA, USA, May 21-23, 2006},
pages = {11--20},
publisher = {{ACM}},
year = {2006},
url = {https://doi.org/10.1145/1132516.1132519},
doi = {10.1145/1132516.1132519},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/SamorodnitskyT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ReingoldTV06,
author = {Omer Reingold and
Luca Trevisan and
Salil P. Vadhan},
editor = {Jon M. Kleinberg},
title = {Pseudorandom walks on regular digraphs and the {RL} vs. {L} problem},
booktitle = {Proceedings of the 38th Annual {ACM} Symposium on Theory of Computing,
Seattle, WA, USA, May 21-23, 2006},
pages = {457--466},
publisher = {{ACM}},
year = {2006},
url = {https://doi.org/10.1145/1132516.1132583},
doi = {10.1145/1132516.1132583},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ReingoldTV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0601100,
author = {Luca Trevisan},
title = {Pseudorandomness and Combinatorial Constructions},
journal = {CoRR},
volume = {abs/cs/0601100},
year = {2006},
url = {http://arxiv.org/abs/cs/0601100},
eprinttype = {arXiv},
eprint = {cs/0601100},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0601100.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0606037,
author = {Andrej Bogdanov and
Luca Trevisan},
title = {Average-Case Complexity},
journal = {CoRR},
volume = {abs/cs/0606037},
year = {2006},
url = {http://arxiv.org/abs/cs/0606037},
eprinttype = {arXiv},
eprint = {cs/0606037},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0606037.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BogdanovT06,
author = {Andrej Bogdanov and
Luca Trevisan},
title = {Average-Case Complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-073}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-073/index.html},
eprinttype = {ECCC},
eprint = {TR06-073},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BogdanovT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR06-013,
author = {Luca Trevisan},
title = {Pseudorandomness and Combinatorial Constructions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-013}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-013/index.html},
eprinttype = {ECCC},
eprint = {TR06-013},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR06-013.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/SchoenebeckTT06,
author = {Grant Schoenebeck and
Luca Trevisan and
Madhur Tulsiani},
title = {A Linear Round Lower Bound for Lovasz-Schrijver {SDP} Relaxations
of Vertex Cover},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-098}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-098/index.html},
eprinttype = {ECCC},
eprint = {TR06-098},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/SchoenebeckTT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/SchoenebeckTT06a,
author = {Grant Schoenebeck and
Luca Trevisan and
Madhur Tulsiani},
title = {Tight Integrality Gaps for Lovasz-Schrijver {LP} Relaxations of Vertex
Cover and Max Cut},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-132}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-132/index.html},
eprinttype = {ECCC},
eprint = {TR06-132},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/SchoenebeckTT06a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/TrevisanVZ05,
author = {Luca Trevisan and
Salil P. Vadhan and
David Zuckerman},
title = {Compression of Samplable Sources},
journal = {Comput. Complex.},
volume = {14},
number = {3},
pages = {186--227},
year = {2005},
url = {https://doi.org/10.1007/s00037-005-0198-6},
doi = {10.1007/S00037-005-0198-6},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/TrevisanVZ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/logcom/SchallhartT05,
author = {Christian Schallhart and
Luca Trevisan},
title = {Approximating Succinct MaxSat},
journal = {J. Log. Comput.},
volume = {15},
number = {4},
pages = {551--557},
year = {2005},
url = {https://doi.org/10.1093/logcom/exi033},
doi = {10.1093/LOGCOM/EXI033},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/logcom/SchallhartT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChazelleRT05,
author = {Bernard Chazelle and
Ronitt Rubinfeld and
Luca Trevisan},
title = {Approximating the Minimum Spanning Tree Weight in Sublinear Time},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {6},
pages = {1370--1379},
year = {2005},
url = {https://doi.org/10.1137/S0097539702403244},
doi = {10.1137/S0097539702403244},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/ChazelleRT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GennaroGKT05,
author = {Rosario Gennaro and
Yael Gertner and
Jonathan Katz and
Luca Trevisan},
title = {Bounds on the Efficiency of Generic Cryptographic Constructions},
journal = {{SIAM} J. Comput.},
volume = {35},
number = {1},
pages = {217--246},
year = {2005},
url = {https://doi.org/10.1137/S0097539704443276},
doi = {10.1137/S0097539704443276},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/GennaroGKT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SernaTX05,
author = {Maria J. Serna and
Luca Trevisan and
Fatos Xhafa},
title = {The approximability of non-Boolean satisfiability problems and restricted
integer programming},
journal = {Theor. Comput. Sci.},
volume = {332},
number = {1-3},
pages = {123--139},
year = {2005},
url = {https://doi.org/10.1016/j.tcs.2004.10.014},
doi = {10.1016/J.TCS.2004.10.014},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/SernaTX05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiT05,
author = {Venkatesan Guruswami and
Luca Trevisan},
editor = {Chandra Chekuri and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Luca Trevisan},
title = {The Complexity of Making Unique Choices: Approximating 1-in- k {SAT}},
booktitle = {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},
series = {Lecture Notes in Computer Science},
volume = {3624},
pages = {99--110},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11538462\_9},
doi = {10.1007/11538462\_9},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/GuruswamiT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Trevisan05,
author = {Luca Trevisan},
title = {Approximation Algorithms for Unique Games},
booktitle = {46th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings},
pages = {197--205},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/SFCS.2005.22},
doi = {10.1109/SFCS.2005.22},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Trevisan05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Trevisan05,
author = {Luca Trevisan},
editor = {Harold N. Gabow and
Ronald Fagin},
title = {On uniform amplification of hardness in {NP}},
booktitle = {Proceedings of the 37th Annual {ACM} Symposium on Theory of Computing,
Baltimore, MD, USA, May 22-24, 2005},
pages = {31--38},
publisher = {{ACM}},
year = {2005},
url = {https://doi.org/10.1145/1060590.1060595},
doi = {10.1145/1060590.1060595},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Trevisan05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FortnowST05,
author = {Lance Fortnow and
Rahul Santhanam and
Luca Trevisan},
editor = {Harold N. Gabow and
Ronald Fagin},
title = {Hierarchies for semantic classes},
booktitle = {Proceedings of the 37th Annual {ACM} Symposium on Theory of Computing,
Baltimore, MD, USA, May 22-24, 2005},
pages = {348--355},
publisher = {{ACM}},
year = {2005},
url = {https://doi.org/10.1145/1060590.1060642},
doi = {10.1145/1060590.1060642},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FortnowST05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/LinTW05,
author = {Henry C. Lin and
Luca Trevisan and
Hoeteck Wee},
editor = {Joe Kilian},
title = {On Hardness Amplification of One-Way Functions},
booktitle = {Theory of Cryptography, Second Theory of Cryptography Conference,
{TCC} 2005, Cambridge, MA, USA, February 10-12, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3378},
pages = {34--49},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/978-3-540-30576-7\_3},
doi = {10.1007/978-3-540-30576-7\_3},
timestamp = {Sun, 02 Jun 2019 21:21:22 +0200},
biburl = {https://dblp.org/rec/conf/tcc/LinTW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2005,
editor = {Chandra Chekuri and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Luca Trevisan},
title = {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},
series = {Lecture Notes in Computer Science},
volume = {3624},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11538462},
doi = {10.1007/11538462},
isbn = {3-540-28239-4},
timestamp = {Tue, 21 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/2005.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-math-0510264,
author = {Alex Samorodnitsky and
Luca Trevisan},
title = {Gowers Uniformity, Influence of Variables, and PCPs},
journal = {CoRR},
volume = {abs/math/0510264},
year = {2005},
url = {http://arxiv.org/abs/math/0510264},
eprinttype = {arXiv},
eprint = {math/0510264},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-math-0510264.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-012,
author = {Luca Trevisan and
Salil P. Vadhan and
David Zuckerman},
title = {Compression of Samplable Sources},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-012}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-012/index.html},
eprinttype = {ECCC},
eprint = {TR05-012},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-012.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-015,
author = {Andrej Bogdanov and
Luca Trevisan},
title = {On Worst-Case to Average-Case Reductions for {NP} Problems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-015}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-015/index.html},
eprinttype = {ECCC},
eprint = {TR05-015},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-022,
author = {Omer Reingold and
Luca Trevisan and
Salil P. Vadhan},
title = {Pseudorandom Walks in Biregular Graphs and the {RL} vs. {L} Problem},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-022}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-022/index.html},
eprinttype = {ECCC},
eprint = {TR05-022},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-034,
author = {Luca Trevisan},
title = {Approximation Algorithms for Unique Games},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-034}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-034/index.html},
eprinttype = {ECCC},
eprint = {TR05-034},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-034.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-116,
author = {Alex Samorodnitsky and
Luca Trevisan},
title = {Gowers Uniformity, Influence of Variables, and PCPs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-116}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-116/index.html},
eprinttype = {ECCC},
eprint = {TR05-116},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-116.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Trevisan04,
author = {Luca Trevisan},
title = {On Local Versus Global Satisfiability},
journal = {{SIAM} J. Discret. Math.},
volume = {17},
number = {4},
pages = {541--547},
year = {2004},
url = {https://doi.org/10.1137/S0895480197326528},
doi = {10.1137/S0895480197326528},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Trevisan04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Trevisan04,
author = {Luca Trevisan},
editor = {Klaus Jansen and
Sanjeev Khanna and
Jos{\'{e}} D. P. Rolim and
Dana Ron},
title = {A Note on Approximate Counting for k-DNF},
booktitle = {Approximation, Randomization, and Combinatorial Optimization, Algorithms
and Techniques, 7th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, {APPROX} 2004, and 8th International
Workshop on Randomization and Computation, {RANDOM} 2004, Cambridge,
MA, USA, August 22-24, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3122},
pages = {417--426},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27821-4\_37},
doi = {10.1007/978-3-540-27821-4\_37},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/Trevisan04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/TrevisanVZ04,
author = {Luca Trevisan and
Salil P. Vadhan and
David Zuckerman},
title = {Compression of Samplable Sources},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {1--14},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313766},
doi = {10.1109/CCC.2004.1313766},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/TrevisanVZ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BogdanovT04,
author = {Andrej Bogdanov and
Luca Trevisan},
title = {Lower Bounds for Testing Bipartiteness in Dense Graphs},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {75--81},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313803},
doi = {10.1109/CCC.2004.1313803},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BogdanovT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/ReingoldTV04,
author = {Omer Reingold and
Luca Trevisan and
Salil P. Vadhan},
editor = {Moni Naor},
title = {Notions of Reducibility between Cryptographic Primitives},
booktitle = {Theory of Cryptography, First Theory of Cryptography Conference, {TCC}
2004, Cambridge, MA, USA, February 19-21, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2951},
pages = {1--20},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24638-1\_1},
doi = {10.1007/978-3-540-24638-1\_1},
timestamp = {Tue, 14 May 2019 10:00:47 +0200},
biburl = {https://dblp.org/rec/conf/tcc/ReingoldTV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/DworkSST04,
author = {Cynthia Dwork and
Ronen Shaltiel and
Adam D. Smith and
Luca Trevisan},
editor = {Moni Naor},
title = {List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge
Argument},
booktitle = {Theory of Cryptography, First Theory of Cryptography Conference, {TCC}
2004, Cambridge, MA, USA, February 19-21, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2951},
pages = {101--120},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24638-1\_6},
doi = {10.1007/978-3-540-24638-1\_6},
timestamp = {Tue, 20 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tcc/DworkSST04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/ams/04/Trevisan04,
author = {Luca Trevisan},
editor = {Steven Rudich and
Avi Wigderson},
title = {Pseudorandomness - Part {II}},
booktitle = {Computational Complexity Theory},
series = {{IAS} / Park City mathematics series},
volume = {10},
pages = {287--314},
publisher = {{AMS} Chelsea Publishing},
year = {2004},
url = {https://doi.org/10.1090/pcms/010/10},
doi = {10.1090/PCMS/010/10},
timestamp = {Fri, 19 Jul 2019 09:16:49 +0200},
biburl = {https://dblp.org/rec/books/ams/04/Trevisan04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-0409043,
author = {Luca Trevisan},
title = {Inapproximability of Combinatorial Optimization Problems},
journal = {CoRR},
volume = {cs.CC/0409043},
year = {2004},
url = {http://arxiv.org/abs/cs.CC/0409043},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-0409043.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-0409044,
author = {Luca Trevisan},
title = {Some Applications of Coding Theory in Computational Complexity},
journal = {CoRR},
volume = {cs.CC/0409044},
year = {2004},
url = {http://arxiv.org/abs/cs.CC/0409044},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-0409044.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-043,
author = {Luca Trevisan},
title = {Some Applications of Coding Theory in Computational Complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR04-043}},
year = {2004},
url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-043/index.html},
eprinttype = {ECCC},
eprint = {TR04-043},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-043.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-065,
author = {Luca Trevisan},
title = {Inapproximability of Combinatorial Optimization Problems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR04-065}},
year = {2004},
url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-065/index.html},
eprinttype = {ECCC},
eprint = {TR04-065},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-065.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-093,
author = {Oded Goldreich and
Madhu Sudan and
Luca Trevisan},
title = {From logarithmic advice to single-bit advice},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR04-093}},
year = {2004},
url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-093/index.html},
eprinttype = {ECCC},
eprint = {TR04-093},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-093.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-098,
author = {Lance Fortnow and
Rahul Santhanam and
Luca Trevisan},
title = {Promise Hierarchies},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR04-098}},
year = {2004},
url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-098/index.html},
eprinttype = {ECCC},
eprint = {TR04-098},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-098.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GoldreichT03,
author = {Oded Goldreich and
Luca Trevisan},
title = {Three theorems regarding testing graph properties},
journal = {Random Struct. Algorithms},
volume = {23},
number = {1},
pages = {23--57},
year = {2003},
url = {https://doi.org/10.1002/rsa.10078},
doi = {10.1002/RSA.10078},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GoldreichT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Trevisan03,
author = {Luca Trevisan},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Error-Correcting Codes in Complexity Theory},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {4},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_4},
doi = {10.1007/3-540-44849-7\_4},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Trevisan03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Trevisa03,
author = {Luca Trevisan},
title = {List-Decoding Using The {XOR} Lemma},
booktitle = {44th Symposium on Foundations of Computer Science {(FOCS} 2003), 11-14
October 2003, Cambridge, MA, USA, Proceedings},
pages = {126--135},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/SFCS.2003.1238187},
doi = {10.1109/SFCS.2003.1238187},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Trevisa03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MosselST03,
author = {Elchanan Mossel and
Amir Shpilka and
Luca Trevisan},
title = {On e-Biased Generators in {NC0}},
booktitle = {44th Symposium on Foundations of Computer Science {(FOCS} 2003), 11-14
October 2003, Cambridge, MA, USA, Proceedings},
pages = {136--145},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/SFCS.2003.1238188},
doi = {10.1109/SFCS.2003.1238188},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/MosselST03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BogdanovT03,
author = {Andrej Bogdanov and
Luca Trevisan},
title = {On Worst-Case to Average-Case Reductions for {NP} Problems},
booktitle = {44th Symposium on Foundations of Computer Science {(FOCS} 2003), 11-14
October 2003, Cambridge, MA, USA, Proceedings},
pages = {308--317},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/SFCS.2003.1238205},
doi = {10.1109/SFCS.2003.1238205},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BogdanovT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR03-013,
author = {Luca Trevisan},
title = {An epsilon-Biased Generator in {NC0}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR03-013}},
year = {2003},
url = {https://eccc.weizmann.ac.il/eccc-reports/2003/TR03-013/index.html},
eprinttype = {ECCC},
eprint = {TR03-013},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR03-013.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR03-042,
author = {Luca Trevisan},
title = {List Decoding Using the {XOR} Lemma},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR03-042}},
year = {2003},
url = {https://eccc.weizmann.ac.il/eccc-reports/2003/TR03-042/index.html},
eprinttype = {ECCC},
eprint = {TR03-042},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR03-042.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR03-043,
author = {Elchanan Mossel and
Amir Shpilka and
Luca Trevisan},
title = {On epsilon-Biased Generators in {NC0}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR03-043}},
year = {2003},
url = {https://eccc.weizmann.ac.il/eccc-reports/2003/TR03-043/index.html},
eprinttype = {ECCC},
eprint = {TR03-043},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR03-043.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/TrevisanV02,
author = {Luca Trevisan and
Salil P. Vadhan},
title = {Pseudorandomness and Average-Case Complexity via Uniform Reductions},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {129--138},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004348},
doi = {10.1109/CCC.2002.1004348},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/TrevisanV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Bar-YossefTRS02,
author = {Ziv Bar{-}Yossef and
Luca Trevisan and
Omer Reingold and
Ronen Shaltiel},
title = {Streaming Computation of Combinatorial Objects},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {165--174},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004352},
doi = {10.1109/CCC.2002.1004352},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Bar-YossefTRS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GoldreichKST02,
author = {Oded Goldreich and
Howard J. Karloff and
Leonard J. Schulman and
Luca Trevisan},
title = {Lower Bounds for Linear Locally Decodable Codes and Private Information
Retrieval},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {175--183},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004353},
doi = {10.1109/CCC.2002.1004353},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GoldreichKST02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BogdanovOT02,
author = {Andrej Bogdanov and
Kenji Obata and
Luca Trevisan},
title = {A Lower Bound for Testing 3-Colorability in Bounded-Degree Graphs},
booktitle = {43rd Symposium on Foundations of Computer Science {(FOCS} 2002), 16-19
November 2002, Vancouver, BC, Canada, Proceedings},
pages = {93--102},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/SFCS.2002.1181886},
doi = {10.1109/SFCS.2002.1181886},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BogdanovOT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/random/Bar-YossefJKST02,
author = {Ziv Bar{-}Yossef and
T. S. Jayram and
Ravi Kumar and
D. Sivakumar and
Luca Trevisan},
editor = {Jos{\'{e}} D. P. Rolim and
Salil P. Vadhan},
title = {Counting Distinct Elements in a Data Stream},
booktitle = {Randomization and Approximation Techniques, 6th International Workshop,
{RANDOM} 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2483},
pages = {1--10},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45726-7\_1},
doi = {10.1007/3-540-45726-7\_1},
timestamp = {Mon, 08 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/random/Bar-YossefJKST02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-064,
author = {Andrej Bogdanov and
Luca Trevisan},
title = {Lower Bounds for Testing Bipartiteness in Dense Graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-064}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-064/index.html},
eprinttype = {ECCC},
eprint = {TR02-064},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-064.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-069,
author = {Luca Trevisan},
title = {A Note on Deterministic Approximate Counting for k-DNF},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-069}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-069/index.html},
eprinttype = {ECCC},
eprint = {TR02-069},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-069.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DiazPST01,
author = {Josep D{\'{\i}}az and
Jordi Petit and
Maria J. Serna and
Luca Trevisan},
title = {Approximating layout problems on random graphs},
journal = {Discret. Math.},
volume = {235},
number = {1-3},
pages = {245--253},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00278-8},
doi = {10.1016/S0012-365X(00)00278-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DiazPST01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/CrescenziST01,
author = {Pierluigi Crescenzi and
Riccardo Silvestri and
Luca Trevisan},
title = {On Weighted vs Unweighted Versions of Combinatorial Optimization Problems},
journal = {Inf. Comput.},
volume = {167},
number = {1},
pages = {10--26},
year = {2001},
url = {https://doi.org/10.1006/inco.2000.3011},
doi = {10.1006/INCO.2000.3011},
timestamp = {Sun, 12 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/CrescenziST01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Trevisan01,
author = {Luca Trevisan},
title = {Extractors and pseudorandom generators},
journal = {J. {ACM}},
volume = {48},
number = {4},
pages = {860--879},
year = {2001},
url = {https://doi.org/10.1145/502090.502099},
doi = {10.1145/502090.502099},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Trevisan01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/SudanTV01,
author = {Madhu Sudan and
Luca Trevisan and
Salil P. Vadhan},
title = {Pseudorandom Generators without the {XOR} Lemma},
journal = {J. Comput. Syst. Sci.},
volume = {62},
number = {2},
pages = {236--266},
year = {2001},
url = {https://doi.org/10.1006/jcss.2000.1730},
doi = {10.1006/JCSS.2000.1730},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/SudanTV01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GoldreichT01,
author = {Oded Goldreich and
Luca Trevisan},
title = {Three Theorems Regarding Testing Graph Properties},
booktitle = {42nd Annual Symposium on Foundations of Computer Science, {FOCS} 2001,
14-17 October 2001, Las Vegas, Nevada, {USA}},
pages = {460--469},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/SFCS.2001.959922},
doi = {10.1109/SFCS.2001.959922},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GoldreichT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChazelleRT01,
author = {Bernard Chazelle and
Ronitt Rubinfeld and
Luca Trevisan},
editor = {Fernando Orejas and
Paul G. Spirakis and
Jan van Leeuwen},
title = {Approximating the Minimum Spanning Tree Weight in Sublinear Time},
booktitle = {Automata, Languages and Programming, 28th International Colloquium,
{ICALP} 2001, Crete, Greece, July 8-12, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2076},
pages = {190--200},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-48224-5\_16},
doi = {10.1007/3-540-48224-5\_16},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ChazelleRT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/random/Trevisan01,
author = {Luca Trevisan},
editor = {Michel X. Goemans and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Luca Trevisan},
title = {Error-Correcting Codes and Pseudorandom Projections},
booktitle = {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},
series = {Lecture Notes in Computer Science},
volume = {2129},
pages = {7--9},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44666-4\_4},
doi = {10.1007/3-540-44666-4\_4},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/random/Trevisan01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Trevisan01,
author = {Luca Trevisan},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Non-approximability results for optimization problems on bounded degree
instances},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {453--461},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380839},
doi = {10.1145/380752.380839},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Trevisan01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/random/2001,
editor = {Michel X. Goemans and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Luca Trevisan},
title = {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},
series = {Lecture Notes in Computer Science},
volume = {2129},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44666-4},
doi = {10.1007/3-540-44666-4},
isbn = {3-540-42470-9},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/random/2001.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR01-010,
author = {Oded Goldreich and
Luca Trevisan},
title = {Three Theorems regarding Testing Graph Properties},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR01-010}},
year = {2001},
url = {https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-010/index.html},
eprinttype = {ECCC},
eprint = {TR01-010},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR01-010.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR01-080,
author = {Oded Goldreich and
Howard J. Karloff and
Leonard J. Schulman and
Luca Trevisan},
title = {Lower Bounds for Linear Locally Decodable Codes and Private Information
Retrieval},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR01-080}},
year = {2001},
url = {https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-080/index.html},
eprinttype = {ECCC},
eprint = {TR01-080},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR01-080.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Trevisan00,
author = {Luca Trevisan},
title = {Erratum: {A} Correction to "Parallel Approximation Algorithms
by Positive Linear Programming"},
journal = {Algorithmica},
volume = {27},
number = {2},
pages = {115--119},
year = {2000},
url = {https://doi.org/10.1007/s004530010007},
doi = {10.1007/S004530010007},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Trevisan00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Trevisan00a,
author = {Luca Trevisan},
title = {Approximating Satisfiable Satisfiability Problems},
journal = {Algorithmica},
volume = {28},
number = {1},
pages = {145--172},
year = {2000},
url = {https://doi.org/10.1007/s004530010035},
doi = {10.1007/S004530010035},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Trevisan00a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/Trevisan00,
author = {Luca Trevisan},
title = {Interactive and probabilistic proof-checking},
journal = {Ann. Pure Appl. Log.},
volume = {104},
number = {1-3},
pages = {325--342},
year = {2000},
url = {https://doi.org/10.1016/S0168-0072(00)00017-8},
doi = {10.1016/S0168-0072(00)00017-8},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/Trevisan00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/CrescenziT00,
author = {Pierluigi Crescenzi and
Luca Trevisan},
title = {On Approximation Scheme Preserving Reducibility and Its Applications},
journal = {Theory Comput. Syst.},
volume = {33},
number = {1},
pages = {1--16},
year = {2000},
url = {https://doi.org/10.1007/s002249910001},
doi = {10.1007/S002249910001},
timestamp = {Sun, 12 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/CrescenziT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/TrevisanSSW00,
author = {Luca Trevisan and
Gregory B. Sorkin and
Madhu Sudan and
David P. Williamson},
title = {Gadgets, Approximation, and Linear Programming},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {6},
pages = {2074--2097},
year = {2000},
url = {https://doi.org/10.1137/S0097539797328847},
doi = {10.1137/S0097539797328847},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/TrevisanSSW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Trevisan00,
author = {Luca Trevisan},
title = {When Hamming Meets Euclid: The Approximability of Geometric {TSP}
and Steiner Tree},
journal = {{SIAM} J. Comput.},
volume = {30},
number = {2},
pages = {475--485},
year = {2000},
url = {https://doi.org/10.1137/S0097539799352735},
doi = {10.1137/S0097539799352735},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Trevisan00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KhannaSTW00,
author = {Sanjeev Khanna and
Madhu Sudan and
Luca Trevisan and
David P. Williamson},
title = {The Approximability of Constraint Satisfaction Problems},
journal = {{SIAM} J. Comput.},
volume = {30},
number = {6},
pages = {1863--1920},
year = {2000},
url = {https://doi.org/10.1137/S0097539799349948},
doi = {10.1137/S0097539799349948},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KhannaSTW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BorealeT00,
author = {Michele Boreale and
Luca Trevisan},
title = {A complexity analysis of bisimilarity for value-passing processes},
journal = {Theor. Comput. Sci.},
volume = {238},
number = {1-2},
pages = {313--345},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00177-7},
doi = {10.1016/S0304-3975(98)00177-7},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BorealeT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Trevisan00,
author = {Luca Trevisan},
title = {A Survey of Optimal {PCP} Characterizations of {NP}},
booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational
Complexity, Florence, Italy, July 4-7, 2000},
pages = {146},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/CCC.2000.856745},
doi = {10.1109/CCC.2000.856745},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Trevisan00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/TrevisanV00,
author = {Luca Trevisan and
Salil P. Vadhan},
title = {Extracting Randomness from Samplable Distributions},
booktitle = {41st Annual Symposium on Foundations of Computer Science, {FOCS} 2000,
12-14 November 2000, Redondo Beach, California, {USA}},
pages = {32--42},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/SFCS.2000.892063},
doi = {10.1109/SFCS.2000.892063},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/TrevisanV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GennaroT00,
author = {Rosario Gennaro and
Luca Trevisan},
title = {Lower Bounds on the Efficiency of Generic Cryptographic Constructions},
booktitle = {41st Annual Symposium on Foundations of Computer Science, {FOCS} 2000,
12-14 November 2000, Redondo Beach, California, {USA}},
pages = {305--313},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/SFCS.2000.892119},
doi = {10.1109/SFCS.2000.892119},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GennaroT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KatzT00,
author = {Jonathan Katz and
Luca Trevisan},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {On the efficiency of local decoding procedures for error-correcting
codes},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {80--86},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335315},
doi = {10.1145/335305.335315},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KatzT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/SamorodnitskyT00,
author = {Alex Samorodnitsky and
Luca Trevisan},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {A {PCP} characterization of {NP} with optimal amortized query complexity},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {191--199},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335329},
doi = {10.1145/335305.335329},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/SamorodnitskyT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR00-022,
author = {Rosario Gennaro and
Luca Trevisan},
title = {Lower Bounds on the Efficiency of Generic Cryptographic Constructions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR00-022}},
year = {2000},
url = {https://eccc.weizmann.ac.il/eccc-reports/2000/TR00-022/index.html},
eprinttype = {ECCC},
eprint = {TR00-022},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR00-022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/GennaroT00,
author = {Rosario Gennaro and
Luca Trevisan},
title = {Lower Bounds on the Efficiency of Generic Cryptographic Constructions},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {17},
year = {2000},
url = {http://eprint.iacr.org/2000/017},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/GennaroT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CrescenziKST99,
author = {Pierluigi Crescenzi and
Viggo Kann and
Riccardo Silvestri and
Luca Trevisan},
title = {Structure in Approximation Classes},
journal = {{SIAM} J. Comput.},
volume = {28},
number = {5},
pages = {1759--1782},
year = {1999},
url = {https://doi.org/10.1137/S0097539796304220},
doi = {10.1137/S0097539796304220},
timestamp = {Sun, 12 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/CrescenziKST99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AndreevCRT99,
author = {Alexander E. Andreev and
Andrea E. F. Clementi and
Jos{\'{e}} D. P. Rolim and
Luca Trevisan},
title = {Weak Random Sources, Hitting Sets, and {BPP} Simulations},
journal = {{SIAM} J. Comput.},
volume = {28},
number = {6},
pages = {2103--2116},
year = {1999},
url = {https://doi.org/10.1137/S0097539797325636},
doi = {10.1137/S0097539797325636},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/AndreevCRT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CrescenziT99,
author = {Pierluigi Crescenzi and
Luca Trevisan},
title = {Max NP-completeness Made Easy},
journal = {Theor. Comput. Sci.},
volume = {225},
number = {1-2},
pages = {65--79},
year = {1999},
url = {https://doi.org/10.1016/S0304-3975(98)00200-X},
doi = {10.1016/S0304-3975(98)00200-X},
timestamp = {Sun, 12 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CrescenziT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ClementiT99,
author = {Andrea E. F. Clementi and
Luca Trevisan},
title = {Improved Non-Approximability Results for Minimum Vertex Cover with
Density Constraints},
journal = {Theor. Comput. Sci.},
volume = {225},
number = {1-2},
pages = {113--128},
year = {1999},
url = {https://doi.org/10.1016/S0304-3975(97)00226-0},
doi = {10.1016/S0304-3975(97)00226-0},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ClementiT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/SudanTV99,
author = {Madhu Sudan and
Luca Trevisan and
Salil P. Vadhan},
title = {Pseudorandom Generators without the {XOR} Lemma (Abstract)},
booktitle = {Proceedings of the 14th Annual {IEEE} Conference on Computational
Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
pages = {4},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/CCC.1999.766253},
doi = {10.1109/CCC.1999.766253},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/SudanTV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Trevisan99,
author = {Luca Trevisan},
editor = {Jeffrey Scott Vitter and
Lawrence L. Larmore and
Frank Thomson Leighton},
title = {Construction of Extractors Using Pseudo-Random Generators (Extended
Abstract)},
booktitle = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
pages = {141--148},
publisher = {{ACM}},
year = {1999},
url = {https://doi.org/10.1145/301250.301289},
doi = {10.1145/301250.301289},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Trevisan99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/SudanTV99,
author = {Madhu Sudan and
Luca Trevisan and
Salil P. Vadhan},
editor = {Jeffrey Scott Vitter and
Lawrence L. Larmore and
Frank Thomson Leighton},
title = {Pseudorandom Generators Without the {XOR} Lemma (Extended Abstract)},
booktitle = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
pages = {537--546},
publisher = {{ACM}},
year = {1999},
url = {https://doi.org/10.1145/301250.301397},
doi = {10.1145/301250.301397},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/SudanTV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Trevisan98,
author = {Luca Trevisan},
title = {Parallel Approximation Algorithms by Positive Linear Programming},
journal = {Algorithmica},
volume = {21},
number = {1},
pages = {72--88},
year = {1998},
url = {https://doi.org/10.1007/PL00009209},
doi = {10.1007/PL00009209},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Trevisan98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/ClementiRT98,
author = {Andrea E. F. Clementi and
Jos{\'{e}} D. P. Rolim and
Luca Trevisan},
title = {Recent Advances Towards Proving {P} = {BPP}},
journal = {Bull. {EATCS}},
volume = {64},
year = {1998},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eatcs/ClementiRT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/RolimT98,
author = {Jos{\'{e}} D. P. Rolim and
Luca Trevisan},
title = {A Case Study of De-randomization Methods for Combinatorial Approximation
Algorithms},
journal = {J. Comb. Optim.},
volume = {2},
number = {3},
pages = {219--236},
year = {1998},
url = {https://doi.org/10.1023/A:1009793909670},
doi = {10.1023/A:1009793909670},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/RolimT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ppl/TrevisanX98,
author = {Luca Trevisan and
Fatos Xhafa},
title = {The Parallel Complexity of Positive Linear Programming},
journal = {Parallel Process. Lett.},
volume = {8},
number = {4},
pages = {527--533},
year = {1998},
url = {https://doi.org/10.1142/S0129626498000511},
doi = {10.1142/S0129626498000511},
timestamp = {Tue, 24 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ppl/TrevisanX98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GuruswamiLST98,
author = {Venkatesan Guruswami and
Daniel Lewin and
Madhu Sudan and
Luca Trevisan},
title = {A Tight Characterization of {NP} with 3 Query PCPs},
booktitle = {39th Annual Symposium on Foundations of Computer Science, {FOCS} '98,
November 8-11, 1998, Palo Alto, California, {USA}},
pages = {8--17},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/SFCS.1998.743424},
doi = {10.1109/SFCS.1998.743424},
timestamp = {Mon, 04 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/GuruswamiLST98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/SudanT98,
author = {Madhu Sudan and
Luca Trevisan},
title = {Probabilistically Checkable Proofs with Low Amortized Query Complexity},
booktitle = {39th Annual Symposium on Foundations of Computer Science, {FOCS} '98,
November 8-11, 1998, Palo Alto, California, {USA}},
pages = {18--27},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/SFCS.1998.743425},
doi = {10.1109/SFCS.1998.743425},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/SudanT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/SernaTX98,
author = {Maria J. Serna and
Luca Trevisan and
Fatos Xhafa},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {The (Parallel) Approximability of Non-Boolean Satisfiability Problems
and Restricted Integer Programming},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {488--498},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028584},
doi = {10.1007/BFB0028584},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/SernaTX98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Trevisan98,
author = {Luca Trevisan},
editor = {Jeffrey Scott Vitter},
title = {Recycling Queries in PCPs and in Linearity Tests (Extended Abstract)},
booktitle = {Proceedings of the Thirtieth Annual {ACM} Symposium on the Theory
of Computing, Dallas, Texas, USA, May 23-26, 1998},
pages = {299--308},
publisher = {{ACM}},
year = {1998},
url = {https://doi.org/10.1145/276698.276769},
doi = {10.1145/276698.276769},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Trevisan98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR98-007,
author = {Luca Trevisan},
title = {Recycling Queries in PCPs and in Linearity Tests},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR98-007}},
year = {1998},
url = {https://eccc.weizmann.ac.il/eccc-reports/1998/TR98-007/index.html},
eprinttype = {ECCC},
eprint = {TR98-007},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR98-007.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR98-034,
author = {Venkatesan Guruswami and
Daniel Lewin and
Madhu Sudan and
Luca Trevisan},
title = {A tight characterization of {NP} with 3 query PCPs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR98-034}},
year = {1998},
url = {https://eccc.weizmann.ac.il/eccc-reports/1998/TR98-034/index.html},
eprinttype = {ECCC},
eprint = {TR98-034},
timestamp = {Mon, 04 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR98-034.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR98-040,
author = {Madhu Sudan and
Luca Trevisan},
title = {Probabilistically checkable proofs with low amortized query complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR98-040}},
year = {1998},
url = {https://eccc.weizmann.ac.il/eccc-reports/1998/TR98-040/index.html},
eprinttype = {ECCC},
eprint = {TR98-040},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR98-040.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR98-055,
author = {Luca Trevisan},
title = {Constructions of Near-Optimal Extractors Using Pseudo-Random Generators},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR98-055}},
year = {1998},
url = {https://eccc.weizmann.ac.il/eccc-reports/1998/TR98-055/index.html},
eprinttype = {ECCC},
eprint = {TR98-055},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR98-055.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR98-074,
author = {Madhu Sudan and
Luca Trevisan and
Salil P. Vadhan},
title = {Pseudorandom generators without the {XOR} Lemma},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR98-074}},
year = {1998},
url = {https://eccc.weizmann.ac.il/eccc-reports/1998/TR98-074/index.html},
eprinttype = {ECCC},
eprint = {TR98-074},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR98-074.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CesatiT97,
author = {Marco Cesati and
Luca Trevisan},
title = {On the Efficiency of Polynomial Time Approximation Schemes},
journal = {Inf. Process. Lett.},
volume = {64},
number = {4},
pages = {165--171},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00164-6},
doi = {10.1016/S0020-0190(97)00164-6},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/CesatiT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KhannaST97,
author = {Sanjeev Khanna and
Madhu Sudan and
Luca Trevisan},
title = {Constraint Satisfaction: The Approximability of Minimization Problems},
booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity, Ulm, Germany, June 24-27, 1997},
pages = {282--296},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/CCC.1997.612323},
doi = {10.1109/CCC.1997.612323},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/KhannaST97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/RolimT97,
author = {Jos{\'{e}} D. P. Rolim and
Luca Trevisan},
editor = {Panos M. Pardalos and
Ding{-}Zhu Du},
title = {A case study of de-randomization methods for combinatorial approximation
algorithms},
booktitle = {Network Design: Connectivity and Facilities Location, Proceedings
of a {DIMACS} Workshop, Princetin, New Jersey, USA, April 28-30, 1997},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {40},
pages = {319--334},
publisher = {{DIMACS/AMS}},
year = {1997},
url = {https://doi.org/10.1090/dimacs/040/19},
doi = {10.1090/DIMACS/040/19},
timestamp = {Mon, 22 May 2023 16:07:35 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/RolimT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Trevisan97,
author = {Luca Trevisan},
editor = {Rainer E. Burkard and
Gerhard J. Woeginger},
title = {Approximating Satisfiable Satisfiability Problems (Extended Abstract)},
booktitle = {Algorithms - {ESA} '97, 5th Annual European Symposium, Graz, Austria,
September 15-17, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1284},
pages = {472--485},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63397-9\_36},
doi = {10.1007/3-540-63397-9\_36},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/Trevisan97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AndreevCRT97,
author = {Alexander E. Andreev and
Andrea E. F. Clementi and
Jos{\'{e}} D. P. Rolim and
Luca Trevisan},
title = {Weak Random Sources, Hitting Sets, and {BPP} Simulations},
booktitle = {38th Annual Symposium on Foundations of Computer Science, {FOCS} '97,
Miami Beach, Florida, USA, October 19-22, 1997},
pages = {264--272},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/SFCS.1997.646115},
doi = {10.1109/SFCS.1997.646115},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AndreevCRT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Trevisan97,
author = {Luca Trevisan},
editor = {Frank Thomson Leighton and
Peter W. Shor},
title = {When Hamming Meets Euclid: The Approximability of Geometric {TSP}
and {MST} (Extended Abstract)},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM} Symposium on the Theory
of Computing, El Paso, Texas, USA, May 4-6, 1997},
pages = {21--29},
publisher = {{ACM}},
year = {1997},
url = {https://doi.org/10.1145/258533.258541},
doi = {10.1145/258533.258541},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Trevisan97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR97-001,
author = {Marco Cesati and
Luca Trevisan},
title = {On the Efficiency of Polynomial Time Approximation Schemes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR97-001}},
year = {1997},
url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-001/index.html},
eprinttype = {ECCC},
eprint = {TR97-001},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-001.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR97-011,
author = {Alexander E. Andreev and
Andrea E. F. Clementi and
Jos{\'{e}} D. P. Rolim and
Luca Trevisan},
title = {Weak Random Sources, Hitting Sets, and {BPP} Simulations},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR97-011}},
year = {1997},
url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-011/index.html},
eprinttype = {ECCC},
eprint = {TR97-011},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-011.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR97-012,
author = {Luca Trevisan},
title = {On Local versus Global Satisfiability},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR97-012}},
year = {1997},
url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-012/index.html},
eprinttype = {ECCC},
eprint = {TR97-012},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-012.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR97-039,
author = {Pierluigi Crescenzi and
Luca Trevisan},
title = {{MAX} NP-Completeness Made Easy},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR97-039}},
year = {1997},
url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-039/index.html},
eprinttype = {ECCC},
eprint = {TR97-039},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-039.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Trevisan96,
author = {Luca Trevisan},
title = {A Note on Minimum-Area Upward Drawing of Complete and Fibonacci Trees},
journal = {Inf. Process. Lett.},
volume = {57},
number = {5},
pages = {231--236},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(96)81422-0},
doi = {10.1016/0020-0190(96)81422-0},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Trevisan96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/CrescenziT96,
author = {Pierluigi Crescenzi and
Luca Trevisan},
title = {On the Distributed Decision-Making Complexity of the Minimum Vertex
Cover Problem},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {30},
number = {5},
pages = {431--441},
year = {1996},
url = {https://doi.org/10.1051/ita/1996300504311},
doi = {10.1051/ITA/1996300504311},
timestamp = {Sun, 12 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ita/CrescenziT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/ClementiT96,
author = {Andrea E. F. Clementi and
Luca Trevisan},
editor = {Jin{-}yi Cai and
C. K. Wong},
title = {Improved Non-approximability Results for Vertex Cover with Density
Constraints},
booktitle = {Computing and Combinatorics, Second Annual International Conference,
{COCOON} '96, Hong Kong, June 17-19, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1090},
pages = {333--342},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61332-3\_167},
doi = {10.1007/3-540-61332-3\_167},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/ClementiT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Trevisan96,
author = {Luca Trevisan},
editor = {Josep D{\'{\i}}az and
Maria J. Serna},
title = {Positive Linear Programming, Parallel Approximation and PCP's},
booktitle = {Algorithms - {ESA} '96, Fourth Annual European Symposium, Barcelona,
Spain, September 25-27, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1136},
pages = {62--75},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61680-2\_47},
doi = {10.1007/3-540-61680-2\_47},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/Trevisan96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/TrevisanSSW96,
author = {Luca Trevisan and
Gregory B. Sorkin and
Madhu Sudan and
David P. Williamson},
title = {Gadgets, Approximation, and Linear Programming (extended abstract)},
booktitle = {37th Annual Symposium on Foundations of Computer Science, {FOCS} '96,
Burlington, Vermont, USA, 14-16 October, 1996},
pages = {617--626},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/SFCS.1996.548521},
doi = {10.1109/SFCS.1996.548521},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/TrevisanSSW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/istcs/CrescenziST96,
author = {Pierluigi Crescenzi and
Riccardo Silvestri and
Luca Trevisan},
title = {To Weight or Not to Weight: Where is the Question?},
booktitle = {Fourth Israel Symposium on Theory of Computing and Systems, {ISTCS}
1996, Jerusalem, Israel, June 10-12, 1996, Proceedings},
pages = {68--77},
publisher = {{IEEE} Computer Society},
year = {1996},
timestamp = {Tue, 31 May 2016 15:27:26 +0200},
biburl = {https://dblp.org/rec/conf/istcs/CrescenziST96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BorealeT96,
author = {Michele Boreale and
Luca Trevisan},
editor = {Wojciech Penczek and
Andrzej Szalas},
title = {Bisimilarity Problems Requiring Exponential Time},
booktitle = {Mathematical Foundations of Computer Science 1996, 21st International
Symposium, MFCS'96, Cracow, Poland, September 2-6, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1113},
pages = {230--241},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61550-4\_151},
doi = {10.1007/3-540-61550-4\_151},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BorealeT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR96-016,
author = {Andrea E. F. Clementi and
Luca Trevisan},
title = {Improved Non-approximability Results for Minimum Vertex Cover with
Density Constraints},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR96-016}},
year = {1996},
url = {https://eccc.weizmann.ac.il/eccc-reports/1996/TR96-016/index.html},
eprinttype = {ECCC},
eprint = {TR96-016},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR96-016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR96-046,
author = {Luca Trevisan},
title = {On the Approximability of the Multi-dimensional Euclidean {TSP}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR96-046}},
year = {1996},
url = {https://eccc.weizmann.ac.il/eccc-reports/1996/TR96-046/index.html},
eprinttype = {ECCC},
eprint = {TR96-046},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR96-046.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR96-064,
author = {Sanjeev Khanna and
Madhu Sudan and
Luca Trevisan},
title = {Constraint satisfaction: The approximability of minimization problems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR96-064}},
year = {1996},
url = {https://eccc.weizmann.ac.il/eccc-reports/1996/TR96-064/index.html},
eprinttype = {ECCC},
eprint = {TR96-064},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR96-064.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR96-066,
author = {Pierluigi Crescenzi and
Viggo Kann and
Riccardo Silvestri and
Luca Trevisan},
title = {Structure in Approximation Classes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR96-066}},
year = {1996},
url = {https://eccc.weizmann.ac.il/eccc-reports/1996/TR96-066/index.html},
eprinttype = {ECCC},
eprint = {TR96-066},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR96-066.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/CrescenziKST95,
author = {Pierluigi Crescenzi and
Viggo Kann and
Riccardo Silvestri and
Luca Trevisan},
editor = {Ding{-}Zhu Du and
Ming Li},
title = {Structure in Approximation Classes (Extended Abstract)},
booktitle = {Computing and Combinatorics, First Annual International Conference,
{COCOON} '95, Xi'an, China, August 24-26, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {959},
pages = {539--548},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/BFb0030875},
doi = {10.1007/BFB0030875},
timestamp = {Sun, 12 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoon/CrescenziKST95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BorealeT95,
author = {Michele Boreale and
Luca Trevisan},
editor = {P. S. Thiagarajan},
title = {On the Complexity of Bisimilarity for Value-Passing Processes (Extended
Abstract)},
booktitle = {Foundations of Software Technology and Theoretical Computer Science,
15th Conference, Bangalore, India, December 18-20, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1026},
pages = {294--308},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60692-0\_56},
doi = {10.1007/3-540-60692-0\_56},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/BorealeT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/CrescenziT94,
author = {Pierluigi Crescenzi and
Luca Trevisan},
editor = {P. S. Thiagarajan},
title = {On Approximation Scheme Preserving Reducability and Its Applications},
booktitle = {Foundations of Software Technology and Theoretical Computer Science,
14th Conference, Madras, India, December 15-17, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {880},
pages = {330--341},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58715-2\_135},
doi = {10.1007/3-540-58715-2\_135},
timestamp = {Sun, 12 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/CrescenziT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/CrescenziT94,
author = {Pierluigi Crescenzi and
Luca Trevisan},
editor = {Ernst W. Mayr and
Gunther Schmidt and
Gottfried Tinhofer},
title = {Minimum Vertex Cover, Distributed Decision-Making, and Communication
Complexity (Extended Abstract)},
booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop,
{WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {903},
pages = {130--139},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-59071-4\_43},
doi = {10.1007/3-540-59071-4\_43},
timestamp = {Sun, 12 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/CrescenziT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
last updated on 2024-09-09 01:17 CEST 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:
