Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVenkatesan Guruswami
Person information
- affiliation (former): Carnegie Mellon University, Pittsburgh, USA
- affiliation: University of Berkeley, Department of EECS, Berkeley, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j110]Vijay Bhattiprolu, Mrinal Kanti Ghosh, Venkatesan Guruswami, Euiwoong Lee, Madhur Tulsiani:
Inapproximability of Matrix p → q Norms. SIAM J. Comput. 52(1): 132-155 (2023)- [j109]Joshua Brakensiek, Venkatesan Guruswami, Sai Sandeep:
Conditional Dichotomy of Boolean Ordered Promise CSPs. TheoretiCS 2 (2023) - [j108]Ryan Gabrys
, Venkatesan Guruswami, João Ribeiro, Ke Wu:
Beyond Single-Deletion Correcting Codes: Substitutions and Transpositions. IEEE Trans. Inf. Theory 69(1): 169-186 (2023) - [j107]Venkatesan Guruswami, Xiaoyu He, Ray Li:
The Zero-Rate Threshold for Adversarial Bit-Deletions is Less Than 1/2. IEEE Trans. Inf. Theory 69(4): 2218-2239 (2023) - [c185]Huck Bennett, Mahdi Cheraghchi, Venkatesan Guruswami, João Ribeiro:
Parameterized Inapproximability of the Minimum Distance Problem over All Fields and the Shortest Vector Problem in All ℓp Norms. STOC 2023: 553-566 - [c184]Joshua Brakensiek, Venkatesan Guruswami, Sai Sandeep:
SDPs and Robust Satisfiability of Promise CSP. STOC 2023: 609-622 - [c183]Omar Alrabiah, Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar:
A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation. STOC 2023: 1438-1448 - [c182]Meghal Gupta, Venkatesan Guruswami, Rachel Yun Zhang:
Binary Error-Correcting Codes with Minimal Noiseless Feedback. STOC 2023: 1475-1487 - [i213]Omar Alrabiah, Venkatesan Guruswami, Ray Li:
Randomly punctured Reed-Solomon codes achieve list-decoding capacity over linear-sized fields. CoRR abs/2304.09445 (2023) - [i212]Venkatesan Guruswami, Shilun Li:
A Deterministic Construction of a Large Distance Code from the Wozencraft Ensemble. CoRR abs/2305.02484 (2023) - 2022
- [j106]Vikraman Arvind, Venkatesan Guruswami:
CNF Satisfiability in a Subspace and Related Problems. Algorithmica 84(11): 3276-3299 (2022) - [j105]Venkatesan Guruswami, Chaoping Xing:
Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes. J. ACM 69(2): 10:1-10:48 (2022) - [j104]Jaroslaw Blasiok, Venkatesan Guruswami, Preetum Nakkiran, Atri Rudra, Madhu Sudan:
General Strong Polarization. J. ACM 69(2): 11:1-11:67 (2022) - [j103]Venkatesan Guruswami, Andrii Riazanov:
Beating Fredman-Komlós for perfect k-hashing. J. Comb. Theory, Ser. A 188: 105580 (2022) - [j102]Joshua Brakensiek, Sivakanth Gopi, Venkatesan Guruswami:
Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations. SIAM J. Comput. 51(3): 577-626 (2022) - [j101]Venkatesan Guruswami, Jonathan Moshieff, Nicolas Resch, Shashwat Silas, Mary Wootters:
Threshold Rates for Properties of Random Codes. IEEE Trans. Inf. Theory 68(2): 905-922 (2022) - [j100]Venkatesan Guruswami, Ray Li, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters:
Bounds for List-Decoding and List-Recovery of Random Linear Codes. IEEE Trans. Inf. Theory 68(2): 923-939 (2022) - [j99]Venkatesan Guruswami, Andrii Riazanov, Min Ye:
Arıkan Meets Shannon: Polar Codes With Near-Optimal Convergence to Channel Capacity. IEEE Trans. Inf. Theory 68(5): 2877-2919 (2022) - [j98]Sivakanth Gopi, Venkatesan Guruswami:
Improved Maximally Recoverable LRCs Using Skew Polynomials. IEEE Trans. Inf. Theory 68(11): 7198-7214 (2022) - [c181]Ryan Gabrys, Venkatesan Guruswami, João Ribeiro, Ke Wu:
Beyond Single-Deletion Correcting Codes: Substitutions and Transpositions. APPROX/RANDOM 2022: 8:1-8:17 - [c180]Iwan M. Duursma, Ryan Gabrys, Venkatesan Guruswami, Ting-Chun Lin, Hsin-Po Wang:
Accelerating Polarization via Alphabet Extension. APPROX/RANDOM 2022: 17:1-17:15 - [c179]Venkatesan Guruswami, Xin Lyu, Xiuhan Wang:
Range Avoidance for Low-Depth Circuits and Connections to Pseudorandomness. APPROX/RANDOM 2022: 20:1-20:21 - [c178]Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar:
Bypassing the XOR Trick: Stronger Certificates for Hypergraph Clique Number. APPROX/RANDOM 2022: 42:1-42:7 - [c177]Venkatesan Guruswami, Peter Manohar, Jonathan Mosheiff:
ℓp-Spread and Restricted Isometry Properties of Sparse Random Matrices. CCC 2022: 7:1-7:17 - [c176]Venkatesan Guruswami, Jonathan Mosheiff:
Punctured Low-Bias Codes Behave Like Random Linear Codes. FOCS 2022: 36-45 - [c175]Venkatesan Guruswami, Sai Sandeep:
Approximate Hypergraph Vertex Cover and generalized Tuza's conjecture. SODA 2022: 927-944 - [c174]Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar:
Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than random. STOC 2022: 678-689 - [e2]Anuj Dawar, Venkatesan Guruswami:
42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India. LIPIcs 250, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-261-7 [contents] - [i211]Venkatesan Guruswami, Peter Manohar, Jonathan Mosheiff:
Sparsity and 𝓁p-Restricted Isometry. CoRR abs/2205.06738 (2022) - [i210]Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar:
Bypassing the XOR Trick: Stronger Certificates for Hypergraph Clique Number. CoRR abs/2205.06739 (2022) - [i209]Iwan M. Duursma, Ryan Gabrys, Venkatesan Guruswami, Ting-Chun Lin, Hsin-Po Wang:
Accelerating Polarization via Alphabet Extension. CoRR abs/2207.04522 (2022) - [i208]Huck Bennett, Mahdi Cheraghchi, Venkatesan Guruswami, João Ribeiro:
Parameterized Inapproximability of the Minimum Distance Problem over all Fields and the Shortest Vector Problem in all 𝓁p Norms. CoRR abs/2211.07900 (2022) - [i207]Joshua Brakensiek, Venkatesan Guruswami, Sai Sandeep:
SDPs and Robust Satisfiability of Promise CSP. CoRR abs/2211.08373 (2022) - [i206]Meghal Gupta, Venkatesan Guruswami, Rachel Yun Zhang:
Binary Error-Correcting Codes with Minimal Noiseless Feedback. CoRR abs/2212.05673 (2022) - [i205]Martin Grohe, Venkatesan Guruswami, Dániel Marx, Stanislav Zivný:
The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 22201). Dagstuhl Reports 12(5): 112-130 (2022) - [i204]Omar Alrabiah, Venkatesan Guruswami, Pravesh Kothari, Peter Manohar:
A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation. Electron. Colloquium Comput. Complex. TR22 (2022) - [i203]Huck Bennett, Mahdi Cheraghchi, Venkatesan Guruswami, João Ribeiro:
Parameterized Inapproximability of the Minimum Distance Problem over all Fields and the Shortest Vector Problem in all ℓp Norms. Electron. Colloquium Comput. Complex. TR22 (2022) - [i202]Venkatesan Guruswami, Xin Lyu, Xiuhan Wang:
Range Avoidance for Low-depth Circuits and Connections to Pseudorandomness. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j97]Venkatesan Guruswami, Nicolas Resch, Chaoping Xing:
Lossless Dimension Expanders Via Linearized Polynomials and Subspace Designs. Comb. 41(4): 545-579 (2021) - [j96]Joshua Brakensiek, Venkatesan Guruswami:
Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy. SIAM J. Comput. 50(6): 1663-1700 (2021) - [j95]Joshua Brakensiek, Venkatesan Guruswami:
The Quest for Strong Inapproximability Results with Perfect Completeness. ACM Trans. Algorithms 17(3): 27:1-27:35 (2021) - [j94]Venkatesan Guruswami, Johan Håstad:
Explicit Two-Deletion Codes With Redundancy Matching the Existential Bound. IEEE Trans. Inf. Theory 67(10): 6384-6394 (2021) - [j93]Venkatesan Guruswami, Bernhard Haeupler, Amirbehshad Shahrasbi:
Optimally Resilient Codes for List-Decoding From Insertions and Deletions. IEEE Trans. Inf. Theory 67(12): 7837-7856 (2021) - [j92]Omar Alrabiah, Venkatesan Guruswami:
An Exponential Lower Bound on the Sub-Packetization of Minimum Storage Regenerating Codes. IEEE Trans. Inf. Theory 67(12): 8086-8093 (2021) - [c173]Omar Alrabiah, Venkatesan Guruswami:
Visible Rank and Codes with Locality. APPROX-RANDOM 2021: 57:1-57:18 - [c172]Venkatesan Guruswami, Xiaoyu He, Ray Li:
The zero-rate threshold for adversarial bit-deletions is less than 1/2. FOCS 2021: 727-738 - [c171]Joshua Brakensiek, Venkatesan Guruswami, Sai Sandeep:
Conditional Dichotomy of Boolean Ordered Promise CSPs. ICALP 2021: 37:1-37:15 - [c170]Venkatesan Guruswami, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters:
Sharp Threshold Rates for Random Codes. ITCS 2021: 5:1-5:20 - [c169]Venkatesan Guruswami, Vinayak Kumar:
Pseudobinomiality of the Sticky Random Walk. ITCS 2021: 48:1-48:19 - [c168]Venkatesan Guruswami, Andrii Riazanov:
Linear Shannon Capacity of Cayley Graphs. ISIT 2021: 988-992 - [c167]Michael Rudow, K. V. Rashmi, Venkatesan Guruswami:
A locality-based lens for coded computation. ISIT 2021: 1070-1075 - [c166]Venkatesan Guruswami, Andrii Riazanov:
Linear Programming Bounds for Almost-Balanced Binary Codes. ISIT 2021: 1302-1307 - [c165]Vikraman Arvind, Venkatesan Guruswami:
CNF Satisfiability in a Subspace and Related Problems. IPEC 2021: 5:1-5:15 - [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 - [i201]Joshua Brakensiek, Venkatesan Guruswami, Sai Sandeep:
Conditional Dichotomy of Boolean Ordered Promise CSPs. CoRR abs/2102.11854 (2021) - [i200]Venkatesan Guruswami, Xiaoyu He, Ray Li:
The zero-rate threshold for adversarial bit-deletions is less than 1/2. CoRR abs/2106.05250 (2021) - [i199]Venkatesan Guruswami, Andrii Riazanov:
Linear Programming Bounds for Almost-Balanced Binary Codes. CoRR abs/2107.07672 (2021) - [i198]Vikraman Arvind, Venkatesan Guruswami:
CNF Satisfiability in a Subspace and Related Problems. CoRR abs/2108.05914 (2021) - [i197]Omar Alrabiah, Venkatesan Guruswami:
Visible Rank and Codes with Locality. CoRR abs/2108.12687 (2021) - [i196]Venkatesan Guruswami, Peter Manohar, Jonathan Mosheiff:
𝓁p-Spread Properties of Sparse Matrices. CoRR abs/2108.13578 (2021) - [i195]Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar:
Algorithms and Certificates for Boolean CSP Refutation: "Smoothed is no harder than Random". CoRR abs/2109.04415 (2021) - [i194]Venkatesan Guruswami, Jonathan Mosheiff:
Punctured Large Distance Codes, and Many Reed-Solomon Codes, Achieve List-Decoding Capacity. CoRR abs/2109.11725 (2021) - [i193]Ryan Gabrys, Venkatesan Guruswami, João Ribeiro, Ke Wu:
Beyond Single-Deletion Correcting Codes: Substitutions and Transpositions. CoRR abs/2112.09971 (2021) - [i192]Omar Alrabiah, Venkatesan Guruswami:
Visible Rank and Codes with Locality. Electron. Colloquium Comput. Complex. TR21 (2021) - [i191]Omar Alrabiah, Venkatesan Guruswami:
Revisiting a Lower Bound on the Redundancy of Linear Batch Codes. Electron. Colloquium Comput. Complex. TR21 (2021) - [i190]Vikraman Arvind, Venkatesan Guruswami:
CNF Satisfiability in a Subspace and Related Problems. Electron. Colloquium Comput. Complex. TR21 (2021) - [i189]Joshua Brakensiek, Venkatesan Guruswami, Sai Sandeep:
Conditional Dichotomy of Boolean Ordered Promise CSPs. Electron. Colloquium Comput. Complex. TR21 (2021) - [i188]Sivakanth Gopi, Venkatesan Guruswami:
Improved Maximally Recoverable LRCs using Skew Polynomials. Electron. Colloquium Comput. Complex. TR21 (2021) - [i187]Venkatesan Guruswami, Xiaoyu He, Ray Li:
The zero-rate threshold for adversarial bit-deletions is less than 1/2. Electron. Colloquium Comput. Complex. TR21 (2021) - [i186]Venkatesan Guruswami, Jonathan Mosheiff:
Punctured Large Distance Codes, and Many Reed-Solomon Codes, Achieve List-Decoding Capacity. Electron. Colloquium Comput. Complex. TR21 (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. TR20 (2020) - [i175]Venkatesan Guruswami, Vinayak Kumar:
Pseudobinomiality of the Sticky Random Walk. Electron. Colloquium Comput. Complex. TR20 (2020) - [i174]Venkatesan Guruswami, Sai Sandeep:
Approximate Hypergraph Vertex Cover and generalized Tuza's conjecture. Electron. Colloquium Comput. Complex. TR20 (2020) - [i173]Venkatesan Guruswami, Chaoping Xing:
Optimal rate list decoding over bounded alphabets using algebraic-geometric codes. Electron. Colloquium Comput. Complex. TR20 (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. TR19 (2019) - [i163]Joshua Brakensiek, Venkatesan Guruswami:
Bridging between 0/1 and Linear Programming via Random Walks. Electron. Colloquium Comput. Complex. TR19 (2019) - [i162]Joshua Brakensiek, Sivakanth Gopi, Venkatesan Guruswami:
CSPs with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations. Electron. Colloquium Comput. Complex. TR19 (2019) - [i161]Venkatesan Guruswami, Bernhard Haeupler, Amirbehshad Shahrasbi:
Optimally Resilient Codes for List-Decoding from Insertions and Deletions. Electron. Colloquium Comput. Complex. TR19 (2019) - [i160]Venkatesan Guruswami, Jakub Oprsal, Sai Sandeep:
Revisiting Alphabet Reduction in Dinur's PCP. Electron. Colloquium Comput. Complex. TR19 (2019) - [i159]