Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Venkatesan Guruswami
@inproceedings{DBLP:conf/soda/AlrabiahGL24,
author = {Omar Alrabiah and
Venkatesan Guruswami and
Ray Li},
editor = {David P. Woodruff},
title = {{AG} codes have no list-decoding friends: Approaching the generalized
Singleton bound requires exponential alphabets},
booktitle = {Proceedings of the 2024 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2024, Alexandria, VA, USA, January 7-10, 2024},
pages = {1367--1378},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977912.55},
doi = {10.1137/1.9781611977912.55},
timestamp = {Thu, 04 Apr 2024 19:38:10 +0200},
biburl = {https://dblp.org/rec/conf/soda/AlrabiahGL24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/innovations/2024,
editor = {Venkatesan Guruswami},
title = {15th Innovations in Theoretical Computer Science Conference, {ITCS}
2024, January 30 to February 2, 2024, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {287},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://www.dagstuhl.de/dagpub/978-3-95977-309-6},
isbn = {978-3-95977-309-6},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/2024.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2403-09465,
author = {Vipul Arora and
Arnab Bhattacharyya and
Mathews Boban and
Venkatesan Guruswami and
Esty Kelman},
title = {Outlier Robust Multivariate Polynomial Regression},
journal = {CoRR},
volume = {abs/2403.09465},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.09465},
doi = {10.48550/ARXIV.2403.09465},
eprinttype = {arXiv},
eprint = {2403.09465},
timestamp = {Fri, 05 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-09465.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2403-19401,
author = {Venkatesan Guruswami and
Rishi Saket},
title = {Hardness of Learning Boolean Functions from Label Proportions},
journal = {CoRR},
volume = {abs/2403.19401},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.19401},
doi = {10.48550/ARXIV.2403.19401},
eprinttype = {arXiv},
eprint = {2403.19401},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-19401.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BhattiproluGGLT23,
author = {Vijay Bhattiprolu and
Mrinal Kanti Ghosh and
Venkatesan Guruswami and
Euiwoong Lee and
Madhur Tulsiani},
title = {Inapproximability of Matrix p {\(\rightarrow\)} q Norms},
journal = {{SIAM} J. Comput.},
volume = {52},
number = {1},
pages = {132--155},
year = {2023},
url = {https://doi.org/10.1137/18M1233418},
doi = {10.1137/18M1233418},
timestamp = {Wed, 29 Mar 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BhattiproluGGLT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ChengGHL23,
author = {Kuan Cheng and
Venkatesan Guruswami and
Bernhard Haeupler and
Xin Li},
title = {Efficient Linear and Affine Codes for Correcting Insertions/Deletions},
journal = {{SIAM} J. Discret. Math.},
volume = {37},
number = {2},
pages = {748--778},
year = {2023},
url = {https://doi.org/10.1137/21m142798x},
doi = {10.1137/21M142798X},
timestamp = {Fri, 18 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ChengGHL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/theoretics/BrakensiekGS23,
author = {Joshua Brakensiek and
Venkatesan Guruswami and
Sai Sandeep},
title = {Conditional Dichotomy of Boolean Ordered Promise CSPs},
journal = {TheoretiCS},
volume = {2},
year = {2023},
url = {https://doi.org/10.46298/theoretics.23.2},
doi = {10.46298/THEORETICS.23.2},
timestamp = {Fri, 24 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/theoretics/BrakensiekGS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GabrysGRW23,
author = {Ryan Gabrys and
Venkatesan Guruswami and
Jo{\~{a}}o Ribeiro and
Ke Wu},
title = {Beyond Single-Deletion Correcting Codes: Substitutions and Transpositions},
journal = {{IEEE} Trans. Inf. Theory},
volume = {69},
number = {1},
pages = {169--186},
year = {2023},
url = {https://doi.org/10.1109/TIT.2022.3202856},
doi = {10.1109/TIT.2022.3202856},
timestamp = {Sat, 18 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/GabrysGRW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GuruswamiHL23,
author = {Venkatesan Guruswami and
Xiaoyu He and
Ray Li},
title = {The Zero-Rate Threshold for Adversarial Bit-Deletions is Less Than
1/2},
journal = {{IEEE} Trans. Inf. Theory},
volume = {69},
number = {4},
pages = {2218--2239},
year = {2023},
url = {https://doi.org/10.1109/TIT.2022.3223023},
doi = {10.1109/TIT.2022.3223023},
timestamp = {Tue, 28 Mar 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tit/GuruswamiHL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiL23,
author = {Venkatesan Guruswami and
Shilun Li},
editor = {Nicole Megow and
Adam D. Smith},
title = {A Deterministic Construction of a Large Distance Code from the Wozencraft
Ensemble},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2023, September 11-13, 2023, Atlanta,
Georgia, {USA}},
series = {LIPIcs},
volume = {275},
pages = {50:1--50:10},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.50},
doi = {10.4230/LIPICS.APPROX/RANDOM.2023.50},
timestamp = {Sat, 09 Sep 2023 00:04:38 +0200},
biburl = {https://dblp.org/rec/conf/approx/GuruswamiL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GuruswamiHKM23,
author = {Venkatesan Guruswami and
Jun{-}Ting Hsieh and
Pravesh K. Kothari and
Peter Manohar},
title = {Efficient Algorithms for Semirandom Planted CSPs at the Refutation
Threshold},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {307--327},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00026},
doi = {10.1109/FOCS57990.2023.00026},
timestamp = {Tue, 02 Jan 2024 14:56:14 +0100},
biburl = {https://dblp.org/rec/conf/focs/GuruswamiHKM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/GuruswamiS23,
author = {Venkatesan Guruswami and
Rishi Saket},
editor = {Patricia Bouyer and
Srikanth Srinivasan},
title = {Hardness of Learning Boolean Functions from Label Proportions},
booktitle = {43rd {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2023, December 18-20, 2023,
{IIIT} Hyderabad, Telangana, India},
series = {LIPIcs},
volume = {284},
pages = {37:1--37:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2023.37},
doi = {10.4230/LIPICS.FSTTCS.2023.37},
timestamp = {Wed, 13 Dec 2023 14:08:06 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/GuruswamiS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/WangG23,
author = {Hsin{-}Po Wang and
Venkatesan Guruswami},
title = {How Many Matrices Should {I} Prepare To Polarize Channels Optimally
Fast?},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2023,
Taipei, Taiwan, June 25-30, 2023},
pages = {1556--1561},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/ISIT54713.2023.10206989},
doi = {10.1109/ISIT54713.2023.10206989},
timestamp = {Mon, 28 Aug 2023 17:20:14 +0200},
biburl = {https://dblp.org/rec/conf/isit/WangG23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/WangGG23,
author = {Hsin{-}Po Wang and
Ryan Gabrys and
Venkatesan Guruswami},
title = {Quickly-Decodable Group Testing with Fewer Tests: Price-Scarlett's
Nonadaptive Splitting with Explicit Scalars},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2023,
Taipei, Taiwan, June 25-30, 2023},
pages = {1609--1614},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/ISIT54713.2023.10206843},
doi = {10.1109/ISIT54713.2023.10206843},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isit/WangGG23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/RudowGR23,
author = {Michael Rudow and
Venkatesan Guruswami and
K. V. Rashmi},
title = {On expanding the toolkit of locality-based coded computation to the
coordinates of inputs},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2023,
Taipei, Taiwan, June 25-30, 2023},
pages = {2171--2176},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/ISIT54713.2023.10206923},
doi = {10.1109/ISIT54713.2023.10206923},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isit/RudowGR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BennettCG023,
author = {Huck Bennett and
Mahdi Cheraghchi and
Venkatesan Guruswami and
Jo{\~{a}}o Ribeiro},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Parameterized Inapproximability of the Minimum Distance Problem over
All Fields and the Shortest Vector Problem in All {\(\mathscr{l}\)}\emph{\({}_{\mbox{p}}\)}
Norms},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {553--566},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585214},
doi = {10.1145/3564246.3585214},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BennettCG023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BrakensiekGS23,
author = {Joshua Brakensiek and
Venkatesan Guruswami and
Sai Sandeep},
editor = {Barna Saha and
Rocco A. Servedio},
title = {SDPs and Robust Satisfiability of Promise {CSP}},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {609--622},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585180},
doi = {10.1145/3564246.3585180},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BrakensiekGS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlrabiahGKM23,
author = {Omar Alrabiah and
Venkatesan Guruswami and
Pravesh K. Kothari and
Peter Manohar},
editor = {Barna Saha and
Rocco A. Servedio},
title = {A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from
Semirandom {CSP} Refutation},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1438--1448},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585143},
doi = {10.1145/3564246.3585143},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AlrabiahGKM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuptaGZ23,
author = {Meghal Gupta and
Venkatesan Guruswami and
Rachel Yun Zhang},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Binary Error-Correcting Codes with Minimal Noiseless Feedback},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1475--1487},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585126},
doi = {10.1145/3564246.3585126},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GuptaGZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2304-09445,
author = {Omar Alrabiah and
Venkatesan Guruswami and
Ray Li},
title = {Randomly punctured Reed-Solomon codes achieve list-decoding capacity
over linear-sized fields},
journal = {CoRR},
volume = {abs/2304.09445},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2304.09445},
doi = {10.48550/ARXIV.2304.09445},
eprinttype = {arXiv},
eprint = {2304.09445},
timestamp = {Mon, 24 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2304-09445.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-02484,
author = {Venkatesan Guruswami and
Shilun Li},
title = {A Deterministic Construction of a Large Distance Code from the Wozencraft
Ensemble},
journal = {CoRR},
volume = {abs/2305.02484},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.02484},
doi = {10.48550/ARXIV.2305.02484},
eprinttype = {arXiv},
eprint = {2305.02484},
timestamp = {Wed, 10 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-02484.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-03283,
author = {Nou{\'{e}}dyn Baspin and
Venkatesan Guruswami and
Anirudh Krishna and
Ray Li},
title = {Improved rate-distance trade-offs for quantum codes with restricted
connectivity},
journal = {CoRR},
volume = {abs/2307.03283},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.03283},
doi = {10.48550/ARXIV.2307.03283},
eprinttype = {arXiv},
eprint = {2307.03283},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-03283.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-13424,
author = {Omar Alrabiah and
Venkatesan Guruswami and
Ray Li},
title = {{AG} codes have no list-decoding friends: Approaching the generalized
Singleton bound requires exponential alphabets},
journal = {CoRR},
volume = {abs/2308.13424},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.13424},
doi = {10.48550/ARXIV.2308.13424},
eprinttype = {arXiv},
eprint = {2308.13424},
timestamp = {Fri, 01 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-13424.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-15403,
author = {Omar Alrabiah and
Venkatesan Guruswami and
Pravesh K. Kothari and
Peter Manohar},
title = {A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from
Semirandom {CSP} Refutation},
journal = {CoRR},
volume = {abs/2308.15403},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.15403},
doi = {10.48550/ARXIV.2308.15403},
eprinttype = {arXiv},
eprint = {2308.15403},
timestamp = {Mon, 04 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-15403.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-16897,
author = {Venkatesan Guruswami and
Jun{-}Ting Hsieh and
Pravesh K. Kothari and
Peter Manohar},
title = {Efficient Algorithms for Semirandom Planted CSPs at the Refutation
Threshold},
journal = {CoRR},
volume = {abs/2309.16897},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.16897},
doi = {10.48550/ARXIV.2309.16897},
eprinttype = {arXiv},
eprint = {2309.16897},
timestamp = {Tue, 17 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-16897.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-16344,
author = {Venkatesan Guruswami and
Xuandi Ren and
Sai Sandeep},
title = {Baby {PIH:} Parameterized Inapproximability of Min {CSP}},
journal = {CoRR},
volume = {abs/2310.16344},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2310.16344},
doi = {10.48550/ARXIV.2310.16344},
eprinttype = {arXiv},
eprint = {2310.16344},
timestamp = {Tue, 31 Oct 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2310-16344.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-08283,
author = {Venkatesan Guruswami and
Hsin{-}Po Wang},
title = {Noise-Resilient Group Testing with Order-Optimal Tests and Fast-and-Reliable
Decoding},
journal = {CoRR},
volume = {abs/2311.08283},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.08283},
doi = {10.48550/ARXIV.2311.08283},
eprinttype = {arXiv},
eprint = {2311.08283},
timestamp = {Tue, 21 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-08283.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-08653,
author = {Louis Golowich and
Venkatesan Guruswami},
title = {Quantum Locally Recoverable Codes},
journal = {CoRR},
volume = {abs/2311.08653},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.08653},
doi = {10.48550/ARXIV.2311.08653},
eprinttype = {arXiv},
eprint = {2311.08653},
timestamp = {Thu, 23 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-08653.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-16587,
author = {Venkatesan Guruswami and
Bingkai Lin and
Xuandi Ren and
Yican Sun and
Kewen Wu},
title = {Parameterized Inapproximability Hypothesis under {ETH}},
journal = {CoRR},
volume = {abs/2311.16587},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.16587},
doi = {10.48550/ARXIV.2311.16587},
eprinttype = {arXiv},
eprint = {2311.16587},
timestamp = {Mon, 04 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-16587.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AlrabiahGL23,
author = {Omar Alrabiah and
Venkatesan Guruswami and
Ray Li},
title = {Randomly punctured Reed-Solomon codes achieve list-decoding capacity
over linear-sized fields},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR23-125}},
year = {2023},
url = {https://eccc.weizmann.ac.il/report/2023/125},
eprinttype = {ECCC},
eprint = {TR23-125},
timestamp = {Wed, 30 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AlrabiahGL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AlrabiahGL23a,
author = {Omar Alrabiah and
Venkatesan Guruswami and
Ray Li},
title = {{AG} codes have no list-decoding friends: Approaching the generalized
Singleton bound requires exponential alphabets},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR23-126}},
year = {2023},
url = {https://eccc.weizmann.ac.il/report/2023/126},
eprinttype = {ECCC},
eprint = {TR23-126},
timestamp = {Wed, 30 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AlrabiahGL23a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GolowichG23,
author = {Louis Golowich and
Venkatesan Guruswami},
title = {Quantum Locally Recoverable Codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR23-173}},
year = {2023},
url = {https://eccc.weizmann.ac.il/report/2023/173},
eprinttype = {ECCC},
eprint = {TR23-173},
timestamp = {Wed, 10 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/GolowichG23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiLRS023,
author = {Venkatesan Guruswami and
Bingkai Lin and
Xuandi Ren and
Yican Sun and
Kewen Wu},
title = {Parameterized Inapproximability Hypothesis under {ETH}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR23-188}},
year = {2023},
url = {https://eccc.weizmann.ac.il/report/2023/188},
eprinttype = {ECCC},
eprint = {TR23-188},
timestamp = {Wed, 10 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiLRS023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiRS23,
author = {Venkatesan Guruswami and
Xuandi Ren and
Sai Sandeep},
title = {Baby {PIH:} Parameterized Inapproximability of Min {CSP}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR23-155}},
year = {2023},
url = {https://eccc.weizmann.ac.il/report/2023/155},
eprinttype = {ECCC},
eprint = {TR23-155},
timestamp = {Wed, 10 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiRS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ArvindG22,
author = {Vikraman Arvind and
Venkatesan Guruswami},
title = {{CNF} Satisfiability in a Subspace and Related Problems},
journal = {Algorithmica},
volume = {84},
number = {11},
pages = {3276--3299},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00958-4},
doi = {10.1007/S00453-022-00958-4},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ArvindG22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GuruswamiX22,
author = {Venkatesan Guruswami and
Chaoping Xing},
title = {Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric
Codes},
journal = {J. {ACM}},
volume = {69},
number = {2},
pages = {10:1--10:48},
year = {2022},
url = {https://doi.org/10.1145/3506668},
doi = {10.1145/3506668},
timestamp = {Wed, 13 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/GuruswamiX22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BlasiokGNRS22,
author = {Jaroslaw Blasiok and
Venkatesan Guruswami and
Preetum Nakkiran and
Atri Rudra and
Madhu Sudan},
title = {General Strong Polarization},
journal = {J. {ACM}},
volume = {69},
number = {2},
pages = {11:1--11:67},
year = {2022},
url = {https://doi.org/10.1145/3491390},
doi = {10.1145/3491390},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BlasiokGNRS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcta/GuruswamiR22,
author = {Venkatesan Guruswami and
Andrii Riazanov},
title = {Beating Fredman-Koml{\'{o}}s for perfect \emph{k}-hashing},
journal = {J. Comb. Theory, Ser. {A}},
volume = {188},
pages = {105580},
year = {2022},
url = {https://doi.org/10.1016/j.jcta.2021.105580},
doi = {10.1016/J.JCTA.2021.105580},
timestamp = {Fri, 01 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcta/GuruswamiR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BrakensiekGG22,
author = {Joshua Brakensiek and
Sivakanth Gopi and
Venkatesan Guruswami},
title = {Constraint Satisfaction Problems with Global Modular Constraints:
Algorithms and Hardness via Polynomial Representations},
journal = {{SIAM} J. Comput.},
volume = {51},
number = {3},
pages = {577--626},
year = {2022},
url = {https://doi.org/10.1137/19m1291054},
doi = {10.1137/19M1291054},
timestamp = {Mon, 27 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BrakensiekGG22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GuruswamiMRSW22,
author = {Venkatesan Guruswami and
Jonathan Moshieff and
Nicolas Resch and
Shashwat Silas and
Mary Wootters},
title = {Threshold Rates for Properties of Random Codes},
journal = {{IEEE} Trans. Inf. Theory},
volume = {68},
number = {2},
pages = {905--922},
year = {2022},
url = {https://doi.org/10.1109/TIT.2021.3123497},
doi = {10.1109/TIT.2021.3123497},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tit/GuruswamiMRSW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GuruswamiLMRSW22,
author = {Venkatesan Guruswami and
Ray Li and
Jonathan Mosheiff and
Nicolas Resch and
Shashwat Silas and
Mary Wootters},
title = {Bounds for List-Decoding and List-Recovery of Random Linear Codes},
journal = {{IEEE} Trans. Inf. Theory},
volume = {68},
number = {2},
pages = {923--939},
year = {2022},
url = {https://doi.org/10.1109/TIT.2021.3127126},
doi = {10.1109/TIT.2021.3127126},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tit/GuruswamiLMRSW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GuruswamiRY22,
author = {Venkatesan Guruswami and
Andrii Riazanov and
Min Ye},
title = {Ar{\i}kan Meets Shannon: Polar Codes With Near-Optimal Convergence
to Channel Capacity},
journal = {{IEEE} Trans. Inf. Theory},
volume = {68},
number = {5},
pages = {2877--2919},
year = {2022},
url = {https://doi.org/10.1109/TIT.2022.3146786},
doi = {10.1109/TIT.2022.3146786},
timestamp = {Wed, 18 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tit/GuruswamiRY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GopiG22,
author = {Sivakanth Gopi and
Venkatesan Guruswami},
title = {Improved Maximally Recoverable LRCs Using Skew Polynomials},
journal = {{IEEE} Trans. Inf. Theory},
volume = {68},
number = {11},
pages = {7198--7214},
year = {2022},
url = {https://doi.org/10.1109/TIT.2022.3176807},
doi = {10.1109/TIT.2022.3176807},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/GopiG22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GabrysGRW22,
author = {Ryan Gabrys and
Venkatesan Guruswami and
Jo{\~{a}}o Ribeiro and
Ke Wu},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Beyond Single-Deletion Correcting Codes: Substitutions and Transpositions},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {8:1--8:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.8},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.8},
timestamp = {Sat, 18 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/approx/GabrysGRW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/DuursmaGGLW22,
author = {Iwan M. Duursma and
Ryan Gabrys and
Venkatesan Guruswami and
Ting{-}Chun Lin and
Hsin{-}Po Wang},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Accelerating Polarization via Alphabet Extension},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {17:1--17:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.17},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.17},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/DuursmaGGLW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiLW22,
author = {Venkatesan Guruswami and
Xin Lyu and
Xiuhan Wang},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Range Avoidance for Low-Depth Circuits and Connections to Pseudorandomness},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {20:1--20:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.20},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.20},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/GuruswamiLW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiKM22,
author = {Venkatesan Guruswami and
Pravesh K. Kothari and
Peter Manohar},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Bypassing the {XOR} Trick: Stronger Certificates for Hypergraph Clique
Number},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {42:1--42:7},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.42},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.42},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/GuruswamiKM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GuruswamiMM22,
author = {Venkatesan Guruswami and
Peter Manohar and
Jonathan Mosheiff},
editor = {Shachar Lovett},
title = {{\(\mathscr{l}\)}\({}_{\mbox{p}}\)-Spread and Restricted Isometry
Properties of Sparse Random Matrices},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {7:1--7:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.7},
doi = {10.4230/LIPICS.CCC.2022.7},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/GuruswamiMM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GuruswamiM22,
author = {Venkatesan Guruswami and
Jonathan Mosheiff},
title = {Punctured Low-Bias Codes Behave Like Random Linear Codes},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {36--45},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00011},
doi = {10.1109/FOCS54457.2022.00011},
timestamp = {Sat, 31 Dec 2022 17:14:50 +0100},
biburl = {https://dblp.org/rec/conf/focs/GuruswamiM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuruswamiS22,
author = {Venkatesan Guruswami and
Sai Sandeep},
editor = {Joseph (Seffi) Naor and
Niv Buchbinder},
title = {Approximate Hypergraph Vertex Cover and generalized Tuza's conjecture},
booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 -
12, 2022},
pages = {927--944},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977073.40},
doi = {10.1137/1.9781611977073.40},
timestamp = {Tue, 12 Apr 2022 11:24:56 +0200},
biburl = {https://dblp.org/rec/conf/soda/GuruswamiS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuruswamiKM22,
author = {Venkatesan Guruswami and
Pravesh K. Kothari and
Peter Manohar},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Algorithms and certificates for Boolean {CSP} refutation: smoothed
is no harder than random},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {678--689},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519955},
doi = {10.1145/3519935.3519955},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GuruswamiKM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/fsttcs/2022,
editor = {Anuj Dawar and
Venkatesan Guruswami},
title = {42nd {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2022, December 18-20, 2022,
{IIT} Madras, Chennai, India},
series = {LIPIcs},
volume = {250},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://www.dagstuhl.de/dagpub/978-3-95977-261-7},
isbn = {978-3-95977-261-7},
timestamp = {Wed, 14 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/2022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2205-06738,
author = {Venkatesan Guruswami and
Peter Manohar and
Jonathan Mosheiff},
title = {Sparsity and {\unicode{120001}}\({}_{\mbox{p}}\)-Restricted Isometry},
journal = {CoRR},
volume = {abs/2205.06738},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2205.06738},
doi = {10.48550/ARXIV.2205.06738},
eprinttype = {arXiv},
eprint = {2205.06738},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2205-06738.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2205-06739,
author = {Venkatesan Guruswami and
Pravesh K. Kothari and
Peter Manohar},
title = {Bypassing the {XOR} Trick: Stronger Certificates for Hypergraph Clique
Number},
journal = {CoRR},
volume = {abs/2205.06739},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2205.06739},
doi = {10.48550/ARXIV.2205.06739},
eprinttype = {arXiv},
eprint = {2205.06739},
timestamp = {Tue, 17 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2205-06739.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2207-04522,
author = {Iwan M. Duursma and
Ryan Gabrys and
Venkatesan Guruswami and
Ting{-}Chun Lin and
Hsin{-}Po Wang},
title = {Accelerating Polarization via Alphabet Extension},
journal = {CoRR},
volume = {abs/2207.04522},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2207.04522},
doi = {10.48550/ARXIV.2207.04522},
eprinttype = {arXiv},
eprint = {2207.04522},
timestamp = {Wed, 13 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2207-04522.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-07900,
author = {Huck Bennett and
Mahdi Cheraghchi and
Venkatesan Guruswami and
Jo{\~{a}}o Ribeiro},
title = {Parameterized Inapproximability of the Minimum Distance Problem over
all Fields and the Shortest Vector Problem in all {\unicode{120001}}\({}_{\mbox{p}}\)
Norms},
journal = {CoRR},
volume = {abs/2211.07900},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.07900},
doi = {10.48550/ARXIV.2211.07900},
eprinttype = {arXiv},
eprint = {2211.07900},
timestamp = {Sat, 18 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-07900.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-08373,
author = {Joshua Brakensiek and
Venkatesan Guruswami and
Sai Sandeep},
title = {SDPs and Robust Satisfiability of Promise {CSP}},
journal = {CoRR},
volume = {abs/2211.08373},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.08373},
doi = {10.48550/ARXIV.2211.08373},
eprinttype = {arXiv},
eprint = {2211.08373},
timestamp = {Wed, 23 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-08373.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2212-05673,
author = {Meghal Gupta and
Venkatesan Guruswami and
Rachel Yun Zhang},
title = {Binary Error-Correcting Codes with Minimal Noiseless Feedback},
journal = {CoRR},
volume = {abs/2212.05673},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2212.05673},
doi = {10.48550/ARXIV.2212.05673},
eprinttype = {arXiv},
eprint = {2212.05673},
timestamp = {Mon, 02 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2212-05673.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/GroheGMZ22,
author = {Martin Grohe and
Venkatesan Guruswami and
D{\'{a}}niel Marx and
Stanislav Zivn{\'{y}}},
title = {The Constraint Satisfaction Problem: Complexity and Approximability
(Dagstuhl Seminar 22201)},
journal = {Dagstuhl Reports},
volume = {12},
number = {5},
pages = {112--130},
year = {2022},
url = {https://doi.org/10.4230/DagRep.12.5.112},
doi = {10.4230/DAGREP.12.5.112},
timestamp = {Fri, 16 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/GroheGMZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AlrabiahGKM22,
author = {Omar Alrabiah and
Venkatesan Guruswami and
Pravesh Kothari and
Peter Manohar},
title = {A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from
Semirandom {CSP} Refutation},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR22-101}},
year = {2022},
url = {https://eccc.weizmann.ac.il/report/2022/101},
eprinttype = {ECCC},
eprint = {TR22-101},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AlrabiahGKM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BennettCG022,
author = {Huck Bennett and
Mahdi Cheraghchi and
Venkatesan Guruswami and
Jo{\~{a}}o Ribeiro},
title = {Parameterized Inapproximability of the Minimum Distance Problem over
all Fields and the Shortest Vector Problem in all {\(\mathscr{l}\)}\({}_{\mbox{p}}\)
Norms},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR22-156}},
year = {2022},
url = {https://eccc.weizmann.ac.il/report/2022/156},
eprinttype = {ECCC},
eprint = {TR22-156},
timestamp = {Sat, 18 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/BennettCG022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiLW22,
author = {Venkatesan Guruswami and
Xin Lyu and
Xiuhan Wang},
title = {Range Avoidance for Low-depth Circuits and Connections to Pseudorandomness},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR22-102}},
year = {2022},
url = {https://eccc.weizmann.ac.il/report/2022/102},
eprinttype = {ECCC},
eprint = {TR22-102},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiLW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/GuruswamiRX21,
author = {Venkatesan Guruswami and
Nicolas Resch and
Chaoping Xing},
title = {Lossless Dimension Expanders Via Linearized Polynomials and Subspace
Designs},
journal = {Comb.},
volume = {41},
number = {4},
pages = {545--579},
year = {2021},
url = {https://doi.org/10.1007/s00493-020-4360-1},
doi = {10.1007/S00493-020-4360-1},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/combinatorica/GuruswamiRX21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BrakensiekG21,
author = {Joshua Brakensiek and
Venkatesan Guruswami},
title = {Promise Constraint Satisfaction: Algebraic Structure and a Symmetric
Boolean Dichotomy},
journal = {{SIAM} J. Comput.},
volume = {50},
number = {6},
pages = {1663--1700},
year = {2021},
url = {https://doi.org/10.1137/19M128212X},
doi = {10.1137/19M128212X},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BrakensiekG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BrakensiekG21,
author = {Joshua Brakensiek and
Venkatesan Guruswami},
title = {The Quest for Strong Inapproximability Results with Perfect Completeness},
journal = {{ACM} Trans. Algorithms},
volume = {17},
number = {3},
pages = {27:1--27:35},
year = {2021},
url = {https://doi.org/10.1145/3459668},
doi = {10.1145/3459668},
timestamp = {Thu, 12 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/BrakensiekG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GuruswamiH21,
author = {Venkatesan Guruswami and
Johan H{\aa}stad},
title = {Explicit Two-Deletion Codes With Redundancy Matching the Existential
Bound},
journal = {{IEEE} Trans. Inf. Theory},
volume = {67},
number = {10},
pages = {6384--6394},
year = {2021},
url = {https://doi.org/10.1109/TIT.2021.3069446},
doi = {10.1109/TIT.2021.3069446},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/GuruswamiH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GuruswamiHS21,
author = {Venkatesan Guruswami and
Bernhard Haeupler and
Amirbehshad Shahrasbi},
title = {Optimally Resilient Codes for List-Decoding From Insertions and Deletions},
journal = {{IEEE} Trans. Inf. Theory},
volume = {67},
number = {12},
pages = {7837--7856},
year = {2021},
url = {https://doi.org/10.1109/TIT.2021.3120910},
doi = {10.1109/TIT.2021.3120910},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/GuruswamiHS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/AlrabiahG21,
author = {Omar Alrabiah and
Venkatesan Guruswami},
title = {An Exponential Lower Bound on the Sub-Packetization of Minimum Storage
Regenerating Codes},
journal = {{IEEE} Trans. Inf. Theory},
volume = {67},
number = {12},
pages = {8086--8093},
year = {2021},
url = {https://doi.org/10.1109/TIT.2021.3112286},
doi = {10.1109/TIT.2021.3112286},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tit/AlrabiahG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/AlrabiahG21,
author = {Omar Alrabiah and
Venkatesan Guruswami},
editor = {Mary Wootters and
Laura Sanit{\`{a}}},
title = {Visible Rank and Codes with Locality},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2021, August 16-18, 2021, University
of Washington, Seattle, Washington, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {207},
pages = {57:1--57:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.57},
doi = {10.4230/LIPICS.APPROX/RANDOM.2021.57},
timestamp = {Tue, 21 Sep 2021 09:36:32 +0200},
biburl = {https://dblp.org/rec/conf/approx/AlrabiahG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GuruswamiHL21,
author = {Venkatesan Guruswami and
Xiaoyu He and
Ray Li},
title = {The zero-rate threshold for adversarial bit-deletions is less than
1/2},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {727--738},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00076},
doi = {10.1109/FOCS52979.2021.00076},
timestamp = {Wed, 09 Mar 2022 12:12:23 +0100},
biburl = {https://dblp.org/rec/conf/focs/GuruswamiHL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BrakensiekGS21,
author = {Joshua Brakensiek and
Venkatesan Guruswami and
Sai Sandeep},
editor = {Nikhil Bansal and
Emanuela Merelli and
James Worrell},
title = {Conditional Dichotomy of Boolean Ordered Promise CSPs},
booktitle = {48th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)},
series = {LIPIcs},
volume = {198},
pages = {37:1--37:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2021.37},
doi = {10.4230/LIPICS.ICALP.2021.37},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/icalp/BrakensiekGS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/GuruswamiMRSW21,
author = {Venkatesan Guruswami and
Jonathan Mosheiff and
Nicolas Resch and
Shashwat Silas and
Mary Wootters},
editor = {James R. Lee},
title = {Sharp Threshold Rates for Random Codes},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {5:1--5:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.5},
doi = {10.4230/LIPICS.ITCS.2021.5},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/GuruswamiMRSW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/GuruswamiK21,
author = {Venkatesan Guruswami and
Vinayak Kumar},
editor = {James R. Lee},
title = {Pseudobinomiality of the Sticky Random Walk},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {48:1--48:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.48},
doi = {10.4230/LIPICS.ITCS.2021.48},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/GuruswamiK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/GuruswamiR21,
author = {Venkatesan Guruswami and
Andrii Riazanov},
title = {Linear Shannon Capacity of Cayley Graphs},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2021,
Melbourne, Australia, July 12-20, 2021},
pages = {988--992},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/ISIT45174.2021.9517713},
doi = {10.1109/ISIT45174.2021.9517713},
timestamp = {Fri, 03 Sep 2021 10:54:55 +0200},
biburl = {https://dblp.org/rec/conf/isit/GuruswamiR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/RudowRG21,
author = {Michael Rudow and
K. V. Rashmi and
Venkatesan Guruswami},
title = {A locality-based lens for coded computation},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2021,
Melbourne, Australia, July 12-20, 2021},
pages = {1070--1075},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/ISIT45174.2021.9518056},
doi = {10.1109/ISIT45174.2021.9518056},
timestamp = {Fri, 03 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isit/RudowRG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/GuruswamiR21a,
author = {Venkatesan Guruswami and
Andrii Riazanov},
title = {Linear Programming Bounds for Almost-Balanced Binary Codes},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2021,
Melbourne, Australia, July 12-20, 2021},
pages = {1302--1307},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/ISIT45174.2021.9518013},
doi = {10.1109/ISIT45174.2021.9518013},
timestamp = {Fri, 03 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isit/GuruswamiR21a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/ArvindG21,
author = {Vikraman Arvind and
Venkatesan Guruswami},
editor = {Petr A. Golovach and
Meirav Zehavi},
title = {{CNF} Satisfiability in a Subspace and Related Problems},
booktitle = {16th International Symposium on Parameterized and Exact Computation,
{IPEC} 2021, September 8-10, 2021, Lisbon, Portugal},
series = {LIPIcs},
volume = {214},
pages = {5:1--5:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2021.5},
doi = {10.4230/LIPICS.IPEC.2021.5},
timestamp = {Tue, 23 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/ArvindG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChengGHL21,
author = {Kuan Cheng and
Venkatesan Guruswami and
Bernhard Haeupler and
Xin Li},
editor = {D{\'{a}}niel Marx},
title = {Efficient Linear and Affine Codes for Correcting Insertions/Deletions},
booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2021, Virtual Conference, January 10 - 13, 2021},
pages = {1--20},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976465.1},
doi = {10.1137/1.9781611976465.1},
timestamp = {Thu, 15 Jul 2021 13:48:55 +0200},
biburl = {https://dblp.org/rec/conf/soda/ChengGHL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuruswamiH21,
author = {Venkatesan Guruswami and
Johan H{\aa}stad},
editor = {D{\'{a}}niel Marx},
title = {Explicit two-deletion codes with redundancy matching the existential
bound},
booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2021, Virtual Conference, January 10 - 13, 2021},
pages = {21--32},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976465.2},
doi = {10.1137/1.9781611976465.2},
timestamp = {Thu, 15 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/GuruswamiH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AbascalGK21,
author = {Jackson Abascal and
Venkatesan Guruswami and
Pravesh K. Kothari},
editor = {D{\'{a}}niel Marx},
title = {Strongly refuting all semi-random Boolean CSPs},
booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2021, Virtual Conference, January 10 - 13, 2021},
pages = {454--472},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976465.28},
doi = {10.1137/1.9781611976465.28},
timestamp = {Thu, 15 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/AbascalGK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-11854,
author = {Joshua Brakensiek and
Venkatesan Guruswami and
Sai Sandeep},
title = {Conditional Dichotomy of Boolean Ordered Promise CSPs},
journal = {CoRR},
volume = {abs/2102.11854},
year = {2021},
url = {https://arxiv.org/abs/2102.11854},
eprinttype = {arXiv},
eprint = {2102.11854},
timestamp = {Wed, 24 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-11854.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-05250,
author = {Venkatesan Guruswami and
Xiaoyu He and
Ray Li},
title = {The zero-rate threshold for adversarial bit-deletions is less than
1/2},
journal = {CoRR},
volume = {abs/2106.05250},
year = {2021},
url = {https://arxiv.org/abs/2106.05250},
eprinttype = {arXiv},
eprint = {2106.05250},
timestamp = {Tue, 15 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-05250.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-07672,
author = {Venkatesan Guruswami and
Andrii Riazanov},
title = {Linear Programming Bounds for Almost-Balanced Binary Codes},
journal = {CoRR},
volume = {abs/2107.07672},
year = {2021},
url = {https://arxiv.org/abs/2107.07672},
eprinttype = {arXiv},
eprint = {2107.07672},
timestamp = {Wed, 21 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-07672.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2108-05914,
author = {Vikraman Arvind and
Venkatesan Guruswami},
title = {{CNF} Satisfiability in a Subspace and Related Problems},
journal = {CoRR},
volume = {abs/2108.05914},
year = {2021},
url = {https://arxiv.org/abs/2108.05914},
eprinttype = {arXiv},
eprint = {2108.05914},
timestamp = {Wed, 18 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2108-05914.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2108-12687,
author = {Omar Alrabiah and
Venkatesan Guruswami},
title = {Visible Rank and Codes with Locality},
journal = {CoRR},
volume = {abs/2108.12687},
year = {2021},
url = {https://arxiv.org/abs/2108.12687},
eprinttype = {arXiv},
eprint = {2108.12687},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2108-12687.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2108-13578,
author = {Venkatesan Guruswami and
Peter Manohar and
Jonathan Mosheiff},
title = {{\unicode{120001}}\({}_{\mbox{p}}\)-Spread Properties of Sparse Matrices},
journal = {CoRR},
volume = {abs/2108.13578},
year = {2021},
url = {https://arxiv.org/abs/2108.13578},
eprinttype = {arXiv},
eprint = {2108.13578},
timestamp = {Fri, 03 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2108-13578.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2109-04415,
author = {Venkatesan Guruswami and
Pravesh K. Kothari and
Peter Manohar},
title = {Algorithms and Certificates for Boolean {CSP} Refutation: "Smoothed
is no harder than Random"},
journal = {CoRR},
volume = {abs/2109.04415},
year = {2021},
url = {https://arxiv.org/abs/2109.04415},
eprinttype = {arXiv},
eprint = {2109.04415},
timestamp = {Tue, 21 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2109-04415.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2109-11725,
author = {Venkatesan Guruswami and
Jonathan Mosheiff},
title = {Punctured Large Distance Codes, and Many Reed-Solomon Codes, Achieve
List-Decoding Capacity},
journal = {CoRR},
volume = {abs/2109.11725},
year = {2021},
url = {https://arxiv.org/abs/2109.11725},
eprinttype = {arXiv},
eprint = {2109.11725},
timestamp = {Mon, 27 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2109-11725.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2112-09971,
author = {Ryan Gabrys and
Venkatesan Guruswami and
Jo{\~{a}}o Ribeiro and
Ke Wu},
title = {Beyond Single-Deletion Correcting Codes: Substitutions and Transpositions},
journal = {CoRR},
volume = {abs/2112.09971},
year = {2021},
url = {https://arxiv.org/abs/2112.09971},
eprinttype = {arXiv},
eprint = {2112.09971},
timestamp = {Sat, 18 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2112-09971.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AlrabiahG21,
author = {Omar Alrabiah and
Venkatesan Guruswami},
title = {Visible Rank and Codes with Locality},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR21-119}},
year = {2021},
url = {https://eccc.weizmann.ac.il/report/2021/119},
eprinttype = {ECCC},
eprint = {TR21-119},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AlrabiahG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AlrabiahG21a,
author = {Omar Alrabiah and
Venkatesan Guruswami},
title = {Revisiting a Lower Bound on the Redundancy of Linear Batch Codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR21-145}},
year = {2021},
url = {https://eccc.weizmann.ac.il/report/2021/145},
eprinttype = {ECCC},
eprint = {TR21-145},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AlrabiahG21a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ArvindG21,
author = {Vikraman Arvind and
Venkatesan Guruswami},
title = {{CNF} Satisfiability in a Subspace and Related Problems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR21-112}},
year = {2021},
url = {https://eccc.weizmann.ac.il/report/2021/112},
eprinttype = {ECCC},
eprint = {TR21-112},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ArvindG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BrakensiekGS21,
author = {Joshua Brakensiek and
Venkatesan Guruswami and
Sai Sandeep},
title = {Conditional Dichotomy of Boolean Ordered Promise CSPs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR21-026}},
year = {2021},
url = {https://eccc.weizmann.ac.il/report/2021/026},
eprinttype = {ECCC},
eprint = {TR21-026},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BrakensiekGS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GopiG21,
author = {Sivakanth Gopi and
Venkatesan Guruswami},
title = {Improved Maximally Recoverable LRCs using Skew Polynomials},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR21-025}},
year = {2021},
url = {https://eccc.weizmann.ac.il/report/2021/025},
eprinttype = {ECCC},
eprint = {TR21-025},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GopiG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiHL21,
author = {Venkatesan Guruswami and
Xiaoyu He and
Ray Li},
title = {The zero-rate threshold for adversarial bit-deletions is less than
1/2},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR21-079}},
year = {2021},
url = {https://eccc.weizmann.ac.il/report/2021/079},
eprinttype = {ECCC},
eprint = {TR21-079},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiHL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiM21,
author = {Venkatesan Guruswami and
Jonathan Mosheiff},
title = {Punctured Large Distance Codes, and Many Reed-Solomon Codes, Achieve
List-Decoding Capacity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR21-139}},
year = {2021},
url = {https://eccc.weizmann.ac.il/report/2021/139},
eprinttype = {ECCC},
eprint = {TR21-139},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BrakensiekGWZ20,
author = {Joshua Brakensiek and
Venkatesan Guruswami and
Marcin Wrochna and
Stanislav Zivn{\'{y}}},
title = {The Power of the Combined Basic Linear Programming and Affine Relaxation
for Promise Constraint Satisfaction Problems},
journal = {{SIAM} J. Comput.},
volume = {49},
number = {6},
pages = {1232--1248},
year = {2020},
url = {https://doi.org/10.1137/20M1312745},
doi = {10.1137/20M1312745},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BrakensiekGWZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GuruswamiS20,
author = {Venkatesan Guruswami and
Sai Sandeep},
title = {Rainbow Coloring Hardness via Low Sensitivity Polymorphisms},
journal = {{SIAM} J. Discret. Math.},
volume = {34},
number = {1},
pages = {520--537},
year = {2020},
url = {https://doi.org/10.1137/19M127731X},
doi = {10.1137/19M127731X},
timestamp = {Wed, 20 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/GuruswamiS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/DalaiGR20,
author = {Marco Dalai and
Venkatesan Guruswami and
Jaikumar Radhakrishnan},
title = {An Improved Bound on the Zero-Error List-Decoding Capacity of the
4/3 Channel},
journal = {{IEEE} Trans. Inf. Theory},
volume = {66},
number = {2},
pages = {749--756},
year = {2020},
url = {https://doi.org/10.1109/TIT.2019.2933424},
doi = {10.1109/TIT.2019.2933424},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/DalaiGR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GuruswamiL20,
author = {Venkatesan Guruswami and
Ray Li},
title = {Coding Against Deletions in Oblivious and Online Models},
journal = {{IEEE} Trans. Inf. Theory},
volume = {66},
number = {4},
pages = {2352--2374},
year = {2020},
url = {https://doi.org/10.1109/TIT.2020.2968298},
doi = {10.1109/TIT.2020.2968298},
timestamp = {Thu, 09 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tit/GuruswamiL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GopiGY20,
author = {Sivakanth Gopi and
Venkatesan Guruswami and
Sergey Yekhanin},
title = {Maximally Recoverable LRCs: {A} Field Size Lower Bound and Constructions
for Few Heavy Parities},
journal = {{IEEE} Trans. Inf. Theory},
volume = {66},
number = {10},
pages = {6066--6083},
year = {2020},
url = {https://doi.org/10.1109/TIT.2020.2990981},
doi = {10.1109/TIT.2020.2990981},
timestamp = {Tue, 06 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tit/GopiGY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GuruswamiJX20,
author = {Venkatesan Guruswami and
Lingfei Jin and
Chaoping Xing},
title = {Constructions of Maximally Recoverable Local Reconstruction Codes
via Function Fields},
journal = {{IEEE} Trans. Inf. Theory},
volume = {66},
number = {10},
pages = {6133--6143},
year = {2020},
url = {https://doi.org/10.1109/TIT.2020.2988459},
doi = {10.1109/TIT.2020.2988459},
timestamp = {Tue, 06 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tit/GuruswamiJX20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GuruswamiLJ20,
author = {Venkatesan Guruswami and
Satyanarayana V. Lokam and
Sai Vikneshwar Mani Jayaraman},
title = {{\unicode{1013}}-MSR Codes: Contacting Fewer Code Blocks for Exact
Repair},
journal = {{IEEE} Trans. Inf. Theory},
volume = {66},
number = {11},
pages = {6749--6761},
year = {2020},
url = {https://doi.org/10.1109/TIT.2020.3023110},
doi = {10.1109/TIT.2020.3023110},
timestamp = {Thu, 17 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/GuruswamiLJ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiLMRSW20,
author = {Venkatesan Guruswami and
Ray Li and
Jonathan Mosheiff and
Nicolas Resch and
Shashwat Silas and
Mary Wootters},
editor = {Jaroslaw Byrka and
Raghu Meka},
title = {Bounds for List-Decoding and List-Recovery of Random Linear Codes},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2020, August 17-19, 2020, Virtual
Conference},
series = {LIPIcs},
volume = {176},
pages = {9:1--9:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.9},
doi = {10.4230/LIPICS.APPROX/RANDOM.2020.9},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/approx/GuruswamiLMRSW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiOS20,
author = {Venkatesan Guruswami and
Jakub Oprsal and
Sai Sandeep},
editor = {Jaroslaw Byrka and
Raghu Meka},
title = {Revisiting Alphabet Reduction in Dinur's {PCP}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2020, August 17-19, 2020, Virtual
Conference},
series = {LIPIcs},
volume = {176},
pages = {34:1--34:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.34},
doi = {10.4230/LIPICS.APPROX/RANDOM.2020.34},
timestamp = {Tue, 21 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/GuruswamiOS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GuruswamiS20,
author = {Venkatesan Guruswami and
Sai Sandeep},
editor = {Artur Czumaj and
Anuj Dawar and
Emanuela Merelli},
title = {d-To-1 Hardness of Coloring 3-Colorable Graphs with {O(1)} Colors},
booktitle = {47th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2020, July 8-11, 2020, Saarbr{\"{u}}cken, Germany (Virtual
Conference)},
series = {LIPIcs},
volume = {168},
pages = {62:1--62:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2020.62},
doi = {10.4230/LIPICS.ICALP.2020.62},
timestamp = {Mon, 21 Dec 2020 13:23:22 +0100},
biburl = {https://dblp.org/rec/conf/icalp/GuruswamiS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icits/LinCGSW20,
author = {Fuchun Lin and
Mahdi Cheraghchi and
Venkatesan Guruswami and
Reihaneh Safavi{-}Naini and
Huaxiong Wang},
editor = {Yael Tauman Kalai and
Adam D. Smith and
Daniel Wichs},
title = {Leakage-Resilient Secret Sharing in Non-Compartmentalized Models},
booktitle = {1st Conference on Information-Theoretic Cryptography, {ITC} 2020,
June 17-19, 2020, Boston, MA, {USA}},
series = {LIPIcs},
volume = {163},
pages = {7:1--7:24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ITC.2020.7},
doi = {10.4230/LIPICS.ITC.2020.7},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icits/LinCGSW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BrakensiekG20,
author = {Joshua Brakensiek and
Venkatesan Guruswami},
editor = {Shuchi Chawla},
title = {Symmetric Polymorphisms and Efficient Decidability of Promise CSPs},
booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
pages = {297--304},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611975994.18},
doi = {10.1137/1.9781611975994.18},
timestamp = {Thu, 15 Jul 2021 13:48:53 +0200},
biburl = {https://dblp.org/rec/conf/soda/BrakensiekG20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuruswamiHS20,
author = {Venkatesan Guruswami and
Bernhard Haeupler and
Amirbehshad Shahrasbi},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Optimally resilient codes for list-decoding from insertions and deletions},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {524--537},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384262},
doi = {10.1145/3357713.3384262},
timestamp = {Mon, 18 Dec 2023 07:33:37 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GuruswamiHS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuruswamiRY20,
author = {Venkatesan Guruswami and
Andrii Riazanov and
Min Ye},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Arikan meets Shannon: polar codes with near-optimal convergence to
channel capacity},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {552--564},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384323},
doi = {10.1145/3357713.3384323},
timestamp = {Tue, 26 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GuruswamiRY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-02440,
author = {Michael Rudow and
K. V. Rashmi and
Venkatesan Guruswami},
title = {A locality-based approach for coded computation},
journal = {CoRR},
volume = {abs/2002.02440},
year = {2020},
url = {https://arxiv.org/abs/2002.02440},
eprinttype = {arXiv},
eprint = {2002.02440},
timestamp = {Mon, 10 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-02440.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-13247,
author = {Venkatesan Guruswami and
Ray Li and
Jonathan Mosheiff and
Nicolas Resch and
Shashwat Silas and
Mary Wootters},
title = {Bounds for list-decoding and list-recovery of random linear codes},
journal = {CoRR},
volume = {abs/2004.13247},
year = {2020},
url = {https://arxiv.org/abs/2004.13247},
eprinttype = {arXiv},
eprint = {2004.13247},
timestamp = {Sat, 02 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-13247.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-09075,
author = {Kuan Cheng and
Venkatesan Guruswami and
Bernhard Haeupler and
Xin Li},
title = {Efficient Linear and Affine Codes for Correcting Insertions/Deletions},
journal = {CoRR},
volume = {abs/2007.09075},
year = {2020},
url = {https://arxiv.org/abs/2007.09075},
eprinttype = {arXiv},
eprint = {2007.09075},
timestamp = {Tue, 10 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-09075.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-10592,
author = {Venkatesan Guruswami and
Johan H{\aa}stad},
title = {Explicit two-deletion codes with redundancy matching the existential
bound},
journal = {CoRR},
volume = {abs/2007.10592},
year = {2020},
url = {https://arxiv.org/abs/2007.10592},
eprinttype = {arXiv},
eprint = {2007.10592},
timestamp = {Tue, 28 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-10592.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-07344,
author = {Venkatesan Guruswami and
Sai Sandeep},
title = {An Algorithmic Study of the Hypergraph Tur{\'{a}}n Problem},
journal = {CoRR},
volume = {abs/2008.07344},
year = {2020},
url = {https://arxiv.org/abs/2008.07344},
eprinttype = {arXiv},
eprint = {2008.07344},
timestamp = {Fri, 21 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-07344.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-04553,
author = {Venkatesan Guruswami and
Jonathan Mosheiff and
Nicolas Resch and
Shashwat Silas and
Mary Wootters},
title = {Sharp threshold rates for random codes},
journal = {CoRR},
volume = {abs/2009.04553},
year = {2020},
url = {https://arxiv.org/abs/2009.04553},
eprinttype = {arXiv},
eprint = {2009.04553},
timestamp = {Thu, 17 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2009-04553.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-05685,
author = {Venkatesan Guruswami and
Andrii Riazanov},
title = {Linear Shannon Capacity of Cayley Graphs},
journal = {CoRR},
volume = {abs/2009.05685},
year = {2020},
url = {https://arxiv.org/abs/2009.05685},
eprinttype = {arXiv},
eprint = {2009.05685},
timestamp = {Thu, 17 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2009-05685.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-08032,
author = {Jackson Abascal and
Venkatesan Guruswami and
Pravesh K. Kothari},
title = {Strongly refuting all semi-random Boolean CSPs},
journal = {CoRR},
volume = {abs/2009.08032},
year = {2020},
url = {https://arxiv.org/abs/2009.08032},
eprinttype = {arXiv},
eprint = {2009.08032},
timestamp = {Wed, 23 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2009-08032.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2012-07804,
author = {Sivakanth Gopi and
Venkatesan Guruswami},
title = {Improved Maximally Recoverable LRCs using Skew Polynomials},
journal = {CoRR},
volume = {abs/2012.07804},
year = {2020},
url = {https://arxiv.org/abs/2012.07804},
eprinttype = {arXiv},
eprint = {2012.07804},
timestamp = {Sat, 02 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2012-07804.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BrakensiekGWZ20,
author = {Joshua Brakensiek and
Venkatesan Guruswami and
Marcin Wrochna and
Stanislav Zivn{\'{y}}},
title = {The Power of the Combined Basic {LP} and Affine Relaxation for Promise
CSPs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR20-004}},
year = {2020},
url = {https://eccc.weizmann.ac.il/report/2020/004},
eprinttype = {ECCC},
eprint = {TR20-004},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BrakensiekGWZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiK20,
author = {Venkatesan Guruswami and
Vinayak Kumar},
title = {Pseudobinomiality of the Sticky Random Walk},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR20-151}},
year = {2020},
url = {https://eccc.weizmann.ac.il/report/2020/151},
eprinttype = {ECCC},
eprint = {TR20-151},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiS20,
author = {Venkatesan Guruswami and
Sai Sandeep},
title = {Approximate Hypergraph Vertex Cover and generalized Tuza's conjecture},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR20-167}},
year = {2020},
url = {https://eccc.weizmann.ac.il/report/2020/167},
eprinttype = {ECCC},
eprint = {TR20-167},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiX20,
author = {Venkatesan Guruswami and
Chaoping Xing},
title = {Optimal rate list decoding over bounded alphabets using algebraic-geometric
codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR20-172}},
year = {2020},
url = {https://eccc.weizmann.ac.il/report/2020/172},
eprinttype = {ECCC},
eprint = {TR20-172},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiX20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GuruswamiL19,
author = {Venkatesan Guruswami and
Ray Li},
title = {Polynomial Time Decodable Codes for the Binary Deletion Channel},
journal = {{IEEE} Trans. Inf. Theory},
volume = {65},
number = {4},
pages = {2171--2178},
year = {2019},
url = {https://doi.org/10.1109/TIT.2018.2876861},
doi = {10.1109/TIT.2018.2876861},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tit/GuruswamiL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GuruswamiXY19,
author = {Venkatesan Guruswami and
Chaoping Xing and
Chen Yuan},
title = {How Long Can Optimal Locally Repairable Codes Be?},
journal = {{IEEE} Trans. Inf. Theory},
volume = {65},
number = {6},
pages = {3662--3670},
year = {2019},
url = {https://doi.org/10.1109/TIT.2019.2891765},
doi = {10.1109/TIT.2019.2891765},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/GuruswamiXY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiT19,
author = {Venkatesan Guruswami and
Runzhou Tao},
editor = {Dimitris Achlioptas and
L{\'{a}}szl{\'{o}} A. V{\'{e}}gh},
title = {Streaming Hardness of Unique Games},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2019, September 20-22, 2019, Massachusetts
Institute of Technology, Cambridge, MA, {USA}},
series = {LIPIcs},
volume = {145},
pages = {5:1--5:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.5},
doi = {10.4230/LIPICS.APPROX-RANDOM.2019.5},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/GuruswamiT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiS19,
author = {Venkatesan Guruswami and
Sai Sandeep},
editor = {Dimitris Achlioptas and
L{\'{a}}szl{\'{o}} A. V{\'{e}}gh},
title = {Rainbow Coloring Hardness via Low Sensitivity Polymorphisms},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2019, September 20-22, 2019, Massachusetts
Institute of Technology, Cambridge, MA, {USA}},
series = {LIPIcs},
volume = {145},
pages = {15:1--15:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.15},
doi = {10.4230/LIPICS.APPROX-RANDOM.2019.15},
timestamp = {Tue, 17 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/GuruswamiS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GuruswamiJX19,
author = {Venkatesan Guruswami and
Lingfei Jin and
Chaoping Xing},
editor = {Christel Baier and
Ioannis Chatzigiannakis and
Paola Flocchini and
Stefano Leonardi},
title = {Constructions of Maximally Recoverable Local Reconstruction Codes
via Function Fields},
booktitle = {46th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2019, July 9-12, 2019, Patras, Greece},
series = {LIPIcs},
volume = {132},
pages = {68:1--68:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2019.68},
doi = {10.4230/LIPICS.ICALP.2019.68},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/icalp/GuruswamiJX19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GuruswamiR19,
author = {Venkatesan Guruswami and
Andrii Riazanov},
editor = {Christel Baier and
Ioannis Chatzigiannakis and
Paola Flocchini and
Stefano Leonardi},
title = {Beating Fredman-Koml{\'{o}}s for Perfect k-Hashing},
booktitle = {46th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2019, July 9-12, 2019, Patras, Greece},
series = {LIPIcs},
volume = {132},
pages = {92:1--92:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2019.92},
doi = {10.4230/LIPICS.ICALP.2019.92},
timestamp = {Thu, 08 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GuruswamiR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/GuruswamiNS19,
author = {Venkatesan Guruswami and
Preetum Nakkiran and
Madhu Sudan},
editor = {Avrim Blum},
title = {Algorithmic Polarization for Hidden Markov Models},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {39:1--39:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.39},
doi = {10.4230/LIPICS.ITCS.2019.39},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/GuruswamiNS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/LinCGSW19,
author = {Fuchun Lin and
Mahdi Cheraghchi and
Venkatesan Guruswami and
Reihaneh Safavi{-}Naini and
Huaxiong Wang},
editor = {Avrim Blum},
title = {Secret Sharing with Binary Shares},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {53:1--53:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.53},
doi = {10.4230/LIPICS.ITCS.2019.53},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/LinCGSW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/GuruswamiJ19,
author = {Venkatesan Guruswami and
Haotian Jiang},
title = {Near-optimal Repair of Reed-Solomon Codes with Low Sub-packetization},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2019,
Paris, France, July 7-12, 2019},
pages = {1077--1081},
publisher = {{IEEE}},
year = {2019},
url = {https://doi.org/10.1109/ISIT.2019.8849719},
doi = {10.1109/ISIT.2019.8849719},
timestamp = {Wed, 16 Oct 2019 14:14:48 +0200},
biburl = {https://dblp.org/rec/conf/isit/GuruswamiJ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BrakensiekG19,
author = {Joshua Brakensiek and
Venkatesan Guruswami},
editor = {Timothy M. Chan},
title = {An Algorithmic Blend of LPs and Ring Equations for Promise CSPs},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {436--455},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.28},
doi = {10.1137/1.9781611975482.28},
timestamp = {Thu, 15 Jul 2021 13:49:01 +0200},
biburl = {https://dblp.org/rec/conf/soda/BrakensiekG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BhattiproluGGLT19,
author = {Vijay Bhattiprolu and
Mrinalkanti Ghosh and
Venkatesan Guruswami and
Euiwoong Lee and
Madhur Tulsiani},
editor = {Timothy M. Chan},
title = {Approximability of p {\(\rightarrow\)} q Matrix Norms: Generalized
Krivine Rounding and Hypercontractive Hardness},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {1358--1368},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.83},
doi = {10.1137/1.9781611975482.83},
timestamp = {Thu, 15 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BhattiproluGGLT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GopiGY19,
author = {Sivakanth Gopi and
Venkatesan Guruswami and
Sergey Yekhanin},
editor = {Timothy M. Chan},
title = {Maximally Recoverable LRCs: {A} field size lower bound and constructions
for few heavy parities},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {2154--2170},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.130},
doi = {10.1137/1.9781611975482.130},
timestamp = {Thu, 15 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/GopiGY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BrakensiekG19,
author = {Joshua Brakensiek and
Venkatesan Guruswami},
editor = {Moses Charikar and
Edith Cohen},
title = {Bridging between 0/1 and linear programming via random walks},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {568--577},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316347},
doi = {10.1145/3313276.3316347},
timestamp = {Sat, 22 Jun 2019 17:42:26 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BrakensiekG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BrakensiekGG19,
author = {Joshua Brakensiek and
Sivakanth Gopi and
Venkatesan Guruswami},
editor = {Moses Charikar and
Edith Cohen},
title = {CSPs with global modular constraints: algorithms and hardness via
polynomial representations},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {590--601},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316401},
doi = {10.1145/3313276.3316401},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BrakensiekGG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlrabiahG19,
author = {Omar Alrabiah and
Venkatesan Guruswami},
editor = {Moses Charikar and
Edith Cohen},
title = {An exponential lower bound on the sub-packetization of {MSR} codes},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {979--985},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316387},
doi = {10.1145/3313276.3316387},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AlrabiahG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-05112,
author = {Omar Alrabiah and
Venkatesan Guruswami},
title = {An Exponential Lower Bound on the Sub-Packetization of {MSR} Codes},
journal = {CoRR},
volume = {abs/1901.05112},
year = {2019},
url = {http://arxiv.org/abs/1901.05112},
eprinttype = {arXiv},
eprint = {1901.05112},
timestamp = {Fri, 01 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1901-05112.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-04740,
author = {Joshua Brakensiek and
Sivakanth Gopi and
Venkatesan Guruswami},
title = {CSPs with Global Modular Constraints: Algorithms and Hardness via
Polynomial Representations},
journal = {CoRR},
volume = {abs/1902.04740},
year = {2019},
url = {http://arxiv.org/abs/1902.04740},
eprinttype = {arXiv},
eprint = {1902.04740},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1902-04740.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-06195,
author = {Fuchun Lin and
Mahdi Cheraghchi and
Venkatesan Guruswami and
Reihaneh Safavi{-}Naini and
Huaxiong Wang},
title = {Non-Malleable Secret Sharing against Affine Tampering},
journal = {CoRR},
volume = {abs/1902.06195},
year = {2019},
url = {http://arxiv.org/abs/1902.06195},
eprinttype = {arXiv},
eprint = {1902.06195},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1902-06195.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-04860,
author = {Joshua Brakensiek and
Venkatesan Guruswami},
title = {Bridging between 0/1 and Linear Programming via Random Walks},
journal = {CoRR},
volume = {abs/1904.04860},
year = {2019},
url = {http://arxiv.org/abs/1904.04860},
eprinttype = {arXiv},
eprint = {1904.04860},
timestamp = {Thu, 25 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1904-04860.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-03931,
author = {Venkatesan Guruswami and
Haotian Jiang},
title = {Near-optimal Repair of Reed-Solomon Codes with Low Sub-packetization},
journal = {CoRR},
volume = {abs/1907.03931},
year = {2019},
url = {http://arxiv.org/abs/1907.03931},
eprinttype = {arXiv},
eprint = {1907.03931},
timestamp = {Wed, 17 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-03931.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-04383,
author = {Joshua Brakensiek and
Venkatesan Guruswami},
title = {Symmetric Polymorphisms and Efficient Decidability of Promise CSPs},
journal = {CoRR},
volume = {abs/1907.04383},
year = {2019},
url = {http://arxiv.org/abs/1907.04383},
eprinttype = {arXiv},
eprint = {1907.04383},
timestamp = {Wed, 17 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-04383.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-10683,
author = {Venkatesan Guruswami and
Bernhard Haeupler and
Amirbehshad Shahrasbi},
title = {Optimally Resilient Codes for List-Decoding from Insertions and Deletions},
journal = {CoRR},
volume = {abs/1909.10683},
year = {2019},
url = {http://arxiv.org/abs/1909.10683},
eprinttype = {arXiv},
eprint = {1909.10683},
timestamp = {Fri, 27 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1909-10683.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-03858,
author = {Venkatesan Guruswami and
Andrii Riazanov and
Min Ye},
title = {Ar{\i}kan meets Shannon: Polar codes with near-optimal convergence
to channel capacity},
journal = {CoRR},
volume = {abs/1911.03858},
year = {2019},
url = {http://arxiv.org/abs/1911.03858},
eprinttype = {arXiv},
eprint = {1911.03858},
timestamp = {Tue, 26 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-03858.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AlrabiahG19,
author = {Omar Alrabiah and
Venkatesan Guruswami},
title = {An Exponential Lower Bound on the Sub-Packetization of {MSR} Codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-005}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/005},
eprinttype = {ECCC},
eprint = {TR19-005},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AlrabiahG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BrakensiekG19,
author = {Joshua Brakensiek and
Venkatesan Guruswami},
title = {Bridging between 0/1 and Linear Programming via Random Walks},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-054}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/054},
eprinttype = {ECCC},
eprint = {TR19-054},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BrakensiekG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BrakensiekGG19,
author = {Joshua Brakensiek and
Sivakanth Gopi and
Venkatesan Guruswami},
title = {CSPs with Global Modular Constraints: Algorithms and Hardness via
Polynomial Representations},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-013}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/013},
eprinttype = {ECCC},
eprint = {TR19-013},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BrakensiekGG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiHS19,
author = {Venkatesan Guruswami and
Bernhard Haeupler and
Amirbehshad Shahrasbi},
title = {Optimally Resilient Codes for List-Decoding from Insertions and Deletions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-153}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/153},
eprinttype = {ECCC},
eprint = {TR19-153},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiHS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiOS19,
author = {Venkatesan Guruswami and
Jakub Oprsal and
Sai Sandeep},
title = {Revisiting Alphabet Reduction in Dinur's {PCP}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-092}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/092},
eprinttype = {ECCC},
eprint = {TR19-092},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiOS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiRY19,
author = {Venkatesan Guruswami and
Andrii Riazanov and
Min Ye},
title = {Ar?kan meets Shannon: Polar codes with near-optimal convergence to
channel capacity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-154}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/154},
eprinttype = {ECCC},
eprint = {TR19-154},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiRY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiS19,
author = {Venkatesan Guruswami and
Sai Sandeep},
title = {Rainbow coloring hardness via low sensitivity polymorphisms},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-094}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/094},
eprinttype = {ECCC},
eprint = {TR19-094},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiS19a,
author = {Venkatesan Guruswami and
Sai Sandeep},
title = {{\textdollar}d{\textdollar}-to-{\textdollar}1{\textdollar} Hardness
of Coloring {\textdollar}4{\textdollar}-colorable Graphs with {\textdollar}O(1){\textdollar}
colors},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-116}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/116},
eprinttype = {ECCC},
eprint = {TR19-116},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiS19a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/GuruswamiL18,
author = {Venkatesan Guruswami and
Euiwoong Lee},
title = {Strong Inapproximability Results on Balanced Rainbow-Colorable Hypergraphs},
journal = {Comb.},
volume = {38},
number = {3},
pages = {547--599},
year = {2018},
url = {https://doi.org/10.1007/s00493-016-3383-0},
doi = {10.1007/S00493-016-3383-0},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/GuruswamiL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/BrakensiekGZ18,
author = {Joshua Brakensiek and
Venkatesan Guruswami and
Samuel Zbarsky},
title = {Efficient Low-Redundancy Codes for Correcting Multiple Deletions},
journal = {{IEEE} Trans. Inf. Theory},
volume = {64},
number = {5},
pages = {3403--3410},
year = {2018},
url = {https://doi.org/10.1109/TIT.2017.2746566},
doi = {10.1109/TIT.2017.2746566},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/BrakensiekGZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/RawatTGE18,
author = {Ankit Singh Rawat and
Itzhak Tamo and
Venkatesan Guruswami and
Klim Efremenko},
title = {{MDS} Code Constructions With Small Sub-Packetization and Near-Optimal
Repair Bandwidth},
journal = {{IEEE} Trans. Inf. Theory},
volume = {64},
number = {10},
pages = {6506--6525},
year = {2018},
url = {https://doi.org/10.1109/TIT.2018.2810095},
doi = {10.1109/TIT.2018.2810095},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/RawatTGE18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/allerton/BeemerCGLP18,
author = {Allison Beemer and
Ryan Coatney and
Venkatesan Guruswami and
Hiram H. Lopez and
Fernando Pi{\~{n}}ero},
title = {Explicit optimal-length locally repairable codes of distance 5},
booktitle = {56th Annual Allerton Conference on Communication, Control, and Computing,
Allerton 2018, Monticello, IL, USA, October 2-5, 2018},
pages = {800--804},
publisher = {{IEEE}},
year = {2018},
url = {https://doi.org/10.1109/ALLERTON.2018.8636018},
doi = {10.1109/ALLERTON.2018.8636018},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/allerton/BeemerCGLP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BlasiokGS18,
author = {Jaroslaw Blasiok and
Venkatesan Guruswami and
Madhu Sudan},
editor = {Eric Blais and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Steurer},
title = {Polar Codes with Exponentially Small Error at Finite Block Length},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2018, August 20-22, 2018 - Princeton,
NJ, {USA}},
series = {LIPIcs},
volume = {116},
pages = {34:1--34:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.34},
doi = {10.4230/LIPICS.APPROX-RANDOM.2018.34},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/BlasiokGS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiXY18,
author = {Venkatesan Guruswami and
Chaoping Xing and
Chen Yuan},
editor = {Eric Blais and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Steurer},
title = {How Long Can Optimal Locally Repairable Codes Be?},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2018, August 20-22, 2018 - Princeton,
NJ, {USA}},
series = {LIPIcs},
volume = {116},
pages = {41:1--41:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.41},
doi = {10.4230/LIPICS.APPROX-RANDOM.2018.41},
timestamp = {Sat, 25 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/approx/GuruswamiXY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GuruswamiRX18,
author = {Venkatesan Guruswami and
Nicolas Resch and
Chaoping Xing},
editor = {Rocco A. Servedio},
title = {Lossless Dimension Expanders via Linearized Polynomials and Subspace
Designs},
booktitle = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
2018, San Diego, CA, {USA}},
series = {LIPIcs},
volume = {102},
pages = {4:1--4:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.CCC.2018.4},
doi = {10.4230/LIPICS.CCC.2018.4},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GuruswamiRX18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/GuruswamiR18,
author = {Venkatesan Guruswami and
Nicolas Resch},
title = {On the List-Decodability of Random Linear Rank-Metric Codes},
booktitle = {2018 {IEEE} International Symposium on Information Theory, {ISIT}
2018, Vail, CO, USA, June 17-22, 2018},
pages = {1505--1509},
publisher = {{IEEE}},
year = {2018},
url = {https://doi.org/10.1109/ISIT.2018.8437698},
doi = {10.1109/ISIT.2018.8437698},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isit/GuruswamiR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/GuruswamiLJ18,
author = {Venkatesan Guruswami and
Satyanarayana V. Lokam and
Sai Vikneshwar Mani Jayaraman},
title = {{\unicode{8714}}-MSR Codes: Contacting Fewer Code Blocks for Exact
Repair},
booktitle = {2018 {IEEE} International Symposium on Information Theory, {ISIT}
2018, Vail, CO, USA, June 17-22, 2018},
pages = {2371--2375},
publisher = {{IEEE}},
year = {2018},
url = {https://doi.org/10.1109/ISIT.2018.8437576},
doi = {10.1109/ISIT.2018.8437576},
timestamp = {Tue, 21 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isit/GuruswamiLJ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuruswamiL18,
author = {Venkatesan Guruswami and
Ray Li},
editor = {Artur Czumaj},
title = {Coding against deletions in oblivious and online models},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {625--643},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.41},
doi = {10.1137/1.9781611975031.41},
timestamp = {Tue, 02 Feb 2021 17:07:58 +0100},
biburl = {https://dblp.org/rec/conf/soda/GuruswamiL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BrakensiekG18,
author = {Joshua Brakensiek and
Venkatesan Guruswami},
editor = {Artur Czumaj},
title = {Promise Constraint Satisfaction: Structure Theory and a Symmetric
Boolean Dichotomy},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {1782--1801},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.117},
doi = {10.1137/1.9781611975031.117},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BrakensiekG18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BlasiokGNRS18,
author = {Jaroslaw Blasiok and
Venkatesan Guruswami and
Preetum Nakkiran and
Atri Rudra and
Madhu Sudan},
editor = {Ilias Diakonikolas and
David Kempe and
Monika Henzinger},
title = {General strong polarization},
booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
pages = {485--492},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3188745.3188816},
doi = {10.1145/3188745.3188816},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BlasiokGNRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-02718,
author = {Jaroslaw Blasiok and
Venkatesan Guruswami and
Preetum Nakkiran and
Atri Rudra and
Madhu Sudan},
title = {General Strong Polarization},
journal = {CoRR},
volume = {abs/1802.02718},
year = {2018},
url = {http://arxiv.org/abs/1802.02718},
eprinttype = {arXiv},
eprint = {1802.02718},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-02718.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-07425,
author = {Vijay Bhattiprolu and
Mrinalkanti Ghosh and
Venkatesan Guruswami and
Euiwoong Lee and
Madhur Tulsiani},
title = {Inapproximability of Matrix p{\(\rightarrow\)}q Norms},
journal = {CoRR},
volume = {abs/1802.07425},
year = {2018},
url = {http://arxiv.org/abs/1802.07425},
eprinttype = {arXiv},
eprint = {1802.07425},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-07425.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-03644,
author = {Vijay Bhattiprolu and
Mrinalkanti Ghosh and
Venkatesan Guruswami and
Euiwoong Lee and
Madhur Tulsiani},
title = {Approximating Operator Norms via Generalized Krivine Rounding},
journal = {CoRR},
volume = {abs/1804.03644},
year = {2018},
url = {http://arxiv.org/abs/1804.03644},
eprinttype = {arXiv},
eprint = {1804.03644},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-03644.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-04151,
author = {Venkatesan Guruswami and
Andrii Riazanov},
title = {Beating Fredman-Koml{\'{o}}s for perfect k-hashing},
journal = {CoRR},
volume = {abs/1805.04151},
year = {2018},
url = {http://arxiv.org/abs/1805.04151},
eprinttype = {arXiv},
eprint = {1805.04151},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-04151.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-01064,
author = {Venkatesan Guruswami and
Chaoping Xing and
Chen Yuan},
title = {How long can optimal locally repairable codes be?},
journal = {CoRR},
volume = {abs/1807.01064},
year = {2018},
url = {http://arxiv.org/abs/1807.01064},
eprinttype = {arXiv},
eprint = {1807.01064},
timestamp = {Sat, 25 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-01064.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-01166,
author = {Venkatesan Guruswami and
Satyanarayana V. Lokam and
Sai Vikneshwar Mani Jayaraman},
title = {{\(\epsilon\)}-MSR Codes: Contacting Fewer Code Blocks for Exact Repair},
journal = {CoRR},
volume = {abs/1807.01166},
year = {2018},
url = {http://arxiv.org/abs/1807.01166},
eprinttype = {arXiv},
eprint = {1807.01166},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-01166.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-05194,
author = {Joshua Brakensiek and
Venkatesan Guruswami},
title = {An Algorithmic Blend of LPs and Ring Equations for Promise CSPs},
journal = {CoRR},
volume = {abs/1807.05194},
year = {2018},
url = {http://arxiv.org/abs/1807.05194},
eprinttype = {arXiv},
eprint = {1807.05194},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-05194.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-02974,
author = {Fuchun Lin and
Mahdi Cheraghchi and
Venkatesan Guruswami and
Reihaneh Safavi{-}Naini and
Huaxiong Wang},
title = {Secret Sharing with Binary Shares},
journal = {CoRR},
volume = {abs/1808.02974},
year = {2018},
url = {http://arxiv.org/abs/1808.02974},
eprinttype = {arXiv},
eprint = {1808.02974},
timestamp = {Sun, 02 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-02974.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-04539,
author = {Venkatesan Guruswami and
Lingfei Jin and
Chaoping Xing},
title = {Constructions of maximally recoverable local reconstruction codes
via function fields},
journal = {CoRR},
volume = {abs/1808.04539},
year = {2018},
url = {http://arxiv.org/abs/1808.04539},
eprinttype = {arXiv},
eprint = {1808.04539},
timestamp = {Sun, 02 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-04539.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-01969,
author = {Venkatesan Guruswami and
Preetum Nakkiran and
Madhu Sudan},
title = {Algorithmic Polarization for Hidden Markov Models},
journal = {CoRR},
volume = {abs/1810.01969},
year = {2018},
url = {http://arxiv.org/abs/1810.01969},
eprinttype = {arXiv},
eprint = {1810.01969},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-01969.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-03980,
author = {Allison Beemer and
Ryan Coatney and
Venkatesan Guruswami and
Hiram H. L{\'{o}}pez and
Fernando Pi{\~{n}}ero},
title = {Explicit optimal-length locally repairable codes of distance 5},
journal = {CoRR},
volume = {abs/1810.03980},
year = {2018},
url = {http://arxiv.org/abs/1810.03980},
eprinttype = {arXiv},
eprint = {1810.03980},
timestamp = {Tue, 30 Oct 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-03980.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-04298,
author = {Jaroslaw Blasiok and
Venkatesan Guruswami and
Madhu Sudan},
title = {Polar Codes with exponentially small error at finite block length},
journal = {CoRR},
volume = {abs/1810.04298},
year = {2018},
url = {http://arxiv.org/abs/1810.04298},
eprinttype = {arXiv},
eprint = {1810.04298},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-04298.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-04607,
author = {Venkatesan Guruswami and
Runzhou Tao},
title = {Streaming Hardness of Unique Games},
journal = {CoRR},
volume = {abs/1811.04607},
year = {2018},
url = {http://arxiv.org/abs/1811.04607},
eprinttype = {arXiv},
eprint = {1811.04607},
timestamp = {Fri, 23 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-04607.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/GroheGZ18,
author = {Martin Grohe and
Venkatesan Guruswami and
Stanislav Zivn{\'{y}}},
title = {The Constraint Satisfaction Problem: Complexity and Approximability
(Dagstuhl Seminar 18231)},
journal = {Dagstuhl Reports},
volume = {8},
number = {6},
pages = {1--18},
year = {2018},
url = {https://doi.org/10.4230/DagRep.8.6.1},
doi = {10.4230/DAGREP.8.6.1},
timestamp = {Mon, 03 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/GroheGZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BhattiproluGGLT18,
author = {Vijay Bhattiprolu and
Mrinalkanti Ghosh and
Venkatesan Guruswami and
Euiwoong Lee and
Madhur Tulsiani},
title = {Inapproximability of Matrix p{\(\rightarrow\)}q Norms},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-037}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/037},
eprinttype = {ECCC},
eprint = {TR18-037},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BhattiproluGGLT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BhattiproluGGLT18a,
author = {Vijay Bhattiprolu and
Mrinalkanti Ghosh and
Venkatesan Guruswami and
Euiwoong Lee and
Madhur Tulsiani},
title = {Approximating Operator Norms via Generalized Krivine Rounding},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-097}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/097},
eprinttype = {ECCC},
eprint = {TR18-097},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BhattiproluGGLT18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BlasiokGNRS18,
author = {Jaroslaw Blasiok and
Venkatesan Guruswami and
Preetum Nakkiran and
Atri Rudra and
Madhu Sudan},
title = {General Strong Polarization},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-027}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/027},
eprinttype = {ECCC},
eprint = {TR18-027},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BlasiokGNRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BrakensiekG18,
author = {Joshua Brakensiek and
Venkatesan Guruswami},
title = {Combining LPs and Ring Equations via Structured Polymorphisms},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-059}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/059},
eprinttype = {ECCC},
eprint = {TR18-059},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BrakensiekG18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiR18,
author = {Venkatesan Guruswami and
Andrii Riazanov},
title = {Beating Fredman-Koml{\'{o}}s for perfect k-hashing},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-096}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/096},
eprinttype = {ECCC},
eprint = {TR18-096},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiRX18,
author = {Venkatesan Guruswami and
Nicolas Resch and
Chaoping Xing},
title = {Lossless dimension expanders via linearized polynomials and subspace
designs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-017}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/017},
eprinttype = {ECCC},
eprint = {TR18-017},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiRX18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/LinCGSW18,
author = {Fuchun Lin and
Mahdi Cheraghchi and
Venkatesan Guruswami and
Reihaneh Safavi{-}Naini and
Huaxiong Wang},
title = {Secret Sharing with Binary Shares},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {746},
year = {2018},
url = {https://eprint.iacr.org/2018/746},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/LinCGSW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/joc/CheraghchiG17,
author = {Mahdi Cheraghchi and
Venkatesan Guruswami},
title = {Non-malleable Coding Against Bit-Wise and Split-State Tampering},
journal = {J. Cryptol.},
volume = {30},
number = {1},
pages = {191--241},
year = {2017},
url = {https://doi.org/10.1007/s00145-015-9219-z},
doi = {10.1007/S00145-015-9219-Z},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/joc/CheraghchiG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GuruswamiHHSV17,
author = {Venkatesan Guruswami and
Prahladh Harsha and
Johan H{\aa}stad and
Srikanth Srinivasan and
Girish Varma},
title = {Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree
Long Codes},
journal = {{SIAM} J. Comput.},
volume = {46},
number = {1},
pages = {132--159},
year = {2017},
url = {https://doi.org/10.1137/140995520},
doi = {10.1137/140995520},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GuruswamiHHSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GuruswamiL17,
author = {Venkatesan Guruswami and
Euiwoong Lee},
title = {Nearly Optimal NP-Hardness of Unique Coverage},
journal = {{SIAM} J. Comput.},
volume = {46},
number = {3},
pages = {1018--1028},
year = {2017},
url = {https://doi.org/10.1137/16M1070682},
doi = {10.1137/16M1070682},
timestamp = {Wed, 05 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GuruswamiL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AustrinGH17,
author = {Per Austrin and
Venkatesan Guruswami and
Johan H{\aa}stad},
title = {(2+{\(\epsilon\)})-Sat Is NP-hard},
journal = {{SIAM} J. Comput.},
volume = {46},
number = {5},
pages = {1554--1573},
year = {2017},
url = {https://doi.org/10.1137/15M1006507},
doi = {10.1137/15M1006507},
timestamp = {Mon, 20 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/AustrinGH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GuruswamiL17,
author = {Venkatesan Guruswami and
Euiwoong Lee},
title = {Inapproximability of H-Transversal/Packing},
journal = {{SIAM} J. Discret. Math.},
volume = {31},
number = {3},
pages = {1552--1571},
year = {2017},
url = {https://doi.org/10.1137/16M1070670},
doi = {10.1137/16M1070670},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/GuruswamiL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/BukhGH17,
author = {Boris Bukh and
Venkatesan Guruswami and
Johan H{\aa}stad},
title = {An Improved Bound on the Fraction of Correctable Deletions},
journal = {{IEEE} Trans. Inf. Theory},
volume = {63},
number = {1},
pages = {93--103},
year = {2017},
url = {https://doi.org/10.1109/TIT.2016.2621044},
doi = {10.1109/TIT.2016.2621044},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/BukhGH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GuruswamiW17,
author = {Venkatesan Guruswami and
Carol Wang},
title = {Deletion Codes in the High-Noise and High-Rate Regimes},
journal = {{IEEE} Trans. Inf. Theory},
volume = {63},
number = {4},
pages = {1961--1970},
year = {2017},
url = {https://doi.org/10.1109/TIT.2017.2659765},
doi = {10.1109/TIT.2017.2659765},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/GuruswamiW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GuruswamiJX17,
author = {Venkatesan Guruswami and
Lingfei Jin and
Chaoping Xing},
title = {Efficiently List-Decodable Punctured Reed-Muller Codes},
journal = {{IEEE} Trans. Inf. Theory},
volume = {63},
number = {7},
pages = {4317--4324},
year = {2017},
url = {https://doi.org/10.1109/TIT.2017.2692212},
doi = {10.1109/TIT.2017.2692212},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/GuruswamiJX17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GuruswamiW17a,
author = {Venkatesan Guruswami and
Mary Wootters},
title = {Repairing Reed-Solomon Codes},
journal = {{IEEE} Trans. Inf. Theory},
volume = {63},
number = {9},
pages = {5684--5698},
year = {2017},
url = {https://doi.org/10.1109/TIT.2017.2702660},
doi = {10.1109/TIT.2017.2702660},
timestamp = {Fri, 21 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/GuruswamiW17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/CanonneGMS17,
author = {Cl{\'{e}}ment L. Canonne and
Venkatesan Guruswami and
Raghu Meka and
Madhu Sudan},
title = {Communication With Imperfectly Shared Randomness},
journal = {{IEEE} Trans. Inf. Theory},
volume = {63},
number = {10},
pages = {6799--6818},
year = {2017},
url = {https://doi.org/10.1109/TIT.2017.2734103},
doi = {10.1109/TIT.2017.2734103},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tit/CanonneGMS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/GuruswamiL17,
author = {Venkatesan Guruswami and
Euiwoong Lee},
title = {Towards a Characterization of Approximation Resistance for Symmetric
CSPs},
journal = {Theory Comput.},
volume = {13},
number = {1},
pages = {1--24},
year = {2017},
url = {https://doi.org/10.4086/toc.2017.v013a003},
doi = {10.4086/TOC.2017.V013A003},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/GuruswamiL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BrakensiekG17,
author = {Joshua Brakensiek and
Venkatesan Guruswami},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {The Quest for Strong Inapproximability Results with Perfect Completeness},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {4:1--4:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.4},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.4},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/BrakensiekG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiVV17,
author = {Venkatesan Guruswami and
Ameya Velingker and
Santhoshini Velusamy},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {8:1--8:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.8},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.8},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/GuruswamiVV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BhattiproluGL17,
author = {Vijay Bhattiprolu and
Venkatesan Guruswami and
Euiwoong Lee},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Sum-of-Squares Certificates for Maxima of Random Tensors on the Sphere},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {31:1--31:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.31},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.31},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/BhattiproluGL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Frank-FischerGW17,
author = {S. Luna Frank{-}Fischer and
Venkatesan Guruswami and
Mary Wootters},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Locality via Partially Lifted Codes},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {43:1--43:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.43},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.43},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/Frank-FischerGW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiL17,
author = {Venkatesan Guruswami and
Ray Li},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Efficiently Decodable Codes for the Binary Deletion Channel},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {47:1--47:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.47},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.47},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/GuruswamiL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BhattiproluGGLT17,
author = {Vijay Bhattiprolu and
Mrinalkanti Ghosh and
Venkatesan Guruswami and
Euiwoong Lee and
Madhur Tulsiani},
editor = {Chris Umans},
title = {Weak Decoupling, Polynomial Folds and Approximate Optimization over
the Sphere},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {1008--1019},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.97},
doi = {10.1109/FOCS.2017.97},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BhattiproluGGLT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/GuruswamiS17,
author = {Venkatesan Guruswami and
Rishi Saket},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {Hardness of Rainbow Coloring Hypergraphs},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {33:33--33:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.33},
doi = {10.4230/LIPICS.FSTTCS.2017.33},
timestamp = {Fri, 03 Sep 2021 15:00:19 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/GuruswamiS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GuruswamiXY17,
author = {Venkatesan Guruswami and
Chaoping Xing and
Chen Yuan},
editor = {Ioannis Chatzigiannakis and
Piotr Indyk and
Fabian Kuhn and
Anca Muscholl},
title = {Subspace Designs Based on Algebraic Function Fields},
booktitle = {44th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
series = {LIPIcs},
volume = {80},
pages = {86:1--86:10},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2017.86},
doi = {10.4230/LIPICS.ICALP.2017.86},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/GuruswamiXY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/DalaiGR17,
author = {Marco Dalai and
Venkatesan Guruswami and
Jaikumar Radhakrishnan},
title = {An improved bound on the zero-error list-decoding capacity of the
4/3 channel},
booktitle = {2017 {IEEE} International Symposium on Information Theory, {ISIT}
2017, Aachen, Germany, June 25-30, 2017},
pages = {1658--1662},
publisher = {{IEEE}},
year = {2017},
url = {https://doi.org/10.1109/ISIT.2017.8006811},
doi = {10.1109/ISIT.2017.8006811},
timestamp = {Wed, 16 Oct 2019 14:14:48 +0200},
biburl = {https://dblp.org/rec/conf/isit/DalaiGR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/RawatTGE17,
author = {Ankit Singh Rawat and
Itzhak Tamo and
Venkatesan Guruswami and
Klim Efremenko},
title = {{\unicode{8714}}-MSR codes with small sub-packetization},
booktitle = {2017 {IEEE} International Symposium on Information Theory, {ISIT}
2017, Aachen, Germany, June 25-30, 2017},
pages = {2043--2047},
publisher = {{IEEE}},
year = {2017},
url = {https://doi.org/10.1109/ISIT.2017.8006888},
doi = {10.1109/ISIT.2017.8006888},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isit/RawatTGE17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuruswamiR17,
author = {Venkatesan Guruswami and
Ankit Singh Rawat},
editor = {Philip N. Klein},
title = {{MDS} Code Constructions with Small Sub-packetization and Near-optimal
Repair Bandwidth},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {2109--2122},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.137},
doi = {10.1137/1.9781611974782.137},
timestamp = {Tue, 02 Feb 2021 17:07:33 +0100},
biburl = {https://dblp.org/rec/conf/soda/GuruswamiR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BrakensiekG17,
author = {Joshua Brakensiek and
Venkatesan Guruswami},
title = {Promise Constraint Satisfaction: Algebraic Structure and a Symmetric
Boolean Dichotomy},
journal = {CoRR},
volume = {abs/1704.01937},
year = {2017},
url = {http://arxiv.org/abs/1704.01937},
eprinttype = {arXiv},
eprint = {1704.01937},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BrakensiekG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GuruswamiXY17,
author = {Venkatesan Guruswami and
Chaoping Xing and
Chen Yuan},
title = {Subspace Designs based on Algebraic Function Fields},
journal = {CoRR},
volume = {abs/1704.05992},
year = {2017},
url = {http://arxiv.org/abs/1704.05992},
eprinttype = {arXiv},
eprint = {1704.05992},
timestamp = {Sat, 25 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/GuruswamiXY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Frank-FischerGW17,
author = {S. Luna Frank{-}Fischer and
Venkatesan Guruswami and
Mary Wootters},
title = {Locality via Partially Lifted Codes},
journal = {CoRR},
volume = {abs/1704.08627},
year = {2017},
url = {http://arxiv.org/abs/1704.08627},
eprinttype = {arXiv},
eprint = {1704.08627},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Frank-FischerGW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GuruswamiL17,
author = {Venkatesan Guruswami and
Ray Li},
title = {Efficiently decodable codes for the binary deletion channel},
journal = {CoRR},
volume = {abs/1705.01963},
year = {2017},
url = {http://arxiv.org/abs/1705.01963},
eprinttype = {arXiv},
eprint = {1705.01963},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GuruswamiL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-01070,
author = {Venkatesan Guruswami and
Chaoping Xing},
title = {Optimal rate list decoding over bounded alphabets using algebraic-geometric
codes},
journal = {CoRR},
volume = {abs/1708.01070},
year = {2017},
url = {http://arxiv.org/abs/1708.01070},
eprinttype = {arXiv},
eprint = {1708.01070},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-01070.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-08216,
author = {Ankit Singh Rawat and
Itzhak Tamo and
Venkatesan Guruswami and
Klim Efremenko},
title = {{MDS} Code Constructions with Small Sub-packetization and Near-optimal
Repair Bandwidth},
journal = {CoRR},
volume = {abs/1709.08216},
year = {2017},
url = {http://arxiv.org/abs/1709.08216},
eprinttype = {arXiv},
eprint = {1709.08216},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1709-08216.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1710-10322,
author = {Sivakanth Gopi and
Venkatesan Guruswami and
Sergey Yekhanin},
title = {On Maximally Recoverable Local Reconstruction Codes},
journal = {CoRR},
volume = {abs/1710.10322},
year = {2017},
url = {http://arxiv.org/abs/1710.10322},
eprinttype = {arXiv},
eprint = {1710.10322},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1710-10322.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1710-11516,
author = {Venkatesan Guruswami and
Nicolas Resch},
title = {On the List-Decodability of Random Linear Rank-Metric Codes},
journal = {CoRR},
volume = {abs/1710.11516},
year = {2017},
url = {http://arxiv.org/abs/1710.11516},
eprinttype = {arXiv},
eprint = {1710.11516},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1710-11516.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BrakensiekG17,
author = {Joshua Brakensiek and
Venkatesan Guruswami},
title = {The Quest for Strong Inapproximability Results with Perfect Completeness},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-080}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/080},
eprinttype = {ECCC},
eprint = {TR17-080},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BrakensiekG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BrakensiekG17a,
author = {Joshua Brakensiek and
Venkatesan Guruswami},
title = {A Family of Dictatorship Tests with Perfect Completeness for 2-to-2
Label Cover},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-141}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/141},
eprinttype = {ECCC},
eprint = {TR17-141},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BrakensiekG17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GopiGY17,
author = {Sivakanth Gopi and
Venkatesan Guruswami and
Sergey Yekhanin},
title = {On Maximally Recoverable Local Reconstruction Codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-183}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/183},
eprinttype = {ECCC},
eprint = {TR17-183},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GopiGY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiS17,
author = {Venkatesan Guruswami and
Rishi Saket},
title = {Hardness of Rainbow Coloring Hypergraphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-147}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/147},
eprinttype = {ECCC},
eprint = {TR17-147},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiXY17,
author = {Venkatesan Guruswami and
Chaoping Xing and
Chen Yuan},
title = {Subspace Designs based on Algebraic Function Fields},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-064}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/064},
eprinttype = {ECCC},
eprint = {TR17-064},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiXY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GuruswamiO16,
author = {Venkatesan Guruswami and
Krzysztof Onak},
title = {Superlinear Lower Bounds for Multipass Graph Processing},
journal = {Algorithmica},
volume = {76},
number = {3},
pages = {654--683},
year = {2016},
url = {https://doi.org/10.1007/s00453-016-0138-7},
doi = {10.1007/S00453-016-0138-7},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GuruswamiO16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/GuruswamiK16,
author = {Venkatesan Guruswami and
Swastik Kopparty},
title = {Explicit subspace designs},
journal = {Comb.},
volume = {36},
number = {2},
pages = {161--185},
year = {2016},
url = {https://doi.org/10.1007/s00493-014-3169-1},
doi = {10.1007/S00493-014-3169-1},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/GuruswamiK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GuruswamiS16,
author = {Venkatesan Guruswami and
Adam D. Smith},
title = {Optimal Rate Code Constructions for Computationally Simple Channels},
journal = {J. {ACM}},
volume = {63},
number = {4},
pages = {35:1--35:37},
year = {2016},
url = {https://doi.org/10.1145/2936015},
doi = {10.1145/2936015},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GuruswamiS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/GuruswamiL16,
author = {Venkatesan Guruswami and
Euiwoong Lee},
title = {Complexity of Approximating {CSP} with Balance / Hard Constraints},
journal = {Theory Comput. Syst.},
volume = {59},
number = {1},
pages = {76--98},
year = {2016},
url = {https://doi.org/10.1007/s00224-015-9638-0},
doi = {10.1007/S00224-015-9638-0},
timestamp = {Wed, 26 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/GuruswamiL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GuruswamiRS016,
author = {Venkatesan Guruswami and
Prasad Raghavendra and
Rishi Saket and
Yi Wu},
title = {Bypassing {UGC} from Some Optimal Geometric Inapproximability Results},
journal = {{ACM} Trans. Algorithms},
volume = {12},
number = {1},
pages = {6:1--6:25},
year = {2016},
url = {https://doi.org/10.1145/2737729},
doi = {10.1145/2737729},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/GuruswamiRS016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/CheraghchiG16,
author = {Mahdi Cheraghchi and
Venkatesan Guruswami},
title = {Capacity of Non-Malleable Codes},
journal = {{IEEE} Trans. Inf. Theory},
volume = {62},
number = {3},
pages = {1097--1118},
year = {2016},
url = {https://doi.org/10.1109/TIT.2015.2511784},
doi = {10.1109/TIT.2015.2511784},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/CheraghchiG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GuruswamiWX16,
author = {Venkatesan Guruswami and
Carol Wang and
Chaoping Xing},
title = {Explicit List-Decodable Rank-Metric and Subspace Codes via Subspace
Designs},
journal = {{IEEE} Trans. Inf. Theory},
volume = {62},
number = {5},
pages = {2707--2718},
year = {2016},
url = {https://doi.org/10.1109/TIT.2016.2544347},
doi = {10.1109/TIT.2016.2544347},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/GuruswamiWX16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/GuruswamiL16,
author = {Venkatesan Guruswami and
Euiwoong Lee},
title = {Simple Proof of Hardness of Feedback Vertex Set},
journal = {Theory Comput.},
volume = {12},
number = {1},
pages = {1--11},
year = {2016},
url = {https://doi.org/10.4086/toc.2016.v012a006},
doi = {10.4086/TOC.2016.V012A006},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/GuruswamiL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GuruswamiR16,
author = {Venkatesan Guruswami and
Jaikumar Radhakrishnan},
editor = {Ran Raz},
title = {Tight Bounds for Communication-Assisted Agreement Distillation},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {6:1--6:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.6},
doi = {10.4230/LIPICS.CCC.2016.6},
timestamp = {Thu, 02 Feb 2023 13:27:05 +0100},
biburl = {https://dblp.org/rec/conf/coco/GuruswamiR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BrakensiekG16,
author = {Joshua Brakensiek and
Venkatesan Guruswami},
editor = {Ran Raz},
title = {New Hardness Results for Graph and Hypergraph Colorings},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {14:1--14:27},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.14},
doi = {10.4230/LIPICS.CCC.2016.14},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BrakensiekG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GuruswamiZ16,
author = {Venkatesan Guruswami and
David Zuckerman},
editor = {Irit Dinur},
title = {Robust Fourier and Polynomial Curve Fitting},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {751--759},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.75},
doi = {10.1109/FOCS.2016.75},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GuruswamiZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/GuruswamiL16,
author = {Venkatesan Guruswami and
Ray Li},
title = {Efficiently decodable insertion/deletion codes for high-noise and
high-rate regimes},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2016,
Barcelona, Spain, July 10-15, 2016},
pages = {620--624},
publisher = {{IEEE}},
year = {2016},
url = {https://doi.org/10.1109/ISIT.2016.7541373},
doi = {10.1109/ISIT.2016.7541373},
timestamp = {Wed, 16 Oct 2019 14:14:48 +0200},
biburl = {https://dblp.org/rec/conf/isit/GuruswamiL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuruswamiL16,
author = {Venkatesan Guruswami and
Euiwoong Lee},
editor = {Robert Krauthgamer},
title = {Nearly Optimal NP-Hardness of Unique Coverage},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
pages = {1724--1730},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974331.ch119},
doi = {10.1137/1.9781611974331.CH119},
timestamp = {Tue, 02 Feb 2021 17:07:56 +0100},
biburl = {https://dblp.org/rec/conf/soda/GuruswamiL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BrakensiekGZ16,
author = {Joshua Brakensiek and
Venkatesan Guruswami and
Samuel Zbarsky},
editor = {Robert Krauthgamer},
title = {Efficient Low-Redundancy Codes for Correcting Multiple Deletions},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
pages = {1884--1892},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974331.ch132},
doi = {10.1137/1.9781611974331.CH132},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BrakensiekGZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BukhG16,
author = {Boris Bukh and
Venkatesan Guruswami},
editor = {Robert Krauthgamer},
title = {An improved bound on the fraction of correctable deletions},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
pages = {1893--1901},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974331.ch133},
doi = {10.1137/1.9781611974331.CH133},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BukhG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuruswamiW16,
author = {Venkatesan Guruswami and
Mary Wootters},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Repairing Reed-solomon codes},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {216--226},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897525},
doi = {10.1145/2897518.2897525},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GuruswamiW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Guruswami16,
author = {Venkatesan Guruswami},
title = {Decoding Reed-Solomon Codes},
booktitle = {Encyclopedia of Algorithms},
pages = {502--506},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_101},
doi = {10.1007/978-1-4939-2864-4\_101},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Guruswami16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Guruswami16,
author = {Venkatesan Guruswami},
title = {Rapidly Mixing Markov Chains: {A} Comparison of Techniques {(A} Survey)},
journal = {CoRR},
volume = {abs/1603.01512},
year = {2016},
url = {http://arxiv.org/abs/1603.01512},
eprinttype = {arXiv},
eprint = {1603.01512},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Guruswami16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BhattiproluGL16,
author = {Vijay V. S. P. Bhattiprolu and
Venkatesan Guruswami and
Euiwoong Lee},
title = {Certifying Random Polynomials over the Unit Sphere via Sum of Squares
Hierarchy},
journal = {CoRR},
volume = {abs/1605.00903},
year = {2016},
url = {http://arxiv.org/abs/1605.00903},
eprinttype = {arXiv},
eprint = {1605.00903},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BhattiproluGL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GuruswamiL16,
author = {Venkatesan Guruswami and
Ray Li},
title = {Efficiently decodable insertion/deletion codes for high-noise and
high-rate regimes},
journal = {CoRR},
volume = {abs/1605.04611},
year = {2016},
url = {http://arxiv.org/abs/1605.04611},
eprinttype = {arXiv},
eprint = {1605.04611},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GuruswamiL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GuruswamiR16,
author = {Venkatesan Guruswami and
Ankit Singh Rawat},
title = {New {MDS} codes with small sub-packetization and near-optimal repair
bandwidth},
journal = {CoRR},
volume = {abs/1608.00191},
year = {2016},
url = {http://arxiv.org/abs/1608.00191},
eprinttype = {arXiv},
eprint = {1608.00191},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GuruswamiR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BhattiproluGLGT16,
author = {Vijay V. S. P. Bhattiprolu and
Mrinalkanti Ghosh and
Euiwoong Lee and
Venkatesan Guruswami and
Madhur Tulsiani},
title = {Multiplicative Approximations for Polynomial Optimization Over the
Unit Sphere},
journal = {CoRR},
volume = {abs/1611.05998},
year = {2016},
url = {http://arxiv.org/abs/1611.05998},
eprinttype = {arXiv},
eprint = {1611.05998},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BhattiproluGLGT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GuruswamiL16a,
author = {Venkatesan Guruswami and
Ray Li},
title = {Codes correcting deletions in oblivious and random models},
journal = {CoRR},
volume = {abs/1612.06335},
year = {2016},
url = {http://arxiv.org/abs/1612.06335},
eprinttype = {arXiv},
eprint = {1612.06335},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GuruswamiL16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BhattiproluGGLT16,
author = {Vijay V. S. P. Bhattiprolu and
Mrinalkanti Ghosh and
Venkatesan Guruswami and
Euiwoong Lee and
Madhur Tulsiani},
title = {Multiplicative Approximations for Polynomial Optimization Over the
Unit Sphere},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-185}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/185},
eprinttype = {ECCC},
eprint = {TR16-185},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BhattiproluGGLT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BrakensiekG16,
author = {Joshua Brakensiek and
Venkatesan Guruswami},
title = {New hardness results for graph and hypergraph colorings},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-029}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/029},
eprinttype = {ECCC},
eprint = {TR16-029},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BrakensiekG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BrakensiekG16a,
author = {Joshua Brakensiek and
Venkatesan Guruswami},
title = {Promise Constraint Satisfaction: Algebraic Structure and a Symmetric
Boolean Dichotomy},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-183}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/183},
eprinttype = {ECCC},
eprint = {TR16-183},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BrakensiekG16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiR16,
author = {Venkatesan Guruswami and
Jaikumar Radhakrishnan},
title = {Tight bounds for communication assisted agreement distillation},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-033}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/033},
eprinttype = {ECCC},
eprint = {TR16-033},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/GuruswamiX15,
author = {Venkatesan Guruswami and
Chaoping Xing},
title = {Optimal rate algebraic list decoding using narrow ray class fields},
journal = {J. Comb. Theory, Ser. {A}},
volume = {129},
pages = {160--183},
year = {2015},
url = {https://doi.org/10.1016/j.jcta.2014.09.003},
doi = {10.1016/J.JCTA.2014.09.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/GuruswamiX15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GuruswamiSS15,
author = {Venkatesan Guruswami and
Sushant Sachdeva and
Rishi Saket},
title = {Inapproximability of Minimum Vertex Cover on k-Uniform k-Partite Hypergraphs},
journal = {{SIAM} J. Discret. Math.},
volume = {29},
number = {1},
pages = {36--58},
year = {2015},
url = {https://doi.org/10.1137/130919416},
doi = {10.1137/130919416},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/GuruswamiSS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GuruswamiX15,
author = {Venkatesan Guruswami and
Patrick Xia},
title = {Polar Codes: Speed of Polarization and Polynomial Gap to Capacity},
journal = {{IEEE} Trans. Inf. Theory},
volume = {61},
number = {1},
pages = {3--16},
year = {2015},
url = {https://doi.org/10.1109/TIT.2014.2371819},
doi = {10.1109/TIT.2014.2371819},
timestamp = {Thu, 23 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/GuruswamiX15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BhattiproluGL15,
author = {Vijay V. S. P. Bhattiprolu and
Venkatesan Guruswami and
Euiwoong Lee},
editor = {Naveen Garg and
Klaus Jansen and
Anup Rao and
Jos{\'{e}} D. P. Rolim},
title = {Approximate Hypergraph Coloring under Low-discrepancy and Related
Promises},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2015, August 24-26, 2015, Princeton,
NJ, {USA}},
series = {LIPIcs},
volume = {40},
pages = {152--174},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.152},
doi = {10.4230/LIPICS.APPROX-RANDOM.2015.152},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/BhattiproluGL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiL15,
author = {Venkatesan Guruswami and
Euiwoong Lee},
editor = {Naveen Garg and
Klaus Jansen and
Anup Rao and
Jos{\'{e}} D. P. Rolim},
title = {Inapproximability of H-Transversal/Packing},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2015, August 24-26, 2015, Princeton,
NJ, {USA}},
series = {LIPIcs},
volume = {40},
pages = {284--304},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.284},
doi = {10.4230/LIPICS.APPROX-RANDOM.2015.284},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/GuruswamiL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiL15a,
author = {Venkatesan Guruswami and
Euiwoong Lee},
editor = {Naveen Garg and
Klaus Jansen and
Anup Rao and
Jos{\'{e}} D. P. Rolim},
title = {Towards a Characterization of Approximation Resistance for Symmetric
CSPs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2015, August 24-26, 2015, Princeton,
NJ, {USA}},
series = {LIPIcs},
volume = {40},
pages = {305--322},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.305},
doi = {10.4230/LIPICS.APPROX-RANDOM.2015.305},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/GuruswamiL15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ForbesG15,
author = {Michael A. Forbes and
Venkatesan Guruswami},
editor = {Naveen Garg and
Klaus Jansen and
Anup Rao and
Jos{\'{e}} D. P. Rolim},
title = {Dimension Expanders via Rank Condensers},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2015, August 24-26, 2015, Princeton,
NJ, {USA}},
series = {LIPIcs},
volume = {40},
pages = {800--814},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.800},
doi = {10.4230/LIPICS.APPROX-RANDOM.2015.800},
timestamp = {Wed, 31 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/ForbesG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiW15,
author = {Venkatesan Guruswami and
Carol Wang},
editor = {Naveen Garg and
Klaus Jansen and
Anup Rao and
Jos{\'{e}} D. P. Rolim},
title = {Deletion Codes in the High-noise and High-rate Regimes},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2015, August 24-26, 2015, Princeton,
NJ, {USA}},
series = {LIPIcs},
volume = {40},
pages = {867--880},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.867},
doi = {10.4230/LIPICS.APPROX-RANDOM.2015.867},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/GuruswamiW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GuruswamiV15,
author = {Venkatesan Guruswami and
Ameya Velingker},
editor = {David Zuckerman},
title = {An Entropy Sumset Inequality and Polynomially Fast Convergence to
Shannon Capacity Over All Alphabets},
booktitle = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19,
2015, Portland, Oregon, {USA}},
series = {LIPIcs},
volume = {33},
pages = {42--57},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.CCC.2015.42},
doi = {10.4230/LIPICS.CCC.2015.42},
timestamp = {Thu, 02 Feb 2023 13:27:06 +0100},
biburl = {https://dblp.org/rec/conf/coco/GuruswamiV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/CanonneGMS15,
author = {Cl{\'{e}}ment Louis Canonne and
Venkatesan Guruswami and
Raghu Meka and
Madhu Sudan},
editor = {Tim Roughgarden},
title = {Communication with Imperfectly Shared Randomness},
booktitle = {Proceedings of the 2015 Conference on Innovations in Theoretical Computer
Science, {ITCS} 2015, Rehovot, Israel, January 11-13, 2015},
pages = {257--262},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2688073.2688099},
doi = {10.1145/2688073.2688099},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/CanonneGMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuruswamiL15,
author = {Venkatesan Guruswami and
Euiwoong Lee},
editor = {Piotr Indyk},
title = {Strong Inapproximability Results on Balanced Rainbow-Colorable Hypergraphs},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
pages = {822--836},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973730.56},
doi = {10.1137/1.9781611973730.56},
timestamp = {Tue, 02 Feb 2021 17:07:30 +0100},
biburl = {https://dblp.org/rec/conf/soda/GuruswamiL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuruswamiSVW15,
author = {Venkatesan Guruswami and
Madhu Sudan and
Ameya Velingker and
Carol Wang},
editor = {Piotr Indyk},
title = {Limitations on Testable Affine-Invariant Codes in the High-Rate Regime},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
pages = {1312--1325},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973730.87},
doi = {10.1137/1.9781611973730.87},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/GuruswamiSVW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/2015,
editor = {Venkatesan Guruswami},
title = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://ieeexplore.ieee.org/xpl/conhome/7352273/proceeding},
isbn = {978-1-4673-8191-8},
timestamp = {Wed, 16 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/2015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GuruswamiL15,
author = {Venkatesan Guruswami and
Euiwoong Lee},
title = {Inapproximability of {\textdollar}H{\textdollar}-Transversal/Packing},
journal = {CoRR},
volume = {abs/1506.06302},
year = {2015},
url = {http://arxiv.org/abs/1506.06302},
eprinttype = {arXiv},
eprint = {1506.06302},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GuruswamiL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BhattiproluGL15,
author = {Vijay V. S. P. Bhattiprolu and
Venkatesan Guruswami and
Euiwoong Lee},
title = {Approximate Hypergraph Coloring under Low-discrepancy and Related
Promises},
journal = {CoRR},
volume = {abs/1506.06444},
year = {2015},
url = {http://arxiv.org/abs/1506.06444},
eprinttype = {arXiv},
eprint = {1506.06444},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BhattiproluGL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BukhG15,
author = {Boris Bukh and
Venkatesan Guruswami},
title = {An improved bound on the fraction of correctable deletions},
journal = {CoRR},
volume = {abs/1507.01719},
year = {2015},
url = {http://arxiv.org/abs/1507.01719},
eprinttype = {arXiv},
eprint = {1507.01719},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BukhG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BrakensiekGZ15,
author = {Joshua Brakensiek and
Venkatesan Guruswami and
Samuel Zbarsky},
title = {Efficient Low-Redundancy Codes for Correcting Multiple Deletions},
journal = {CoRR},
volume = {abs/1507.06175},
year = {2015},
url = {http://arxiv.org/abs/1507.06175},
eprinttype = {arXiv},
eprint = {1507.06175},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BrakensiekGZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GuruswamiJX15,
author = {Venkatesan Guruswami and
Lingfei Jin and
Chaoping Xing},
title = {Efficient list decoding of punctured Reed-Muller codes},
journal = {CoRR},
volume = {abs/1508.00603},
year = {2015},
url = {http://arxiv.org/abs/1508.00603},
eprinttype = {arXiv},
eprint = {1508.00603},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GuruswamiJX15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GuruswamiW15,
author = {Venkatesan Guruswami and
Mary Wootters},
title = {Repairing Reed-Solomon Codes},
journal = {CoRR},
volume = {abs/1509.04764},
year = {2015},
url = {http://arxiv.org/abs/1509.04764},
eprinttype = {arXiv},
eprint = {1509.04764},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GuruswamiW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/BulatovGKM15,
author = {Andrei A. Bulatov and
Venkatesan Guruswami and
Andrei A. Krokhin and
D{\'{a}}niel Marx},
title = {The Constraint Satisfaction Problem: Complexity and Approximability
(Dagstuhl Seminar 15301)},
journal = {Dagstuhl Reports},
volume = {5},
number = {7},
pages = {22--41},
year = {2015},
url = {https://doi.org/10.4230/DagRep.5.7.22},
doi = {10.4230/DAGREP.5.7.22},
timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/BulatovGKM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BrakensiekGZ15,
author = {Joshua Brakensiek and
Venkatesan Guruswami and
Samuel Zbarsky},
title = {Efficient Low-Redundancy Codes for Correcting Multiple Deletions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR15-116}},
year = {2015},
url = {https://eccc.weizmann.ac.il/report/2015/116},
eprinttype = {ECCC},
eprint = {TR15-116},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BrakensiekGZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BukhG15,
author = {Boris Bukh and
Venkatesan Guruswami},
title = {An improved bound on the fraction of correctable deletions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR15-117}},
year = {2015},
url = {https://eccc.weizmann.ac.il/report/2015/117},
eprinttype = {ECCC},
eprint = {TR15-117},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BukhG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiL15,
author = {Venkatesan Guruswami and
Euiwoong Lee},
title = {Towards a Characterization of Approximation Resistance for Symmetric
CSPs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR15-105}},
year = {2015},
url = {https://eccc.weizmann.ac.il/report/2015/105},
eprinttype = {ECCC},
eprint = {TR15-105},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiL15a,
author = {Venkatesan Guruswami and
Euiwoong Lee},
title = {Nearly Optimal NP-Hardness of Unique Coverage},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR15-155}},
year = {2015},
url = {https://eccc.weizmann.ac.il/report/2015/155},
eprinttype = {ECCC},
eprint = {TR15-155},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiL15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamjo/GuruswamiSZ14,
author = {Venkatesan Guruswami and
Ali Kemal Sinop and
Yuan Zhou},
title = {Constant Factor Lasserre Integrality Gaps for Graph Partitioning Problems},
journal = {{SIAM} J. Optim.},
volume = {24},
number = {4},
pages = {1698--1717},
year = {2014},
url = {https://doi.org/10.1137/13093025X},
doi = {10.1137/13093025X},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamjo/GuruswamiSZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GuruswamiN14,
author = {Venkatesan Guruswami and
Srivatsan Narayanan},
title = {Combinatorial Limitations of Average-Radius List-Decoding},
journal = {{IEEE} Trans. Inf. Theory},
volume = {60},
number = {10},
pages = {5827--5842},
year = {2014},
url = {https://doi.org/10.1109/TIT.2014.2343224},
doi = {10.1109/TIT.2014.2343224},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/GuruswamiN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiW14,
author = {Venkatesan Guruswami and
Carol Wang},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Nikhil R. Devanur and
Cristopher Moore},
title = {Evading Subspaces Over Large Fields and Explicit List-decodable Rank-metric
Codes},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2014, September 4-6, 2014, Barcelona,
Spain},
series = {LIPIcs},
volume = {28},
pages = {748--761},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2014},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.748},
doi = {10.4230/LIPICS.APPROX-RANDOM.2014.748},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/GuruswamiW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GuruswamiX14,
author = {Venkatesan Guruswami and
Chaoping Xing},
title = {Hitting Sets for Low-Degree Polynomials with Optimal Density},
booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
BC, Canada, June 11-13, 2014},
pages = {161--168},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/CCC.2014.24},
doi = {10.1109/CCC.2014.24},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GuruswamiX14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AustrinHG14,
author = {Per Austrin and
Johan H{\aa}stad and
Venkatesan Guruswami},
title = {{(2} + epsilon)-Sat Is NP-Hard},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {1--10},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.9},
doi = {10.1109/FOCS.2014.9},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AustrinHG14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/CheraghchiG14,
author = {Mahdi Cheraghchi and
Venkatesan Guruswami},
editor = {Moni Naor},
title = {Capacity of non-malleable codes},
booktitle = {Innovations in Theoretical Computer Science, ITCS'14, Princeton, NJ,
USA, January 12-14, 2014},
pages = {155--168},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2554797.2554814},
doi = {10.1145/2554797.2554814},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/CheraghchiG14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/GuruswamiL14,
author = {Venkatesan Guruswami and
Euiwoong Lee},
editor = {Moni Naor},
title = {Complexity of approximating {CSP} with balance / hard constraints},
booktitle = {Innovations in Theoretical Computer Science, ITCS'14, Princeton, NJ,
USA, January 12-14, 2014},
pages = {439--448},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2554797.2554837},
doi = {10.1145/2554797.2554837},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/GuruswamiL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuruswamiX14,
author = {Venkatesan Guruswami and
Chaoping Xing},
editor = {Chandra Chekuri},
title = {Optimal rate list decoding of folded algebraic-geometric codes over
constant-sized alphabets},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
pages = {1858--1866},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973402.134},
doi = {10.1137/1.9781611973402.134},
timestamp = {Tue, 02 Feb 2021 17:07:40 +0100},
biburl = {https://dblp.org/rec/conf/soda/GuruswamiX14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuruswamiHHSV14,
author = {Venkatesan Guruswami and
Prahladh Harsha and
Johan H{\aa}stad and
Srikanth Srinivasan and
Girish Varma},
editor = {David B. Shmoys},
title = {Super-polylogarithmic hypergraph coloring hardness via low-degree
long codes},
booktitle = {Symposium on Theory of Computing, {STOC} 2014, New York, NY, USA,
May 31 - June 03, 2014},
pages = {614--623},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2591796.2591882},
doi = {10.1145/2591796.2591882},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GuruswamiHHSV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/CheraghchiG14,
author = {Mahdi Cheraghchi and
Venkatesan Guruswami},
editor = {Yehuda Lindell},
title = {Non-malleable Coding against Bit-Wise and Split-State Tampering},
booktitle = {Theory of Cryptography - 11th Theory of Cryptography Conference, {TCC}
2014, San Diego, CA, USA, February 24-26, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8349},
pages = {440--464},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-642-54242-8\_19},
doi = {10.1007/978-3-642-54242-8\_19},
timestamp = {Tue, 14 May 2019 10:00:47 +0200},
biburl = {https://dblp.org/rec/conf/tcc/CheraghchiG14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CanonneGMS14,
author = {Cl{\'{e}}ment L. Canonne and
Venkatesan Guruswami and
Raghu Meka and
Madhu Sudan},
title = {Communication with Imperfectly Shared Randomness},
journal = {CoRR},
volume = {abs/1411.3603},
year = {2014},
url = {http://arxiv.org/abs/1411.3603},
eprinttype = {arXiv},
eprint = {1411.3603},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CanonneGMS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GuruswamiW14,
author = {Venkatesan Guruswami and
Carol Wang},
title = {Deletion codes in the high-noise and high-rate regimes},
journal = {CoRR},
volume = {abs/1411.6667},
year = {2014},
url = {http://arxiv.org/abs/1411.6667},
eprinttype = {arXiv},
eprint = {1411.6667},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GuruswamiW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GuruswamiV14,
author = {Venkatesan Guruswami and
Ameya Velingker},
title = {An Entropy Sumset Inequality and Polynomially Fast Convergence to
Shannon Capacity Over All Alphabets},
journal = {CoRR},
volume = {abs/1411.6993},
year = {2014},
url = {http://arxiv.org/abs/1411.6993},
eprinttype = {arXiv},
eprint = {1411.6993},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GuruswamiV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ForbesG14,
author = {Michael A. Forbes and
Venkatesan Guruswami},
title = {Dimension Expanders via Rank Condensers},
journal = {CoRR},
volume = {abs/1411.7455},
year = {2014},
url = {http://arxiv.org/abs/1411.7455},
eprinttype = {arXiv},
eprint = {1411.7455},
timestamp = {Wed, 31 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ForbesG14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/CanonneGMS14,
author = {Cl{\'{e}}ment L. Canonne and
Venkatesan Guruswami and
Raghu Meka and
Madhu Sudan},
title = {Communication with Imperfectly Shared Randomness},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-153}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/153},
eprinttype = {ECCC},
eprint = {TR14-153},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/CanonneGMS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ForbesG14,
author = {Michael A. Forbes and
Venkatesan Guruswami},
title = {Dimension Expanders via Rank Condensers},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-162}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/162},
eprinttype = {ECCC},
eprint = {TR14-162},
timestamp = {Wed, 31 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ForbesG14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiL14,
author = {Venkatesan Guruswami and
Euiwoong Lee},
title = {Inapproximability of Feedback Vertex Set for Bounded Length Cycles},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-006}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/006},
eprinttype = {ECCC},
eprint = {TR14-006},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiL14a,
author = {Venkatesan Guruswami and
Euiwoong Lee},
title = {Strong Inapproximability Results on Balanced Rainbow-Colorable Hypergraphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-043}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/043},
eprinttype = {ECCC},
eprint = {TR14-043},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiL14a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiSVW14,
author = {Venkatesan Guruswami and
Madhu Sudan and
Ameya Velingker and
Carol Wang},
title = {Limitations on Testable Affine-Invariant Codes in the High-Rate Regime},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-067}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/067},
eprinttype = {ECCC},
eprint = {TR14-067},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiSVW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiV14,
author = {Venkatesan Guruswami and
Ameya Velingker},
title = {An Entropy Sumset Inequality and Polynomially Fast Convergence to
Shannon Capacity Over All Alphabets},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-165}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/165},
eprinttype = {ECCC},
eprint = {TR14-165},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CheraghchiGV13,
author = {Mahdi Cheraghchi and
Venkatesan Guruswami and
Ameya Velingker},
title = {Restricted Isometry of Fourier Matrices and List Decodability of Random
Linear Codes},
journal = {{SIAM} J. Comput.},
volume = {42},
number = {5},
pages = {1888--1914},
year = {2013},
url = {https://doi.org/10.1137/120896773},
doi = {10.1137/120896773},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CheraghchiGV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GuruswamiW13,
author = {Venkatesan Guruswami and
Carol Wang},
title = {Linear-Algebraic List Decoding for Variants of Reed-Solomon Codes},
journal = {{IEEE} Trans. Inf. Theory},
volume = {59},
number = {6},
pages = {3257--3268},
year = {2013},
url = {https://doi.org/10.1109/TIT.2013.2246813},
doi = {10.1109/TIT.2013.2246813},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/GuruswamiW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/GuruswamiS13,
author = {Venkatesan Guruswami and
Ali Kemal Sinop},
title = {Improved Inapproximability Results for Maximum k-Colorable Subgraph},
journal = {Theory Comput.},
volume = {9},
pages = {413--435},
year = {2013},
url = {https://doi.org/10.4086/toc.2013.v009a011},
doi = {10.4086/TOC.2013.V009A011},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/GuruswamiS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiN13,
author = {Venkatesan Guruswami and
Srivatsan Narayanan},
editor = {Prasad Raghavendra and
Sofya Raskhodnikova and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim},
title = {Combinatorial Limitations of Average-Radius List Decoding},
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 = {591--606},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40328-6\_41},
doi = {10.1007/978-3-642-40328-6\_41},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/GuruswamiN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GuruswamiO13,
author = {Venkatesan Guruswami and
Krzysztof Onak},
title = {Superlinear Lower Bounds for Multipass Graph Processing},
booktitle = {Proceedings of the 28th Conference on Computational Complexity, {CCC}
2013, K.lo Alto, California, USA, 5-7 June, 2013},
pages = {287--298},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/CCC.2013.37},
doi = {10.1109/CCC.2013.37},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GuruswamiO13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GuruswamiX13,
author = {Venkatesan Guruswami and
Patrick Xia},
title = {Polar Codes: Speed of Polarization and Polynomial Gap to Capacity},
booktitle = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2013, 26-29 October, 2013, Berkeley, CA, {USA}},
pages = {310--319},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/FOCS.2013.41},
doi = {10.1109/FOCS.2013.41},
timestamp = {Thu, 23 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GuruswamiX13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DinurG13,
author = {Irit Dinur and
Venkatesan Guruswami},
title = {PCPs via Low-Degree Long Code and Hardness for Constrained Hypergraph
Coloring},
booktitle = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2013, 26-29 October, 2013, Berkeley, CA, {USA}},
pages = {340--349},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/FOCS.2013.44},
doi = {10.1109/FOCS.2013.44},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/DinurG13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GuruswamiK13,
author = {Venkatesan Guruswami and
Swastik Kopparty},
title = {Explicit Subspace Designs},
booktitle = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2013, 26-29 October, 2013, Berkeley, CA, {USA}},
pages = {608--617},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/FOCS.2013.71},
doi = {10.1109/FOCS.2013.71},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GuruswamiK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Guruswami13,
author = {Venkatesan Guruswami},
editor = {Anil Seth and
Nisheeth K. Vishnoi},
title = {Polar Codes: Reliable Communication with Complexity Polynomial in
the Gap to Shannon Capacity (Invited Talk)},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2013, December 12-14, 2013,
Guwahati, India},
series = {LIPIcs},
volume = {24},
pages = {1--1},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2013},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2013.1},
doi = {10.4230/LIPICS.FSTTCS.2013.1},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/Guruswami13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuruswamiS13,
author = {Venkatesan Guruswami and
Ali Kemal Sinop},
editor = {Sanjeev Khanna},
title = {Approximating Non-Uniform Sparsest Cut Via Generalized Spectra},
booktitle = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2013, New Orleans, Louisiana, USA, January 6-8,
2013},
pages = {295--305},
publisher = {{SIAM}},
year = {2013},
url = {https://doi.org/10.1137/1.9781611973105.22},
doi = {10.1137/1.9781611973105.22},
timestamp = {Tue, 02 Feb 2021 17:07:29 +0100},
biburl = {https://dblp.org/rec/conf/soda/GuruswamiS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CheraghchiGV13,
author = {Mahdi Cheraghchi and
Venkatesan Guruswami and
Ameya Velingker},
editor = {Sanjeev Khanna},
title = {Restricted Isometry of Fourier Matrices and List Decodability of Random
Linear Codes},
booktitle = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2013, New Orleans, Louisiana, USA, January 6-8,
2013},
pages = {432--442},
publisher = {{SIAM}},
year = {2013},
url = {https://doi.org/10.1137/1.9781611973105.31},
doi = {10.1137/1.9781611973105.31},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/CheraghchiGV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuruswamiX13,
author = {Venkatesan Guruswami and
Chaoping Xing},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes
up to the singleton bound},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {843--852},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488715},
doi = {10.1145/2488608.2488715},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GuruswamiX13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/www/BeutelXGPF13,
author = {Alex Beutel and
Wanhong Xu and
Venkatesan Guruswami and
Christopher Palow and
Christos Faloutsos},
editor = {Daniel Schwabe and
Virg{\'{\i}}lio A. F. Almeida and
Hartmut Glaser and
Ricardo Baeza{-}Yates and
Sue B. Moon},
title = {CopyCatch: stopping group attacks by spotting lockstep behavior in
social networks},
booktitle = {22nd International World Wide Web Conference, {WWW} '13, Rio de Janeiro,
Brazil, May 13-17, 2013},
pages = {119--130},
publisher = {International World Wide Web Conferences Steering Committee / {ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488388.2488400},
doi = {10.1145/2488388.2488400},
timestamp = {Sun, 22 Sep 2019 18:15:38 +0200},
biburl = {https://dblp.org/rec/conf/www/BeutelXGPF13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1302-6660,
author = {Venkatesan Guruswami and
Chaoping Xing},
title = {Optimal rate algebraic list decoding using narrow ray class fields},
journal = {CoRR},
volume = {abs/1302.6660},
year = {2013},
url = {http://arxiv.org/abs/1302.6660},
eprinttype = {arXiv},
eprint = {1302.6660},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1302-6660.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-4321,
author = {Venkatesan Guruswami and
Patrick Xia},
title = {Polar Codes: Speed of polarization and polynomial gap to capacity},
journal = {CoRR},
volume = {abs/1304.4321},
year = {2013},
url = {http://arxiv.org/abs/1304.4321},
eprinttype = {arXiv},
eprint = {1304.4321},
timestamp = {Thu, 23 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1304-4321.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CheraghchiG13,
author = {Mahdi Cheraghchi and
Venkatesan Guruswami},
title = {Capacity of Non-Malleable Codes},
journal = {CoRR},
volume = {abs/1309.0458},
year = {2013},
url = {http://arxiv.org/abs/1309.0458},
eprinttype = {arXiv},
eprint = {1309.0458},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CheraghchiG13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CheraghchiG13a,
author = {Mahdi Cheraghchi and
Venkatesan Guruswami},
title = {Non-Malleable Coding Against Bit-wise and Split-State Tampering},
journal = {CoRR},
volume = {abs/1309.1151},
year = {2013},
url = {http://arxiv.org/abs/1309.1151},
eprinttype = {arXiv},
eprint = {1309.1151},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CheraghchiG13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GuruswamiW13,
author = {Venkatesan Guruswami and
Carol Wang},
title = {Explicit rank-metric codes list-decodable with optimal redundancy},
journal = {CoRR},
volume = {abs/1311.7084},
year = {2013},
url = {http://arxiv.org/abs/1311.7084},
eprinttype = {arXiv},
eprint = {1311.7084},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GuruswamiW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GuruswamiHHSV13,
author = {Venkatesan Guruswami and
Johan H{\aa}stad and
Prahladh Harsha and
Srikanth Srinivasan and
Girish Varma},
title = {Super-polylogarithmic hypergraph coloring hardness via low-degree
long codes},
journal = {CoRR},
volume = {abs/1311.7407},
year = {2013},
url = {http://arxiv.org/abs/1311.7407},
eprinttype = {arXiv},
eprint = {1311.7407},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GuruswamiHHSV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GuruswamiS13,
author = {Venkatesan Guruswami and
Ali Kemal Sinop},
title = {Rounding Lasserre SDPs using column selection and spectrum-based approximation
schemes for graph partitioning and Quadratic IPs},
journal = {CoRR},
volume = {abs/1312.3024},
year = {2013},
url = {http://arxiv.org/abs/1312.3024},
eprinttype = {arXiv},
eprint = {1312.3024},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GuruswamiS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AustrinGH13,
author = {Per Austrin and
Venkatesan Guruswami and
Johan H{\aa}stad},
title = {(2+{\(\epsilon\)})-SAT is NP-hard},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-159}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/159},
eprinttype = {ECCC},
eprint = {TR13-159},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AustrinGH13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/CheraghchiG13,
author = {Mahdi Cheraghchi and
Venkatesan Guruswami},
title = {Capacity of Non-Malleable Codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-118}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/118},
eprinttype = {ECCC},
eprint = {TR13-118},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/CheraghchiG13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/CheraghchiG13a,
author = {Mahdi Cheraghchi and
Venkatesan Guruswami},
title = {Non-Malleable Coding Against Bit-wise and Split-State Tampering},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-121}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/121},
eprinttype = {ECCC},
eprint = {TR13-121},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/CheraghchiG13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DinurG13a,
author = {Irit Dinur and
Venkatesan Guruswami},
title = {PCPs via low-degree long code and hardness for constrained hypergraph
coloring},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-122}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/122},
eprinttype = {ECCC},
eprint = {TR13-122},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DinurG13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiHHSV13,
author = {Venkatesan Guruswami and
Prahladh Harsha and
Johan H{\aa}stad and
Srikanth Srinivasan and
Girish Varma},
title = {Super-polylogarithmic hypergraph coloring hardness via low-degree
long codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-167}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/167},
eprinttype = {ECCC},
eprint = {TR13-167},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiHHSV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiK13,
author = {Venkatesan Guruswami and
Swastik Kopparty},
title = {Explicit Subspace Designs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-060}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/060},
eprinttype = {ECCC},
eprint = {TR13-060},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiL13,
author = {Venkatesan Guruswami and
Euiwoong Lee},
title = {Complexity of approximating {CSP} with Balance / Hard Constraints},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-125}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/125},
eprinttype = {ECCC},
eprint = {TR13-125},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiO13,
author = {Venkatesan Guruswami and
Krzysztof Onak},
title = {Superlinear lower bounds for multipass graph processing},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-002}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/002},
eprinttype = {ECCC},
eprint = {TR13-002},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiO13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiSS13,
author = {Venkatesan Guruswami and
Sushant Sachdeva and
Rishi Saket},
title = {Inapproximability of Minimum Vertex Cover on k-uniform k-partite Hypergraphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-071}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/071},
eprinttype = {ECCC},
eprint = {TR13-071},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiW13,
author = {Venkatesan Guruswami and
Carol Wang},
title = {Explicit rank-metric codes list-decodable with optimal redundancy},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-170}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/170},
eprinttype = {ECCC},
eprint = {TR13-170},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiX13,
author = {Venkatesan Guruswami and
Chaoping Xing},
title = {Optimal rate list decoding of folded algebraic-geometric codes over
constant-sized alphabets},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-046}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/046},
eprinttype = {ECCC},
eprint = {TR13-046},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiX13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiX13a,
author = {Venkatesan Guruswami and
Patrick Xia},
title = {Polar Codes: Speed of polarization and polynomial gap to capacity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-050}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/050},
eprinttype = {ECCC},
eprint = {TR13-050},
timestamp = {Thu, 23 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiX13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiX13b,
author = {Venkatesan Guruswami and
Chaoping Xing},
title = {Hitting Sets for Low-Degree Polynomials with Optimal Density},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-175}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/175},
eprinttype = {ECCC},
eprint = {TR13-175},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiX13b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/CheraghchiG13,
author = {Mahdi Cheraghchi and
Venkatesan Guruswami},
title = {Capacity of Non-Malleable Codes},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {564},
year = {2013},
url = {http://eprint.iacr.org/2013/564},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/CheraghchiG13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/CheraghchiG13a,
author = {Mahdi Cheraghchi and
Venkatesan Guruswami},
title = {Non-Malleable Coding Against Bit-wise and Split-State Tampering},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {565},
year = {2013},
url = {http://eprint.iacr.org/2013/565},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/CheraghchiG13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FeldmanGRW12,
author = {Vitaly Feldman and
Venkatesan Guruswami and
Prasad Raghavendra and
Yi Wu},
title = {Agnostic Learning of Monomials by Halfspaces Is Hard},
journal = {{SIAM} J. Comput.},
volume = {41},
number = {6},
pages = {1558--1590},
year = {2012},
url = {https://doi.org/10.1137/120865094},
doi = {10.1137/120865094},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FeldmanGRW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/GuruswamiZ12,
author = {Venkatesan Guruswami and
Yuan Zhou},
title = {Tight Bounds on the Approximability of Almost-Satisfiable Horn {SAT}
and Exact Hitting Set},
journal = {Theory Comput.},
volume = {8},
number = {1},
pages = {239--267},
year = {2012},
url = {https://doi.org/10.4086/toc.2012.v008a011},
doi = {10.4086/TOC.2012.V008A011},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/GuruswamiZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiZ12,
author = {Venkatesan Guruswami and
Yuan Zhou},
editor = {Anupam Gupta and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Rocco A. Servedio},
title = {Approximating Bounded Occurrence Ordering CSPs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques - 15th International Workshop, {APPROX} 2012, and 16th
International Workshop, {RANDOM} 2012, Cambridge, MA, USA, August
15-17, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7408},
pages = {158--169},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32512-0\_14},
doi = {10.1007/978-3-642-32512-0\_14},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/GuruswamiZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GuruswamiS12,
author = {Venkatesan Guruswami and
Ali Kemal Sinop},
title = {Faster {SDP} Hierarchy Solvers for Local Rounding Algorithms},
booktitle = {53rd Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2012, New Brunswick, NJ, USA, October 20-23, 2012},
pages = {197--206},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/FOCS.2012.58},
doi = {10.1109/FOCS.2012.58},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GuruswamiS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/GuruswamiNW12,
author = {Venkatesan Guruswami and
Srivatsan Narayanan and
Carol Wang},
editor = {Shafi Goldwasser},
title = {List decoding subspace codes from insertions and deletions},
booktitle = {Innovations in Theoretical Computer Science 2012, Cambridge, MA, USA,
January 8-10, 2012},
pages = {183--189},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2090236.2090252},
doi = {10.1145/2090236.2090252},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/GuruswamiNW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BhaskaraCVGZ12,
author = {Aditya Bhaskara and
Moses Charikar and
Aravindan Vijayaraghavan and
Venkatesan Guruswami and
Yuan Zhou},
editor = {Yuval Rabani},
title = {Polynomial integrality gaps for strong {SDP} relaxations of Densest
\emph{k}-subgraph},
booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
pages = {388--405},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973099.34},
doi = {10.1137/1.9781611973099.34},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BhaskaraCVGZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuruswamiRSW12,
author = {Venkatesan Guruswami and
Prasad Raghavendra and
Rishi Saket and
Yi Wu},
editor = {Yuval Rabani},
title = {Bypassing {UGC} from some optimal geometric inapproximability results},
booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
pages = {699--717},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973099.58},
doi = {10.1137/1.9781611973099.58},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/GuruswamiRSW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuruswamiS12,
author = {Venkatesan Guruswami and
Ali Kemal Sinop},
editor = {Yuval Rabani},
title = {Optimal column-based low-rank matrix reconstruction},
booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
pages = {1207--1214},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973099.95},
doi = {10.1137/1.9781611973099.95},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/GuruswamiS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuruswamiX12,
author = {Venkatesan Guruswami and
Chaoping Xing},
editor = {Howard J. Karloff and
Toniann Pitassi},
title = {Folded codes from function field towers and improved optimal rate
list decoding},
booktitle = {Proceedings of the 44th Symposium on Theory of Computing Conference,
{STOC} 2012, New York, NY, USA, May 19 - 22, 2012},
pages = {339--350},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2213977.2214009},
doi = {10.1145/2213977.2214009},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GuruswamiX12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-0535,
author = {Venkatesan Guruswami and
Srivatsan Narayanan and
Carol Wang},
title = {List decoding subspace codes from insertions and deletions},
journal = {CoRR},
volume = {abs/1202.0535},
year = {2012},
url = {http://arxiv.org/abs/1202.0535},
eprinttype = {arXiv},
eprint = {1202.0535},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-0535.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-6071,
author = {Venkatesan Guruswami and
Ali Kemal Sinop and
Yuan Zhou},
title = {Constant Factor Lasserre Integrality Gaps for Graph Partitioning Problems},
journal = {CoRR},
volume = {abs/1202.6071},
year = {2012},
url = {http://arxiv.org/abs/1202.6071},
eprinttype = {arXiv},
eprint = {1202.6071},
timestamp = {Wed, 04 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-6071.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-6086,
author = {Venkatesan Guruswami and
Srivatsan Narayanan},
title = {Combinatorial limitations of a strong form of list decoding},
journal = {CoRR},
volume = {abs/1202.6086},
year = {2012},
url = {http://arxiv.org/abs/1202.6086},
eprinttype = {arXiv},
eprint = {1202.6086},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-6086.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1204-4209,
author = {Venkatesan Guruswami and
Chaoping Xing},
title = {Folded Codes from Function Field Towers and Improved Optimal Rate
List Decoding},
journal = {CoRR},
volume = {abs/1204.4209},
year = {2012},
url = {http://arxiv.org/abs/1204.4209},
eprinttype = {arXiv},
eprint = {1204.4209},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1204-4209.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-1140,
author = {Mahdi Cheraghchi and
Venkatesan Guruswami and
Ameya Velingker},
title = {Restricted Isometry of Fourier Matrices and List Decodability of Random
Linear Codes},
journal = {CoRR},
volume = {abs/1207.1140},
year = {2012},
url = {http://arxiv.org/abs/1207.1140},
eprinttype = {arXiv},
eprint = {1207.1140},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1207-1140.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-4372,
author = {Venkatesan Guruswami and
Ali Kemal Sinop},
title = {Faster {SDP} hierarchy solvers for local rounding algorithms},
journal = {CoRR},
volume = {abs/1207.4372},
year = {2012},
url = {http://arxiv.org/abs/1207.4372},
eprinttype = {arXiv},
eprint = {1207.4372},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1207-4372.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1212-6925,
author = {Venkatesan Guruswami and
Krzysztof Onak},
title = {Superlinear lower bounds for multipass graph processing},
journal = {CoRR},
volume = {abs/1212.6925},
year = {2012},
url = {http://arxiv.org/abs/1212.6925},
eprinttype = {arXiv},
eprint = {1212.6925},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1212-6925.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/CheraghchiGV12,
author = {Mahdi Cheraghchi and
Venkatesan Guruswami and
Ameya Velingker},
title = {Restricted Isometry of Fourier Matrices and List Decodability of Random
Linear Codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-082}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/082},
eprinttype = {ECCC},
eprint = {TR12-082},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/CheraghchiGV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiN12,
author = {Venkatesan Guruswami and
Srivatsan Narayanan},
title = {Combinatorial limitations of a strong form of list decoding},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-017}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/017},
eprinttype = {ECCC},
eprint = {TR12-017},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiN12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiS12,
author = {Venkatesan Guruswami and
Ali Kemal Sinop},
title = {Faster {SDP} hierarchy solvers for local rounding algorithms},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-111}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/111},
eprinttype = {ECCC},
eprint = {TR12-111},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiW12,
author = {Venkatesan Guruswami and
Carol Wang},
title = {Linear-algebraic list decoding for variants of Reed-Solomon codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-073}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/073},
eprinttype = {ECCC},
eprint = {TR12-073},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiX12,
author = {Venkatesan Guruswami and
Chaoping Xing},
title = {Folded Codes from Function Field Towers and Improved Optimal Rate
List Decoding},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-036}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/036},
eprinttype = {ECCC},
eprint = {TR12-036},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiX12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiX12a,
author = {Venkatesan Guruswami and
Chaoping Xing},
title = {List decoding Reed-Solomon, Algebraic-Geometric, and Gabidulin subcodes
up to the Singleton bound},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-146}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/146},
eprinttype = {ECCC},
eprint = {TR12-146},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiX12a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiZ12,
author = {Venkatesan Guruswami and
Yuan Zhou},
title = {Approximating Bounded Occurrence Ordering CSPs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-074}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/074},
eprinttype = {ECCC},
eprint = {TR12-074},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/ChakrabartiGWW11,
author = {Amit Chakrabarti and
Venkatesan Guruswami and
Andrew Wirth and
Anthony Wirth},
title = {The query complexity of estimating weighted averages},
journal = {Acta Informatica},
volume = {48},
number = {7-8},
pages = {417--426},
year = {2011},
url = {https://doi.org/10.1007/s00236-011-0145-8},
doi = {10.1007/S00236-011-0145-8},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/ChakrabartiGWW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GopalanG11,
author = {Parikshit Gopalan and
Venkatesan Guruswami},
title = {Hardness amplification within {NP} against deterministic algorithms},
journal = {J. Comput. Syst. Sci.},
volume = {77},
number = {1},
pages = {107--121},
year = {2011},
url = {https://doi.org/10.1016/j.jcss.2010.06.008},
doi = {10.1016/J.JCSS.2010.06.008},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/GopalanG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GuruswamiHMRC11,
author = {Venkatesan Guruswami and
Johan H{\aa}stad and
Rajsekar Manokaran and
Prasad Raghavendra and
Moses Charikar},
title = {Beating the Random Ordering Is Hard: Every Ordering {CSP} Is Approximation
Resistant},
journal = {{SIAM} J. Comput.},
volume = {40},
number = {3},
pages = {878--914},
year = {2011},
url = {https://doi.org/10.1137/090756144},
doi = {10.1137/090756144},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/GuruswamiHMRC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GopalanGR11,
author = {Parikshit Gopalan and
Venkatesan Guruswami and
Prasad Raghavendra},
title = {List Decoding Tensor Products and Interleaved Codes},
journal = {{SIAM} J. Comput.},
volume = {40},
number = {5},
pages = {1432--1462},
year = {2011},
url = {https://doi.org/10.1137/090778274},
doi = {10.1137/090778274},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GopalanGR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChawlaDG11,
author = {Shuchi Chawla and
Cynthia Dwork and
Venkatesan Guruswami},
title = {Special Section on the Fortieth Annual {ACM} Symposium On Theory Of
Computing {(STOC} 2008)},
journal = {{SIAM} J. Comput.},
volume = {40},
number = {6},
pages = {1738},
year = {2011},
url = {https://doi.org/10.1137/SMJCAT000040000006001738000001},
doi = {10.1137/SMJCAT000040000006001738000001},
timestamp = {Fri, 23 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChawlaDG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GuruswamiR11,
author = {Venkatesan Guruswami and
Atri Rudra},
title = {Soft Decoding, Dual {BCH} Codes, and Better List-Decodable varepsilon-Biased
Codes},
journal = {{IEEE} Trans. Inf. Theory},
volume = {57},
number = {2},
pages = {705--717},
year = {2011},
url = {https://doi.org/10.1109/TIT.2010.2095193},
doi = {10.1109/TIT.2010.2095193},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/GuruswamiR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GuruswamiHK11,
author = {Venkatesan Guruswami and
Johan H{\aa}stad and
Swastik Kopparty},
title = {On the List-Decodability of Random Linear Codes},
journal = {{IEEE} Trans. Inf. Theory},
volume = {57},
number = {2},
pages = {718--725},
year = {2011},
url = {https://doi.org/10.1109/TIT.2010.2095170},
doi = {10.1109/TIT.2010.2095170},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/GuruswamiHK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiW11,
author = {Venkatesan Guruswami and
Carol Wang},
editor = {Leslie Ann Goldberg and
Klaus Jansen and
R. Ravi and
Jos{\'{e}} D. P. Rolim},
title = {Optimal Rate List Decoding via Derivative Codes},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
17-19, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6845},
pages = {593--604},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22935-0\_50},
doi = {10.1007/978-3-642-22935-0\_50},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/GuruswamiW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Guruswami11,
author = {Venkatesan Guruswami},
title = {Linear-Algebraic List Decoding of Folded Reed-Solomon Codes},
booktitle = {Proceedings of the 26th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2011, San Jose, California, USA, June 8-10, 2011},
pages = {77--85},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/CCC.2011.22},
doi = {10.1109/CCC.2011.22},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Guruswami11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GuruswamiS11,
author = {Venkatesan Guruswami and
Ali Kemal Sinop},
editor = {Rafail Ostrovsky},
title = {Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes
for Graph Partitioning and Quadratic Integer Programming with {PSD}
Objectives},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {482--491},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.36},
doi = {10.1109/FOCS.2011.36},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GuruswamiS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/GuruswamiMRSZ11,
author = {Venkatesan Guruswami and
Yury Makarychev and
Prasad Raghavendra and
David Steurer and
Yuan Zhou},
editor = {Bernard Chazelle},
title = {Finding Almost-Perfect Graph Bisections},
booktitle = {Innovations in Computer Science - {ICS} 2011, Tsinghua University,
Beijing, China, January 7-9, 2011. Proceedings},
pages = {321--337},
publisher = {Tsinghua University Press},
year = {2011},
url = {http://conference.iiis.tsinghua.edu.cn/ICS2011/content/papers/11.html},
timestamp = {Mon, 23 Mar 2020 08:26:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/GuruswamiMRSZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuruswamiZ11,
author = {Venkatesan Guruswami and
Yuan Zhou},
editor = {Dana Randall},
title = {Tight Bounds on the Approximability of Almost-satisfiable Horn {SAT}
and Exact Hitting Set},
booktitle = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25,
2011},
pages = {1574--1589},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973082.122},
doi = {10.1137/1.9781611973082.122},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/GuruswamiZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuruswamiS11,
author = {Venkatesan Guruswami and
Ali Kemal Sinop},
editor = {Dana Randall},
title = {The complexity of finding independent sets in bounded degree (hyper)graphs
of low chromatic number},
booktitle = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25,
2011},
pages = {1615--1626},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973082.125},
doi = {10.1137/1.9781611973082.125},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/GuruswamiS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-1732,
author = {Venkatesan Guruswami and
Ali Kemal Sinop},
title = {Optimal Column-Based Low-Rank Matrix Reconstruction},
journal = {CoRR},
volume = {abs/1104.1732},
year = {2011},
url = {http://arxiv.org/abs/1104.1732},
eprinttype = {arXiv},
eprint = {1104.1732},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1104-1732.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-4746,
author = {Venkatesan Guruswami and
Ali Kemal Sinop},
title = {Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes
for Quadratic Integer Programming with {PSD} Objectives},
journal = {CoRR},
volume = {abs/1104.4746},
year = {2011},
url = {http://arxiv.org/abs/1104.4746},
eprinttype = {arXiv},
eprint = {1104.4746},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1104-4746.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1106-0436,
author = {Venkatesan Guruswami},
title = {Linear-algebraic list decoding of folded Reed-Solomon codes},
journal = {CoRR},
volume = {abs/1106.0436},
year = {2011},
url = {http://arxiv.org/abs/1106.0436},
eprinttype = {arXiv},
eprint = {1106.0436},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1106-0436.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1106-3951,
author = {Venkatesan Guruswami and
Carol Wang},
title = {Optimal rate list decoding via derivative codes},
journal = {CoRR},
volume = {abs/1106.3951},
year = {2011},
url = {http://arxiv.org/abs/1106.3951},
eprinttype = {arXiv},
eprint = {1106.3951},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1106-3951.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1110-1360,
author = {Aditya Bhaskara and
Moses Charikar and
Venkatesan Guruswami and
Aravindan Vijayaraghavan and
Yuan Zhou},
title = {Polynomial integrality gaps for strong {SDP} relaxations of Densest
k-subgraph},
journal = {CoRR},
volume = {abs/1110.1360},
year = {2011},
url = {http://arxiv.org/abs/1110.1360},
eprinttype = {arXiv},
eprint = {1110.1360},
timestamp = {Wed, 04 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1110-1360.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1112-4109,
author = {Venkatesan Guruswami and
Ali Kemal Sinop},
title = {Certifying Graph Expansion and Non-Uniform Sparsity via Generalized
Spectra},
journal = {CoRR},
volume = {abs/1112.4109},
year = {2011},
url = {http://arxiv.org/abs/1112.4109},
eprinttype = {arXiv},
eprint = {1112.4109},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1112-4109.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiHMRC11,
author = {Venkatesan Guruswami and
Johan H{\aa}stad and
Rajsekar Manokaran and
Prasad Raghavendra and
Moses Charikar},
title = {Beating the Random Ordering is Hard: Every ordering {CSP} is approximation
resistant},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR11-027}},
year = {2011},
url = {https://eccc.weizmann.ac.il/report/2011/027},
eprinttype = {ECCC},
eprint = {TR11-027},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiHMRC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiS11,
author = {Venkatesan Guruswami and
Ali Kemal Sinop},
title = {Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes
for Quadratic Integer Programming with {PSD} Objectives},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR11-066}},
year = {2011},
url = {https://eccc.weizmann.ac.il/report/2011/066},
eprinttype = {ECCC},
eprint = {TR11-066},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/GuruswamiLR10,
author = {Venkatesan Guruswami and
James R. Lee and
Alexander A. Razborov},
title = {Almost Euclidean subspaces of \emph{l} \({}_{\mbox{1}}\)\({}^{\mbox{\emph{N}}}\)
{VIA} expander codes},
journal = {Comb.},
volume = {30},
number = {1},
pages = {47--68},
year = {2010},
url = {https://doi.org/10.1007/s00493-010-2463-9},
doi = {10.1007/S00493-010-2463-9},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/GuruswamiLR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/AndrewsCGKTZ10,
author = {Matthew Andrews and
Julia Chuzhoy and
Venkatesan Guruswami and
Sanjeev Khanna and
Kunal Talwar and
Lisa Zhang},
title = {Inapproximability of Edge-Disjoint Paths and low congestion routing
on undirected graphs},
journal = {Comb.},
volume = {30},
number = {5},
pages = {485--520},
year = {2010},
url = {https://doi.org/10.1007/s00493-010-2455-9},
doi = {10.1007/S00493-010-2455-9},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/AndrewsCGKTZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Ben-SassonGKSV10,
author = {Eli Ben{-}Sasson and
Venkatesan Guruswami and
Tali Kaufman and
Madhu Sudan and
Michael Viderman},
title = {Locally Testable Codes Require Redundant Testers},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {7},
pages = {3230--3247},
year = {2010},
url = {https://doi.org/10.1137/090779875},
doi = {10.1137/090779875},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Ben-SassonGKSV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GuruswamiR10,
author = {Venkatesan Guruswami and
Atri Rudra},
title = {The existence of concatenated codes list-decodable up to the hamming
bound},
journal = {{IEEE} Trans. Inf. Theory},
volume = {56},
number = {10},
pages = {5195--5206},
year = {2010},
url = {https://doi.org/10.1109/TIT.2010.2059572},
doi = {10.1109/TIT.2010.2059572},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/GuruswamiR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GuruswamiV10,
author = {Venkatesan Guruswami and
Salil P. Vadhan},
title = {A Lower Bound on List Size for List Decoding},
journal = {{IEEE} Trans. Inf. Theory},
volume = {56},
number = {11},
pages = {5681--5688},
year = {2010},
url = {https://doi.org/10.1109/TIT.2010.2070170},
doi = {10.1109/TIT.2010.2070170},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/GuruswamiV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GuruswamiS10,
author = {Venkatesan Guruswami and
Adam D. Smith},
title = {Codes for Computationally Simple Channels: Explicit Constructions
with Optimal Rate},
booktitle = {51th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2010, October 23-26, 2010, Las Vegas, Nevada, {USA}},
pages = {723--732},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/FOCS.2010.74},
doi = {10.1109/FOCS.2010.74},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GuruswamiS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GuruswamiS10,
author = {Venkatesan Guruswami and
Rishi Saket},
editor = {Samson Abramsky and
Cyril Gavoille and
Claude Kirchner and
Friedhelm Meyer auf der Heide and
Paul G. Spirakis},
title = {On the Inapproximability of Vertex Cover on \emph{k}-Partite \emph{k}-Uniform
Hypergraphs},
booktitle = {Automata, Languages and Programming, 37th International Colloquium,
{ICALP} 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6198},
pages = {360--371},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-14165-2\_31},
doi = {10.1007/978-3-642-14165-2\_31},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GuruswamiS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GuruswamiKOPTW10,
author = {Venkatesan Guruswami and
Subhash Khot and
Ryan O'Donnell and
Preyas Popat and
Madhur Tulsiani and
Yi Wu},
editor = {Samson Abramsky and
Cyril Gavoille and
Claude Kirchner and
Friedhelm Meyer auf der Heide and
Paul G. Spirakis},
title = {{SDP} Gaps for 2-to-1 and Other Label-Cover Variants},
booktitle = {Automata, Languages and Programming, 37th International Colloquium,
{ICALP} 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6198},
pages = {617--628},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-14165-2\_52},
doi = {10.1007/978-3-642-14165-2\_52},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GuruswamiKOPTW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuruswamiHK10,
author = {Venkatesan Guruswami and
Johan H{\aa}stad and
Swastik Kopparty},
editor = {Leonard J. Schulman},
title = {On the list-decodability of random linear codes},
booktitle = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing, {STOC}
2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
pages = {409--416},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1806689.1806747},
doi = {10.1145/1806689.1806747},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GuruswamiHK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1001-1386,
author = {Venkatesan Guruswami and
Johan H{\aa}stad and
Swastik Kopparty},
title = {On the List-Decodability of Random Linear Codes},
journal = {CoRR},
volume = {abs/1001.1386},
year = {2010},
url = {http://arxiv.org/abs/1001.1386},
eprinttype = {arXiv},
eprint = {1001.1386},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1001-1386.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1004-4017,
author = {Venkatesan Guruswami and
Adam D. Smith},
title = {Codes for Computationally Simple Channels: Explicit Constructions
with Optimal Rate},
journal = {CoRR},
volume = {abs/1004.4017},
year = {2010},
url = {http://arxiv.org/abs/1004.4017},
eprinttype = {arXiv},
eprint = {1004.4017},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1004-4017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1012-0729,
author = {Vitaly Feldman and
Venkatesan Guruswami and
Prasad Raghavendra and
Yi Wu},
title = {Agnostic Learning of Monomials by Halfspaces is Hard},
journal = {CoRR},
volume = {abs/1012.0729},
year = {2010},
url = {http://arxiv.org/abs/1012.0729},
eprinttype = {arXiv},
eprint = {1012.0729},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1012-0729.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FeldmanGRW10,
author = {Vitaly Feldman and
Venkatesan Guruswami and
Prasad Raghavendra and
Yi Wu},
title = {Agnostic Learning of Monomials by Halfspaces is Hard},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-185}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/185},
eprinttype = {ECCC},
eprint = {TR10-185},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/FeldmanGRW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiHK10,
author = {Venkatesan Guruswami and
Johan H{\aa}stad and
Swastik Kopparty},
title = {On the List-Decodability of Random Linear Codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-003}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/003},
eprinttype = {ECCC},
eprint = {TR10-003},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiHK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiRSW10,
author = {Venkatesan Guruswami and
Prasad Raghavendra and
Rishi Saket and
Yi Wu},
title = {Bypassing {UGC} from some optimal geometric inapproximability results},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-177}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/177},
eprinttype = {ECCC},
eprint = {TR10-177},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiRSW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiS10,
author = {Venkatesan Guruswami and
Adam D. Smith},
title = {Codes for Computationally Simple Channels: Explicit Constructions
with Optimal Rate},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-077}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/077},
eprinttype = {ECCC},
eprint = {TR10-077},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiS10a,
author = {Venkatesan Guruswami and
Ali Kemal Sinop},
title = {The complexity of finding independent sets in bounded degree (hyper)graphs
of low chromatic number},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-111}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/111},
eprinttype = {ECCC},
eprint = {TR10-111},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiS10a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiZ10,
author = {Venkatesan Guruswami and
Yuan Zhou},
title = {Tight Bounds on the Approximability of Almost-satisfiable Horn {SAT}
and Exact Hitting Set\}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-063}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/063},
eprinttype = {ECCC},
eprint = {TR10-063},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cacm/GuruswamiR09,
author = {Venkatesan Guruswami and
Atri Rudra},
title = {Error correction up to the information-theoretic limit},
journal = {Commun. {ACM}},
volume = {52},
number = {3},
pages = {87--95},
year = {2009},
url = {https://doi.org/10.1145/1467247.1467269},
doi = {10.1145/1467247.1467269},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cacm/GuruswamiR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GuruswamiUV09,
author = {Venkatesan Guruswami and
Christopher Umans and
Salil P. Vadhan},
title = {Unbalanced expanders and randomness extractors from Parvaresh-Vardy
codes},
journal = {J. {ACM}},
volume = {56},
number = {4},
pages = {20:1--20:34},
year = {2009},
url = {https://doi.org/10.1145/1538902.1538904},
doi = {10.1145/1538902.1538904},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GuruswamiUV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GuruswamiR09,
author = {Venkatesan Guruswami and
Prasad Raghavendra},
title = {Hardness of Learning Halfspaces with Noise},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {2},
pages = {742--765},
year = {2009},
url = {https://doi.org/10.1137/070685798},
doi = {10.1137/070685798},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GuruswamiR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GuruswamiR09,
author = {Venkatesan Guruswami and
Atri Rudra},
title = {Better Binary List Decodable Codes Via Multilevel Concatenation},
journal = {{IEEE} Trans. Inf. Theory},
volume = {55},
number = {1},
pages = {19--26},
year = {2009},
url = {https://doi.org/10.1109/TIT.2008.2008124},
doi = {10.1109/TIT.2008.2008124},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/GuruswamiR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/GuruswamiR09,
author = {Venkatesan Guruswami and
Prasad Raghavendra},
title = {Hardness of Solving Sparse Overdetermined Linear Systems: {A} 3-Query
{PCP} over Integers},
journal = {{ACM} Trans. Comput. Theory},
volume = {1},
number = {2},
pages = {6:1--6:20},
year = {2009},
url = {https://doi.org/10.1145/1595391.1595393},
doi = {10.1145/1595391.1595393},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/GuruswamiR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/allerton/GuruswamiLW09,
author = {Venkatesan Guruswami and
James R. Lee and
Avi Wigderson},
title = {Expander codes over reals, Euclidean sections, and compressed sensing},
booktitle = {47th Annual Allerton Conference on Communication, Control, and Computing,
Allerton 2009, Monticello, IL, USA, September 30 - October 2, 2009},
pages = {1231--1234},
publisher = {{IEEE}},
year = {2009},
url = {https://doi.org/10.1109/ALLERTON.2009.5394536},
doi = {10.1109/ALLERTON.2009.5394536},
timestamp = {Wed, 29 Nov 2023 20:15:57 +0100},
biburl = {https://dblp.org/rec/conf/allerton/GuruswamiLW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiS09,
author = {Venkatesan Guruswami and
Ali Kemal Sinop},
editor = {Irit Dinur and
Klaus Jansen and
Joseph Naor and
Jos{\'{e}} D. P. Rolim},
title = {Improved Inapproximability Results for Maximum k-Colorable Subgraph},
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 = {163--176},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03685-9\_13},
doi = {10.1007/978-3-642-03685-9\_13},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/GuruswamiS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Ben-SassonGKSV09,
author = {Eli Ben{-}Sasson and
Venkatesan Guruswami and
Tali Kaufman and
Madhu Sudan and
Michael Viderman},
title = {Locally Testable Codes Require Redundant Testers},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {52--61},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.6},
doi = {10.1109/CCC.2009.6},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Ben-SassonGKSV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/CharikarGM09,
author = {Moses Charikar and
Venkatesan Guruswami and
Rajsekar Manokaran},
title = {Every Permutation {CSP} of arity 3 is Approximation Resistant},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {62--73},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.29},
doi = {10.1109/CCC.2009.29},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/CharikarGM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/codcry/Guruswami09,
author = {Venkatesan Guruswami},
editor = {Yeow Meng Chee and
Chao Li and
San Ling and
Huaxiong Wang and
Chaoping Xing},
title = {List Decoding of Binary Codes-A Brief Survey of Some Recent Results},
booktitle = {Coding and Cryptology, Second International Workshop, {IWCC} 2009,
Zhangjiajie, China, June 1-5, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5557},
pages = {97--106},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-01877-0\_10},
doi = {10.1007/978-3-642-01877-0\_10},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/codcry/Guruswami09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FeldmanGRW09,
author = {Vitaly Feldman and
Venkatesan Guruswami and
Prasad Raghavendra and
Yi Wu},
title = {Agnostic Learning of Monomials by Halfspaces Is Hard},
booktitle = {50th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2009, October 25-27, 2009, Atlanta, Georgia, {USA}},
pages = {385--394},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/FOCS.2009.26},
doi = {10.1109/FOCS.2009.26},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FeldmanGRW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GopalanGR09,
author = {Parikshit Gopalan and
Venkatesan Guruswami and
Prasad Raghavendra},
editor = {Michael Mitzenmacher},
title = {List decoding tensor products and interleaved codes},
booktitle = {Proceedings of the 41st Annual {ACM} Symposium on Theory of Computing,
{STOC} 2009, Bethesda, MD, USA, May 31 - June 2, 2009},
pages = {13--22},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1536414.1536419},
doi = {10.1145/1536414.1536419},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GopalanGR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Guruswami09,
author = {Venkatesan Guruswami},
editor = {Michael Mitzenmacher},
title = {Artin automorphisms, cyclotomic function fields, and folded list-decodable
codes},
booktitle = {Proceedings of the 41st Annual {ACM} Symposium on Theory of Computing,
{STOC} 2009, Bethesda, MD, USA, May 31 - June 2, 2009},
pages = {23--32},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1536414.1536420},
doi = {10.1145/1536414.1536420},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Guruswami09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BateniCG09,
author = {MohammadHossein Bateni and
Moses Charikar and
Venkatesan Guruswami},
editor = {Michael Mitzenmacher},
title = {MaxMin allocation via degree lower-bounded arborescences},
booktitle = {Proceedings of the 41st Annual {ACM} Symposium on Theory of Computing,
{STOC} 2009, Bethesda, MD, USA, May 31 - June 2, 2009},
pages = {543--552},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1536414.1536488},
doi = {10.1145/1536414.1536488},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BateniCG09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0910-2271,
author = {Venkatesan Guruswami and
Ali Kemal Sinop},
title = {Improved Inapproximability Results for Maximum k-Colorable Subgraph},
journal = {CoRR},
volume = {abs/0910.2271},
year = {2009},
url = {http://arxiv.org/abs/0910.2271},
eprinttype = {arXiv},
eprint = {0910.2271},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0910-2271.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Ben-SassonGKSV09,
author = {Eli Ben{-}Sasson and
Venkatesan Guruswami and
Tali Kaufman and
Madhu Sudan and
Michael Viderman},
title = {Locally Testable Codes Require Redundant Testers},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR09-126}},
year = {2009},
url = {https://eccc.weizmann.ac.il/report/2009/126},
eprinttype = {ECCC},
eprint = {TR09-126},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonGKSV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Guruswami09,
author = {Venkatesan Guruswami},
title = {Artin automorphisms, Cyclotomic function fields, and Folded list-decodable
codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR09-001}},
year = {2009},
url = {https://eccc.weizmann.ac.il/report/2009/001},
eprinttype = {ECCC},
eprint = {TR09-001},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Guruswami09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiR09,
author = {Venkatesan Guruswami and
Prasad Raghavendra},
title = {Hardness of Solving Sparse Overdetermined Linear Systems: {A} 3-Query
{PCP} over Integers},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR09-020}},
year = {2009},
url = {https://eccc.weizmann.ac.il/report/2009/020},
eprinttype = {ECCC},
eprint = {TR09-020},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiS09,
author = {Venkatesan Guruswami and
Ali Kemal Sinop},
title = {Improved Inapproximability Results for Maximum k-Colorable Subgraph},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR09-099}},
year = {2009},
url = {https://eccc.weizmann.ac.il/report/2009/099},
eprinttype = {ECCC},
eprint = {TR09-099},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GopalanGL08,
author = {Parikshit Gopalan and
Venkatesan Guruswami and
Richard J. Lipton},
title = {Algorithms for Modular Counting of Roots of Multivariate Polynomials},
journal = {Algorithmica},
volume = {50},
number = {4},
pages = {479--496},
year = {2008},
url = {https://doi.org/10.1007/s00453-007-9097-3},
doi = {10.1007/S00453-007-9097-3},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GopalanGL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GuruswamiK08,
author = {Venkatesan Guruswami and
Valentine Kabanets},
title = {Hardness Amplification via Space-Efficient Direct Products},
journal = {Comput. Complex.},
volume = {17},
number = {4},
pages = {475--500},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0253-1},
doi = {10.1007/S00037-008-0253-1},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GuruswamiK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/moc/GuruswamiP08,
author = {Venkatesan Guruswami and
Anindya C. Patthak},
title = {Correlated algebraic-geometric codes: Improved list decoding over
bounded alphabets},
journal = {Math. Comput.},
volume = {77},
number = {261},
pages = {447--473},
year = {2008},
url = {https://doi.org/10.1090/S0025-5718-07-02012-1},
doi = {10.1090/S0025-5718-07-02012-1},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/moc/GuruswamiP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GuruswamiR08,
author = {Venkatesan Guruswami and
Atri Rudra},
title = {Explicit Codes Achieving List Decoding Capacity: Error-Correction
With Optimal Redundancy},
journal = {{IEEE} Trans. Inf. Theory},
volume = {54},
number = {1},
pages = {135--150},
year = {2008},
url = {https://doi.org/10.1109/TIT.2007.911222},
doi = {10.1109/TIT.2007.911222},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/GuruswamiR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiR08,
author = {Venkatesan Guruswami and
Prasad Raghavendra},
editor = {Ashish Goel and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Ronitt Rubinfeld},
title = {Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms
and Unique-Games Hardness},
booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms
and Techniques, 11th International Workshop, {APPROX} 2008, and 12th
International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5171},
pages = {77--90},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85363-3\_7},
doi = {10.1007/978-3-540-85363-3\_7},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/GuruswamiR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiLW08,
author = {Venkatesan Guruswami and
James R. Lee and
Avi Wigderson},
editor = {Ashish Goel and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Ronitt Rubinfeld},
title = {Euclidean Sections of with Sublinear Randomness and Error-Correction
over the Reals},
booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms
and Techniques, 11th International Workshop, {APPROX} 2008, and 12th
International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5171},
pages = {444--454},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85363-3\_35},
doi = {10.1007/978-3-540-85363-3\_35},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/GuruswamiLW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GopalanG08,
author = {Parikshit Gopalan and
Venkatesan Guruswami},
title = {Hardness Amplification within {NP} against Deterministic Algorithms},
booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
pages = {19--30},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/CCC.2008.17},
doi = {10.1109/CCC.2008.17},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GopalanG08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GuruswamiR08,
author = {Venkatesan Guruswami and
Atri Rudra},
title = {Soft Decoding, Dual {BCH} Codes, and Better List-Decodable e-Biased
Codes},
booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
pages = {163--174},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/CCC.2008.13},
doi = {10.1109/CCC.2008.13},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GuruswamiR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GuruswamiMR08,
author = {Venkatesan Guruswami and
Rajsekar Manokaran and
Prasad Raghavendra},
title = {Beating the Random Ordering is Hard: Inapproximability of Maximum
Acyclic Subgraph},
booktitle = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2008, October 25-28, 2008, Philadelphia, PA, {USA}},
pages = {573--582},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/FOCS.2008.51},
doi = {10.1109/FOCS.2008.51},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GuruswamiMR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icits/Guruswami08,
author = {Venkatesan Guruswami},
editor = {Reihaneh Safavi{-}Naini},
title = {List Error-Correction with Optimal Information Rate (Invited Talk)},
booktitle = {Information Theoretic Security, Third International Conference, {ICITS}
2008, Calgary, Canada, August 10-13, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5155},
pages = {118--119},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85093-9\_12},
doi = {10.1007/978-3-540-85093-9\_12},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/icits/Guruswami08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/GuruswamiM08,
author = {Venkatesan Guruswami and
Widad Machmouchi},
editor = {Frank R. Kschischang and
En{-}Hui Yang},
title = {Explicit interleavers for a Repeat Accumulate Accumulate {(RAA)} code
construction},
booktitle = {2008 {IEEE} International Symposium on Information Theory, {ISIT}
2008, Toronto, ON, Canada, July 6-11, 2008},
pages = {1968--1972},
publisher = {{IEEE}},
year = {2008},
url = {https://doi.org/10.1109/ISIT.2008.4595333},
doi = {10.1109/ISIT.2008.4595333},
timestamp = {Wed, 16 Oct 2019 14:14:48 +0200},
biburl = {https://dblp.org/rec/conf/isit/GuruswamiM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuruswamiR08,
author = {Venkatesan Guruswami and
Atri Rudra},
editor = {Shang{-}Hua Teng},
title = {Concatenated codes can achieve list-decoding capacity},
booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
2008},
pages = {258--267},
publisher = {{SIAM}},
year = {2008},
url = {http://dl.acm.org/citation.cfm?id=1347082.1347111},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/GuruswamiR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuruswamiLR08,
author = {Venkatesan Guruswami and
James R. Lee and
Alexander A. Razborov},
editor = {Shang{-}Hua Teng},
title = {Almost Euclidean subspaces of l\({}^{\mbox{N}}\)\({}_{\mbox{1}}\)
via expander codes},
booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
2008},
pages = {353--362},
publisher = {{SIAM}},
year = {2008},
url = {http://dl.acm.org/citation.cfm?id=1347082.1347121},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/GuruswamiLR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Guruswami08,
author = {Venkatesan Guruswami},
editor = {Ming{-}Yang Kao},
title = {Decoding Reed-Solomon Codes},
booktitle = {Encyclopedia of Algorithms - 2008 Edition},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-0-387-30162-4\_101},
doi = {10.1007/978-0-387-30162-4\_101},
timestamp = {Thu, 27 Jun 2019 16:25:31 +0200},
biburl = {https://dblp.org/rec/reference/algo/Guruswami08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0811-4139,
author = {Venkatesan Guruswami},
title = {Artin automorphisms, Cyclotomic function fields, and Folded list-decodable
codes},
journal = {CoRR},
volume = {abs/0811.4139},
year = {2008},
url = {http://arxiv.org/abs/0811.4139},
eprinttype = {arXiv},
eprint = {0811.4139},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0811-4139.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0811-4395,
author = {Parikshit Gopalan and
Venkatesan Guruswami and
Prasad Raghavendra},
title = {List Decoding Tensor Products and Interleaved Codes},
journal = {CoRR},
volume = {abs/0811.4395},
year = {2008},
url = {http://arxiv.org/abs/0811.4395},
eprinttype = {arXiv},
eprint = {0811.4395},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0811-4395.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GopalanGRR08,
author = {Parikshit Gopalan and
Venkatesan Guruswami and
Prasad Raghavendra},
title = {List Decoding Tensor Products and Interleaved Codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR08-105}},
year = {2008},
url = {https://eccc.weizmann.ac.il/eccc-reports/2008/TR08-105/index.html},
eprinttype = {ECCC},
eprint = {TR08-105},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GopalanGRR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiR08,
author = {Venkatesan Guruswami and
Prasad Raghavendra},
title = {Constraint Satisfaction over a Non-Boolean Domain: Approximation algorithms
and Unique-Games hardness},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR08-008}},
year = {2008},
url = {https://eccc.weizmann.ac.il/eccc-reports/2008/TR08-008/index.html},
eprinttype = {ECCC},
eprint = {TR08-008},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiR08a,
author = {Venkatesan Guruswami and
Atri Rudra},
title = {Soft decoding, dual {BCH} codes, and better list-decodable eps-biased
codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR08-036}},
year = {2008},
url = {https://eccc.weizmann.ac.il/eccc-reports/2008/TR08-036/index.html},
eprinttype = {ECCC},
eprint = {TR08-036},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiR08a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiR08b,
author = {Venkatesan Guruswami and
Atri Rudra},
title = {Concatenated codes can achieve list-decoding capacity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR08-054}},
year = {2008},
url = {https://eccc.weizmann.ac.il/eccc-reports/2008/TR08-054/index.html},
eprinttype = {ECCC},
eprint = {TR08-054},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiR08b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GuruswamiK07,
author = {Venkatesan Guruswami and
Valentine Kabanets},
title = {Special Issue "Conference on Computational Complexity 2006"
Guest Editors' Foreword},
journal = {Comput. Complex.},
volume = {16},
number = {2},
pages = {113--114},
year = {2007},
url = {https://doi.org/10.1007/s00037-007-0225-x},
doi = {10.1007/S00037-007-0225-X},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GuruswamiK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AlonGKS07,
author = {Noga Alon and
Venkatesan Guruswami and
Tali Kaufman and
Madhu Sudan},
title = {Guessing secrets efficiently via list decoding},
journal = {{ACM} Trans. Algorithms},
volume = {3},
number = {4},
pages = {42},
year = {2007},
url = {https://doi.org/10.1145/1290672.1290679},
doi = {10.1145/1290672.1290679},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/AlonGKS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaecc/Guruswami07,
author = {Venkatesan Guruswami},
editor = {Serdar Boztas and
Hsiao{-}feng Lu},
title = {List Decoding and Pseudorandom Constructions},
booktitle = {Applied Algebra, Algebraic Algorithms and Error-Correcting Codes,
17th International Symposium, AAECC-17, Bangalore, India, December
16-20, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4851},
pages = {1--6},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77224-8\_1},
doi = {10.1007/978-3-540-77224-8\_1},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/aaecc/Guruswami07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiR07,
author = {Venkatesan Guruswami and
Atri Rudra},
editor = {Moses Charikar and
Klaus Jansen and
Omer Reingold and
Jos{\'{e}} D. P. Rolim},
title = {Better Binary List-Decodable Codes Via Multilevel Concatenation},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 10th International Workshop, {APPROX} 2007, and 11th
International Workshop, {RANDOM} 2007, Princeton, NJ, USA, August
20-22, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4627},
pages = {554--568},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74208-1\_40},
doi = {10.1007/978-3-540-74208-1\_40},
timestamp = {Sat, 30 Sep 2023 09:34:32 +0200},
biburl = {https://dblp.org/rec/conf/approx/GuruswamiR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GuruswamiUV07,
author = {Venkatesan Guruswami and
Christopher Umans and
Salil P. Vadhan},
title = {Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy
Codes},
booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
13-16 June 2007, San Diego, California, {USA}},
pages = {96--108},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/CCC.2007.38},
doi = {10.1109/CCC.2007.38},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GuruswamiUV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChuzhoyGKT07,
author = {Julia Chuzhoy and
Venkatesan Guruswami and
Sanjeev Khanna and
Kunal Talwar},
editor = {David S. Johnson and
Uriel Feige},
title = {Hardness of routing with congestion in directed graphs},
booktitle = {Proceedings of the 39th Annual {ACM} Symposium on Theory of Computing,
San Diego, California, USA, June 11-13, 2007},
pages = {165--178},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1250790.1250816},
doi = {10.1145/1250790.1250816},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChuzhoyGKT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuruswamiR07,
author = {Venkatesan Guruswami and
Prasad Raghavendra},
editor = {David S. Johnson and
Uriel Feige},
title = {A 3-query {PCP} over integers},
booktitle = {Proceedings of the 39th Annual {ACM} Symposium on Theory of Computing,
San Diego, California, USA, June 11-13, 2007},
pages = {198--206},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1250790.1250819},
doi = {10.1145/1250790.1250819},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GuruswamiR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AndrewsCGKTZ07,
author = {Matthew Andrews and
Julia Chuzhoy and
Venkatesan Guruswami and
Sanjeev Khanna and
Kunal Talwar and
Lisa Zhang},
title = {Inapproximability of edge-disjoint paths and low congestion routing
on undirected graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR07-113}},
year = {2007},
url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-113/index.html},
eprinttype = {ECCC},
eprint = {TR07-113},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AndrewsCGKTZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GopalanG07,
author = {Parikshit Gopalan and
Venkatesan Guruswami},
title = {Deterministic Hardness Amplification via Local {GMD} Decoding},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR07-089}},
year = {2007},
url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-089/index.html},
eprinttype = {ECCC},
eprint = {TR07-089},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GopalanG07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiLR07,
author = {Venkatesan Guruswami and
James R. Lee and
Alexander A. Razborov},
title = {Almost Euclidean subspaces of {\(\mathscr{l}\)}\({}_{\mbox{1}}\)\({}^{\mbox{N}}\)
via expander codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR07-086}},
year = {2007},
url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-086/index.html},
eprinttype = {ECCC},
eprint = {TR07-086},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiLR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiR07,
author = {Venkatesan Guruswami and
Atri Rudra},
title = {Better Binary List-Decodable Codes via Multilevel Concatenation},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR07-109}},
year = {2007},
url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-109/index.html},
eprinttype = {ECCC},
eprint = {TR07-109},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/Guruswami06,
author = {Venkatesan Guruswami},
title = {Iterative Decoding of Low-Density Parity Check Codes},
journal = {Bull. {EATCS}},
volume = {90},
pages = {53--88},
year = {2006},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eatcs/Guruswami06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fttcs/Guruswami06,
author = {Venkatesan Guruswami},
title = {Algorithmic Results in List Decoding},
journal = {Found. Trends Theor. Comput. Sci.},
volume = {2},
number = {2},
year = {2006},
url = {https://doi.org/10.1561/0400000007},
doi = {10.1561/0400000007},
timestamp = {Thu, 20 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fttcs/Guruswami06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GuruswamiR06,
author = {Venkatesan Guruswami and
Atri Rudra},
title = {Limits to List Decoding Reed-Solomon Codes},
journal = {{IEEE} Trans. Inf. Theory},
volume = {52},
number = {8},
pages = {3642--3649},
year = {2006},
url = {https://doi.org/10.1109/TIT.2006.878164},
doi = {10.1109/TIT.2006.878164},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/GuruswamiR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/GiotisG06,
author = {Ioannis Giotis and
Venkatesan Guruswami},
title = {Correlation Clustering with a Fixed Number of Clusters},
journal = {Theory Comput.},
volume = {2},
number = {13},
pages = {249--266},
year = {2006},
url = {https://doi.org/10.4086/toc.2006.v002a013},
doi = {10.4086/TOC.2006.V002A013},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/GiotisG06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GuruswamiP06,
author = {Venkatesan Guruswami and
Anindya C. Patthak},
title = {Correlated Algebraic-Geometric Codes: Improved List Decoding over
Bounded Alphabets},
booktitle = {47th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2006), 21-24 October 2006, Berkeley, California, USA, Proceedings},
pages = {227--238},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/FOCS.2006.23},
doi = {10.1109/FOCS.2006.23},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GuruswamiP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GuruswamiR06,
author = {Venkatesan Guruswami and
Prasad Raghavendra},
title = {Hardness of Learning Halfspaces with Noise},
booktitle = {47th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2006), 21-24 October 2006, Berkeley, California, USA, Proceedings},
pages = {543--552},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/FOCS.2006.33},
doi = {10.1109/FOCS.2006.33},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GuruswamiR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Guruswami06,
author = {Venkatesan Guruswami},
editor = {Tetsuo Asano},
title = {On 2-Query Codeword Testing with Near-Perfect Completeness},
booktitle = {Algorithms and Computation, 17th International Symposium, {ISAAC}
2006, Kolkata, India, December 18-20, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4288},
pages = {267--276},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11940128\_28},
doi = {10.1007/11940128\_28},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/Guruswami06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/itw/Guruswami06,
author = {Venkatesan Guruswami},
editor = {Gadiel Seroussi and
Alfredo Viola},
title = {List Decoding in Average-Case Complexity and Pseudorandomness},
booktitle = {2006 {IEEE} Information Theory Workshop, {ITW} 2006, Punta del Este,
Uruguay, March 13-17, 2006},
pages = {32--36},
publisher = {{IEEE}},
year = {2006},
url = {https://doi.org/10.1109/ITW.2006.1633776},
doi = {10.1109/ITW.2006.1633776},
timestamp = {Wed, 16 Oct 2019 14:14:51 +0200},
biburl = {https://dblp.org/rec/conf/itw/Guruswami06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/GopalanGL06,
author = {Parikshit Gopalan and
Venkatesan Guruswami and
Richard J. Lipton},
editor = {Jos{\'{e}} R. Correa and
Alejandro Hevia and
Marcos A. Kiwi},
title = {Algorithms for Modular Counting of Roots of Multivariate Polynomials},
booktitle = {{LATIN} 2006: Theoretical Informatics, 7th Latin American Symposium,
Valdivia, Chile, March 20-24, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3887},
pages = {544--555},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11682462\_51},
doi = {10.1007/11682462\_51},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/GopalanGL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/GuruswamiK06,
author = {Venkatesan Guruswami and
Valentine Kabanets},
editor = {Jos{\'{e}} R. Correa and
Alejandro Hevia and
Marcos A. Kiwi},
title = {Hardness Amplification Via Space-Efficient Direct Products},
booktitle = {{LATIN} 2006: Theoretical Informatics, 7th Latin American Symposium,
Valdivia, Chile, March 20-24, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3887},
pages = {556--568},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11682462\_52},
doi = {10.1007/11682462\_52},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/latin/GuruswamiK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GiotisG06,
author = {Ioannis Giotis and
Venkatesan Guruswami},
title = {Correlation clustering with a fixed number of clusters},
booktitle = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006},
pages = {1167--1176},
publisher = {{ACM} Press},
year = {2006},
url = {http://dl.acm.org/citation.cfm?id=1109557.1109686},
timestamp = {Fri, 07 Mar 2014 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/GiotisG06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuruswamiR06,
author = {Venkatesan Guruswami and
Atri Rudra},
editor = {Jon M. Kleinberg},
title = {Explicit capacity-achieving list-decodable codes},
booktitle = {Proceedings of the 38th Annual {ACM} Symposium on Theory of Computing,
Seattle, WA, USA, May 21-23, 2006},
pages = {1--10},
publisher = {{ACM}},
year = {2006},
url = {https://doi.org/10.1145/1132516.1132518},
doi = {10.1145/1132516.1132518},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GuruswamiR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0610022,
author = {Venkatesan Guruswami},
title = {Iterative Decoding of Low-Density Parity Check Codes {(A} Survey)},
journal = {CoRR},
volume = {abs/cs/0610022},
year = {2006},
url = {http://arxiv.org/abs/cs/0610022},
eprinttype = {arXiv},
eprint = {cs/0610022},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0610022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Guruswami06,
author = {Venkatesan Guruswami},
title = {Iterative Decoding of Low-Density Parity Check Codes {(A} Survey)},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-123}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-123/index.html},
eprinttype = {ECCC},
eprint = {TR06-123},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Guruswami06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiR06,
author = {Venkatesan Guruswami and
Prasad Raghavendra},
title = {Hardness of Learning Halfspaces with Noise},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-061}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-061/index.html},
eprinttype = {ECCC},
eprint = {TR06-061},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiT06,
author = {Venkatesan Guruswami and
Kunal Talwar},
title = {Hardness of Low Congestion Routing in Directed Graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-141}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-141/index.html},
eprinttype = {ECCC},
eprint = {TR06-141},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiUV06,
author = {Venkatesan Guruswami and
Christopher Umans and
Salil P. Vadhan},
title = {Extractors and condensers from univariate polynomials},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-134}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-134/index.html},
eprinttype = {ECCC},
eprint = {TR06-134},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiUV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GuruswamiMR05,
author = {Venkatesan Guruswami and
Daniele Micciancio and
Oded Regev},
title = {The complexity of the covering radius problem},
journal = {Comput. Complex.},
volume = {14},
number = {2},
pages = {90--121},
year = {2005},
url = {https://doi.org/10.1007/s00037-005-0193-y},
doi = {10.1007/S00037-005-0193-Y},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GuruswamiMR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/CharikarGW05,
author = {Moses Charikar and
Venkatesan Guruswami and
Anthony Wirth},
title = {Clustering with qualitative information},
journal = {J. Comput. Syst. Sci.},
volume = {71},
number = {3},
pages = {360--383},
year = {2005},
url = {https://doi.org/10.1016/j.jcss.2004.10.012},
doi = {10.1016/J.JCSS.2004.10.012},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/CharikarGW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DinurGKR05,
author = {Irit Dinur and
Venkatesan Guruswami and
Subhash Khot and
Oded Regev},
title = {A New Multilayered {PCP} and the Hardness of Hypergraph Vertex Cover},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {5},
pages = {1129--1146},
year = {2005},
url = {https://doi.org/10.1137/S0097539704443057},
doi = {10.1137/S0097539704443057},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DinurGKR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GuruswamiV05,
author = {Venkatesan Guruswami and
Alexander Vardy},
title = {Maximum-likelihood decoding of Reed-Solomon codes is NP-hard},
journal = {{IEEE} Trans. Inf. Theory},
volume = {51},
number = {7},
pages = {2249--2256},
year = {2005},
url = {https://doi.org/10.1109/TIT.2005.850102},
doi = {10.1109/TIT.2005.850102},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/GuruswamiV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GuruswamiI05,
author = {Venkatesan Guruswami and
Piotr Indyk},
title = {Linear-time encodable/decodable codes with near-optimal rate},
journal = {{IEEE} Trans. Inf. Theory},
volume = {51},
number = {10},
pages = {3393--3400},
year = {2005},
url = {https://doi.org/10.1109/TIT.2005.855587},
doi = {10.1109/TIT.2005.855587},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/GuruswamiI05.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/approx/GuruswamiR05,
author = {Venkatesan Guruswami and
Atri Rudra},
editor = {Chandra Chekuri and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Luca Trevisan},
title = {Tolerant Locally Testable Codes},
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 = {306--317},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11538462\_26},
doi = {10.1007/11538462\_26},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/GuruswamiR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiV05,
author = {Venkatesan Guruswami and
Salil P. Vadhan},
editor = {Chandra Chekuri and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Luca Trevisan},
title = {A Lower Bound on List Size for List Decoding},
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 = {318--329},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11538462\_27},
doi = {10.1007/11538462\_27},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/GuruswamiV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GuruswamiK05,
author = {Venkatesan Guruswami and
Subhash Khot},
title = {Hardness of Max 3SAT with No Mixed Clauses},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
pages = {154--162},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.10},
doi = {10.1109/CCC.2005.10},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GuruswamiK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuruswamiV05,
author = {Venkatesan Guruswami and
Alexander Vardy},
title = {Maximum-likelihood decoding of Reed-Solomon codes is NP-hard},
booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
23-25, 2005},
pages = {470--478},
publisher = {{SIAM}},
year = {2005},
url = {http://dl.acm.org/citation.cfm?id=1070432.1070497},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/GuruswamiV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuruswamiHKKKM05,
author = {Venkatesan Guruswami and
Jason D. Hartline and
Anna R. Karlin and
David Kempe and
Claire Kenyon and
Frank McSherry},
title = {On profit-maximizing envy-free pricing},
booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
23-25, 2005},
pages = {1164--1173},
publisher = {{SIAM}},
year = {2005},
url = {http://dl.acm.org/citation.cfm?id=1070432.1070598},
timestamp = {Mon, 07 Nov 2016 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/GuruswamiHKKKM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuruswamiR05,
author = {Venkatesan Guruswami and
Atri Rudra},
editor = {Harold N. Gabow and
Ronald Fagin},
title = {Limits to list decoding Reed-Solomon codes},
booktitle = {Proceedings of the 37th Annual {ACM} Symposium on Theory of Computing,
Baltimore, MD, USA, May 22-24, 2005},
pages = {602--609},
publisher = {{ACM}},
year = {2005},
url = {https://doi.org/10.1145/1060590.1060679},
doi = {10.1145/1060590.1060679},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GuruswamiR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0504023,
author = {Ioannis Giotis and
Venkatesan Guruswami},
title = {Correlation Clustering with a Fixed Number of Clusters},
journal = {CoRR},
volume = {abs/cs/0504023},
year = {2005},
url = {http://arxiv.org/abs/cs/0504023},
eprinttype = {arXiv},
eprint = {cs/0504023},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0504023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0511072,
author = {Venkatesan Guruswami and
Atri Rudra},
title = {Explicit Codes Achieving List Decoding Capacity: Error-correction
with Optimal Redundancy},
journal = {CoRR},
volume = {abs/cs/0511072},
year = {2005},
url = {http://arxiv.org/abs/cs/0511072},
eprinttype = {arXiv},
eprint = {cs/0511072},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0511072.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-019,
author = {Venkatesan Guruswami and
Atri Rudra},
title = {Tolerant Locally Testable Codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-019}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-019/index.html},
eprinttype = {ECCC},
eprint = {TR05-019},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-057,
author = {Venkatesan Guruswami and
Valentine Kabanets},
title = {Hardness amplification via space-efficient direct products},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-057}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-057/index.html},
eprinttype = {ECCC},
eprint = {TR05-057},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-057.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-132,
author = {Venkatesan Guruswami},
title = {Algebraic-geometric generalizations of the Parvaresh-Vardy codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-132}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-132/index.html},
eprinttype = {ECCC},
eprint = {TR05-132},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-132.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-133,
author = {Venkatesan Guruswami and
Atri Rudra},
title = {Explicit Capacity-Achieving List-Decodable Codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-133}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-133/index.html},
eprinttype = {ECCC},
eprint = {TR05-133},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-133.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/sp/Guruswami2004,
author = {Venkatesan Guruswami},
title = {List Decoding of Error-Correcting Codes (Winning Thesis of the 2002
{ACM} Doctoral Dissertation Competition)},
series = {Lecture Notes in Computer Science},
volume = {3282},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/b104335},
doi = {10.1007/B104335},
isbn = {3-540-24051-9},
timestamp = {Sat, 17 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/sp/Guruswami2004.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Guruswami03,
author = {Venkatesan Guruswami},
title = {Inapproximability Results for Set Splitting and Satisfiability Problems
with No Mixed Clauses},
journal = {Algorithmica},
volume = {38},
number = {3},
pages = {451--469},
year = {2004},
url = {https://doi.org/10.1007/s00453-003-1072-z},
doi = {10.1007/S00453-003-1072-Z},
timestamp = {Tue, 13 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Guruswami03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/CohenG04,
author = {Edith Cohen and
Venkatesan Guruswami},
title = {Guest Editors' foreword},
journal = {J. Comput. Syst. Sci.},
volume = {68},
number = {4},
pages = {701},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2003.11.001},
doi = {10.1016/J.JCSS.2003.11.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/CohenG04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/EngebretsenG04,
author = {Lars Engebretsen and
Venkatesan Guruswami},
title = {Is constraint satisfaction over two variables always easy?},
journal = {Random Struct. Algorithms},
volume = {25},
number = {2},
pages = {150--178},
year = {2004},
url = {https://doi.org/10.1002/rsa.20026},
doi = {10.1002/RSA.20026},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/EngebretsenG04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GuruswamiK04,
author = {Venkatesan Guruswami and
Sanjeev Khanna},
title = {On the Hardness of 4-Coloring a 3-Colorable Graph},
journal = {{SIAM} J. Discret. Math.},
volume = {18},
number = {1},
pages = {30--40},
year = {2004},
url = {https://doi.org/10.1137/S0895480100376794},
doi = {10.1137/S0895480100376794},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/GuruswamiK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/Guruswami04,
author = {Venkatesan Guruswami},
title = {Guest column: error-correcting codes and expander graphs},
journal = {{SIGACT} News},
volume = {35},
number = {3},
pages = {25--41},
year = {2004},
url = {https://doi.org/10.1145/1027914.1027924},
doi = {10.1145/1027914.1027924},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigact/Guruswami04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GuruswamiMR04,
author = {Venkatesan Guruswami and
Daniele Micciancio and
Oded Regev},
title = {The Complexity of the Covering Radius Problem on Lattices and Codes},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {161--173},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313831},
doi = {10.1109/CCC.2004.1313831},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GuruswamiMR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GuruswamiI04,
author = {Venkatesan Guruswami and
Piotr Indyk},
editor = {Josep D{\'{\i}}az and
Juhani Karhum{\"{a}}ki and
Arto Lepist{\"{o}} and
Donald Sannella},
title = {Linear-Time List Decoding in Error-Free Settings: (Extended Abstract)},
booktitle = {Automata, Languages and Programming: 31st International Colloquium,
{ICALP} 2004, Turku, Finland, July 12-16, 2004. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3142},
pages = {695--707},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27836-8\_59},
doi = {10.1007/978-3-540-27836-8\_59},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GuruswamiI04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuruswamiI04,
author = {Venkatesan Guruswami and
Piotr Indyk},
editor = {J. Ian Munro},
title = {Efficiently decodable codes meeting Gilbert-Varshamov bound for low
rates},
booktitle = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14,
2004},
pages = {756--757},
publisher = {{SIAM}},
year = {2004},
url = {http://dl.acm.org/citation.cfm?id=982792.982907},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/GuruswamiI04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Guruswami04,
author = {Venkatesan Guruswami},
editor = {L{\'{a}}szl{\'{o}} Babai},
title = {Better extractors for better codes?},
booktitle = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
Chicago, IL, USA, June 13-16, 2004},
pages = {436--444},
publisher = {{ACM}},
year = {2004},
url = {https://doi.org/10.1145/1007352.1007422},
doi = {10.1145/1007352.1007422},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Guruswami04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-0405005,
author = {Venkatesan Guruswami and
Alexander Vardy},
title = {Maximum-likelihood decoding of Reed-Solomon Codes is NP-hard},
journal = {CoRR},
volume = {cs.CC/0405005},
year = {2004},
url = {http://arxiv.org/abs/cs/0405005},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-0405005.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-040,
author = {Venkatesan Guruswami and
Alexander Vardy},
title = {Maximum-likelihood decoding of Reed-Solomon codes is NP-hard},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR04-040}},
year = {2004},
url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-040/index.html},
eprinttype = {ECCC},
eprint = {TR04-040},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-040.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GuruswamiKRSY03,
author = {Venkatesan Guruswami and
Sanjeev Khanna and
Rajmohan Rajaraman and
F. Bruce Shepherd and
Mihalis Yannakakis},
title = {Near-optimal hardness results and approximation algorithms for edge-disjoint
paths and related problems},
journal = {J. Comput. Syst. Sci.},
volume = {67},
number = {3},
pages = {473--496},
year = {2003},
url = {https://doi.org/10.1016/S0022-0000(03)00066-7},
doi = {10.1016/S0022-0000(03)00066-7},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/GuruswamiKRSY03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/Guruswami03,
author = {Venkatesan Guruswami},
title = {Constructions of codes from number fields},
journal = {{IEEE} Trans. Inf. Theory},
volume = {49},
number = {3},
pages = {594--603},
year = {2003},
url = {https://doi.org/10.1109/TIT.2002.808131},
doi = {10.1109/TIT.2002.808131},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/Guruswami03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/Guruswami03a,
author = {Venkatesan Guruswami},
title = {List decoding from erasures: bounds and code constructions},
journal = {{IEEE} Trans. Inf. Theory},
volume = {49},
number = {11},
pages = {2826--2833},
year = {2003},
url = {https://doi.org/10.1109/TIT.2003.815776},
doi = {10.1109/TIT.2003.815776},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/Guruswami03a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Guruswami03,
author = {Venkatesan Guruswami},
title = {List Decoding with Side Information},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {300},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214429},
doi = {10.1109/CCC.2003.1214429},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Guruswami03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CharikarGW03,
author = {Moses Charikar and
Venkatesan Guruswami and
Anthony Wirth},
title = {Clustering with Qualitative Information},
booktitle = {44th Symposium on Foundations of Computer Science {(FOCS} 2003), 11-14
October 2003, Cambridge, MA, USA, Proceedings},
pages = {524--533},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/SFCS.2003.1238225},
doi = {10.1109/SFCS.2003.1238225},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/CharikarGW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuruswamiI03,
author = {Venkatesan Guruswami and
Piotr Indyk},
title = {Embeddings and non-approximability of geometric problems},
booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}},
pages = {537--538},
publisher = {{ACM/SIAM}},
year = {2003},
url = {http://dl.acm.org/citation.cfm?id=644108.644198},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/GuruswamiI03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuruswamiS03,
author = {Venkatesan Guruswami and
Igor E. Shparlinski},
title = {Unconditional proof of tightness of Johnson bound},
booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}},
pages = {754--755},
publisher = {{ACM/SIAM}},
year = {2003},
url = {http://dl.acm.org/citation.cfm?id=644108.644232},
timestamp = {Sun, 20 Mar 2016 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/GuruswamiS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuruswamiI03,
author = {Venkatesan Guruswami and
Piotr Indyk},
editor = {Lawrence L. Larmore and
Michel X. Goemans},
title = {Linear time encodable and list decodable codes},
booktitle = {Proceedings of the 35th Annual {ACM} Symposium on Theory of Computing,
June 9-11, 2003, San Diego, CA, {USA}},
pages = {126--135},
publisher = {{ACM}},
year = {2003},
url = {https://doi.org/10.1145/780542.780562},
doi = {10.1145/780542.780562},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GuruswamiI03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DinurGKR03,
author = {Irit Dinur and
Venkatesan Guruswami and
Subhash Khot and
Oded Regev},
editor = {Lawrence L. Larmore and
Michel X. Goemans},
title = {A new multilayered {PCP} and the hardness of hypergraph vertex cover},
booktitle = {Proceedings of the 35th Annual {ACM} Symposium on Theory of Computing,
June 9-11, 2003, San Diego, CA, {USA}},
pages = {595--601},
publisher = {{ACM}},
year = {2003},
url = {https://doi.org/10.1145/780542.780629},
doi = {10.1145/780542.780629},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DinurGKR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-0304026,
author = {Irit Dinur and
Venkatesan Guruswami and
Subhash Khot and
Oded Regev},
title = {A New Multilayered {PCP} and the Hardness of Hypergraph Vertex Cover},
journal = {CoRR},
volume = {cs.CC/0304026},
year = {2003},
url = {http://arxiv.org/abs/cs/0304026},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-0304026.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR03-080,
author = {Venkatesan Guruswami},
title = {Better Extractors for Better Codes?},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR03-080}},
year = {2003},
url = {https://eccc.weizmann.ac.il/eccc-reports/2003/TR03-080/index.html},
eprinttype = {ECCC},
eprint = {TR03-080},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR03-080.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/CharikarFGKRS02,
author = {Moses Charikar and
Ronald Fagin and
Venkatesan Guruswami and
Jon M. Kleinberg and
Prabhakar Raghavan and
Amit Sahai},
title = {Query Strategies for Priced Information},
journal = {J. Comput. Syst. Sci.},
volume = {64},
number = {4},
pages = {785--819},
year = {2002},
url = {https://doi.org/10.1006/jcss.2002.1828},
doi = {10.1006/JCSS.2002.1828},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/CharikarFGKRS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GuruswamiHS02,
author = {Venkatesan Guruswami and
Johan H{\aa}stad and
Madhu Sudan},
title = {Hardness of Approximate Hypergraph Coloring},
journal = {{SIAM} J. Comput.},
volume = {31},
number = {6},
pages = {1663--1686},
year = {2002},
url = {https://doi.org/10.1137/S0097539700377165},
doi = {10.1137/S0097539700377165},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GuruswamiHS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GuruswamiHSZ02,
author = {Venkatesan Guruswami and
Johan H{\aa}stad and
Madhu Sudan and
David Zuckerman},
title = {Combinatorial bounds for list decoding},
journal = {{IEEE} Trans. Inf. Theory},
volume = {48},
number = {5},
pages = {1021--1034},
year = {2002},
url = {https://doi.org/10.1109/18.995539},
doi = {10.1109/18.995539},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tit/GuruswamiHSZ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GuruswamiS02,
author = {Venkatesan Guruswami and
Madhu Sudan},
title = {Decoding Concatenated Codes using Soft Information},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {148--157},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004350},
doi = {10.1109/CCC.2002.1004350},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GuruswamiS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/random/EngebretsenG02,
author = {Lars Engebretsen and
Venkatesan Guruswami},
editor = {Jos{\'{e}} D. P. Rolim and
Salil P. Vadhan},
title = {Is Constraint Satisfaction Over Two Variables Always Easy?},
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 = {224--238},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45726-7\_18},
doi = {10.1007/3-540-45726-7\_18},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/random/EngebretsenG02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AlonGKS02,
author = {Noga Alon and
Venkatesan Guruswami and
Tali Kaufman and
Madhu Sudan},
editor = {David Eppstein},
title = {Guessing secrets efficiently via list decoding},
booktitle = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
pages = {254--262},
publisher = {{ACM/SIAM}},
year = {2002},
url = {http://dl.acm.org/citation.cfm?id=545381.545414},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/AlonGKS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Guruswami02,
author = {Venkatesan Guruswami},
editor = {John H. Reif},
title = {Limits to list decodability of linear codes},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {802--811},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.510022},
doi = {10.1145/509907.510022},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Guruswami02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuruswamiI02,
author = {Venkatesan Guruswami and
Piotr Indyk},
editor = {John H. Reif},
title = {Near-optimal linear-time codes for unique decoding and new list-decodable
codes over smaller alphabets},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {812--821},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.510023},
doi = {10.1145/509907.510023},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GuruswamiI02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-027,
author = {Irit Dinur and
Venkatesan Guruswami and
Subhash Khot},
title = {Vertex Cover on k-Uniform Hypergraphs is Hard to Approximate within
Factor (k-3-epsilon)},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-027}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-027/index.html},
eprinttype = {ECCC},
eprint = {TR02-027},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-027.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-053,
author = {Lars Engebretsen and
Venkatesan Guruswami},
title = {Is Constraint Satisfaction Over Two Variables Always Easy?},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-053}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-053/index.html},
eprinttype = {ECCC},
eprint = {TR02-053},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-053.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/us/Guruswami2001,
author = {Venkatesan Guruswami},
title = {List decoding of error correcting codes},
school = {Massachusetts Institute of Technology},
year = {2001},
url = {http://dspace.mit.edu/handle/1721.1/8700},
timestamp = {Wed, 04 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/us/Guruswami2001.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computing/GuruswamiRCCW01,
author = {Venkatesan Guruswami and
C. Pandu Rangan and
Maw{-}Shang Chang and
Gerard J. Chang and
C. K. Wong},
title = {The K\({}_{\mbox{r}}\)-Packing Problem},
journal = {Computing},
volume = {66},
number = {1},
pages = {79--89},
year = {2001},
url = {https://doi.org/10.1007/s006070170039},
doi = {10.1007/S006070170039},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/computing/GuruswamiRCCW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GuruswamiS01,
author = {Venkatesan Guruswami and
Madhu Sudan},
title = {On representations of algebraic-geometry codes},
journal = {{IEEE} Trans. Inf. Theory},
volume = {47},
number = {4},
pages = {1610--1613},
year = {2001},
url = {https://doi.org/10.1109/18.923745},
doi = {10.1109/18.923745},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tit/GuruswamiS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaecc/Guruswami01,
author = {Venkatesan Guruswami},
editor = {Serdar Boztas and
Igor E. Shparlinski},
title = {Constructions of Codes from Number Fields},
booktitle = {Applied Algebra, Algebraic Algorithms and Error-Correcting Codes,
14th International Symposium, AAECC-14, Melbourne, Australia November
26-30, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2227},
pages = {129--140},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45624-4\_14},
doi = {10.1007/3-540-45624-4\_14},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/aaecc/Guruswami01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GuruswamiI01,
author = {Venkatesan Guruswami and
Piotr Indyk},
title = {Expander-Based Constructions of Efficiently Decodable Codes},
booktitle = {42nd Annual Symposium on Foundations of Computer Science, {FOCS} 2001,
14-17 October 2001, Las Vegas, Nevada, {USA}},
pages = {658--667},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/SFCS.2001.959942},
doi = {10.1109/SFCS.2001.959942},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GuruswamiI01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Guruswami01,
author = {Venkatesan Guruswami},
editor = {Ramesh Hariharan and
Madhavan Mukund and
V. Vinay},
title = {List Decoding from Erasures: Bounds and Code Constructions},
booktitle = {{FST} {TCS} 2001: Foundations of Software Technology and Theoretical
Computer Science, 21st Conference, Bangalore, India, December 13-15,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2245},
pages = {195--206},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45294-X\_17},
doi = {10.1007/3-540-45294-X\_17},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/Guruswami01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR01-002,
author = {Venkatesan Guruswami},
title = {Constructions of Codes from Number Fields},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR01-002}},
year = {2001},
url = {https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-002/index.html},
eprinttype = {ECCC},
eprint = {TR01-002},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR01-002.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GuruswamiR00,
author = {Venkatesan Guruswami and
C. Pandu Rangan},
title = {Algorithmic aspects of clique-transversal and clique-independent sets},
journal = {Discret. Appl. Math.},
volume = {100},
number = {3},
pages = {183--202},
year = {2000},
url = {https://doi.org/10.1016/S0166-218X(99)00159-6},
doi = {10.1016/S0166-218X(99)00159-6},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GuruswamiR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Guruswami00,
author = {Venkatesan Guruswami},
editor = {Klaus Jansen and
Samir Khuller},
title = {Inapproximability results for set splitting and satisfiability problems
with no mixed clauses},
booktitle = {Approximation Algorithms for Combinatorial Optimization, Third International
Workshop, {APPROX} 2000, Saarbr{\"{u}}cken, Germany, September
5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1913},
pages = {155--166},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44436-X\_16},
doi = {10.1007/3-540-44436-X\_16},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/Guruswami00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GuruswamiK00,
author = {Venkatesan Guruswami and
Sanjeev Khanna},
title = {On the Hardness of 4-Coloring a 3-Colorable Graph},
booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational
Complexity, Florence, Italy, July 4-7, 2000},
pages = {188--197},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/CCC.2000.856749},
doi = {10.1109/CCC.2000.856749},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GuruswamiK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/GuruswamiS00,
author = {Venkatesan Guruswami and
Madhu Sudan},
editor = {Mike Paterson},
title = {On Representations of Algebraic-Geometric Codes for List Decoding},
booktitle = {Algorithms - {ESA} 2000, 8th Annual European Symposium, Saarbr{\"{u}}cken,
Germany, September 5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1879},
pages = {244--255},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-45253-2\_23},
doi = {10.1007/3-540-45253-2\_23},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/GuruswamiS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GuruswamiHS00,
author = {Venkatesan Guruswami and
Johan H{\aa}stad and
Madhu Sudan},
title = {Hardness of Approximate Hypergraph Coloring},
booktitle = {41st Annual Symposium on Foundations of Computer Science, {FOCS} 2000,
12-14 November 2000, Redondo Beach, California, {USA}},
pages = {149--158},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/SFCS.2000.892074},
doi = {10.1109/SFCS.2000.892074},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GuruswamiHS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GuruswamiSS00,
author = {Venkatesan Guruswami and
Amit Sahai and
Madhu Sudan},
title = {"Soft-decision" Decoding of Chinese Remainder Codes},
booktitle = {41st Annual Symposium on Foundations of Computer Science, {FOCS} 2000,
12-14 November 2000, Redondo Beach, California, {USA}},
pages = {159--168},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/SFCS.2000.892076},
doi = {10.1109/SFCS.2000.892076},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GuruswamiSS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CharikarGKRS00,
author = {Moses Charikar and
Venkatesan Guruswami and
Ravi Kumar and
Sridhar Rajagopalan and
Amit Sahai},
title = {Combinatorial feature selection problems},
booktitle = {41st Annual Symposium on Foundations of Computer Science, {FOCS} 2000,
12-14 November 2000, Redondo Beach, California, {USA}},
pages = {631--640},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/SFCS.2000.892331},
doi = {10.1109/SFCS.2000.892331},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/CharikarGKRS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuruswamiS00,
author = {Venkatesan Guruswami and
Madhu Sudan},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {List decoding algorithms for certain concatenated codes},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {181--190},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335327},
doi = {10.1145/335305.335327},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GuruswamiS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CharikarFGKRS00,
author = {Moses Charikar and
Ronald Fagin and
Venkatesan Guruswami and
Jon M. Kleinberg and
Prabhakar Raghavan and
Amit Sahai},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Query strategies for priced information (extended abstract)},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {582--591},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335382},
doi = {10.1145/335305.335382},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CharikarFGKRS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR00-062,
author = {Venkatesan Guruswami and
Johan H{\aa}stad and
Madhu Sudan},
title = {Hardness of approximate hypergraph coloring},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR00-062}},
year = {2000},
url = {https://eccc.weizmann.ac.il/eccc-reports/2000/TR00-062/index.html},
eprinttype = {ECCC},
eprint = {TR00-062},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR00-062.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR00-073,
author = {Venkatesan Guruswami and
Sanjeev Khanna},
title = {On the Hardness of 4-coloring a 3-colorable Graph},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR00-073}},
year = {2000},
url = {https://eccc.weizmann.ac.il/eccc-reports/2000/TR00-073/index.html},
eprinttype = {ECCC},
eprint = {TR00-073},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR00-073.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Guruswami99,
author = {Venkatesan Guruswami},
title = {Maximum Cut on Line and Total Graphs},
journal = {Discret. Appl. Math.},
volume = {92},
number = {2-3},
pages = {217--221},
year = {1999},
url = {https://doi.org/10.1016/S0166-218X(99)00056-6},
doi = {10.1016/S0166-218X(99)00056-6},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Guruswami99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Guruswami99,
author = {Venkatesan Guruswami},
title = {Enumerative aspects of certain subclasses of perfect graphs},
journal = {Discret. Math.},
volume = {205},
number = {1-3},
pages = {97--117},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(99)00022-9},
doi = {10.1016/S0012-365X(99)00022-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Guruswami99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GuruswamiS99,
author = {Venkatesan Guruswami and
Madhu Sudan},
title = {Improved decoding of Reed-Solomon and algebraic-geometry codes},
journal = {{IEEE} Trans. Inf. Theory},
volume = {45},
number = {6},
pages = {1757--1767},
year = {1999},
url = {https://doi.org/10.1109/18.782097},
doi = {10.1109/18.782097},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tit/GuruswamiS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/GuruswamiS99,
author = {Venkatesan Guruswami and
Amit Sahai},
editor = {Shai Ben{-}David and
Philip M. Long},
title = {Multiclass Learning, Boosting, and Error-Correcting Codes},
booktitle = {Proceedings of the Twelfth Annual Conference on Computational Learning
Theory, {COLT} 1999, Santa Cruz, CA, USA, July 7-9, 1999},
pages = {145--155},
publisher = {{ACM}},
year = {1999},
url = {https://doi.org/10.1145/307400.307429},
doi = {10.1145/307400.307429},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colt/GuruswamiS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DodisGK99,
author = {Yevgeniy Dodis and
Venkatesan Guruswami and
Sanjeev Khanna},
editor = {Robert Endre Tarjan and
Tandy J. Warnow},
title = {The 2-Catalog Segmentation Problem},
booktitle = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
17-19 January 1999, Baltimore, Maryland, {USA}},
pages = {897--898},
publisher = {{ACM/SIAM}},
year = {1999},
url = {http://dl.acm.org/citation.cfm?id=314500.315075},
timestamp = {Thu, 05 Jul 2018 07:29:57 +0200},
biburl = {https://dblp.org/rec/conf/soda/DodisGK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuruswamiKRSY99,
author = {Venkatesan Guruswami and
Sanjeev Khanna and
Rajmohan Rajaraman and
F. Bruce Shepherd and
Mihalis Yannakakis},
editor = {Jeffrey Scott Vitter and
Lawrence L. Larmore and
Frank Thomson Leighton},
title = {Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint
Paths and Related Problems},
booktitle = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
pages = {19--28},
publisher = {{ACM}},
year = {1999},
url = {https://doi.org/10.1145/301250.301262},
doi = {10.1145/301250.301262},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GuruswamiKRSY99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-043,
author = {Venkatesan Guruswami},
title = {The Approximability of Set Splitting Problems and Satisfiability Problems
with no Mixed Clauses},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-043}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-043/index.html},
eprinttype = {ECCC},
eprint = {TR99-043},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-043.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GuruswamiR98,
author = {Venkatesan Guruswami and
C. Pandu Rangan},
title = {A Natural Family of Optimization Problems with Arbitrarily Small Approximation
Thresholds},
journal = {Inf. Process. Lett.},
volume = {68},
number = {5},
pages = {241--248},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(98)00169-0},
doi = {10.1016/S0020-0190(98)00169-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GuruswamiR98.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/GuruswamiS98,
author = {Venkatesan Guruswami and
Madhu Sudan},
title = {Improved Decoding of Reed-Solomon and Algebraic-Geometric Codes},
booktitle = {39th Annual Symposium on Foundations of Computer Science, {FOCS} '98,
November 8-11, 1998, Palo Alto, California, {USA}},
pages = {28--39},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/SFCS.1998.743426},
doi = {10.1109/SFCS.1998.743426},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GuruswamiS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/GuruswamiRCCW98,
author = {Venkatesan Guruswami and
C. Pandu Rangan and
Maw{-}Shang Chang and
Gerard J. Chang and
C. K. Wong},
editor = {Juraj Hromkovic and
Ondrej S{\'{y}}kora},
title = {The Vertex-Disjoint Triangles Problem},
booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop,
{WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1517},
pages = {26--37},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/10692760\_3},
doi = {10.1007/10692760\_3},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/GuruswamiRCCW98.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-043,
author = {Venkatesan Guruswami and
Madhu Sudan},
title = {Improved decoding of Reed-Solomon and algebraic-geometric codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR98-043}},
year = {1998},
url = {https://eccc.weizmann.ac.il/eccc-reports/1998/TR98-043/index.html},
eprinttype = {ECCC},
eprint = {TR98-043},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR98-043.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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-04-11 22:45 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:
