Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDVenkatesan Guruswami
Person information
- affiliation: Carnegie Mellon University, Pittsburgh, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[c166]Venkatesan Guruswami, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters:
Sharp Threshold Rates for Random Codes. ITCS 2021: 5:1-5:20- [c165]Venkatesan Guruswami, Vinayak Kumar:
Pseudobinomiality of the Sticky Random Walk. ITCS 2021: 48:1-48:19 - [c164]Kuan Cheng, Venkatesan Guruswami, Bernhard Haeupler, Xin Li:
Efficient Linear and Affine Codes for Correcting Insertions/Deletions. SODA 2021: 1-20 - [c163]Venkatesan Guruswami, Johan Håstad:
Explicit two-deletion codes with redundancy matching the existential bound. SODA 2021: 21-32 - [c162]Jackson Abascal, Venkatesan Guruswami, Pravesh K. Kothari:
Strongly refuting all semi-random Boolean CSPs. SODA 2021: 454-472 - [i188]Joshua Brakensiek, Venkatesan Guruswami, Sai Sandeep:
Conditional Dichotomy of Boolean Ordered Promise CSPs. CoRR abs/2102.11854 (2021) - [i187]Sivakanth Gopi, Venkatesan Guruswami:
Improved Maximally Recoverable LRCs using Skew Polynomials. Electron. Colloquium Comput. Complex. 28: 25 (2021) - [i186]Joshua Brakensiek, Venkatesan Guruswami, Sai Sandeep:
Conditional Dichotomy of Boolean Ordered Promise CSPs. Electron. Colloquium Comput. Complex. 28: 26 (2021) - 2020
- [j91]Joshua Brakensiek, Venkatesan Guruswami, Marcin Wrochna, Stanislav Zivný:
The Power of the Combined Basic Linear Programming and Affine Relaxation for Promise Constraint Satisfaction Problems. SIAM J. Comput. 49(6): 1232-1248 (2020) - [j90]Venkatesan Guruswami, Sai Sandeep:
Rainbow Coloring Hardness via Low Sensitivity Polymorphisms. SIAM J. Discret. Math. 34(1): 520-537 (2020) - [j89]Marco Dalai
, Venkatesan Guruswami, Jaikumar Radhakrishnan:
An Improved Bound on the Zero-Error List-Decoding Capacity of the 4/3 Channel. IEEE Trans. Inf. Theory 66(2): 749-756 (2020) - [j88]Venkatesan Guruswami, Ray Li:
Coding Against Deletions in Oblivious and Online Models. IEEE Trans. Inf. Theory 66(4): 2352-2374 (2020) - [j87]Sivakanth Gopi, Venkatesan Guruswami, Sergey Yekhanin:
Maximally Recoverable LRCs: A Field Size Lower Bound and Constructions for Few Heavy Parities. IEEE Trans. Inf. Theory 66(10): 6066-6083 (2020) - [j86]Venkatesan Guruswami, Lingfei Jin, Chaoping Xing:
Constructions of Maximally Recoverable Local Reconstruction Codes via Function Fields. IEEE Trans. Inf. Theory 66(10): 6133-6143 (2020) - [j85]Venkatesan Guruswami, Satyanarayana V. Lokam, Sai Vikneshwar Mani Jayaraman:
ϵ-MSR Codes: Contacting Fewer Code Blocks for Exact Repair. IEEE Trans. Inf. Theory 66(11): 6749-6761 (2020) - [c161]Venkatesan Guruswami, Ray Li, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters:
Bounds for List-Decoding and List-Recovery of Random Linear Codes. APPROX/RANDOM 2020: 9:1-9:21 - [c160]Venkatesan Guruswami, Jakub Oprsal, Sai Sandeep:
Revisiting Alphabet Reduction in Dinur's PCP. APPROX/RANDOM 2020: 34:1-34:14 - [c159]Venkatesan Guruswami, Sai Sandeep:
d-To-1 Hardness of Coloring 3-Colorable Graphs with O(1) Colors. ICALP 2020: 62:1-62:12 - [c158]Fuchun Lin, Mahdi Cheraghchi, Venkatesan Guruswami, Reihaneh Safavi-Naini, Huaxiong Wang:
Leakage-Resilient Secret Sharing in Non-Compartmentalized Models. ITC 2020: 7:1-7:24 - [c157]Joshua Brakensiek, Venkatesan Guruswami:
Symmetric Polymorphisms and Efficient Decidability of Promise CSPs. SODA 2020: 297-304 - [c156]Venkatesan Guruswami, Bernhard Haeupler, Amirbehshad Shahrasbi:
Optimally resilient codes for list-decoding from insertions and deletions. STOC 2020: 524-537 - [c155]Venkatesan Guruswami, Andrii Riazanov, Min Ye:
Arikan meets Shannon: polar codes with near-optimal convergence to channel capacity. STOC 2020: 552-564 - [i185]Michael Rudow, K. V. Rashmi, Venkatesan Guruswami:
A locality-based approach for coded computation. CoRR abs/2002.02440 (2020) - [i184]Venkatesan Guruswami, Ray Li, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters:
Bounds for list-decoding and list-recovery of random linear codes. CoRR abs/2004.13247 (2020) - [i183]Kuan Cheng, Venkatesan Guruswami, Bernhard Haeupler, Xin Li:
Efficient Linear and Affine Codes for Correcting Insertions/Deletions. CoRR abs/2007.09075 (2020) - [i182]Venkatesan Guruswami, Johan Håstad:
Explicit two-deletion codes with redundancy matching the existential bound. CoRR abs/2007.10592 (2020) - [i181]Venkatesan Guruswami, Sai Sandeep:
An Algorithmic Study of the Hypergraph Turán Problem. CoRR abs/2008.07344 (2020) - [i180]Venkatesan Guruswami, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters:
Sharp threshold rates for random codes. CoRR abs/2009.04553 (2020) - [i179]Venkatesan Guruswami, Andrii Riazanov:
Linear Shannon Capacity of Cayley Graphs. CoRR abs/2009.05685 (2020) - [i178]Jackson Abascal, Venkatesan Guruswami, Pravesh K. Kothari:
Strongly refuting all semi-random Boolean CSPs. CoRR abs/2009.08032 (2020) - [i177]Sivakanth Gopi, Venkatesan Guruswami:
Improved Maximally Recoverable LRCs using Skew Polynomials. CoRR abs/2012.07804 (2020) - [i176]Joshua Brakensiek, Venkatesan Guruswami, Marcin Wrochna, Stanislav Zivný:
The Power of the Combined Basic LP and Affine Relaxation for Promise CSPs. Electron. Colloquium Comput. Complex. 27: 4 (2020) - [i175]Venkatesan Guruswami, Vinayak Kumar:
Pseudobinomiality of the Sticky Random Walk. Electron. Colloquium Comput. Complex. 27: 151 (2020) - [i174]Venkatesan Guruswami, Sai Sandeep:
Approximate Hypergraph Vertex Cover and generalized Tuza's conjecture. Electron. Colloquium Comput. Complex. 27: 167 (2020) - [i173]Venkatesan Guruswami, Chaoping Xing:
Optimal rate list decoding over bounded alphabets using algebraic-geometric codes. Electron. Colloquium Comput. Complex. 27: 172 (2020)
2010 – 2019
- 2019
- [j84]Venkatesan Guruswami, Ray Li:
Polynomial Time Decodable Codes for the Binary Deletion Channel. IEEE Trans. Inf. Theory 65(4): 2171-2178 (2019) - [j83]Venkatesan Guruswami, Chaoping Xing, Chen Yuan:
How Long Can Optimal Locally Repairable Codes Be? IEEE Trans. Inf. Theory 65(6): 3662-3670 (2019) - [c154]Venkatesan Guruswami, Runzhou Tao:
Streaming Hardness of Unique Games. APPROX-RANDOM 2019: 5:1-5:12 - [c153]Venkatesan Guruswami, Sai Sandeep:
Rainbow Coloring Hardness via Low Sensitivity Polymorphisms. APPROX-RANDOM 2019: 15:1-15:17 - [c152]Venkatesan Guruswami, Lingfei Jin, Chaoping Xing:
Constructions of Maximally Recoverable Local Reconstruction Codes via Function Fields. ICALP 2019: 68:1-68:14 - [c151]Venkatesan Guruswami, Andrii Riazanov:
Beating Fredman-Komlós for Perfect k-Hashing. ICALP 2019: 92:1-92:14 - [c150]Venkatesan Guruswami, Preetum Nakkiran, Madhu Sudan:
Algorithmic Polarization for Hidden Markov Models. ITCS 2019: 39:1-39:19 - [c149]Fuchun Lin, Mahdi Cheraghchi, Venkatesan Guruswami, Reihaneh Safavi-Naini, Huaxiong Wang:
Secret Sharing with Binary Shares. ITCS 2019: 53:1-53:20 - [c148]Venkatesan Guruswami, Haotian Jiang:
Near-optimal Repair of Reed-Solomon Codes with Low Sub-packetization. ISIT 2019: 1077-1081 - [c147]Joshua Brakensiek, Venkatesan Guruswami:
An Algorithmic Blend of LPs and Ring Equations for Promise CSPs. SODA 2019: 436-455 - [c146]Vijay Bhattiprolu, Mrinalkanti Ghosh, Venkatesan Guruswami, Euiwoong Lee, Madhur Tulsiani:
Approximability of p → q Matrix Norms: Generalized Krivine Rounding and Hypercontractive Hardness. SODA 2019: 1358-1368 - [c145]Sivakanth Gopi, Venkatesan Guruswami, Sergey Yekhanin:
Maximally Recoverable LRCs: A field size lower bound and constructions for few heavy parities. SODA 2019: 2154-2170 - [c144]Joshua Brakensiek, Venkatesan Guruswami:
Bridging between 0/1 and linear programming via random walks. STOC 2019: 568-577 - [c143]Joshua Brakensiek, Sivakanth Gopi, Venkatesan Guruswami:
CSPs with global modular constraints: algorithms and hardness via polynomial representations. STOC 2019: 590-601 - [c142]Omar Alrabiah, Venkatesan Guruswami:
An exponential lower bound on the sub-packetization of MSR codes. STOC 2019: 979-985 - [i172]Omar Alrabiah, Venkatesan Guruswami:
An Exponential Lower Bound on the Sub-Packetization of MSR Codes. CoRR abs/1901.05112 (2019) - [i171]Joshua Brakensiek, Sivakanth Gopi, Venkatesan Guruswami:
CSPs with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations. CoRR abs/1902.04740 (2019) - [i170]Fuchun Lin, Mahdi Cheraghchi, Venkatesan Guruswami, Reihaneh Safavi-Naini, Huaxiong Wang:
Non-Malleable Secret Sharing against Affine Tampering. CoRR abs/1902.06195 (2019) - [i169]Joshua Brakensiek, Venkatesan Guruswami:
Bridging between 0/1 and Linear Programming via Random Walks. CoRR abs/1904.04860 (2019) - [i168]Venkatesan Guruswami, Haotian Jiang:
Near-optimal Repair of Reed-Solomon Codes with Low Sub-packetization. CoRR abs/1907.03931 (2019) - [i167]Joshua Brakensiek, Venkatesan Guruswami:
Symmetric Polymorphisms and Efficient Decidability of Promise CSPs. CoRR abs/1907.04383 (2019) - [i166]Venkatesan Guruswami, Bernhard Haeupler, Amirbehshad Shahrasbi:
Optimally Resilient Codes for List-Decoding from Insertions and Deletions. CoRR abs/1909.10683 (2019) - [i165]Venkatesan Guruswami, Andrii Riazanov, Min Ye:
Arıkan meets Shannon: Polar codes with near-optimal convergence to channel capacity. CoRR abs/1911.03858 (2019) - [i164]Omar Alrabiah, Venkatesan Guruswami:
An Exponential Lower Bound on the Sub-Packetization of MSR Codes. Electron. Colloquium Comput. Complex. 26: 5 (2019) - [i163]Joshua Brakensiek, Sivakanth Gopi, Venkatesan Guruswami:
CSPs with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations. Electron. Colloquium Comput. Complex. 26: 13 (2019) - [i162]Joshua Brakensiek, Venkatesan Guruswami:
Bridging between 0/1 and Linear Programming via Random Walks. Electron. Colloquium Comput. Complex. 26: 54 (2019) - [i161]Venkatesan Guruswami, Jakub Oprsal, Sai Sandeep:
Revisiting Alphabet Reduction in Dinur's PCP. Electron. Colloquium Comput. Complex. 26: 92 (2019) - [i160]Venkatesan Guruswami, Sai Sandeep:
Rainbow coloring hardness via low sensitivity polymorphisms. Electron. Colloquium Comput. Complex. 26: 94 (2019) - [i159]Venkatesan Guruswami, Sai Sandeep:
$d$-to-$1$ Hardness of Coloring $4$-colorable Graphs with $O(1)$ colors. Electron. Colloquium Comput. Complex. 26: 116 (2019) - [i158]Venkatesan Guruswami, Bernhard Haeupler, Amirbehshad Shahrasbi:
Optimally Resilient Codes for List-Decoding from Insertions and Deletions. Electron. Colloquium Comput. Complex. 26: 153 (2019) - [i157]Venkatesan Guruswami, Andrii Riazanov, Min Ye:
Ar?kan meets Shannon: Polar codes with near-optimal convergence to channel capacity. Electron. Colloquium Comput. Complex. 26: 154 (2019) - 2018
- [j82]Venkatesan Guruswami, Euiwoong Lee:
Strong Inapproximability Results on Balanced Rainbow-Colorable Hypergraphs. Comb. 38(3): 547-599 (2018) - [j81]Joshua Brakensiek, Venkatesan Guruswami, Samuel Zbarsky:
Efficient Low-Redundancy Codes for Correcting Multiple Deletions. IEEE Trans. Inf. Theory 64(5): 3403-3410 (2018) - [j80]Ankit Singh Rawat, Itzhak Tamo, Venkatesan Guruswami, Klim Efremenko:
MDS Code Constructions With Small Sub-Packetization and Near-Optimal Repair Bandwidth. IEEE Trans. Inf. Theory 64(10): 6506-6525 (2018) - [c141]Allison Beemer, Ryan Coatney, Venkatesan Guruswami, Hiram H. Lopez, Fernando Piñero:
Explicit optimal-length locally repairable codes of distance 5. Allerton 2018: 800-804 - [c140]Jaroslaw Blasiok, Venkatesan Guruswami, Madhu Sudan:
Polar Codes with Exponentially Small Error at Finite Block Length. APPROX-RANDOM 2018: 34:1-34:17 - [c139]Venkatesan Guruswami, Chaoping Xing, Chen Yuan:
How Long Can Optimal Locally Repairable Codes Be?. APPROX-RANDOM 2018: 41:1-41:11 - [c138]Venkatesan Guruswami, Nicolas Resch, Chaoping Xing:
Lossless Dimension Expanders via Linearized Polynomials and Subspace Designs. Computational Complexity Conference 2018: 4:1-4:16 - [c137]Venkatesan Guruswami, Nicolas Resch:
On the List-Decodability of Random Linear Rank-Metric Codes. ISIT 2018: 1505-1509 - [c136]Venkatesan Guruswami, Satyanarayana V. Lokam, Sai Vikneshwar Mani Jayaraman:
∊-MSR Codes: Contacting Fewer Code Blocks for Exact Repair. ISIT 2018: 2371-2375 - [c135]Venkatesan Guruswami, Ray Li:
Coding against deletions in oblivious and online models. SODA 2018: 625-643 - [c134]Joshua Brakensiek, Venkatesan Guruswami:
Promise Constraint Satisfaction: Structure Theory and a Symmetric Boolean Dichotomy. SODA 2018: 1782-1801 - [c133]Jaroslaw Blasiok, Venkatesan Guruswami, Preetum Nakkiran, Atri Rudra, Madhu Sudan:
General strong polarization. STOC 2018: 485-492 - [i156]Jaroslaw Blasiok, Venkatesan Guruswami, Preetum Nakkiran, Atri Rudra, Madhu Sudan:
General Strong Polarization. CoRR abs/1802.02718 (2018) - [i155]Vijay Bhattiprolu, Mrinalkanti Ghosh, Venkatesan Guruswami, Euiwoong Lee, Madhur Tulsiani:
Inapproximability of Matrix p→q Norms. CoRR abs/1802.07425 (2018) - [i154]Vijay Bhattiprolu, Mrinalkanti Ghosh, Venkatesan Guruswami, Euiwoong Lee, Madhur Tulsiani:
Approximating Operator Norms via Generalized Krivine Rounding. CoRR abs/1804.03644 (2018) - [i153]Venkatesan Guruswami, Andrii Riazanov:
Beating Fredman-Komlós for perfect k-hashing. CoRR abs/1805.04151 (2018) - [i152]Venkatesan Guruswami, Chaoping Xing, Chen Yuan:
How long can optimal locally repairable codes be? CoRR abs/1807.01064 (2018) - [i151]Venkatesan Guruswami, Satyanarayana V. Lokam, Sai Vikneshwar Mani Jayaraman:
ε-MSR Codes: Contacting Fewer Code Blocks for Exact Repair. CoRR abs/1807.01166 (2018) - [i150]Joshua Brakensiek, Venkatesan Guruswami:
An Algorithmic Blend of LPs and Ring Equations for Promise CSPs. CoRR abs/1807.05194 (2018) - [i149]Fuchun Lin, Mahdi Cheraghchi, Venkatesan Guruswami, Reihaneh Safavi-Naini, Huaxiong Wang:
Secret Sharing with Binary Shares. CoRR abs/1808.02974 (2018) - [i148]Venkatesan Guruswami, Lingfei Jin, Chaoping Xing:
Constructions of maximally recoverable local reconstruction codes via function fields. CoRR abs/1808.04539 (2018) - [i147]Venkatesan Guruswami, Preetum Nakkiran, Madhu Sudan:
Algorithmic Polarization for Hidden Markov Models. CoRR abs/1810.01969 (2018) - [i146]Allison Beemer, Ryan Coatney, Venkatesan Guruswami, Hiram H. López, Fernando Piñero:
Explicit optimal-length locally repairable codes of distance 5. CoRR abs/1810.03980 (2018) - [i145]Jaroslaw Blasiok, Venkatesan Guruswami, Madhu Sudan:
Polar Codes with exponentially small error at finite block length. CoRR abs/1810.04298 (2018) - [i144]Venkatesan Guruswami, Runzhou Tao:
Streaming Hardness of Unique Games. CoRR abs/1811.04607 (2018) - [i143]Martin Grohe, Venkatesan Guruswami, Stanislav Zivný:
The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 18231). Dagstuhl Reports 8(6): 1-18 (2018) - [i142]Venkatesan Guruswami, Nicolas Resch, Chaoping Xing:
Lossless dimension expanders via linearized polynomials and subspace designs. Electron. Colloquium Comput. Complex. 25: 17 (2018) - [i141]Jaroslaw Blasiok, Venkatesan Guruswami, Preetum Nakkiran, Atri Rudra, Madhu Sudan:
General Strong Polarization. Electron. Colloquium Comput. Complex. 25: 27 (2018) - [i140]Vijay Bhattiprolu, Mrinalkanti Ghosh, Venkatesan Guruswami, Euiwoong Lee, Madhur Tulsiani:
Inapproximability of Matrix p→q Norms. Electron. Colloquium Comput. Complex. 25: 37 (2018) - [i139]Joshua Brakensiek, Venkatesan Guruswami:
Combining LPs and Ring Equations via Structured Polymorphisms. Electron. Colloquium Comput. Complex. 25: 59 (2018) - [i138]Venkatesan Guruswami, Andrii Riazanov:
Beating Fredman-Komlós for perfect k-hashing. Electron. Colloquium Comput. Complex. 25: 96 (2018) - [i137]Vijay Bhattiprolu, Mrinalkanti Ghosh, Venkatesan Guruswami, Euiwoong Lee, Madhur Tulsiani:
Approximating Operator Norms via Generalized Krivine Rounding. Electron. Colloquium Comput. Complex. 25: 97 (2018) - [i136]Fuchun Lin, Mahdi Cheraghchi, Venkatesan Guruswami, Reihaneh Safavi-Naini, Huaxiong Wang:
Secret Sharing with Binary Shares. IACR Cryptol. ePrint Arch. 2018: 746 (2018) - 2017
- [j79]Mahdi Cheraghchi, Venkatesan Guruswami:
Non-malleable Coding Against Bit-Wise and Split-State Tampering. J. Cryptol. 30(1): 191-241 (2017) - [j78]Venkatesan Guruswami, Prahladh Harsha, Johan Håstad, Srikanth Srinivasan, Girish Varma:
Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes. SIAM J. Comput. 46(1): 132-159 (2017) - [j77]Venkatesan Guruswami, Euiwoong Lee:
Nearly Optimal NP-Hardness of Unique Coverage. SIAM J. Comput. 46(3): 1018-1028 (2017) - [j76]Per Austrin, Venkatesan Guruswami, Johan Håstad:
(2+ε)-Sat Is NP-hard. SIAM J. Comput. 46(5): 1554-1573 (2017) - [j75]Venkatesan Guruswami, Euiwoong Lee:
Inapproximability of H-Transversal/Packing. SIAM J. Discret. Math. 31(3): 1552-1571 (2017) - [j74]Boris Bukh, Venkatesan Guruswami, Johan Håstad:
An Improved Bound on the Fraction of Correctable Deletions. IEEE Trans. Inf. Theory 63(1): 93-103 (2017) - [j73]Venkatesan Guruswami, Carol Wang:
Deletion Codes in the High-Noise and High-Rate Regimes. IEEE Trans. Inf. Theory 63(4): 1961-1970 (2017) - [j72]Venkatesan Guruswami, Lingfei Jin, Chaoping Xing:
Efficiently List-Decodable Punctured Reed-Muller Codes. IEEE Trans. Inf. Theory 63(7): 4317-4324 (2017) - [j71]Venkatesan Guruswami, Mary Wootters:
Repairing Reed-Solomon Codes. IEEE Trans. Inf. Theory 63(9): 5684-5698 (2017) - [j70]Clément L. Canonne, Venkatesan Guruswami, Raghu Meka, Madhu Sudan:
Communication With Imperfectly Shared Randomness. IEEE Trans. Inf. Theory 63(10): 6799-6818 (2017) - [j69]Venkatesan Guruswami, Euiwoong Lee:
Towards a Characterization of Approximation Resistance for Symmetric CSPs. Theory Comput. 13(1): 1-24 (2017) - [c132]Joshua Brakensiek, Venkatesan Guruswami:
The Quest for Strong Inapproximability Results with Perfect Completeness. APPROX-RANDOM 2017: 4:1-4:20 - [c131]Venkatesan Guruswami, Ameya Velingker, Santhoshini Velusamy:
Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph. APPROX-RANDOM 2017: 8:1-8:19 - [c130]Vijay Bhattiprolu, Venkatesan Guruswami, Euiwoong Lee:
Sum-of-Squares Certificates for Maxima of Random Tensors on the Sphere. APPROX-RANDOM 2017: 31:1-31:20 - [c129]S. Luna Frank-Fischer, Venkatesan Guruswami, Mary Wootters:
Locality via Partially Lifted Codes. APPROX-RANDOM 2017: 43:1-43:17 - [c128]Venkatesan Guruswami, Ray Li:
Efficiently Decodable Codes for the Binary Deletion Channel. APPROX-RANDOM 2017: 47:1-47:13 - [c127]Vijay Bhattiprolu, Mrinalkanti Ghosh, Venkatesan Guruswami, Euiwoong Lee, Madhur Tulsiani:
Weak Decoupling, Polynomial Folds and Approximate Optimization over the Sphere. FOCS 2017: 1008-1019 - [c126]Venkatesan Guruswami, Rishi Saket:
Hardness of Rainbow Coloring Hypergraphs. FSTTCS 2017: 33:33-33:15 - [c125]Venkatesan Guruswami, Chaoping Xing, Chen Yuan:
Subspace Designs Based on Algebraic Function Fields. ICALP 2017: 86:1-86:10 - [c124]Marco Dalai, Venkatesan Guruswami, Jaikumar Radhakrishnan:
An improved bound on the zero-error list-decoding capacity of the 4/3 channel. ISIT 2017: 1658-1662 - [c123]Ankit Singh Rawat, Itzhak Tamo, Venkatesan Guruswami, Klim Efremenko:
∊-MSR codes with small sub-packetization. ISIT 2017: 2043-2047 - [c122]Venkatesan Guruswami, Ankit Singh Rawat:
MDS Code Constructions with Small Sub-packetization and Near-optimal Repair Bandwidth. SODA 2017: 2109-2122 - [i135]Joshua Brakensiek, Venkatesan Guruswami:
Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy. CoRR abs/1704.01937 (2017) - [i134]Venkatesan Guruswami, Chaoping Xing, Chen Yuan:
Subspace Designs based on Algebraic Function Fields. CoRR abs/1704.05992 (2017) - [i133]S. Luna Frank-Fischer, Venkatesan Guruswami, Mary Wootters:
Locality via Partially Lifted Codes. CoRR abs/1704.08627 (2017) - [i132]Venkatesan Guruswami, Ray Li:
Efficiently decodable codes for the binary deletion channel. CoRR abs/1705.01963 (2017) - [i131]Venkatesan Guruswami, Chaoping Xing:
Optimal rate list decoding over bounded alphabets using algebraic-geometric codes. CoRR abs/1708.01070 (2017) - [i130]Ankit Singh Rawat, Itzhak Tamo, Venkatesan Guruswami, Klim Efremenko:
MDS Code Constructions with Small Sub-packetization and Near-optimal Repair Bandwidth. CoRR abs/1709.08216 (2017) - [i129]Sivakanth Gopi, Venkatesan Guruswami, Sergey Yekhanin:
On Maximally Recoverable Local Reconstruction Codes. CoRR abs/1710.10322 (2017) - [i128]Venkatesan Guruswami, Nicolas Resch:
On the List-Decodability of Random Linear Rank-Metric Codes. CoRR abs/1710.11516 (2017) - [i127]Venkatesan Guruswami, Chaoping Xing, Chen Yuan:
Subspace Designs based on Algebraic Function Fields. Electron. Colloquium Comput. Complex. 24: 64 (2017) - [i126]Joshua Brakensiek, Venkatesan Guruswami:
The Quest for Strong Inapproximability Results with Perfect Completeness. Electron. Colloquium Comput. Complex. 24: 80 (2017) - [i125]Joshua Brakensiek, Venkatesan Guruswami:
A Family of Dictatorship Tests with Perfect Completeness for 2-to-2 Label Cover. Electron. Colloquium Comput. Complex. 24: 141 (2017) - [i124]Venkatesan Guruswami, Rishi Saket:
Hardness of Rainbow Coloring Hypergraphs. Electron. Colloquium Comput. Complex. 24: 147 (2017) - [i123]Sivakanth Gopi, Venkatesan Guruswami, Sergey Yekhanin:
On Maximally Recoverable Local Reconstruction Codes. Electron. Colloquium Comput. Complex. 24: 183 (2017) - 2016
- [j68]Venkatesan Guruswami, Krzysztof Onak:
Superlinear Lower Bounds for Multipass Graph Processing. Algorithmica 76(3): 654-683 (2016) - [j67]Venkatesan Guruswami, Swastik Kopparty:
Explicit subspace designs. Comb. 36(2): 161-185 (2016) - [j66]