BibTeX records: Venkatesan Guruswami

download as .bib file

@inproceedings{DBLP:conf/innovations/GuruswamiNS19,
  author    = {Venkatesan Guruswami and
               Preetum Nakkiran and
               Madhu Sudan},
  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}},
  pages     = {39:1--39:19},
  year      = {2019},
  crossref  = {DBLP:conf/innovations/2019},
  url       = {https://doi.org/10.4230/LIPIcs.ITCS.2019.39},
  doi       = {10.4230/LIPIcs.ITCS.2019.39},
  timestamp = {Wed, 09 Jan 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/innovations/GuruswamiNS19},
  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},
  title     = {Secret Sharing with Binary Shares},
  booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
               2019, January 10-12, 2019, San Diego, California, {USA}},
  pages     = {53:1--53:20},
  year      = {2019},
  crossref  = {DBLP:conf/innovations/2019},
  url       = {https://doi.org/10.4230/LIPIcs.ITCS.2019.53},
  doi       = {10.4230/LIPIcs.ITCS.2019.53},
  timestamp = {Wed, 09 Jan 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/innovations/LinCGSW19},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BrakensiekG19,
  author    = {Joshua Brakensiek and
               Venkatesan Guruswami},
  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},
  year      = {2019},
  crossref  = {DBLP:conf/soda/2019},
  url       = {https://doi.org/10.1137/1.9781611975482.28},
  doi       = {10.1137/1.9781611975482.28},
  timestamp = {Wed, 09 Jan 2019 13:15:38 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/BrakensiekG19},
  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},
  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},
  year      = {2019},
  crossref  = {DBLP:conf/soda/2019},
  url       = {https://doi.org/10.1137/1.9781611975482.83},
  doi       = {10.1137/1.9781611975482.83},
  timestamp = {Wed, 09 Jan 2019 13:15:38 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/BhattiproluGGLT19},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GopiGY19,
  author    = {Sivakanth Gopi and
               Venkatesan Guruswami and
               Sergey Yekhanin},
  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},
  year      = {2019},
  crossref  = {DBLP:conf/soda/2019},
  url       = {https://doi.org/10.1137/1.9781611975482.130},
  doi       = {10.1137/1.9781611975482.130},
  timestamp = {Wed, 09 Jan 2019 13:15:38 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/GopiGY19},
  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},
  archivePrefix = {arXiv},
  eprint    = {1901.05112},
  timestamp = {Fri, 01 Feb 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1901-05112},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {26},
  pages     = {5},
  year      = {2019},
  url       = {https://eccc.weizmann.ac.il/report/2019/005},
  timestamp = {Tue, 12 Feb 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/AlrabiahG19},
  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   = {Combinatorica},
  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 = {Fri, 16 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/combinatorica/GuruswamiL18},
  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. Information 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 = {Sun, 06 May 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tit/BrakensiekGZ18},
  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. Information 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 = {Wed, 03 Oct 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tit/RawatTGE18},
  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},
  year      = {2018},
  crossref  = {DBLP:conf/allerton/2018},
  url       = {https://doi.org/10.1109/ALLERTON.2018.8636018},
  doi       = {10.1109/ALLERTON.2018.8636018},
  timestamp = {Wed, 13 Feb 2019 09:36:05 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/allerton/BeemerCGLP18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BlasiokGS18,
  author    = {Jaroslaw Blasiok and
               Venkatesan Guruswami and
               Madhu Sudan},
  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}},
  pages     = {34:1--34:17},
  year      = {2018},
  crossref  = {DBLP:conf/approx/2018},
  url       = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.34},
  doi       = {10.4230/LIPIcs.APPROX-RANDOM.2018.34},
  timestamp = {Wed, 15 Aug 2018 16:15:06 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/BlasiokGS18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiXY18,
  author    = {Venkatesan Guruswami and
               Chaoping Xing and
               Chen Yuan},
  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}},
  pages     = {41:1--41:11},
  year      = {2018},
  crossref  = {DBLP:conf/approx/2018},
  url       = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.41},
  doi       = {10.4230/LIPIcs.APPROX-RANDOM.2018.41},
  timestamp = {Wed, 15 Aug 2018 16:15:06 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/GuruswamiXY18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GuruswamiRX18,
  author    = {Venkatesan Guruswami and
               Nicolas Resch and
               Chaoping Xing},
  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}},
  pages     = {4:1--4:16},
  year      = {2018},
  crossref  = {DBLP:conf/coco/2018},
  url       = {https://doi.org/10.4230/LIPIcs.CCC.2018.4},
  doi       = {10.4230/LIPIcs.CCC.2018.4},
  timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/GuruswamiRX18},
  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},
  year      = {2018},
  crossref  = {DBLP:conf/isit/2018},
  url       = {https://doi.org/10.1109/ISIT.2018.8437698},
  doi       = {10.1109/ISIT.2018.8437698},
  timestamp = {Tue, 21 Aug 2018 13:02:26 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/isit/GuruswamiR18},
  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},
  year      = {2018},
  crossref  = {DBLP:conf/isit/2018},
  url       = {https://doi.org/10.1109/ISIT.2018.8437576},
  doi       = {10.1109/ISIT.2018.8437576},
  timestamp = {Tue, 21 Aug 2018 13:02:26 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/isit/GuruswamiLJ18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuruswamiL18,
  author    = {Venkatesan Guruswami and
               Ray Li},
  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},
  year      = {2018},
  crossref  = {DBLP:conf/soda/2018},
  url       = {https://doi.org/10.1137/1.9781611975031.41},
  doi       = {10.1137/1.9781611975031.41},
  timestamp = {Thu, 04 Jan 2018 13:32:12 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/GuruswamiL18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BrakensiekG18,
  author    = {Joshua Brakensiek and
               Venkatesan Guruswami},
  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},
  year      = {2018},
  crossref  = {DBLP:conf/soda/2018},
  url       = {https://doi.org/10.1137/1.9781611975031.117},
  doi       = {10.1137/1.9781611975031.117},
  timestamp = {Thu, 04 Jan 2018 13:32:12 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/BrakensiekG18},
  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},
  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},
  year      = {2018},
  crossref  = {DBLP:conf/stoc/2018},
  url       = {https://doi.org/10.1145/3188745.3188816},
  doi       = {10.1145/3188745.3188816},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/BlasiokGNRS18},
  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},
  archivePrefix = {arXiv},
  eprint    = {1802.02718},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1802-02718},
  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},
  archivePrefix = {arXiv},
  eprint    = {1802.07425},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1802-07425},
  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},
  archivePrefix = {arXiv},
  eprint    = {1804.03644},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1804-03644},
  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},
  archivePrefix = {arXiv},
  eprint    = {1805.04151},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1805-04151},
  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},
  archivePrefix = {arXiv},
  eprint    = {1807.01064},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1807-01064},
  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},
  archivePrefix = {arXiv},
  eprint    = {1807.01166},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1807-01166},
  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},
  archivePrefix = {arXiv},
  eprint    = {1807.05194},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1807-05194},
  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},
  archivePrefix = {arXiv},
  eprint    = {1808.02974},
  timestamp = {Sun, 02 Sep 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1808-02974},
  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},
  archivePrefix = {arXiv},
  eprint    = {1808.04539},
  timestamp = {Sun, 02 Sep 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1808-04539},
  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},
  archivePrefix = {arXiv},
  eprint    = {1810.01969},
  timestamp = {Tue, 30 Oct 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1810-01969},
  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},
  archivePrefix = {arXiv},
  eprint    = {1810.03980},
  timestamp = {Tue, 30 Oct 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1810-03980},
  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},
  archivePrefix = {arXiv},
  eprint    = {1810.04298},
  timestamp = {Tue, 30 Oct 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1810-04298},
  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},
  archivePrefix = {arXiv},
  eprint    = {1811.04607},
  timestamp = {Fri, 23 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1811-04607},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/GroheGZ18,
  author    = {Martin Grohe and
               Venkatesan Guruswami and
               Stanislav Zivny},
  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 = {Wed, 19 Dec 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/dagstuhl-reports/GroheGZ18},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {25},
  pages     = {17},
  year      = {2018},
  url       = {https://eccc.weizmann.ac.il/report/2018/017},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiRX18},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {25},
  pages     = {27},
  year      = {2018},
  url       = {https://eccc.weizmann.ac.il/report/2018/027},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/BlasiokGNRS18},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {25},
  pages     = {37},
  year      = {2018},
  url       = {https://eccc.weizmann.ac.il/report/2018/037},
  timestamp = {Wed, 12 Sep 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/BhattiproluGGLT18},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {25},
  pages     = {59},
  year      = {2018},
  url       = {https://eccc.weizmann.ac.il/report/2018/059},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/BrakensiekG18},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {25},
  pages     = {96},
  year      = {2018},
  url       = {https://eccc.weizmann.ac.il/report/2018/096},
  timestamp = {Wed, 12 Sep 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiR18},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {25},
  pages     = {97},
  year      = {2018},
  url       = {https://eccc.weizmann.ac.il/report/2018/097},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/BhattiproluGGLT18a},
  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} Cryptology ePrint Archive},
  volume    = {2018},
  pages     = {746},
  year      = {2018},
  url       = {https://eprint.iacr.org/2018/746},
  timestamp = {Wed, 12 Sep 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/iacr/LinCGSW18},
  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. Cryptology},
  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 = {Tue, 06 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/joc/CheraghchiG17},
  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 = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/siamcomp/GuruswamiHHSV17},
  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/bib/journals/siamcomp/GuruswamiL17},
  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/bib/journals/siamcomp/AustrinGH17},
  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. Discrete Math.},
  volume    = {31},
  number    = {3},
  pages     = {1552--1571},
  year      = {2017},
  url       = {https://doi.org/10.1137/16M1070670},
  doi       = {10.1137/16M1070670},
  timestamp = {Wed, 11 Oct 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/siamdm/GuruswamiL17},
  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. Information 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 = {Thu, 27 Jul 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tit/BukhGH17},
  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. Information 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 = {Wed, 26 Jul 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tit/GuruswamiW17},
  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. Information 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 = {Wed, 26 Jul 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tit/GuruswamiJX17},
  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. Information 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 = {Tue, 22 Aug 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tit/GuruswamiW17a},
  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. Information 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 = {Wed, 11 Oct 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tit/CanonneGMS17},
  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 of Computing},
  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 = {Sat, 06 Jan 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/toc/GuruswamiL17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BrakensiekG17,
  author    = {Joshua Brakensiek and
               Venkatesan Guruswami},
  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}},
  pages     = {4:1--4:20},
  year      = {2017},
  crossref  = {DBLP:conf/approx/2017},
  url       = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.4},
  doi       = {10.4230/LIPIcs.APPROX-RANDOM.2017.4},
  timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/BrakensiekG17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiVV17,
  author    = {Venkatesan Guruswami and
               Ameya Velingker and
               Santhoshini Velusamy},
  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}},
  pages     = {8:1--8:19},
  year      = {2017},
  crossref  = {DBLP:conf/approx/2017},
  url       = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.8},
  doi       = {10.4230/LIPIcs.APPROX-RANDOM.2017.8},
  timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/GuruswamiVV17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BhattiproluGL17,
  author    = {Vijay Bhattiprolu and
               Venkatesan Guruswami and
               Euiwoong Lee},
  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}},
  pages     = {31:1--31:20},
  year      = {2017},
  crossref  = {DBLP:conf/approx/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/bib/conf/approx/BhattiproluGL17},
  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},
  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}},
  pages     = {43:1--43:17},
  year      = {2017},
  crossref  = {DBLP:conf/approx/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/bib/conf/approx/Frank-FischerGW17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiL17,
  author    = {Venkatesan Guruswami and
               Ray Li},
  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}},
  pages     = {47:1--47:13},
  year      = {2017},
  crossref  = {DBLP:conf/approx/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/bib/conf/approx/GuruswamiL17},
  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},
  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},
  year      = {2017},
  crossref  = {DBLP:conf/focs/2017},
  url       = {https://doi.org/10.1109/FOCS.2017.97},
  doi       = {10.1109/FOCS.2017.97},
  timestamp = {Tue, 04 Dec 2018 10:17:29 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/focs/BhattiproluGGLT17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/GuruswamiS17,
  author    = {Venkatesan Guruswami and
               Rishi Saket},
  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},
  pages     = {33:33--33:15},
  year      = {2017},
  crossref  = {DBLP:conf/fsttcs/2017},
  url       = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.33},
  doi       = {10.4230/LIPIcs.FSTTCS.2017.33},
  timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/fsttcs/GuruswamiS17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GuruswamiXY17,
  author    = {Venkatesan Guruswami and
               Chaoping Xing and
               Chen Yuan},
  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},
  pages     = {86:1--86:10},
  year      = {2017},
  crossref  = {DBLP:conf/icalp/2017},
  url       = {https://doi.org/10.4230/LIPIcs.ICALP.2017.86},
  doi       = {10.4230/LIPIcs.ICALP.2017.86},
  timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/GuruswamiXY17},
  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},
  year      = {2017},
  crossref  = {DBLP:conf/isit/2017},
  url       = {https://doi.org/10.1109/ISIT.2017.8006811},
  doi       = {10.1109/ISIT.2017.8006811},
  timestamp = {Thu, 17 Aug 2017 10:00:34 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/isit/DalaiGR17},
  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},
  year      = {2017},
  crossref  = {DBLP:conf/isit/2017},
  url       = {https://doi.org/10.1109/ISIT.2017.8006888},
  doi       = {10.1109/ISIT.2017.8006888},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/isit/RawatTGE17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuruswamiR17,
  author    = {Venkatesan Guruswami and
               Ankit Singh Rawat},
  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},
  year      = {2017},
  crossref  = {DBLP:conf/soda/2017},
  url       = {https://doi.org/10.1137/1.9781611974782.137},
  doi       = {10.1137/1.9781611974782.137},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/GuruswamiR17},
  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},
  archivePrefix = {arXiv},
  eprint    = {1704.01937},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/BrakensiekG17},
  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},
  archivePrefix = {arXiv},
  eprint    = {1704.05992},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/GuruswamiXY17},
  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},
  archivePrefix = {arXiv},
  eprint    = {1704.08627},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/Frank-FischerGW17},
  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},
  archivePrefix = {arXiv},
  eprint    = {1705.01963},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/GuruswamiL17},
  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},
  archivePrefix = {arXiv},
  eprint    = {1708.01070},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1708-01070},
  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},
  archivePrefix = {arXiv},
  eprint    = {1709.08216},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1709-08216},
  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},
  archivePrefix = {arXiv},
  eprint    = {1710.10322},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1710-10322},
  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},
  archivePrefix = {arXiv},
  eprint    = {1710.11516},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1710-11516},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {24},
  pages     = {64},
  year      = {2017},
  url       = {https://eccc.weizmann.ac.il/report/2017/064},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiXY17},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {24},
  pages     = {80},
  year      = {2017},
  url       = {https://eccc.weizmann.ac.il/report/2017/080},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/BrakensiekG17},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {24},
  pages     = {141},
  year      = {2017},
  url       = {https://eccc.weizmann.ac.il/report/2017/141},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/BrakensiekG17a},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {24},
  pages     = {147},
  year      = {2017},
  url       = {https://eccc.weizmann.ac.il/report/2017/147},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiS17},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {24},
  pages     = {183},
  year      = {2017},
  url       = {https://eccc.weizmann.ac.il/report/2017/183},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GopiGY17},
  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/bib/journals/algorithmica/GuruswamiO16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/GuruswamiK16,
  author    = {Venkatesan Guruswami and
               Swastik Kopparty},
  title     = {Explicit subspace designs},
  journal   = {Combinatorica},
  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 = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/combinatorica/GuruswamiK16},
  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/bib/journals/jacm/GuruswamiS16},
  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/bib/journals/mst/GuruswamiL16},
  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/bib/journals/talg/GuruswamiRS016},
  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. Information 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 = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tit/CheraghchiG16},
  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. Information 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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tit/GuruswamiWX16},
  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 of Computing},
  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 = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/toc/GuruswamiL16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GuruswamiR16,
  author    = {Venkatesan Guruswami and
               Jaikumar Radhakrishnan},
  title     = {Tight Bounds for Communication-Assisted Agreement Distillation},
  booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
               June 1, 2016, Tokyo, Japan},
  pages     = {6:1--6:17},
  year      = {2016},
  crossref  = {DBLP:conf/coco/2016},
  url       = {https://doi.org/10.4230/LIPIcs.CCC.2016.6},
  doi       = {10.4230/LIPIcs.CCC.2016.6},
  timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/GuruswamiR16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BrakensiekG16,
  author    = {Joshua Brakensiek and
               Venkatesan Guruswami},
  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},
  pages     = {14:1--14:27},
  year      = {2016},
  crossref  = {DBLP:conf/coco/2016},
  url       = {https://doi.org/10.4230/LIPIcs.CCC.2016.14},
  doi       = {10.4230/LIPIcs.CCC.2016.14},
  timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/BrakensiekG16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GuruswamiZ16,
  author    = {Venkatesan Guruswami and
               David Zuckerman},
  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},
  year      = {2016},
  crossref  = {DBLP:conf/focs/2016},
  url       = {https://doi.org/10.1109/FOCS.2016.75},
  doi       = {10.1109/FOCS.2016.75},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/focs/GuruswamiZ16},
  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},
  year      = {2016},
  crossref  = {DBLP:conf/isit/2016},
  url       = {https://doi.org/10.1109/ISIT.2016.7541373},
  doi       = {10.1109/ISIT.2016.7541373},
  timestamp = {Wed, 24 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/isit/GuruswamiL16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuruswamiL16,
  author    = {Venkatesan Guruswami and
               Euiwoong Lee},
  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},
  year      = {2016},
  crossref  = {DBLP:conf/soda/2016},
  url       = {https://doi.org/10.1137/1.9781611974331.ch119},
  doi       = {10.1137/1.9781611974331.ch119},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/GuruswamiL16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BrakensiekGZ16,
  author    = {Joshua Brakensiek and
               Venkatesan Guruswami and
               Samuel Zbarsky},
  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},
  year      = {2016},
  crossref  = {DBLP:conf/soda/2016},
  url       = {https://doi.org/10.1137/1.9781611974331.ch132},
  doi       = {10.1137/1.9781611974331.ch132},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/BrakensiekGZ16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BukhG16,
  author    = {Boris Bukh and
               Venkatesan Guruswami},
  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},
  year      = {2016},
  crossref  = {DBLP:conf/soda/2016},
  url       = {https://doi.org/10.1137/1.9781611974331.ch133},
  doi       = {10.1137/1.9781611974331.ch133},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/BukhG16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuruswamiW16,
  author    = {Venkatesan Guruswami and
               Mary Wootters},
  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},
  year      = {2016},
  crossref  = {DBLP:conf/stoc/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/bib/conf/stoc/GuruswamiW16},
  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/bib/reference/algo/Guruswami16},
  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},
  archivePrefix = {arXiv},
  eprint    = {1603.01512},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/Guruswami16},
  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},
  archivePrefix = {arXiv},
  eprint    = {1605.00903},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/BhattiproluGL16},
  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},
  archivePrefix = {arXiv},
  eprint    = {1605.04611},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/GuruswamiL16},
  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},
  archivePrefix = {arXiv},
  eprint    = {1608.00191},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/GuruswamiR16},
  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},
  archivePrefix = {arXiv},
  eprint    = {1611.05998},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/BhattiproluGLGT16},
  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},
  archivePrefix = {arXiv},
  eprint    = {1612.06335},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/GuruswamiL16a},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {23},
  pages     = {29},
  year      = {2016},
  url       = {http://eccc.hpi-web.de/report/2016/029},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/BrakensiekG16},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {23},
  pages     = {33},
  year      = {2016},
  url       = {http://eccc.hpi-web.de/report/2016/033},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiR16},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {23},
  pages     = {183},
  year      = {2016},
  url       = {http://eccc.hpi-web.de/report/2016/183},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/BrakensiekG16a},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {23},
  pages     = {185},
  year      = {2016},
  url       = {http://eccc.hpi-web.de/report/2016/185},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/BhattiproluGGLT16},
  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 = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/jct/GuruswamiX15},
  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. Discrete Math.},
  volume    = {29},
  number    = {1},
  pages     = {36--58},
  year      = {2015},
  url       = {https://doi.org/10.1137/130919416},
  doi       = {10.1137/130919416},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/siamdm/GuruswamiSS15},
  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. Information 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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tit/GuruswamiX15},
  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},
  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}},
  pages     = {152--174},
  year      = {2015},
  crossref  = {DBLP:conf/approx/2015},
  url       = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.152},
  doi       = {10.4230/LIPIcs.APPROX-RANDOM.2015.152},
  timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/BhattiproluGL15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiL15,
  author    = {Venkatesan Guruswami and
               Euiwoong Lee},
  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}},
  pages     = {284--304},
  year      = {2015},
  crossref  = {DBLP:conf/approx/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/bib/conf/approx/GuruswamiL15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiL15a,
  author    = {Venkatesan Guruswami and
               Euiwoong Lee},
  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}},
  pages     = {305--322},
  year      = {2015},
  crossref  = {DBLP:conf/approx/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/bib/conf/approx/GuruswamiL15a},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ForbesG15,
  author    = {Michael A. Forbes and
               Venkatesan Guruswami},
  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}},
  pages     = {800--814},
  year      = {2015},
  crossref  = {DBLP:conf/approx/2015},
  url       = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.800},
  doi       = {10.4230/LIPIcs.APPROX-RANDOM.2015.800},
  timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/ForbesG15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiW15,
  author    = {Venkatesan Guruswami and
               Carol Wang},
  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}},
  pages     = {867--880},
  year      = {2015},
  crossref  = {DBLP:conf/approx/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/bib/conf/approx/GuruswamiW15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GuruswamiV15,
  author    = {Venkatesan Guruswami and
               Ameya Velingker},
  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}},
  pages     = {42--57},
  year      = {2015},
  crossref  = {DBLP:conf/coco/2015},
  url       = {https://doi.org/10.4230/LIPIcs.CCC.2015.42},
  doi       = {10.4230/LIPIcs.CCC.2015.42},
  timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/GuruswamiV15},
  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},
  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},
  year      = {2015},
  crossref  = {DBLP:conf/innovations/2015},
  url       = {https://doi.org/10.1145/2688073.2688099},
  doi       = {10.1145/2688073.2688099},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/innovations/CanonneGMS15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuruswamiL15,
  author    = {Venkatesan Guruswami and
               Euiwoong Lee},
  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},
  year      = {2015},
  crossref  = {DBLP:conf/soda/2015},
  url       = {https://doi.org/10.1137/1.9781611973730.56},
  doi       = {10.1137/1.9781611973730.56},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/GuruswamiL15},
  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},
  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},
  year      = {2015},
  crossref  = {DBLP:conf/soda/2015},
  url       = {https://doi.org/10.1137/1.9781611973730.87},
  doi       = {10.1137/1.9781611973730.87},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/GuruswamiSVW15},
  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       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7352273},
  isbn      = {978-1-4673-8191-8},
  timestamp = {Mon, 04 Jan 2016 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/focs/2015},
  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},
  archivePrefix = {arXiv},
  eprint    = {1506.06302},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/GuruswamiL15},
  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},
  archivePrefix = {arXiv},
  eprint    = {1506.06444},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/BhattiproluGL15},
  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},
  archivePrefix = {arXiv},
  eprint    = {1507.01719},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/BukhG15},
  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},
  archivePrefix = {arXiv},
  eprint    = {1507.06175},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/BrakensiekGZ15},
  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},
  archivePrefix = {arXiv},
  eprint    = {1508.00603},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/GuruswamiJX15},
  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},
  archivePrefix = {arXiv},
  eprint    = {1509.04764},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/GuruswamiW15},
  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/bib/journals/dagstuhl-reports/BulatovGKM15},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {22},
  pages     = {105},
  year      = {2015},
  url       = {http://eccc.hpi-web.de/report/2015/105},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiL15},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {22},
  pages     = {116},
  year      = {2015},
  url       = {http://eccc.hpi-web.de/report/2015/116},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/BrakensiekGZ15},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {22},
  pages     = {117},
  year      = {2015},
  url       = {http://eccc.hpi-web.de/report/2015/117},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/BukhG15},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {22},
  pages     = {155},
  year      = {2015},
  url       = {http://eccc.hpi-web.de/report/2015/155},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiL15a},
  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} Journal on Optimization},
  volume    = {24},
  number    = {4},
  pages     = {1698--1717},
  year      = {2014},
  url       = {https://doi.org/10.1137/13093025X},
  doi       = {10.1137/13093025X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/siamjo/GuruswamiSZ14},
  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. Information 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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tit/GuruswamiN14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiW14,
  author    = {Venkatesan Guruswami and
               Carol Wang},
  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},
  pages     = {748--761},
  year      = {2014},
  crossref  = {DBLP:conf/approx/2014},
  url       = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.748},
  doi       = {10.4230/LIPIcs.APPROX-RANDOM.2014.748},
  timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/GuruswamiW14},
  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},
  year      = {2014},
  crossref  = {DBLP:conf/coco/2014},
  url       = {https://doi.org/10.1109/CCC.2014.24},
  doi       = {10.1109/CCC.2014.24},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/GuruswamiX14},
  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},
  year      = {2014},
  crossref  = {DBLP:conf/focs/2014},
  url       = {https://doi.org/10.1109/FOCS.2014.9},
  doi       = {10.1109/FOCS.2014.9},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/focs/AustrinHG14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/CheraghchiG14,
  author    = {Mahdi Cheraghchi and
               Venkatesan Guruswami},
  title     = {Capacity of non-malleable codes},
  booktitle = {Innovations in Theoretical Computer Science, ITCS'14, Princeton, NJ,
               USA, January 12-14, 2014},
  pages     = {155--168},
  year      = {2014},
  crossref  = {DBLP:conf/innovations/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/bib/conf/innovations/CheraghchiG14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/GuruswamiL14,
  author    = {Venkatesan Guruswami and
               Euiwoong Lee},
  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},
  year      = {2014},
  crossref  = {DBLP:conf/innovations/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/bib/conf/innovations/GuruswamiL14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuruswamiX14,
  author    = {Venkatesan Guruswami and
               Chaoping Xing},
  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},
  year      = {2014},
  crossref  = {DBLP:conf/soda/2014},
  url       = {https://doi.org/10.1137/1.9781611973402.134},
  doi       = {10.1137/1.9781611973402.134},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/GuruswamiX14},
  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},
  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},
  year      = {2014},
  crossref  = {DBLP:conf/stoc/2014},
  url       = {https://doi.org/10.1145/2591796.2591882},
  doi       = {10.1145/2591796.2591882},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/GuruswamiHHSV14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/CheraghchiG14,
  author    = {Mahdi Cheraghchi and
               Venkatesan Guruswami},
  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},
  pages     = {440--464},
  year      = {2014},
  crossref  = {DBLP:conf/tcc/2014},
  url       = {https://doi.org/10.1007/978-3-642-54242-8\_19},
  doi       = {10.1007/978-3-642-54242-8\_19},
  timestamp = {Fri, 02 Nov 2018 09:44:20 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/tcc/CheraghchiG14},
  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},
  archivePrefix = {arXiv},
  eprint    = {1411.3603},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/CanonneGMS14},
  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},
  archivePrefix = {arXiv},
  eprint    = {1411.6667},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/GuruswamiW14},
  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},
  archivePrefix = {arXiv},
  eprint    = {1411.6993},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/GuruswamiV14},
  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},
  archivePrefix = {arXiv},
  eprint    = {1411.7455},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/ForbesG14},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {21},
  pages     = {6},
  year      = {2014},
  url       = {http://eccc.hpi-web.de/report/2014/006},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiL14},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {21},
  pages     = {43},
  year      = {2014},
  url       = {http://eccc.hpi-web.de/report/2014/043},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiL14a},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {21},
  pages     = {67},
  year      = {2014},
  url       = {http://eccc.hpi-web.de/report/2014/067},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiSVW14},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {21},
  pages     = {153},
  year      = {2014},
  url       = {http://eccc.hpi-web.de/report/2014/153},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/CanonneGMS14},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {21},
  pages     = {162},
  year      = {2014},
  url       = {http://eccc.hpi-web.de/report/2014/162},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/ForbesG14},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {21},
  pages     = {165},
  year      = {2014},
  url       = {http://eccc.hpi-web.de/report/2014/165},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiV14},
  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/bib/journals/siamcomp/CheraghchiGV13},
  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. Information 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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tit/GuruswamiW13},
  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 of Computing},
  volume    = {9},
  pages     = {413--435},
  year      = {2013},
  url       = {https://doi.org/10.4086/toc.2013.v009a011},
  doi       = {10.4086/toc.2013.v009a011},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/toc/GuruswamiS13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiN13,
  author    = {Venkatesan Guruswami and
               Srivatsan Narayanan},
  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},
  pages     = {591--606},
  year      = {2013},
  crossref  = {DBLP:conf/approx/2013},
  url       = {https://doi.org/10.1007/978-3-642-40328-6\_41},
  doi       = {10.1007/978-3-642-40328-6\_41},
  timestamp = {Tue, 23 May 2017 01:10:59 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/GuruswamiN13},
  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},
  year      = {2013},
  crossref  = {DBLP:conf/coco/2013},
  url       = {https://doi.org/10.1109/CCC.2013.37},
  doi       = {10.1109/CCC.2013.37},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/GuruswamiO13},
  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},
  year      = {2013},
  crossref  = {DBLP:conf/focs/2013},
  url       = {https://doi.org/10.1109/FOCS.2013.41},
  doi       = {10.1109/FOCS.2013.41},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/focs/GuruswamiX13},
  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},
  year      = {2013},
  crossref  = {DBLP:conf/focs/2013},
  url       = {https://doi.org/10.1109/FOCS.2013.44},
  doi       = {10.1109/FOCS.2013.44},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/focs/DinurG13},
  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},
  year      = {2013},
  crossref  = {DBLP:conf/focs/2013},
  url       = {https://doi.org/10.1109/FOCS.2013.71},
  doi       = {10.1109/FOCS.2013.71},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/focs/GuruswamiK13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Guruswami13,
  author    = {Venkatesan Guruswami},
  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},
  pages     = {1--1},
  year      = {2013},
  crossref  = {DBLP:conf/fsttcs/2013},
  url       = {https://doi.org/10.4230/LIPIcs.FSTTCS.2013.1},
  doi       = {10.4230/LIPIcs.FSTTCS.2013.1},
  timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/fsttcs/Guruswami13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuruswamiS13,
  author    = {Venkatesan Guruswami and
               Ali Kemal Sinop},
  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},
  year      = {2013},
  crossref  = {DBLP:conf/soda/2013},
  url       = {https://doi.org/10.1137/1.9781611973105.22},
  doi       = {10.1137/1.9781611973105.22},
  timestamp = {Wed, 24 May 2017 08:31:20 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/GuruswamiS13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CheraghchiGV13,
  author    = {Mahdi Cheraghchi and
               Venkatesan Guruswami and
               Ameya Velingker},
  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},
  year      = {2013},
  crossref  = {DBLP:conf/soda/2013},
  url       = {https://doi.org/10.1137/1.9781611973105.31},
  doi       = {10.1137/1.9781611973105.31},
  timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/CheraghchiGV13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuruswamiX13,
  author    = {Venkatesan Guruswami and
               Chaoping Xing},
  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},
  year      = {2013},
  crossref  = {DBLP:conf/stoc/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/bib/conf/stoc/GuruswamiX13},
  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},
  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},
  year      = {2013},
  crossref  = {DBLP:conf/www/2013},
  url       = {https://doi.org/10.1145/2488388.2488400},
  doi       = {10.1145/2488388.2488400},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/www/BeutelXGPF13},
  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},
  archivePrefix = {arXiv},
  eprint    = {1302.6660},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1302-6660},
  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},
  archivePrefix = {arXiv},
  eprint    = {1304.4321},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1304-4321},
  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},
  archivePrefix = {arXiv},
  eprint    = {1309.0458},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/CheraghchiG13},
  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},
  archivePrefix = {arXiv},
  eprint    = {1309.1151},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/CheraghchiG13a},
  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},
  archivePrefix = {arXiv},
  eprint    = {1311.7084},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/GuruswamiW13},
  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},
  archivePrefix = {arXiv},
  eprint    = {1311.7407},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/GuruswamiHHSV13},
  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},
  archivePrefix = {arXiv},
  eprint    = {1312.3024},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/GuruswamiS13},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {20},
  pages     = {2},
  year      = {2013},
  url       = {http://eccc.hpi-web.de/report/2013/002},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiO13},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {20},
  pages     = {46},
  year      = {2013},
  url       = {http://eccc.hpi-web.de/report/2013/046},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiX13},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {20},
  pages     = {50},
  year      = {2013},
  url       = {http://eccc.hpi-web.de/report/2013/050},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiX13a},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiK13,
  author    = {Venkatesan Guruswami and
               Swastik Kopparty},
  title     = {Explicit Subspace Designs},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {20},
  pages     = {60},
  year      = {2013},
  url       = {http://eccc.hpi-web.de/report/2013/060},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiK13},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {20},
  pages     = {71},
  year      = {2013},
  url       = {http://eccc.hpi-web.de/report/2013/071},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiSS13},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {20},
  pages     = {118},
  year      = {2013},
  url       = {http://eccc.hpi-web.de/report/2013/118},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/CheraghchiG13},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {20},
  pages     = {121},
  year      = {2013},
  url       = {http://eccc.hpi-web.de/report/2013/121},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/CheraghchiG13a},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {20},
  pages     = {122},
  year      = {2013},
  url       = {http://eccc.hpi-web.de/report/2013/122},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/DinurG13a},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {20},
  pages     = {125},
  year      = {2013},
  url       = {http://eccc.hpi-web.de/report/2013/125},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiL13},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {20},
  pages     = {159},
  year      = {2013},
  url       = {http://eccc.hpi-web.de/report/2013/159},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/AustrinGH13},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {20},
  pages     = {167},
  year      = {2013},
  url       = {http://eccc.hpi-web.de/report/2013/167},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiHHSV13},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {20},
  pages     = {170},
  year      = {2013},
  url       = {http://eccc.hpi-web.de/report/2013/170},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiW13},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {20},
  pages     = {175},
  year      = {2013},
  url       = {http://eccc.hpi-web.de/report/2013/175},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiX13b},
  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} Cryptology ePrint Archive},
  volume    = {2013},
  pages     = {564},
  year      = {2013},
  url       = {http://eprint.iacr.org/2013/564},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/iacr/CheraghchiG13},
  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} Cryptology ePrint Archive},
  volume    = {2013},
  pages     = {565},
  year      = {2013},
  url       = {http://eprint.iacr.org/2013/565},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/iacr/CheraghchiG13a},
  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/bib/journals/siamcomp/FeldmanGRW12},
  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 of Computing},
  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 = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/toc/GuruswamiZ12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiZ12,
  author    = {Venkatesan Guruswami and
               Yuan Zhou},
  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},
  pages     = {158--169},
  year      = {2012},
  crossref  = {DBLP:conf/approx/2012},
  url       = {https://doi.org/10.1007/978-3-642-32512-0\_14},
  doi       = {10.1007/978-3-642-32512-0\_14},
  timestamp = {Tue, 23 May 2017 01:11:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/GuruswamiZ12},
  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},
  year      = {2012},
  crossref  = {DBLP:conf/focs/2012},
  url       = {https://doi.org/10.1109/FOCS.2012.58},
  doi       = {10.1109/FOCS.2012.58},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/focs/GuruswamiS12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/GuruswamiNW12,
  author    = {Venkatesan Guruswami and
               Srivatsan Narayanan and
               Carol Wang},
  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},
  year      = {2012},
  crossref  = {DBLP:conf/innovations/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/bib/conf/innovations/GuruswamiNW12},
  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},
  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},
  year      = {2012},
  crossref  = {DBLP:conf/soda/2012},
  url       = {http://portal.acm.org/citation.cfm?id=2095150\&\#38;CFID=63838676\&\#38;CFTOKEN=79617016},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/BhaskaraCVGZ12},
  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},
  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},
  year      = {2012},
  crossref  = {DBLP:conf/soda/2012},
  url       = {http://portal.acm.org/citation.cfm?id=2095174\&\#38;CFID=63838676\&\#38;CFTOKEN=79617016},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/GuruswamiRSW12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuruswamiS12,
  author    = {Venkatesan Guruswami and
               Ali Kemal Sinop},
  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},
  year      = {2012},
  crossref  = {DBLP:conf/soda/2012},
  url       = {http://portal.acm.org/citation.cfm?id=2095211\&\#38;CFID=63838676\&\#38;CFTOKEN=79617016},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/GuruswamiS12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuruswamiX12,
  author    = {Venkatesan Guruswami and
               Chaoping Xing},
  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},
  year      = {2012},
  crossref  = {DBLP:conf/stoc/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/bib/conf/stoc/GuruswamiX12},
  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},
  archivePrefix = {arXiv},
  eprint    = {1202.0535},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1202-0535},
  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},
  archivePrefix = {arXiv},
  eprint    = {1202.6071},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1202-6071},
  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},
  archivePrefix = {arXiv},
  eprint    = {1202.6086},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1202-6086},
  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},
  archivePrefix = {arXiv},
  eprint    = {1204.4209},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1204-4209},
  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},
  archivePrefix = {arXiv},
  eprint    = {1207.1140},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1207-1140},
  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},
  archivePrefix = {arXiv},
  eprint    = {1207.4372},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1207-4372},
  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},
  archivePrefix = {arXiv},
  eprint    = {1212.6925},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1212-6925},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {19},
  pages     = {17},
  year      = {2012},
  url       = {http://eccc.hpi-web.de/report/2012/017},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiN12},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {19},
  pages     = {36},
  year      = {2012},
  url       = {http://eccc.hpi-web.de/report/2012/036},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiX12},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {19},
  pages     = {73},
  year      = {2012},
  url       = {http://eccc.hpi-web.de/report/2012/073},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiW12},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {19},
  pages     = {74},
  year      = {2012},
  url       = {http://eccc.hpi-web.de/report/2012/074},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiZ12},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {19},
  pages     = {82},
  year      = {2012},
  url       = {http://eccc.hpi-web.de/report/2012/082},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/CheraghchiGV12},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {19},
  pages     = {111},
  year      = {2012},
  url       = {http://eccc.hpi-web.de/report/2012/111},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiS12},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {19},
  pages     = {146},
  year      = {2012},
  url       = {http://eccc.hpi-web.de/report/2012/146},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiX12a},
  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 Inf.},
  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 = {Mon, 05 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/acta/ChakrabartiGWW11},
  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 = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/jcss/GopalanG11},
  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 = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/siamcomp/GuruswamiHMRC11},
  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/bib/journals/siamcomp/GopalanGR11},
  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       = {http://epubs.siam.org/sicomp/resource/1/smjcat/v40/i6/p1738\_s1},
  timestamp = {Sun, 17 Dec 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/siamcomp/ChawlaDG11},
  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. Information 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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tit/GuruswamiR11},
  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. Information 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 = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/tit/GuruswamiHK11},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiW11,
  author    = {Venkatesan Guruswami and
               Carol Wang},
  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},
  pages     = {593--604},
  year      = {2011},
  crossref  = {DBLP:conf/approx/2011},
  url       = {https://doi.org/10.1007/978-3-642-22935-0\_50},
  doi       = {10.1007/978-3-642-22935-0\_50},
  timestamp = {Tue, 23 May 2017 01:11:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/GuruswamiW11},
  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},
  year      = {2011},
  crossref  = {DBLP:conf/coco/2011},
  url       = {https://doi.org/10.1109/CCC.2011.22},
  doi       = {10.1109/CCC.2011.22},
  timestamp = {Tue, 19 Jun 2018 18:38:13 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/Guruswami11},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GuruswamiS11,
  author    = {Venkatesan Guruswami and
               Ali Kemal Sinop},
  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},
  year      = {2011},
  crossref  = {DBLP:conf/focs/2011},
  url       = {https://doi.org/10.1109/FOCS.2011.36},
  doi       = {10.1109/FOCS.2011.36},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/focs/GuruswamiS11},
  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},
  title     = {Finding Almost-Perfect Graph Bisections},
  booktitle = {Innovations in Computer Science - {ICS} 2010, Tsinghua University,
               Beijing, China, January 7-9, 2011. Proceedings},
  pages     = {321--337},
  year      = {2011},
  crossref  = {DBLP:conf/innovations/2011},
  url       = {http://conference.itcs.tsinghua.edu.cn/ICS2011/content/papers/11.html},
  timestamp = {Wed, 19 Oct 2011 15:40:50 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/innovations/GuruswamiMRSZ11},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuruswamiZ11,
  author    = {Venkatesan Guruswami and
               Yuan Zhou},
  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},
  year      = {2011},
  crossref  = {DBLP:conf/soda/2011},
  url       = {https://doi.org/10.1137/1.9781611973082.122},
  doi       = {10.1137/1.9781611973082.122},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/GuruswamiZ11},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuruswamiS11,
  author    = {Venkatesan Guruswami and
               Ali Kemal Sinop},
  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},
  year      = {2011},
  crossref  = {DBLP:conf/soda/2011},
  url       = {https://doi.org/10.1137/1.9781611973082.125},
  doi       = {10.1137/1.9781611973082.125},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/GuruswamiS11},
  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},
  archivePrefix = {arXiv},
  eprint    = {1104.1732},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1104-1732},
  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},
  archivePrefix = {arXiv},
  eprint    = {1104.4746},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1104-4746},
  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},
  archivePrefix = {arXiv},
  eprint    = {1106.0436},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1106-0436},
  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},
  archivePrefix = {arXiv},
  eprint    = {1106.3951},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1106-3951},
  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},
  archivePrefix = {arXiv},
  eprint    = {1110.1360},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1110-1360},
  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},
  archivePrefix = {arXiv},
  eprint    = {1112.4109},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1112-4109},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {18},
  pages     = {27},
  year      = {2011},
  url       = {http://eccc.hpi-web.de/report/2011/027},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiHMRC11},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {18},
  pages     = {66},
  year      = {2011},
  url       = {http://eccc.hpi-web.de/report/2011/066},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiS11},
  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   = {Combinatorica},
  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 = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/combinatorica/GuruswamiLR10},
  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   = {Combinatorica},
  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 = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/combinatorica/AndrewsCGKTZ10},
  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 = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/siamcomp/Ben-SassonGKSV10},
  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. Information 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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tit/GuruswamiR10},
  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. Information 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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tit/GuruswamiV10},
  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},
  year      = {2010},
  crossref  = {DBLP:conf/focs/2010},
  url       = {https://doi.org/10.1109/FOCS.2010.74},
  doi       = {10.1109/FOCS.2010.74},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/focs/GuruswamiS10},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GuruswamiS10,
  author    = {Venkatesan Guruswami and
               Rishi Saket},
  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}},
  pages     = {360--371},
  year      = {2010},
  crossref  = {DBLP:conf/icalp/2010-1},
  url       = {https://doi.org/10.1007/978-3-642-14165-2\_31},
  doi       = {10.1007/978-3-642-14165-2\_31},
  timestamp = {Wed, 14 Nov 2018 11:00:14 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/GuruswamiS10},
  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},
  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}},
  pages     = {617--628},
  year      = {2010},
  crossref  = {DBLP:conf/icalp/2010-1},
  url       = {https://doi.org/10.1007/978-3-642-14165-2\_52},
  doi       = {10.1007/978-3-642-14165-2\_52},
  timestamp = {Wed, 14 Nov 2018 11:00:14 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/GuruswamiKOPTW10},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuruswamiHK10,
  author    = {Venkatesan Guruswami and
               Johan H{\aa}stad and
               Swastik Kopparty},
  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},
  year      = {2010},
  crossref  = {DBLP:conf/stoc/2010},
  url       = {https://doi.org/10.1145/1806689.1806747},
  doi       = {10.1145/1806689.1806747},
  timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/GuruswamiHK10},
  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},
  archivePrefix = {arXiv},
  eprint    = {1001.1386},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1001-1386},
  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},
  archivePrefix = {arXiv},
  eprint    = {1004.4017},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1004-4017},
  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},
  archivePrefix = {arXiv},
  eprint    = {1012.0729},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1012-0729},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {17},
  pages     = {3},
  year      = {2010},
  url       = {http://eccc.hpi-web.de/report/2010/003},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiHK10},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {17},
  pages     = {63},
  year      = {2010},
  url       = {http://eccc.hpi-web.de/report/2010/063},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiZ10},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {17},
  pages     = {77},
  year      = {2010},
  url       = {http://eccc.hpi-web.de/report/2010/077},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiS10},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {17},
  pages     = {111},
  year      = {2010},
  url       = {http://eccc.hpi-web.de/report/2010/111},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiS10a},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {17},
  pages     = {177},
  year      = {2010},
  url       = {http://eccc.hpi-web.de/report/2010/177},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiRSW10},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {17},
  pages     = {185},
  year      = {2010},
  url       = {http://eccc.hpi-web.de/report/2010/185},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/FeldmanGRW10},
  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/bib/journals/cacm/GuruswamiR09},
  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/bib/journals/jacm/GuruswamiUV09},
  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/bib/journals/siamcomp/GuruswamiR09},
  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. Information 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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tit/GuruswamiR09},
  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   = {{TOCT}},
  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 = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/toct/GuruswamiR09},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiS09,
  author    = {Venkatesan Guruswami and
               Ali Kemal Sinop},
  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},
  pages     = {163--176},
  year      = {2009},
  crossref  = {DBLP:conf/approx/2009},
  url       = {https://doi.org/10.1007/978-3-642-03685-9\_13},
  doi       = {10.1007/978-3-642-03685-9\_13},
  timestamp = {Tue, 23 May 2017 01:11:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/GuruswamiS09},
  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},
  year      = {2009},
  crossref  = {DBLP:conf/coco/2009},
  url       = {https://doi.org/10.1109/CCC.2009.6},
  doi       = {10.1109/CCC.2009.6},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/Ben-SassonGKSV09},
  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},
  year      = {2009},
  crossref  = {DBLP:conf/coco/2009},
  url       = {https://doi.org/10.1109/CCC.2009.29},
  doi       = {10.1109/CCC.2009.29},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/coco/CharikarGM09},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/codcry/Guruswami09,
  author    = {Venkatesan Guruswami},
  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},
  pages     = {97--106},
  year      = {2009},
  crossref  = {DBLP:conf/codcry/2009},
  url       = {https://doi.org/10.1007/978-3-642-01877-0\_10},
  doi       = {10.1007/978-3-642-01877-0\_10},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/codcry/Guruswami09},
  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},
  year      = {2009},
  crossref  = {DBLP:conf/focs/2009},
  url       = {https://doi.org/10.1109/FOCS.2009.26},
  doi       = {10.1109/FOCS.2009.26},
  timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/focs/FeldmanGRW09},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GopalanGR09,
  author    = {Parikshit Gopalan and
               Venkatesan Guruswami and
               Prasad Raghavendra},
  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},
  year      = {2009},
  crossref  = {DBLP:conf/stoc/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/bib/conf/stoc/GopalanGR09},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Guruswami09,
  author    = {Venkatesan Guruswami},
  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},
  year      = {2009},
  crossref  = {DBLP:conf/stoc/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/bib/conf/stoc/Guruswami09},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BateniCG09,
  author    = {MohammadHossein Bateni and
               Moses Charikar and
               Venkatesan Guruswami},
  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},
  year      = {2009},
  crossref  = {DBLP:conf/stoc/2009},
  url       = {https://doi.org/10.1145/1536414.1536488},
  doi       = {10.1145/1536414.1536488},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/BateniCG09},
  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},
  archivePrefix = {arXiv},
  eprint    = {0910.2271},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-0910-2271},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {16},
  pages     = {1},
  year      = {2009},
  url       = {http://eccc.hpi-web.de/report/2009/001},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/Guruswami09},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {16},
  pages     = {20},
  year      = {2009},
  url       = {http://eccc.hpi-web.de/report/2009/020},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiR09},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {16},
  pages     = {99},
  year      = {2009},
  url       = {http://eccc.hpi-web.de/report/2009/099},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiS09},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {16},
  pages     = {126},
  year      = {2009},
  url       = {http://eccc.hpi-web.de/report/2009/126},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/Ben-SassonGKSV09},
  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/bib/journals/algorithmica/GopalanGL08},
  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   = {Computational Complexity},
  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, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/cc/GuruswamiK08},
  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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/moc/GuruswamiP08},
  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. Information 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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tit/GuruswamiR08},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiR08,
  author    = {Venkatesan Guruswami and
               Prasad Raghavendra},
  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},
  pages     = {77--90},
  year      = {2008},
  crossref  = {DBLP:conf/approx/2008},
  url       = {https://doi.org/10.1007/978-3-540-85363-3\_7},
  doi       = {10.1007/978-3-540-85363-3\_7},
  timestamp = {Tue, 13 Jun 2017 10:37:56 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/GuruswamiR08},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiLW08,
  author    = {Venkatesan Guruswami and
               James R. Lee and
               Avi Wigderson},
  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},
  pages     = {444--454},
  year      = {2008},
  crossref  = {DBLP:conf/approx/2008},
  url       = {https://doi.org/10.1007/978-3-540-85363-3\_35},
  doi       = {10.1007/978-3-540-85363-3\_35},
  timestamp = {Tue, 13 Jun 2017 10:37:56 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/GuruswamiLW08},
  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},
  year      = {2008},
  crossref  = {DBLP:conf/coco/2008},
  url       = {https://doi.org/10.1109/CCC.2008.17},
  doi       = {10.1109/CCC.2008.17},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/GopalanG08},
  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},
  year      = {2008},
  crossref  = {DBLP:conf/coco/2008},
  url       = {https://doi.org/10.1109/CCC.2008.13},
  doi       = {10.1109/CCC.2008.13},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/GuruswamiR08},
  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},
  year      = {2008},
  crossref  = {DBLP:conf/focs/2008},
  url       = {https://doi.org/10.1109/FOCS.2008.51},
  doi       = {10.1109/FOCS.2008.51},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/focs/GuruswamiMR08},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icits/Guruswami08,
  author    = {Venkatesan Guruswami},
  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},
  pages     = {118--119},
  year      = {2008},
  crossref  = {DBLP:conf/icits/2008},
  url       = {https://doi.org/10.1007/978-3-540-85093-9\_12},
  doi       = {10.1007/978-3-540-85093-9\_12},
  timestamp = {Tue, 13 Jun 2017 10:37:56 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icits/Guruswami08},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/GuruswamiM08,
  author    = {Venkatesan Guruswami and
               Widad Machmouchi},
  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},
  year      = {2008},
  crossref  = {DBLP:conf/isit/2008},
  url       = {https://doi.org/10.1109/ISIT.2008.4595333},
  doi       = {10.1109/ISIT.2008.4595333},
  timestamp = {Wed, 24 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/isit/GuruswamiM08},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuruswamiR08,
  author    = {Venkatesan Guruswami and
               Atri Rudra},
  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},
  year      = {2008},
  crossref  = {DBLP:conf/soda/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/bib/conf/soda/GuruswamiR08},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuruswamiLR08,
  author    = {Venkatesan Guruswami and
               James R. Lee and
               Alexander A. Razborov},
  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},
  year      = {2008},
  crossref  = {DBLP:conf/soda/2008},
  url       = {http://dl.acm.org/citation.cfm?id=1347082.1347121},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/GuruswamiLR08},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Guruswami08,
  author    = {Venkatesan Guruswami},
  title     = {Decoding Reed-Solomon Codes},
  booktitle = {Encyclopedia of Algorithms},
  year      = {2008},
  crossref  = {DBLP:reference/algo/2008},
  url       = {https://doi.org/10.1007/978-0-387-30162-4\_101},
  doi       = {10.1007/978-0-387-30162-4\_101},
  timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/reference/algo/Guruswami08},
  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},
  archivePrefix = {arXiv},
  eprint    = {0811.4139},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-0811-4139},
  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},
  archivePrefix = {arXiv},
  eprint    = {0811.4395},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-0811-4395},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {15},
  number    = {008},
  year      = {2008},
  url       = {http://eccc.hpi-web.de/eccc-reports/2008/TR08-008/index.html},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiR08},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {15},
  number    = {036},
  year      = {2008},
  url       = {http://eccc.hpi-web.de/eccc-reports/2008/TR08-036/index.html},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiR08a},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {15},
  number    = {054},
  year      = {2008},
  url       = {http://eccc.hpi-web.de/eccc-reports/2008/TR08-054/index.html},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiR08b},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {15},
  number    = {105},
  year      = {2008},
  url       = {http://eccc.hpi-web.de/eccc-reports/2008/TR08-105/index.html},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GopalanGRR08},
  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   = {Computational Complexity},
  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, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/cc/GuruswamiK07},
  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, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/talg/AlonGKS07},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaecc/Guruswami07,
  author    = {Venkatesan Guruswami},
  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},
  pages     = {1--6},
  year      = {2007},
  crossref  = {DBLP:conf/aaecc/2007},
  url       = {https://doi.org/10.1007/978-3-540-77224-8\_1},
  doi       = {10.1007/978-3-540-77224-8\_1},
  timestamp = {Fri, 02 Jun 2017 13:01:06 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/aaecc/Guruswami07},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiR07,
  author    = {Venkatesan Guruswami and
               Atri Rudra},
  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},
  pages     = {554--568},
  year      = {2007},
  crossref  = {DBLP:conf/approx/2007},
  url       = {https://doi.org/10.1007/978-3-540-74208-1\_40},
  doi       = {10.1007/978-3-540-74208-1\_40},
  timestamp = {Fri, 02 Jun 2017 13:01:07 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/GuruswamiR07},
  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},
  year      = {2007},
  crossref  = {DBLP:conf/coco/2007},
  url       = {https://doi.org/10.1109/CCC.2007.38},
  doi       = {10.1109/CCC.2007.38},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/GuruswamiUV07},
  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},
  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},
  year      = {2007},
  crossref  = {DBLP:conf/stoc/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/bib/conf/stoc/ChuzhoyGKT07},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuruswamiR07,
  author    = {Venkatesan Guruswami and
               Prasad Raghavendra},
  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},
  year      = {2007},
  crossref  = {DBLP:conf/stoc/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/bib/conf/stoc/GuruswamiR07},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {14},
  number    = {086},
  year      = {2007},
  url       = {http://eccc.hpi-web.de/eccc-reports/2007/TR07-086/index.html},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiLR07},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {14},
  number    = {089},
  year      = {2007},
  url       = {http://eccc.hpi-web.de/eccc-reports/2007/TR07-089/index.html},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GopalanG07},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {14},
  number    = {109},
  year      = {2007},
  url       = {http://eccc.hpi-web.de/eccc-reports/2007/TR07-109/index.html},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiR07},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {14},
  number    = {113},
  year      = {2007},
  url       = {http://eccc.hpi-web.de/eccc-reports/2007/TR07-113/index.html},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/AndrewsCGKTZ07},
  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   = {Bulletin of the {EATCS}},
  volume    = {90},
  pages     = {53--88},
  year      = {2006},
  timestamp = {Tue, 20 Mar 2012 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/eatcs/Guruswami06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fttcs/Guruswami06,
  author    = {Venkatesan Guruswami},
  title     = {Algorithmic Results in List Decoding},
  journal   = {Foundations and Trends in Theoretical Computer Science},
  volume    = {2},
  number    = {2},
  year      = {2006},
  url       = {https://doi.org/10.1561/0400000007},
  doi       = {10.1561/0400000007},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/fttcs/Guruswami06},
  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. Information 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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tit/GuruswamiR06},
  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 of Computing},
  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 = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/toc/GiotisG06},
  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},
  year      = {2006},
  crossref  = {DBLP:conf/focs/2006},
  url       = {https://doi.org/10.1109/FOCS.2006.23},
  doi       = {10.1109/FOCS.2006.23},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/focs/GuruswamiP06},
  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},
  year      = {2006},
  crossref  = {DBLP:conf/focs/2006},
  url       = {https://doi.org/10.1109/FOCS.2006.33},
  doi       = {10.1109/FOCS.2006.33},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/focs/GuruswamiR06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Guruswami06,
  author    = {Venkatesan Guruswami},
  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},
  pages     = {267--276},
  year      = {2006},
  crossref  = {DBLP:conf/isaac/2006},
  url       = {https://doi.org/10.1007/11940128\_28},
  doi       = {10.1007/11940128\_28},
  timestamp = {Fri, 02 Jun 2017 13:01:08 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/isaac/Guruswami06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/itw/Guruswami06,
  author    = {Venkatesan Guruswami},
  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},
  year      = {2006},
  crossref  = {DBLP:conf/itw/2006},
  url       = {https://doi.org/10.1109/ITW.2006.1633776},
  doi       = {10.1109/ITW.2006.1633776},
  timestamp = {Fri, 08 Feb 2019 17:00:56 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/itw/Guruswami06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/GopalanGL06,
  author    = {Parikshit Gopalan and
               Venkatesan Guruswami and
               Richard J. Lipton},
  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},
  pages     = {544--555},
  year      = {2006},
  crossref  = {DBLP:conf/latin/2006},
  url       = {https://doi.org/10.1007/11682462\_51},
  doi       = {10.1007/11682462\_51},
  timestamp = {Sun, 04 Jun 2017 10:09:36 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/latin/GopalanGL06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/GuruswamiK06,
  author    = {Venkatesan Guruswami and
               Valentine Kabanets},
  title     = {Hardness Amplification Via Space-Efficient Direct Products},
  booktitle = {{LATIN} 2006: Theoretical Informatics, 7th Latin American Symposium,
               Valdivia, Chile, March 20-24, 2006, Proceedings},
  pages     = {556--568},
  year      = {2006},
  crossref  = {DBLP:conf/latin/2006},
  url       = {https://doi.org/10.1007/11682462\_52},
  doi       = {10.1007/11682462\_52},
  timestamp = {Sun, 04 Jun 2017 10:09:36 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/latin/GuruswamiK06},
  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},
  year      = {2006},
  crossref  = {DBLP:conf/soda/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/bib/conf/soda/GiotisG06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuruswamiR06,
  author    = {Venkatesan Guruswami and
               Atri Rudra},
  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},
  year      = {2006},
  crossref  = {DBLP:conf/stoc/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/bib/conf/stoc/GuruswamiR06},
  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},
  archivePrefix = {arXiv},
  eprint    = {cs/0610022},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-cs-0610022},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {13},
  number    = {061},
  year      = {2006},
  url       = {http://eccc.hpi-web.de/eccc-reports/2006/TR06-061/index.html},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiR06},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {13},
  number    = {123},
  year      = {2006},
  url       = {http://eccc.hpi-web.de/eccc-reports/2006/TR06-123/index.html},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/Guruswami06},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {13},
  number    = {134},
  year      = {2006},
  url       = {http://eccc.hpi-web.de/eccc-reports/2006/TR06-134/index.html},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiUV06},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {13},
  number    = {141},
  year      = {2006},
  url       = {http://eccc.hpi-web.de/eccc-reports/2006/TR06-141/index.html},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GuruswamiT06},
  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   = {Computational Complexity},
  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 = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/cc/GuruswamiMR05},
  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 = {Tue, 06 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/jcss/CharikarGW05},
  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, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/siamcomp/DinurGKR05},
  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. Information 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 = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/tit/GuruswamiV05},
  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. Information 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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tit/GuruswamiI05},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiT05,
  author    = {Venkatesan Guruswami 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},
  pages     = {99--110},
  year      = {2005},
  crossref  = {DBLP:conf/approx/2005},
  url       = {https://doi.org/10.1007/11538462\_9},
  doi       = {10.1007/11538462\_9},
  timestamp = {Tue, 30 May 2017 16:36:53 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/GuruswamiT05},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiR05,
  author    = {Venkatesan Guruswami and
               Atri Rudra},
  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},
  pages     = {306--317},
  year      = {2005},
  crossref  = {DBLP:conf/approx/2005},
  url       = {https://doi.org/10.1007/11538462\_26},
  doi       = {10.1007/11538462\_26},
  timestamp = {Tue, 30 May 2017 16:36:53 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/GuruswamiR05},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiV05,
  author    = {Venkatesan Guruswami and
               Salil P. Vadhan},
  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},
  pages     = {318--329},
  year      = {2005},
  crossref  = {DBLP:conf/approx/2005},
  url       = {https://doi.org/10.1007/11538462\_27},
  doi       = {10.1007/11538462\_27},
  timestamp = {Tue, 30 May 2017 16:36:53 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/GuruswamiV05},
  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},
  year      = {2005},
  crossref  = {DBLP:conf/coco/2005},
  url       = {https://doi.org/10.1109/CCC.2005.10},
  doi       = {10.1109/CCC.2005.10},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/GuruswamiK05},
  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},
  year      = {2005},
  crossref  = {DBLP:conf/soda/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/bib/conf/soda/GuruswamiV05},
  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},
  year      = {2005},
  crossref  = {DBLP:conf/soda/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/bib/conf/soda/GuruswamiHKKKM05},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuruswamiR05,
  author    = {Venkatesan Guruswami and
               Atri Rudra},
  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},
  year      = {2005},
  crossref  = {DBLP:conf/stoc/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/bib/conf/stoc/GuruswamiR05},
  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},
  archivePrefix = {arXiv},
  eprint    = {cs/0504023},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-cs-0504023},
  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},
  archivePrefix = {arXiv},
  eprint    = {cs/0511072},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-cs-0511072},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  number    = {019},
  year      = {2005},
  url       = {http://eccc.hpi-web.de/eccc-reports/2005/TR05-019/index.html},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/ECCC-TR05-019},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  number    = {057},
  year      = {2005},
  url       = {http://eccc.hpi-web.de/eccc-reports/2005/TR05-057/index.html},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/ECCC-TR05-057},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  number    = {132},
  year      = {2005},
  url       = {http://eccc.hpi-web.de/eccc-reports/2005/TR05-132/index.html},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/ECCC-TR05-132},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  number    = {133},
  year      = {2005},
  url       = {http://eccc.hpi-web.de/eccc-reports/2005/TR05-133/index.html},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/ECCC-TR05-133},
  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 = {Tue, 16 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/books/sp/Guruswami2004},
  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/bib/journals/algorithmica/Guruswami03},
  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 = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/jcss/CohenG04},
  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/bib/journals/rsa/EngebretsenG04},
  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. Discrete Math.},
  volume    = {18},
  number    = {1},
  pages     = {30--40},
  year      = {2004},
  url       = {https://doi.org/10.1137/S0895480100376794},
  doi       = {10.1137/S0895480100376794},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/siamdm/GuruswamiK04},
  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/bib/journals/sigact/Guruswami04},
  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},
  year      = {2004},
  crossref  = {DBLP:conf/coco/2004},
  url       = {https://doi.org/10.1109/CCC.2004.1313831},
  doi       = {10.1109/CCC.2004.1313831},
  timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/coco/GuruswamiMR04},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GuruswamiI04,
  author    = {Venkatesan Guruswami and
               Piotr Indyk},
  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},
  pages     = {695--707},
  year      = {2004},
  crossref  = {DBLP:conf/icalp/2004},
  url       = {https://doi.org/10.1007/978-3-540-27836-8\_59},
  doi       = {10.1007/978-3-540-27836-8\_59},
  timestamp = {Tue, 30 May 2017 12:57:44 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/GuruswamiI04},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuruswamiI04,
  author    = {Venkatesan Guruswami and
               Piotr Indyk},
  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},
  year      = {2004},
  crossref  = {DBLP:conf/soda/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/bib/conf/soda/GuruswamiI04},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Guruswami04,
  author    = {Venkatesan Guruswami},
  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},
  year      = {2004},
  crossref  = {DBLP:conf/stoc/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/bib/conf/stoc/Guruswami04},
  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.CC/0405005},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/cs-CC-0405005},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  number    = {040},
  year      = {2004},
  url       = {http://eccc.hpi-web.de/eccc-reports/2004/TR04-040/index.html},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/ECCC-TR04-040},
  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 = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/jcss/GuruswamiKRSY03},
  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. Information 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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tit/Guruswami03},
  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. Information 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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tit/Guruswami03a},
  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},
  year      = {2003},
  crossref  = {DBLP:conf/coco/2003},
  url       = {https://doi.org/10.1109/CCC.2003.1214429},
  doi       = {10.1109/CCC.2003.1214429},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/Guruswami03},
  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},
  year      = {2003},
  crossref  = {DBLP:conf/focs/2003},
  url       = {https://doi.org/10.1109/SFCS.2003.1238225},
  doi       = {10.1109/SFCS.2003.1238225},
  timestamp = {Fri, 02 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/focs/CharikarGW03},
  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},
  year      = {2003},
  crossref  = {DBLP:conf/soda/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/bib/conf/soda/GuruswamiI03},
  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},
  year      = {2003},
  crossref  = {DBLP:conf/soda/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/bib/conf/soda/GuruswamiS03},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuruswamiI03,
  author    = {Venkatesan Guruswami and
               Piotr Indyk},
  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},
  year      = {2003},
  crossref  = {DBLP:conf/stoc/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/bib/conf/stoc/GuruswamiI03},
  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},
  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},
  year      = {2003},
  crossref  = {DBLP:conf/stoc/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/bib/conf/stoc/DinurGKR03},
  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.CC/0304026},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/cs-CC-0304026},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  number    = {080},
  year      = {2003},
  url       = {http://eccc.hpi-web.de/eccc-reports/2003/TR03-080/index.html},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/ECCC-TR03-080},
  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 = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/jcss/CharikarFGKRS02},
  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 = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/siamcomp/GuruswamiHS02},
  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. Information Theory},
  volume    = {48},
  number    = {5},
  pages     = {1021--1034},
  year      = {2002},
  url       = {https://doi.org/10.1109/18.995539},
  doi       = {10.1109/18.995539},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/tit/GuruswamiHSZ02},
  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},
  year      = {2002},
  crossref  = {DBLP:conf/coco/2002},
  url       = {https://doi.org/10.1109/CCC.2002.1004350},
  doi       = {10.1109/CCC.2002.1004350},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/GuruswamiS02},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/random/EngebretsenG02,
  author    = {Lars Engebretsen and
               Venkatesan Guruswami},
  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},
  pages     = {224--238},
  year      = {2002},
  crossref  = {DBLP:conf/random/2002},
  url       = {https://doi.org/10.1007/3-540-45726-7\_18},
  doi       = {10.1007/3-540-45726-7\_18},
  timestamp = {Fri, 26 May 2017 14:09:15 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/random/EngebretsenG02},
  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},
  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},
  year      = {2002},
  crossref  = {DBLP:conf/soda/2002},
  url       = {http://dl.acm.org/citation.cfm?id=545381.545414},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/AlonGKS02},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Guruswami02,
  author    = {Venkatesan Guruswami},
  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},
  year      = {2002},
  crossref  = {DBLP:conf/stoc/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/bib/conf/stoc/Guruswami02},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuruswamiI02,
  author    = {Venkatesan Guruswami and
               Piotr Indyk},
  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},
  year      = {2002},
  crossref  = {DBLP:conf/stoc/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/bib/conf/stoc/GuruswamiI02},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  number    = {027},
  year      = {2002},
  url       = {http://eccc.hpi-web.de/eccc-reports/2002/TR02-027/index.html},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/ECCC-TR02-027},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  number    = {053},
  year      = {2002},
  url       = {http://eccc.hpi-web.de/eccc-reports/2002/TR02-053/index.html},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/ECCC-TR02-053},
  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 2016 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/phd/us/Guruswami2001},
  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 = {Mon, 05 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/computing/GuruswamiRCCW01},
  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. Information Theory},
  volume    = {47},
  number    = {4},
  pages     = {1610--1613},
  year      = {2001},
  url       = {https://doi.org/10.1109/18.923745},
  doi       = {10.1109/18.923745},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tit/GuruswamiS01},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaecc/Guruswami01,
  author    = {Venkatesan Guruswami},
  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},
  pages     = {129--140},
  year      = {2001},
  crossref  = {DBLP:conf/aaecc/2001},
  url       = {https://doi.org/10.1007/3-540-45624-4\_14},
  doi       = {10.1007/3-540-45624-4\_14},
  timestamp = {Fri, 26 May 2017 14:09:14 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/aaecc/Guruswami01},
  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},
  year      = {2001},
  crossref  = {DBLP:conf/focs/2001},
  url       = {https://doi.org/10.1109/SFCS.2001.959942},
  doi       = {10.1109/SFCS.2001.959942},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/focs/GuruswamiI01},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Guruswami01,
  author    = {Venkatesan Guruswami},
  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},
  pages     = {195--206},
  year      = {2001},
  crossref  = {DBLP:conf/fsttcs/2001},
  url       = {https://doi.org/10.1007/3-540-45294-X\_17},
  doi       = {10.1007/3-540-45294-X\_17},
  timestamp = {Fri, 26 May 2017 14:09:15 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/fsttcs/Guruswami01},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {8},
  number    = {2},
  year      = {2001},
  url       = {http://eccc.hpi-web.de/eccc-reports/2001/TR01-002/index.html},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/ECCC-TR01-002},
  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   = {Discrete Applied Mathematics},
  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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dam/GuruswamiR00},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Guruswami00,
  author    = {Venkatesan Guruswami},
  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},
  pages     = {155--166},
  year      = {2000},
  crossref  = {DBLP:conf/approx/2000},
  url       = {https://doi.org/10.1007/3-540-44436-X\_16},
  doi       = {10.1007/3-540-44436-X\_16},
  timestamp = {Wed, 24 May 2017 15:40:44 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/Guruswami00},
  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},
  year      = {2000},
  crossref  = {DBLP:conf/coco/2000},
  url       = {https://doi.org/10.1109/CCC.2000.856749},
  doi       = {10.1109/CCC.2000.856749},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/coco/GuruswamiK00},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/GuruswamiS00,
  author    = {Venkatesan Guruswami and
               Madhu Sudan},
  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},
  pages     = {244--255},
  year      = {2000},
  crossref  = {DBLP:conf/esa/2000},
  url       = {https://doi.org/10.1007/3-540-45253-2\_23},
  doi       = {10.1007/3-540-45253-2\_23},
  timestamp = {Wed, 24 May 2017 15:40:43 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/esa/GuruswamiS00},
  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},
  year      = {2000},
  crossref  = {DBLP:conf/focs/2000},
  url       = {https://doi.org/10.1109/SFCS.2000.892074},
  doi       = {10.1109/SFCS.2000.892074},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/focs/GuruswamiHS00},
  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},
  year      = {2000},
  crossref  = {DBLP:conf/focs/2000},
  url       = {https://doi.org/10.1109/SFCS.2000.892076},
  doi       = {10.1109/SFCS.2000.892076},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/focs/GuruswamiSS00},
  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},
  year      = {2000},
  crossref  = {DBLP:conf/focs/2000},
  url       = {https://doi.org/10.1109/SFCS.2000.892331},
  doi       = {10.1109/SFCS.2000.892331},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/focs/CharikarGKRS00},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuruswamiS00,
  author    = {Venkatesan Guruswami and
               Madhu Sudan},
  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},
  year      = {2000},
  crossref  = {DBLP:conf/stoc/2000},
  url       = {https://doi.org/10.1145/335305.335327},
  doi       = {10.1145/335305.335327},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/GuruswamiS00},
  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},
  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},
  year      = {2000},
  crossref  = {DBLP:conf/stoc/2000},
  url       = {https://doi.org/10.1145/335305.335382},
  doi       = {10.1145/335305.335382},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/CharikarFGKRS00},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {7},
  number    = {62},
  year      = {2000},
  url       = {http://eccc.hpi-web.de/eccc-reports/2000/TR00-062/index.html},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/ECCC-TR00-062},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {7},
  number    = {73},
  year      = {2000},
  url       = {http://eccc.hpi-web.de/eccc-reports/2000/TR00-073/index.html},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/ECCC-TR00-073},
  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   = {Discrete Applied Mathematics},
  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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dam/Guruswami99},
  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   = {Discrete Mathematics},
  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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dm/Guruswami99},
  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. Information Theory},
  volume    = {45},
  number    = {6},
  pages     = {1757--1767},
  year      = {1999},
  url       = {https://doi.org/10.1109/18.782097},
  doi       = {10.1109/18.782097},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/tit/GuruswamiS99},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/GuruswamiS99,
  author    = {Venkatesan Guruswami and
               Amit Sahai},
  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},
  year      = {1999},
  crossref  = {DBLP:conf/colt/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/bib/conf/colt/GuruswamiS99},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DodisGK99,
  author    = {Yevgeniy Dodis and
               Venkatesan Guruswami and
               Sanjeev Khanna},
  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},
  year      = {1999},
  crossref  = {DBLP:conf/soda/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/bib/conf/soda/DodisGK99},
  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},
  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},
  year      = {1999},
  crossref  = {DBLP:conf/stoc/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/bib/conf/stoc/GuruswamiKRSY99},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  number    = {43},
  year      = {1999},
  url       = {http://eccc.hpi-web.de/eccc-reports/1999/TR99-043/index.html},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/ECCC-TR99-043},
  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/bib/journals/ipl/GuruswamiR98},
  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},
  year      = {1998},
  crossref  = {DBLP:conf/focs/1998},
  url       = {https://doi.org/10.1109/SFCS.1998.743424},
  doi       = {10.1109/SFCS.1998.743424},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/focs/GuruswamiLST98},
  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},
  year      = {1998},
  crossref  = {DBLP:conf/focs/1998},
  url       = {https://doi.org/10.1109/SFCS.1998.743426},
  doi       = {10.1109/SFCS.1998.743426},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/focs/GuruswamiS98},
  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},
  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},
  pages     = {26--37},
  year      = {1998},
  crossref  = {DBLP:conf/wg/1998},
  url       = {https://doi.org/10.1007/10692760\_3},
  doi       = {10.1007/10692760\_3},
  timestamp = {Tue, 23 May 2017 14:54:57 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/wg/GuruswamiRCCW98},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {5},
  number    = {34},
  year      = {1998},
  url       = {http://eccc.hpi-web.de/eccc-reports/1998/TR98-034/index.html},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/ECCC-TR98-034},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {5},
  number    = {43},
  year      = {1998},
  url       = {http://eccc.hpi-web.de/eccc-reports/1998/TR98-043/index.html},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/ECCC-TR98-043},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/innovations/2019,
  editor    = {Avrim Blum},
  title     = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
               2019, January 10-12, 2019, San Diego, California, {USA}},
  series    = {LIPIcs},
  volume    = {124},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2018},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-095-8},
  isbn      = {978-3-95977-095-8},
  timestamp = {Tue, 08 Jan 2019 13:39:45 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/innovations/2019},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2019,
  editor    = {Timothy M. Chan},
  title     = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
               2019},
  publisher = {{SIAM}},
  year      = {2019},
  url       = {https://doi.org/10.1137/1.9781611975482},
  doi       = {10.1137/1.9781611975482},
  isbn      = {978-1-61197-548-2},
  timestamp = {Wed, 09 Jan 2019 13:15:38 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/2019},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/allerton/2018,
  title     = {56th Annual Allerton Conference on Communication, Control, and Computing,
               Allerton 2018, Monticello, IL, USA, October 2-5, 2018},
  publisher = {{IEEE}},
  year      = {2018},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=8630872},
  isbn      = {978-1-5386-6596-1},
  timestamp = {Wed, 13 Feb 2019 09:36:05 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/allerton/2018},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2018,
  editor    = {Eric Blais and
               Klaus Jansen and
               Jos{\'{e}} D. P. Rolim and
               David Steurer},
  title     = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques, {APPROX/RANDOM} 2018, August 20-22, 2018 - Princeton,
               NJ, {USA}},
  series    = {LIPIcs},
  volume    = {116},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2018},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-085-9},
  isbn      = {978-3-95977-085-9},
  timestamp = {Wed, 15 Aug 2018 16:15:06 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/2018},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2018,
  editor    = {Rocco A. Servedio},
  title     = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
               2018, San Diego, CA, {USA}},
  series    = {LIPIcs},
  volume    = {102},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2018},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-069-9},
  isbn      = {978-3-95977-069-9},
  timestamp = {Mon, 04 Jun 2018 18:10:04 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/2018},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/isit/2018,
  title     = {2018 {IEEE} International Symposium on Information Theory, {ISIT}
               2018, Vail, CO, USA, June 17-22, 2018},
  publisher = {{IEEE}},
  year      = {2018},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=8410646},
  isbn      = {978-1-5386-4781-3},
  timestamp = {Tue, 21 Aug 2018 13:02:26 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/isit/2018},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2018,
  editor    = {Artur Czumaj},
  title     = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
  publisher = {{SIAM}},
  year      = {2018},
  url       = {https://doi.org/10.1137/1.9781611975031},
  doi       = {10.1137/1.9781611975031},
  isbn      = {978-1-61197-503-1},
  timestamp = {Thu, 04 Jan 2018 13:32:12 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/2018},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2018,
  editor    = {Ilias Diakonikolas and
               David Kempe and
               Monika Henzinger},
  title     = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
  publisher = {{ACM}},
  year      = {2018},
  url       = {http://dl.acm.org/citation.cfm?id=3188745},
  timestamp = {Thu, 21 Jun 2018 08:21:03 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/2018},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2017,
  editor    = {Klaus Jansen and
               Jos{\'{e}} D. P. Rolim and
               David Williamson and
               Santosh Srinivas Vempala},
  title     = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
               CA, {USA}},
  series    = {LIPIcs},
  volume    = {81},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2017},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-044-6},
  isbn      = {978-3-95977-044-6},
  timestamp = {Mon, 14 Aug 2017 18:26:41 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/2017},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/2017,
  editor    = {Chris Umans},
  title     = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
               2017, Berkeley, CA, USA, October 15-17, 2017},
  publisher = {{IEEE} Computer Society},
  year      = {2017},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=8100284},
  isbn      = {978-1-5386-3464-6},
  timestamp = {Tue, 04 Dec 2018 10:17:29 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/focs/2017},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/fsttcs/2017,
  editor    = {Satya V. Lokam and
               R. Ramanujam},
  title     = {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},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2018},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-055-2},
  isbn      = {978-3-95977-055-2},
  timestamp = {Mon, 12 Feb 2018 10:56:14 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/fsttcs/2017},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/icalp/2017,
  editor    = {Ioannis Chatzigiannakis and
               Piotr Indyk and
               Fabian Kuhn and
               Anca Muscholl},
  title     = {44th International Colloquium on Automata, Languages, and Programming,
               {ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
  series    = {LIPIcs},
  volume    = {80},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2017},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-041-5},
  isbn      = {978-3-95977-041-5},
  timestamp = {Mon, 17 Jul 2017 16:47:29 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/2017},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/isit/2017,
  title     = {2017 {IEEE} International Symposium on Information Theory, {ISIT}
               2017, Aachen, Germany, June 25-30, 2017},
  publisher = {{IEEE}},
  year      = {2017},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7999336},
  isbn      = {978-1-5090-4096-4},
  timestamp = {Thu, 17 Aug 2017 10:00:34 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/isit/2017},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2017,
  editor    = {Philip N. Klein},
  title     = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
               16-19},
  publisher = {{SIAM}},
  year      = {2017},
  url       = {https://doi.org/10.1137/1.9781611974782},
  doi       = {10.1137/1.9781611974782},
  isbn      = {978-1-61197-478-2},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/2017},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2016,
  editor    = {Ran Raz},
  title     = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
               June 1, 2016, Tokyo, Japan},
  series    = {LIPIcs},
  volume    = {50},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2016},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-008-8},
  isbn      = {978-3-95977-008-8},
  timestamp = {Thu, 02 Jun 2016 21:24:46 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/2016},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/2016,
  editor    = {Irit Dinur},
  title     = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
               2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
               {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {2016},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7781469},
  isbn      = {978-1-5090-3933-3},
  timestamp = {Tue, 20 Dec 2016 16:13:45 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/focs/2016},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/isit/2016,
  title     = {{IEEE} International Symposium on Information Theory, {ISIT} 2016,
               Barcelona, Spain, July 10-15, 2016},
  publisher = {{IEEE}},
  year      = {2016},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7532279},
  isbn      = {978-1-5090-1806-2},
  timestamp = {Tue, 16 Aug 2016 12:58:01 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/isit/2016},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2016,
  editor    = {Robert Krauthgamer},
  title     = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
  publisher = {{SIAM}},
  year      = {2016},
  url       = {https://doi.org/10.1137/1.9781611974331},
  doi       = {10.1137/1.9781611974331},
  isbn      = {978-1-61197-433-1},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/2016},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2016,
  editor    = {Daniel Wichs and
               Yishay Mansour},
  title     = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
  publisher = {{ACM}},
  year      = {2016},
  url       = {http://dl.acm.org/citation.cfm?id=2897518},
  isbn      = {978-1-4503-4132-5},
  timestamp = {Fri, 10 Jun 2016 10:30:30 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/2016},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2015,
  editor    = {Naveen Garg and
               Klaus Jansen and
               Anup Rao and
               Jos{\'{e}} D. P. Rolim},
  title     = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques, {APPROX/RANDOM} 2015, August 24-26, 2015, Princeton,
               NJ, {USA}},
  series    = {LIPIcs},
  volume    = {40},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2015},
  url       = {http://www.dagstuhl.de/dagpub/978-3-939897-89-7},
  isbn      = {978-3-939897-89-7},
  timestamp = {Wed, 14 Feb 2018 13:29:27 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/approx/2015},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2015,
  editor    = {David Zuckerman},
  title     = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19,
               2015, Portland, Oregon, {USA}},
  series    = {LIPIcs},
  volume    = {33},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2015},
  url       = {http://www.dagstuhl.de/dagpub/978-3-939897-81-1},
  isbn      = {978-3-939897-81-1},
  timestamp = {Wed, 10 Jun 2015 20:58:08 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/2015},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/innovations/2015,
  editor    = {Tim Roughgarden},
  title     = {Proceedings of the 2015 Conference on Innovations in Theoretical Computer
               Science, {ITCS} 2015, Rehovot, Israel, January 11-13, 2015},
  publisher = {{ACM}},
  year      = {2015},
  url       = {http://dl.acm.org/citation.cfm?id=2688073},
  isbn      = {978-1-4503-3333-7},
  timestamp = {Sun, 25 Jan 2015 11:29:31 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/innovations/2015},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2015,
  editor    = {Piotr Indyk},
  title     = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
  publisher = {{SIAM}},
  year      = {2015},
  url       = {https://doi.org/10.1137/1.9781611973730},
  doi       = {10.1137/1.9781611973730},
  isbn      = {978-1-61197-374-7},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/2015},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2014,
  editor    = {Klaus Jansen and
               Jos{\'{e}} D. P. Rolim and
               Nikhil R. Devanur and
               Cristopher Moore},
  title     = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques, {APPROX/RANDOM} 2014, September 4-6, 2014, Barcelona,
               Spain},
  series    = {LIPIcs},
  volume    = {28},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2014},
  isbn      = {978-3-939897-74-3},
  timestamp = {Wed, 17 Sep 2014 16:43:51 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/2014},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2014,
  title     = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
               BC, Canada, June 11-13, 2014},
  publisher = {{IEEE} Computer Society},
  year      = {2014},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6875457},
  isbn      = {978-1-4799-3626-7},
  timestamp = {Fri, 13 May 2016 10:43:51 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/2014},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/2014,
  title     = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
               2014, Philadelphia, PA, USA, October 18-21, 2014},
  publisher = {{IEEE} Computer Society},
  year      = {2014},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6975722},
  isbn      = {978-1-4799-6517-5},
  timestamp = {Thu, 23 Jun 2016 15:53:28 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/focs/2014},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/innovations/2014,
  editor    = {Moni Naor},
  title     = {Innovations in Theoretical Computer Science, ITCS'14, Princeton, NJ,
               USA, January 12-14, 2014},
  publisher = {{ACM}},
  year      = {2014},
  url       = {http://dl.acm.org/citation.cfm?id=2554797},
  isbn      = {978-1-4503-2698-8},
  timestamp = {Fri, 14 Feb 2014 17:36:37 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/innovations/2014},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2014,
  editor    = {Chandra Chekuri},
  title     = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
  publisher = {{SIAM}},
  year      = {2014},
  url       = {https://doi.org/10.1137/1.9781611973402},
  doi       = {10.1137/1.9781611973402},
  isbn      = {978-1-61197-338-9},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/2014},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2014,
  editor    = {David B. Shmoys},
  title     = {Symposium on Theory of Computing, {STOC} 2014, New York, NY, USA,
               May 31 - June 03, 2014},
  publisher = {{ACM}},
  year      = {2014},
  url       = {http://dl.acm.org/citation.cfm?id=2591796},
  isbn      = {978-1-4503-2710-7},
  timestamp = {Wed, 29 Mar 2017 16:45:26 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/2014},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/tcc/2014,
  editor    = {Yehuda Lindell},
  title     = {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},
  publisher = {Springer},
  year      = {2014},
  url       = {https://doi.org/10.1007/978-3-642-54242-8},
  doi       = {10.1007/978-3-642-54242-8},
  isbn      = {978-3-642-54241-1},
  timestamp = {Fri, 02 Nov 2018 09:44:20 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/tcc/2014},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2013,
  editor    = {Prasad Raghavendra and
               Sofya Raskhodnikova and
               Klaus Jansen and
               Jos{\'{e}} D. P. Rolim},
  title     = {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},
  publisher = {Springer},
  year      = {2013},
  url       = {https://doi.org/10.1007/978-3-642-40328-6},
  doi       = {10.1007/978-3-642-40328-6},
  isbn      = {978-3-642-40327-9},
  timestamp = {Tue, 23 May 2017 01:10:59 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/2013},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2013,
  title     = {Proceedings of the 28th Conference on Computational Complexity, {CCC}
               2013, K.lo Alto, California, USA, 5-7 June, 2013},
  publisher = {{IEEE} Computer Society},
  year      = {2013},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6596469},
  isbn      = {978-0-7695-4997-2},
  timestamp = {Fri, 13 May 2016 10:25:51 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/2013},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/2013,
  title     = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
               2013, 26-29 October, 2013, Berkeley, CA, {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {2013},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6685222},
  isbn      = {978-0-7695-5135-7},
  timestamp = {Mon, 15 Dec 2014 18:48:45 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/focs/2013},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/fsttcs/2013,
  editor    = {Anil Seth and
               Nisheeth K. Vishnoi},
  title     = {{IARCS} Annual Conference on Foundations of Software Technology and
               Theoretical Computer Science, {FSTTCS} 2013, December 12-14, 2013,
               Guwahati, India},
  series    = {LIPIcs},
  volume    = {24},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2013},
  url       = {http://drops.dagstuhl.de/portals/extern/index.php?semnr=13018},
  isbn      = {978-3-939897-64-4},
  timestamp = {Wed, 11 Dec 2013 14:43:09 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/fsttcs/2013},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2013,
  editor    = {Sanjeev Khanna},
  title     = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2013, New Orleans, Louisiana, USA, January 6-8,
               2013},
  publisher = {{SIAM}},
  year      = {2013},
  url       = {https://doi.org/10.1137/1.9781611973105},
  doi       = {10.1137/1.9781611973105},
  isbn      = {978-1-61197-251-1},
  timestamp = {Wed, 24 May 2017 08:31:20 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/2013},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2013,
  editor    = {Dan Boneh and
               Tim Roughgarden and
               Joan Feigenbaum},
  title     = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
               USA, June 1-4, 2013},
  publisher = {{ACM}},
  year      = {2013},
  url       = {http://dl.acm.org/citation.cfm?id=2488608},
  isbn      = {978-1-4503-2029-0},
  timestamp = {Sun, 26 May 2013 10:30:47 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/2013},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/www/2013,
  editor    = {Daniel Schwabe and
               Virg{\'{\i}}lio A. F. Almeida and
               Hartmut Glaser and
               Ricardo A. Baeza{-}Yates and
               Sue B. Moon},
  title     = {22nd International World Wide Web Conference, {WWW} '13, Rio de Janeiro,
               Brazil, May 13-17, 2013},
  publisher = {International World Wide Web Conferences Steering Committee / {ACM}},
  year      = {2013},
  url       = {http://dl.acm.org/citation.cfm?id=2488388},
  isbn      = {978-1-4503-2035-1},
  timestamp = {Sat, 24 Aug 2013 18:12:36 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/www/2013},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2012,
  editor    = {Anupam Gupta and
               Klaus Jansen and
               Jos{\'{e}} D. P. Rolim and
               Rocco A. Servedio},
  title     = {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},
  publisher = {Springer},
  year      = {2012},
  url       = {https://doi.org/10.1007/978-3-642-32512-0},
  doi       = {10.1007/978-3-642-32512-0},
  isbn      = {978-3-642-32511-3},
  timestamp = {Tue, 23 May 2017 01:11:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/2012},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/2012,
  title     = {53rd Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
               2012, New Brunswick, NJ, USA, October 20-23, 2012},
  publisher = {{IEEE} Computer Society},
  year      = {2012},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6374356},
  isbn      = {978-1-4673-4383-1},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/focs/2012},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/innovations/2012,
  editor    = {Shafi Goldwasser},
  title     = {Innovations in Theoretical Computer Science 2012, Cambridge, MA, USA,
               January 8-10, 2012},
  publisher = {{ACM}},
  year      = {2012},
  isbn      = {978-1-4503-1115-1},
  timestamp = {Sat, 24 Mar 2012 15:58:31 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/innovations/2012},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2012,
  editor    = {Yuval Rabani},
  title     = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
  publisher = {{SIAM}},
  year      = {2012},
  url       = {https://doi.org/10.1137/1.9781611973099},
  doi       = {10.1137/1.9781611973099},
  isbn      = {978-1-61197-210-8},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/2012},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2012,
  editor    = {Howard J. Karloff and
               Toniann Pitassi},
  title     = {Proceedings of the 44th Symposium on Theory of Computing Conference,
               {STOC} 2012, New York, NY, USA, May 19 - 22, 2012},
  publisher = {{ACM}},
  year      = {2012},
  url       = {http://dl.acm.org/citation.cfm?id=2213977},
  isbn      = {978-1-4503-1245-5},
  timestamp = {Tue, 22 May 2012 21:36:43 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/2012},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2011,
  editor    = {Leslie Ann Goldberg and
               Klaus Jansen and
               R. Ravi and
               Jos{\'{e}} D. P. Rolim},
  title     = {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},
  publisher = {Springer},
  year      = {2011},
  url       = {https://doi.org/10.1007/978-3-642-22935-0},
  doi       = {10.1007/978-3-642-22935-0},
  isbn      = {978-3-642-22934-3},
  timestamp = {Tue, 23 May 2017 01:11:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/2011},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2011,
  title     = {Proceedings of the 26th Annual {IEEE} Conference on Computational
               Complexity, {CCC} 2011, San Jose, California, USA, June 8-10, 2011},
  publisher = {{IEEE} Computer Society},
  year      = {2011},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5959244},
  isbn      = {978-0-7695-4411-3},
  timestamp = {Tue, 19 Jun 2018 18:38:13 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/2011},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/2011,
  editor    = {Rafail Ostrovsky},
  title     = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
               2011, Palm Springs, CA, USA, October 22-25, 2011},
  publisher = {{IEEE} Computer Society},
  year      = {2011},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6108120},
  isbn      = {978-1-4577-1843-4},
  timestamp = {Mon, 15 Dec 2014 18:48:45 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/focs/2011},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/innovations/2011,
  editor    = {Bernard Chazelle},
  title     = {Innovations in Computer Science - {ICS} 2010, Tsinghua University,
               Beijing, China, January 7-9, 2011. Proceedings},
  publisher = {Tsinghua University Press},
  year      = {2011},
  isbn      = {978-7-302-24517-9},
  timestamp = {Wed, 19 Oct 2011 15:40:50 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/innovations/2011},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2011,
  editor    = {Dana Randall},
  title     = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25,
               2011},
  publisher = {{SIAM}},
  year      = {2011},
  url       = {https://doi.org/10.1137/1.9781611973082},
  doi       = {10.1137/1.9781611973082},
  isbn      = {978-0-89871-993-2},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/2011},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/2010,
  title     = {51th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
               2010, October 23-26, 2010, Las Vegas, Nevada, {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {2010},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5669376},
  isbn      = {978-0-7695-4244-7},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/focs/2010},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/icalp/2010-1,
  editor    = {Samson Abramsky and
               Cyril Gavoille and
               Claude Kirchner and
               Friedhelm {Meyer auf der Heide} and
               Paul G. Spirakis},
  title     = {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},
  publisher = {Springer},
  year      = {2010},
  url       = {https://doi.org/10.1007/978-3-642-14165-2},
  doi       = {10.1007/978-3-642-14165-2},
  isbn      = {978-3-642-14164-5},
  timestamp = {Wed, 14 Nov 2018 11:00:14 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/2010-1},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2010,
  editor    = {Leonard J. Schulman},
  title     = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing, {STOC}
               2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
  publisher = {{ACM}},
  year      = {2010},
  isbn      = {978-1-4503-0050-6},
  timestamp = {Fri, 12 Oct 2012 12:16:22 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/2010},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2009,
  editor    = {Irit Dinur and
               Klaus Jansen and
               Joseph Naor and
               Jos{\'{e}} D. P. Rolim},
  title     = {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},
  publisher = {Springer},
  year      = {2009},
  url       = {https://doi.org/10.1007/978-3-642-03685-9},
  doi       = {10.1007/978-3-642-03685-9},
  isbn      = {978-3-642-03684-2},
  timestamp = {Tue, 23 May 2017 01:11:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/2009},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2009,
  title     = {Proceedings of the 24th Annual {IEEE} Conference on Computational
               Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
  publisher = {{IEEE} Computer Society},
  year      = {2009},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5231175},
  isbn      = {978-0-7695-3717-7},
  timestamp = {Fri, 13 May 2016 10:27:38 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/2009},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/codcry/2009,
  editor    = {Yeow Meng Chee and
               Chao Li and
               San Ling and
               Huaxiong Wang and
               Chaoping Xing},
  title     = {Coding and Cryptology, Second International Workshop, {IWCC} 2009,
               Zhangjiajie, China, June 1-5, 2009. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {5557},
  publisher = {Springer},
  year      = {2009},
  url       = {https://doi.org/10.1007/978-3-642-01877-0},
  doi       = {10.1007/978-3-642-01877-0},
  isbn      = {978-3-642-01813-8},
  timestamp = {Fri, 26 May 2017 00:49:50 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/codcry/2009},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/2009,
  title     = {50th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
               2009, October 25-27, 2009, Atlanta, Georgia, {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {2009},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5438528},
  isbn      = {978-0-7695-3850-1},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/focs/2009},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2009,
  editor    = {Michael Mitzenmacher},
  title     = {Proceedings of the 41st Annual {ACM} Symposium on Theory of Computing,
               {STOC} 2009, Bethesda, MD, USA, May 31 - June 2, 2009},
  publisher = {{ACM}},
  year      = {2009},
  isbn      = {978-1-60558-506-2},
  timestamp = {Fri, 05 Jun 2009 09:31:27 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/2009},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2008,
  editor    = {Ashish Goel and
               Klaus Jansen and
               Jos{\'{e}} D. P. Rolim and
               Ronitt Rubinfeld},
  title     = {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},
  publisher = {Springer},
  year      = {2008},
  url       = {https://doi.org/10.1007/978-3-540-85363-3},
  doi       = {10.1007/978-3-540-85363-3},
  isbn      = {978-3-540-85362-6},
  timestamp = {Tue, 13 Jun 2017 10:37:56 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/2008},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2008,
  title     = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
               Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {2008},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4558793},
  isbn      = {978-0-7695-3169-4},
  timestamp = {Fri, 13 May 2016 10:27:59 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/2008},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/2008,
  title     = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
               2008, October 25-28, 2008, Philadelphia, PA, {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {2008},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4690923},
  isbn      = {978-0-7695-3436-7},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/focs/2008},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/icits/2008,
  editor    = {Reihaneh Safavi{-}Naini},
  title     = {Information Theoretic Security, Third International Conference, {ICITS}
               2008, Calgary, Canada, August 10-13, 2008, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {5155},
  publisher = {Springer},
  year      = {2008},
  url       = {https://doi.org/10.1007/978-3-540-85093-9},
  doi       = {10.1007/978-3-540-85093-9},
  isbn      = {978-3-540-85092-2},
  timestamp = {Tue, 13 Jun 2017 10:37:56 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icits/2008},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/isit/2008,
  editor    = {Frank R. Kschischang and
               En{-}Hui Yang},
  title     = {2008 {IEEE} International Symposium on Information Theory, {ISIT}
               2008, Toronto, ON, Canada, July 6-11, 2008},
  publisher = {{IEEE}},
  year      = {2008},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4586217},
  isbn      = {978-1-4244-2256-2},
  timestamp = {Wed, 18 Apr 2012 08:49:51 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/isit/2008},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2008,
  editor    = {Shang{-}Hua Teng},
  title     = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
               2008},
  publisher = {{SIAM}},
  year      = {2008},
  url       = {http://dl.acm.org/citation.cfm?id=1347082},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/2008},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:reference/algo/2008,
  editor    = {Ming{-}Yang Kao},
  title     = {Encyclopedia of Algorithms},
  publisher = {Springer},
  year      = {2008},
  isbn      = {978-0-387-30162-4},
  timestamp = {Fri, 25 Nov 2011 18:23:31 +0100},
  biburl    = {https://dblp.org/rec/bib/reference/algo/2008},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/aaecc/2007,
  editor    = {Serdar Boztas and
               Hsiao{-}feng Lu},
  title     = {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},
  publisher = {Springer},
  year      = {2007},
  url       = {https://doi.org/10.1007/978-3-540-77224-8},
  doi       = {10.1007/978-3-540-77224-8},
  isbn      = {978-3-540-77223-1},
  timestamp = {Fri, 02 Jun 2017 13:01:06 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/aaecc/2007},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2007,
  editor    = {Moses Charikar and
               Klaus Jansen and
               Omer Reingold and
               Jos{\'{e}} D. P. Rolim},
  title     = {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},
  publisher = {Springer},
  year      = {2007},
  url       = {https://doi.org/10.1007/978-3-540-74208-1},
  doi       = {10.1007/978-3-540-74208-1},
  isbn      = {978-3-540-74207-4},
  timestamp = {Fri, 02 Jun 2017 13:01:07 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/2007},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2007,
  title     = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
               13-16 June 2007, San Diego, California, {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {2007},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4262736},
  isbn      = {0-7695-2780-9},
  timestamp = {Fri, 13 May 2016 10:28:33 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/2007},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2007,
  editor    = {David S. Johnson and
               Uriel Feige},
  title     = {Proceedings of the 39th Annual {ACM} Symposium on Theory of Computing,
               San Diego, California, USA, June 11-13, 2007},
  publisher = {{ACM}},
  year      = {2007},
  isbn      = {978-1-59593-631-8},
  timestamp = {Wed, 13 Jun 2007 12:33:13 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/2007},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/2006,
  title     = {47th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
               2006), 21-24 October 2006, Berkeley, California, USA, Proceedings},
  publisher = {{IEEE} Computer Society},
  year      = {2006},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4031329},
  isbn      = {0-7695-2720-5},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/focs/2006},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/isaac/2006,
  editor    = {Tetsuo Asano},
  title     = {Algorithms and Computation, 17th International Symposium, {ISAAC}
               2006, Kolkata, India, December 18-20, 2006, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {4288},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11940128},
  doi       = {10.1007/11940128},
  isbn      = {3-540-49694-7},
  timestamp = {Fri, 02 Jun 2017 13:01:08 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/isaac/2006},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/itw/2006,
  editor    = {Gadiel Seroussi and
               Alfredo Viola},
  title     = {2006 {IEEE} Information Theory Workshop, {ITW} 2006, Punta del Este,
               Uruguay, March 13-17, 2006},
  publisher = {{IEEE}},
  year      = {2006},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=10885},
  isbn      = {1-4244-0036-8},
  timestamp = {Fri, 08 Feb 2019 17:00:56 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/itw/2006},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/latin/2006,
  editor    = {Jos{\'{e}} R. Correa and
               Alejandro Hevia and
               Marcos A. Kiwi},
  title     = {{LATIN} 2006: Theoretical Informatics, 7th Latin American Symposium,
               Valdivia, Chile, March 20-24, 2006, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {3887},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11682462},
  doi       = {10.1007/11682462},
  isbn      = {3-540-32755-X},
  timestamp = {Sun, 04 Jun 2017 10:09:36 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/latin/2006},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2006,
  title     = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006},
  publisher = {{ACM} Press},
  year      = {2006},
  url       = {http://dl.acm.org/citation.cfm?id=1109557},
  isbn      = {0-89871-605-5},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/2006},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2006,
  editor    = {Jon M. Kleinberg},
  title     = {Proceedings of the 38th Annual {ACM} Symposium on Theory of Computing,
               Seattle, WA, USA, May 21-23, 2006},
  publisher = {{ACM}},
  year      = {2006},
  isbn      = {1-59593-134-1},
  timestamp = {Thu, 28 Sep 2006 09:38:26 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/2006},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2005,
  editor    = {Chandra Chekuri and
               Klaus Jansen and
               Jos{\'{e}} D. P. Rolim and
               Luca Trevisan},
  title     = {Approximation, Randomization and Combinatorial Optimization, Algorithms
               and Techniques, 8th International Workshop on Approximation Algorithms
               for Combinatorial Optimization Problems, {APPROX} 2005 and 9th InternationalWorkshop
               on Randomization and Computation, {RANDOM} 2005, Berkeley, CA, USA,
               August 22-24, 2005, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {3624},
  publisher = {Springer},
  year      = {2005},
  url       = {https://doi.org/10.1007/11538462},
  doi       = {10.1007/11538462},
  isbn      = {3-540-28239-4},
  timestamp = {Tue, 30 May 2017 16:36:53 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/2005},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2005,
  title     = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
               11-15 June 2005, San Jose, CA, {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {2005},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=9851},
  isbn      = {0-7695-2364-1},
  timestamp = {Fri, 13 May 2016 10:29:32 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/2005},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2005,
  title     = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
               23-25, 2005},
  publisher = {{SIAM}},
  year      = {2005},
  url       = {http://dl.acm.org/citation.cfm?id=1070432},
  isbn      = {0-89871-585-7},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/2005},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2005,
  editor    = {Harold N. Gabow and
               Ronald Fagin},
  title     = {Proceedings of the 37th Annual {ACM} Symposium on Theory of Computing,
               Baltimore, MD, USA, May 22-24, 2005},
  publisher = {{ACM}},
  year      = {2005},
  isbn      = {1-58113-960-8},
  timestamp = {Tue, 12 Jul 2005 13:48:39 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/2005},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2004,
  title     = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
               21-24 June 2004, Amherst, MA, {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {2004},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=9188},
  isbn      = {0-7695-2120-7},
  timestamp = {Fri, 13 May 2016 10:29:53 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/2004},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/icalp/2004,
  editor    = {Josep D{\'{\i}}az and
               Juhani Karhum{\"{a}}ki and
               Arto Lepist{\"{o}} and
               Donald Sannella},
  title     = {Automata, Languages and Programming: 31st International Colloquium,
               {ICALP} 2004, Turku, Finland, July 12-16, 2004. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {3142},
  publisher = {Springer},
  year      = {2004},
  url       = {https://doi.org/10.1007/b99859},
  doi       = {10.1007/b99859},
  isbn      = {3-540-22849-7},
  timestamp = {Tue, 30 May 2017 12:57:44 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/2004},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2004,
  editor    = {J. Ian Munro},
  title     = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14,
               2004},
  publisher = {{SIAM}},
  year      = {2004},
  url       = {http://dl.acm.org/citation.cfm?id=982792},
  isbn      = {0-89871-558-X},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/2004},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2004,
  editor    = {L{\'{a}}szl{\'{o}} Babai},
  title     = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
               Chicago, IL, USA, June 13-16, 2004},
  publisher = {{ACM}},
  year      = {2004},
  isbn      = {1-58113-852-0},
  timestamp = {Fri, 03 Sep 2004 08:58:11 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/2004},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2003,
  title     = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
               2003), 7-10 July 2003, Aarhus, Denmark},
  publisher = {{IEEE} Computer Society},
  year      = {2003},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=8614},
  isbn      = {0-7695-1879-6},
  timestamp = {Fri, 13 May 2016 10:30:12 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/2003},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/2003,
  title     = {44th Symposium on Foundations of Computer Science {(FOCS} 2003), 11-14
               October 2003, Cambridge, MA, USA, Proceedings},
  publisher = {{IEEE} Computer Society},
  year      = {2003},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=8767},
  isbn      = {0-7695-2040-5},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/focs/2003},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2003,
  title     = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}},
  publisher = {{ACM/SIAM}},
  year      = {2003},
  url       = {http://dl.acm.org/citation.cfm?id=644108},
  isbn      = {0-89871-538-5},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/2003},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2003,
  editor    = {Lawrence L. Larmore and
               Michel X. Goemans},
  title     = {Proceedings of the 35th Annual {ACM} Symposium on Theory of Computing,
               June 9-11, 2003, San Diego, CA, {USA}},
  publisher = {{ACM}},
  year      = {2003},
  isbn      = {1-58113-674-9},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/2003},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2002,
  title     = {Proceedings of the 17th Annual {IEEE} Conference on Computational
               Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
               2002},
  publisher = {{IEEE} Computer Society},
  year      = {2002},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7872},
  isbn      = {0-7695-1468-5},
  timestamp = {Fri, 13 May 2016 10:30:36 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/2002},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/random/2002,
  editor    = {Jos{\'{e}} D. P. Rolim and
               Salil P. Vadhan},
  title     = {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},
  publisher = {Springer},
  year      = {2002},
  url       = {https://doi.org/10.1007/3-540-45726-7},
  doi       = {10.1007/3-540-45726-7},
  isbn      = {3-540-44147-6},
  timestamp = {Fri, 26 May 2017 14:09:15 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/random/2002},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2002,
  editor    = {David Eppstein},
  title     = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  publisher = {{ACM/SIAM}},
  year      = {2002},
  url       = {http://dl.acm.org/citation.cfm?id=545381},
  isbn      = {0-89871-513-X},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/2002},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2002,
  editor    = {John H. Reif},
  title     = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
               May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
  publisher = {{ACM}},
  year      = {2002},
  isbn      = {1-58113-495-9},
  timestamp = {Thu, 16 Feb 2012 12:04:12 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/2002},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/aaecc/2001,
  editor    = {Serdar Boztas and
               Igor E. Shparlinski},
  title     = {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},
  publisher = {Springer},
  year      = {2001},
  url       = {https://doi.org/10.1007/3-540-45624-4},
  doi       = {10.1007/3-540-45624-4},
  isbn      = {3-540-42911-5},
  timestamp = {Fri, 26 May 2017 14:09:14 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/aaecc/2001},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/2001,
  title     = {42nd Annual Symposium on Foundations of Computer Science, {FOCS} 2001,
               14-17 October 2001, Las Vegas, Nevada, {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {2001},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7601},
  isbn      = {0-7695-1390-5},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/focs/2001},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/fsttcs/2001,
  editor    = {Ramesh Hariharan and
               Madhavan Mukund and
               V. Vinay},
  title     = {{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},
  publisher = {Springer},
  year      = {2001},
  url       = {https://doi.org/10.1007/3-540-45294-X},
  doi       = {10.1007/3-540-45294-X},
  isbn      = {3-540-43002-4},
  timestamp = {Fri, 26 May 2017 14:09:15 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/fsttcs/2001},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2000,
  editor    = {Klaus Jansen and
               Samir Khuller},
  title     = {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},
  publisher = {Springer},
  year      = {2000},
  url       = {https://doi.org/10.1007/3-540-44436-X},
  doi       = {10.1007/3-540-44436-X},
  isbn      = {3-540-67996-0},
  timestamp = {Wed, 24 May 2017 15:40:44 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/2000},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2000,
  title     = {Proceedings of the 15th Annual {IEEE} Conference on Computational
               Complexity, Florence, Italy, July 4-7, 2000},
  publisher = {{IEEE} Computer Society},
  year      = {2000},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6911},
  isbn      = {0-7695-0674-7},
  timestamp = {Fri, 13 May 2016 10:31:15 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/2000},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/esa/2000,
  editor    = {Mike Paterson},
  title     = {Algorithms - {ESA} 2000, 8th Annual European Symposium, Saarbr{\"{u}}cken,
               Germany, September 5-8, 2000, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1879},
  publisher = {Springer},
  year      = {2000},
  url       = {https://doi.org/10.1007/3-540-45253-2},
  doi       = {10.1007/3-540-45253-2},
  isbn      = {3-540-41004-X},
  timestamp = {Wed, 24 May 2017 15:40:43 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/esa/2000},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/2000,
  title     = {41st Annual Symposium on Foundations of Computer Science, {FOCS} 2000,
               12-14 November 2000, Redondo Beach, California, {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {2000},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7164},
  isbn      = {0-7695-0850-2},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/focs/2000},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2000,
  editor    = {F. Frances Yao and
               Eugene M. Luks},
  title     = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
               of Computing, May 21-23, 2000, Portland, OR, {USA}},
  publisher = {{ACM}},
  year      = {2000},
  isbn      = {1-58113-184-4},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/2000},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/colt/1999,
  editor    = {Shai Ben{-}David and
               Philip M. Long},
  title     = {Proceedings of the Twelfth Annual Conference on Computational Learning
               Theory, {COLT} 1999, Santa Cruz, CA, USA, July 7-9, 1999},
  publisher = {{ACM}},
  year      = {1999},
  url       = {http://dl.acm.org/citation.cfm?id=307400},
  isbn      = {1-58113-167-4},
  timestamp = {Mon, 12 Dec 2011 15:03:15 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/colt/1999},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/1999,
  editor    = {Robert Endre Tarjan and
               Tandy J. Warnow},
  title     = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
               17-19 January 1999, Baltimore, Maryland, {USA}},
  publisher = {{ACM/SIAM}},
  year      = {1999},
  url       = {http://dl.acm.org/citation.cfm?id=314500},
  isbn      = {0-89871-434-6},
  timestamp = {Thu, 05 Jul 2018 07:29:57 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/1999},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/1999,
  editor    = {Jeffrey Scott Vitter and
               Lawrence L. Larmore and
               Frank Thomson Leighton},
  title     = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
               Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
  publisher = {{ACM}},
  year      = {1999},
  isbn      = {1-58113-067-8},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/1999},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/1998,
  title     = {39th Annual Symposium on Foundations of Computer Science, {FOCS} '98,
               November 8-11, 1998, Palo Alto, California, {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {1998},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5965},
  isbn      = {0-8186-9172-7},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/focs/1998},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wg/1998,
  editor    = {Juraj Hromkovic and
               Ondrej S{\'{y}}kora},
  title     = {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},
  publisher = {Springer},
  year      = {1998},
  url       = {https://doi.org/10.1007/b71621},
  doi       = {10.1007/b71621},
  isbn      = {3-540-65195-0},
  timestamp = {Tue, 23 May 2017 14:54:57 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/wg/1998},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
maintained by Schloss Dagstuhl LZI, founded at University of Trier