Venkatesan Guruswami - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 100 from 439

2025

AG Codes Have No List-Decoding Friends: Approaching the Generalized Singleton Bound Requires Exponential AlphabetsOmar Alrabiah, Venkatesan Guruswami, Ray Li. TIT, 71(4):2443-2451, April 2025. [doi]

PCP-free APX-Hardness of Nearest Codeword and Minimum DistanceVijay Bhattiprolu, Venkatesan Guruswami, Xuandi Ren. eccc, TR25, 2025. [doi]

SDPs and Robust Satisfiability of Promise CSPJoshua Brakensiek, Venkatesan Guruswami, Sai Sandeep. eccc, TR25, 2025. [doi]

Quantum Locally Recoverable CodesLouis Golowich, Venkatesan Guruswami. soda 2025: 5512-5522 [doi]

New Spectral Algorithms for Refuting Smoothed k-SATVenkatesan Guruswami, Pravesh K. Kothari, Peter Manohar. CACM, 68(3):83-91, March 2025. [doi]

A Deterministic Construction of a Large Distance Code From the Wozencraft EnsembleVenkatesan Guruswami, Shilun Li. TIT, 71(2):930-935, February 2025. [doi]

2024

Successive Cancellation Sampling Decoder: An Attempt to Analyze List Decoding TheoreticallyHsin-Po Wang 0001, Venkatesan Guruswami. isit 2024: 2412-2417 [doi]

Isolate and then Identify: Rethinking Adaptive Group TestingHsin-Po Wang 0001, Venkatesan Guruswami. isit 2024: 3231-3236 [doi]

Outlier Robust Multivariate Polynomial RegressionVipul Arora 0002, Arnab Bhattacharyya 0001, Mathews Boban, Venkatesan Guruswami, Esty Kelman. esa 2024: [doi]

Randomly Punctured Reed-Solomon Codes Achieve List-Decoding Capacity over Linear-Sized FieldsOmar Alrabiah, Venkatesan Guruswami, Ray Li. stoc 2024: 1458-1469 [doi]

Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow CyclesOmar Alrabiah, Venkatesan Guruswami. focs 2024: 1874-1882 [doi]

AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabetsOmar Alrabiah, Venkatesan Guruswami, Ray Li. soda 2024: 1367-1378 [doi]

Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow CyclesOmar Alrabiah, Venkatesan Guruswami. eccc, TR24, 2024. [doi]

Parameterized Inapproximability of the Minimum Distance Problem over All Fields and the Shortest Vector Problem in All \({\ell_{{p}}}\) NormsHuck Bennett, Mahdi Cheraghchi, Venkatesan Guruswami, João Ribeiro 0002. SICOMP, 53(5):1439-1475, 2024. [doi]

New constructions of pseudorandom codesSurendra Ghentiyala, Venkatesan Guruswami. iacr, 2024:1425, 2024. [doi]

Decoding Quasi-Cyclic Quantum LDPC CodesLouis Golowich, Venkatesan Guruswami. focs 2024: 344-368 [doi]

Baby PIH: Parameterized Inapproximability of Min CSPVenkatesan Guruswami, Xuandi Ren, Sai Sandeep. coco 2024: [doi]

Capacity-Achieving Gray CodesVenkatesan Guruswami, Hsin-Po Wang 0001. approx 2024: [doi]

Certifying Euclidean Sections and Finding Planted Sparse Vectors Beyond the √n Dimension ThresholdVenkatesan Guruswami, Jun-Ting Hsieh, Prasad Raghavendra. focs 2024: 930-948 [doi]

Parameterized Inapproximability Hypothesis under Exponential Time HypothesisVenkatesan Guruswami, Bingkai Lin, Xuandi Ren, Yican Sun, Kewen Wu 0001. stoc 2024: 24-35 [doi]

Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETHVenkatesan Guruswami, Bingkai Lin, Xuandi Ren, Yican Sun, Kewen Wu 0001. eccc, TR24, 2024. [doi]

2023

How Many Matrices Should I Prepare To Polarize Channels Optimally Fast?Hsin-Po Wang 0001, Venkatesan Guruswami. isit 2023: 1556-1561 [doi]

Quickly-Decodable Group Testing with Fewer Tests: Price-Scarlett's Nonadaptive Splitting with Explicit ScalarsHsin-Po Wang 0001, Ryan Gabrys, Venkatesan Guruswami. isit 2023: 1609-1614 [doi]

A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP RefutationOmar Alrabiah, Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar. stoc 2023: 1438-1448 [doi]

AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabetsOmar Alrabiah, Venkatesan Guruswami, Ray Li. eccc, TR23, 2023. [doi]

Randomly punctured Reed-Solomon codes achieve list-decoding capacity over linear-sized fieldsOmar Alrabiah, Venkatesan Guruswami, Ray Li. eccc, TR23, 2023. [doi]

p NormsHuck Bennett, Mahdi Cheraghchi, Venkatesan Guruswami, João Ribeiro 0002. stoc 2023: 553-566 [doi]

Inapproximability of Matrix p → q NormsVijay Bhattiprolu, Mrinal Kanti Ghosh, Venkatesan Guruswami, Euiwoong Lee, Madhur Tulsiani. SICOMP, 52(1):132-155, February 2023. [doi]

SDPs and Robust Satisfiability of Promise CSPJoshua Brakensiek, Venkatesan Guruswami, Sai Sandeep. stoc 2023: 609-622 [doi]

Conditional Dichotomy of Boolean Ordered Promise CSPsJoshua Brakensiek, Venkatesan Guruswami, Sai Sandeep. theoretics, 2, 2023. [doi]

Efficient Linear and Affine Codes for Correcting Insertions/DeletionsKuan Cheng, Venkatesan Guruswami, Bernhard Haeupler, Xin Li 0006. siamdm, 37(2):748-778, June 2023. [doi]

Beyond Single-Deletion Correcting Codes: Substitutions and TranspositionsRyan Gabrys, Venkatesan Guruswami, João L. Ribeiro 0001, Ke Wu 0001. TIT, 69(1):169-186, 2023. [doi]

Quantum Locally Recoverable CodesLouis Golowich, Venkatesan Guruswami. eccc, TR23, 2023. [doi]

Binary Error-Correcting Codes with Minimal Noiseless FeedbackMeghal Gupta, Venkatesan Guruswami, Rachel Yun Zhang. stoc 2023: 1475-1487 [doi]

Efficient Algorithms for Semirandom Planted CSPs at the Refutation ThresholdVenkatesan Guruswami, Jun-Ting Hsieh, Pravesh K. Kothari, Peter Manohar. focs 2023: 307-327 [doi]

A Deterministic Construction of a Large Distance Code from the Wozencraft EnsembleVenkatesan Guruswami, Shilun Li. approx 2023: [doi]

Hardness of Learning Boolean Functions from Label ProportionsVenkatesan Guruswami, Rishi Saket. fsttcs 2023: [doi]

Baby PIH: Parameterized Inapproximability of Min CSPVenkatesan Guruswami, Xuandi Ren, Sai Sandeep. eccc, TR23, 2023. [doi]

The Zero-Rate Threshold for Adversarial Bit-Deletions is Less Than 1/2Venkatesan Guruswami, Xiaoyu He, Ray Li. TIT, 69(4):2218-2239, April 2023. [doi]

Parameterized Inapproximability Hypothesis under ETHVenkatesan Guruswami, Bingkai Lin, Xuandi Ren, Yican Sun, Kewen Wu 0001. eccc, TR23, 2023. [doi]

On expanding the toolkit of locality-based coded computation to the coordinates of inputsMichael Rudow, Venkatesan Guruswami, K. V. Rashmi. isit 2023: 2171-2176 [doi]

2022

Strongly refuting all semi-random Boolean CSPsJackson Abascal, Venkatesan Guruswami, Pravesh K. Kothari. soda 2022: 454-472 [doi]

A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP RefutationOmar Alrabiah, Venkatesan Guruswami, Pravesh Kothari, Peter Manohar. eccc, TR22, 2022. [doi]

CNF Satisfiability in a Subspace and Related ProblemsVikraman Arvind, Venkatesan Guruswami. algorithmica, 84(11):3276-3299, 2022. [doi]

p NormsHuck Bennett, Mahdi Cheraghchi, Venkatesan Guruswami, João L. Ribeiro 0001. eccc, TR22, 2022. [doi]

General Strong PolarizationJaroslaw Blasiok, Venkatesan Guruswami, Preetum Nakkiran, Atri Rudra, Madhu Sudan. JACM, 69(2), 2022. [doi]

Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial RepresentationsJoshua Brakensiek, Sivakanth Gopi, Venkatesan Guruswami. SICOMP, 51(3):577-626, 2022. [doi]

Efficient Linear and Affine Codes for Correcting Insertions/DeletionsKuan Cheng, Venkatesan Guruswami, Bernhard Haeupler, Xin Li. soda 2022: 1-20 [doi]

Accelerating Polarization via Alphabet ExtensionIwan M. Duursma, Ryan Gabrys, Venkatesan Guruswami, Ting-Chun Lin, Hsin-Po Wang 0001. approx 2022: [doi]

Beyond Single-Deletion Correcting Codes: Substitutions and TranspositionsRyan Gabrys, Venkatesan Guruswami, João L. Ribeiro 0001, Ke Wu. approx 2022: [doi]

Improved Maximally Recoverable LRCs Using Skew PolynomialsSivakanth Gopi, Venkatesan Guruswami. TIT, 68(11):7198-7214, 2022. [doi]

The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 22201)Martin Grohe, Venkatesan Guruswami, Dániel Marx, Stanislav Zivný. dagstuhl-reports, 12(5):112-130, 2022. [doi]

Explicit two-deletion codes with redundancy matching the existential boundVenkatesan Guruswami, Johan Håstad. soda 2022: 21-32 [doi]

Range Avoidance for Low-Depth Circuits and Connections to PseudorandomnessVenkatesan Guruswami, Xin Lyu, Xiuhan Wang. approx 2022: [doi]

Bypassing the XOR Trick: Stronger Certificates for Hypergraph Clique NumberVenkatesan Guruswami, Pravesh K. Kothari, Peter Manohar. approx 2022: [doi]

Approximate Hypergraph Vertex Cover and generalized Tuza's conjectureVenkatesan Guruswami, Sai Sandeep. soda 2022: 927-944 [doi]

Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than randomVenkatesan Guruswami, Pravesh K. Kothari, Peter Manohar. stoc 2022: 678-689 [doi]

p-Spread and Restricted Isometry Properties of Sparse Random MatricesVenkatesan Guruswami, Peter Manohar, Jonathan Mosheiff. coco 2022: [doi]

Punctured Low-Bias Codes Behave Like Random Linear CodesVenkatesan Guruswami, Jonathan Mosheiff. focs 2022: 36-45 [doi]

Bounds for List-Decoding and List-Recovery of Random Linear CodesVenkatesan Guruswami, Ray Li, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters. TIT, 68(2):923-939, 2022. [doi]

Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric CodesVenkatesan Guruswami, Chaoping Xing. JACM, 69(2), 2022. [doi]

Threshold Rates for Properties of Random CodesVenkatesan Guruswami, Jonathan Moshieff, Nicolas Resch, Shashwat Silas, Mary Wootters. TIT, 68(2):905-922, 2022. [doi]

Arıkan Meets Shannon: Polar Codes With Near-Optimal Convergence to Channel CapacityVenkatesan Guruswami, Andrii Riazanov, Min Ye 0005. TIT, 68(5):2877-2919, 2022. [doi]

k-hashingVenkatesan Guruswami, Andrii Riazanov. jcta, 188:105580, 2022. [doi]

Range Avoidance for Low-depth Circuits and Connections to PseudorandomnessVenkatesan Guruswami, Xin Lyu, Xiuhan Wang. eccc, TR22, 2022. [doi]

2021

Strongly refuting all semi-random Boolean CSPsJackson Abascal, Venkatesan Guruswami, Pravesh K. Kothari. soda 2021: 454-472 [doi]

Visible Rank and Codes with LocalityOmar Alrabiah, Venkatesan Guruswami. approx 2021: [doi]

Visible Rank and Codes with LocalityOmar Alrabiah, Venkatesan Guruswami. eccc, 28:119, 2021. [doi]

An Exponential Lower Bound on the Sub-Packetization of Minimum Storage Regenerating CodesOmar Alrabiah, Venkatesan Guruswami. TIT, 67(12):8086-8093, 2021. [doi]

Revisiting a Lower Bound on the Redundancy of Linear Batch CodesOmar Alrabiah, Venkatesan Guruswami. eccc, 28:145, 2021. [doi]

CNF Satisfiability in a Subspace and Related ProblemsVikraman Arvind, Venkatesan Guruswami. iwpec 2021: [doi]

CNF Satisfiability in a Subspace and Related ProblemsVikraman Arvind, Venkatesan Guruswami. eccc, 28:112, 2021. [doi]

Conditional Dichotomy of Boolean Ordered Promise CSPsJoshua Brakensiek, Venkatesan Guruswami, Sai Sandeep. icalp 2021: [doi]

Conditional Dichotomy of Boolean Ordered Promise CSPsJoshua Brakensiek, Venkatesan Guruswami, Sai Sandeep. eccc, 28:26, 2021. [doi]

The Quest for Strong Inapproximability Results with Perfect CompletenessJoshua Brakensiek, Venkatesan Guruswami. TALG, 17(3), 2021. [doi]

Efficient Linear and Affine Codes for Correcting Insertions/DeletionsKuan Cheng, Venkatesan Guruswami, Bernhard Haeupler, Xin Li 0006. soda 2021: 1-20 [doi]

Improved Maximally Recoverable LRCs using Skew PolynomialsSivakanth Gopi, Venkatesan Guruswami. eccc, 28:25, 2021. [doi]

Linear Programming Bounds for Almost-Balanced Binary CodesVenkatesan Guruswami, Andrii Riazanov. isit 2021: 1302-1307 [doi]

Pseudobinomiality of the Sticky Random WalkVenkatesan Guruswami, Vinayak Kumar. innovations 2021: [doi]

Sharp Threshold Rates for Random CodesVenkatesan Guruswami, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters. innovations 2021: [doi]

The zero-rate threshold for adversarial bit-deletions is less than 1/2Venkatesan Guruswami, Xiaoyu He, Ray Li. focs 2022: 727-738 [doi]

Linear Shannon Capacity of Cayley GraphsVenkatesan Guruswami, Andrii Riazanov. isit 2021: 988-992 [doi]

Explicit two-deletion codes with redundancy matching the existential boundVenkatesan Guruswami, Johan Håstad. soda 2021: 21-32 [doi]

Lossless Dimension Expanders Via Linearized Polynomials and Subspace DesignsVenkatesan Guruswami, Nicolas Resch, Chaoping Xing. combinatorica, 41(4):545-579, 2021. [doi]

Explicit Two-Deletion Codes With Redundancy Matching the Existential BoundVenkatesan Guruswami, Johan Håstad. TIT, 67(10):6384-6394, 2021. [doi]

Punctured Large Distance Codes, and Many Reed-Solomon Codes, Achieve List-Decoding CapacityVenkatesan Guruswami, Jonathan Mosheiff. eccc, 28:139, 2021. [doi]

The zero-rate threshold for adversarial bit-deletions is less than 1/2Venkatesan Guruswami, Xiaoyu He, Ray Li. eccc, 28:79, 2021. [doi]

Optimally Resilient Codes for List-Decoding From Insertions and DeletionsVenkatesan Guruswami, Bernhard Haeupler, Amirbehshad Shahrasbi. TIT, 67(12):7837-7856, 2021. [doi]

A locality-based lens for coded computationMichael Rudow, K. V. Rashmi, Venkatesan Guruswami. isit 2021: 1070-1075 [doi]

2020

Symmetric Polymorphisms and Efficient Decidability of Promise CSPsJoshua Brakensiek, Venkatesan Guruswami. soda 2020: 297-304 [doi]

The Power of the Combined Basic Linear Programming and Affine Relaxation for Promise Constraint Satisfaction ProblemsJoshua Brakensiek, Venkatesan Guruswami, Marcin Wrochna, Stanislav Zivný. SICOMP, 49(6):1232-1248, 2020. [doi]

An Improved Bound on the Zero-Error List-Decoding Capacity of the 4/3 ChannelMarco Dalai, Venkatesan Guruswami, Jaikumar Radhakrishnan. TIT, 66(2):749-756, 2020. [doi]

Arikan meets Shannon: polar codes with near-optimal convergence to channel capacityVenkatesan Guruswami, Andrii Riazanov, Min Ye. stoc 2020: 552-564 [doi]

Optimally resilient codes for list-decoding from insertions and deletionsVenkatesan Guruswami, Bernhard Haeupler, Amirbehshad Shahrasbi. stoc 2020: 524-537 [doi]

Revisiting Alphabet Reduction in Dinur's PCPVenkatesan Guruswami, Jakub Oprsal, Sai Sandeep. approx 2020: [doi]

Bounds for List-Decoding and List-Recovery of Random Linear CodesVenkatesan Guruswami, Ray Li, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters. approx 2020: [doi]

d-To-1 Hardness of Coloring 3-Colorable Graphs with O(1) ColorsVenkatesan Guruswami, Sai Sandeep. icalp 2020: [doi]

Approximate Hypergraph Vertex Cover and generalized Tuza's conjectureVenkatesan Guruswami, Sai Sandeep. eccc, 27:167, 2020. [doi]

Optimal rate list decoding over bounded alphabets using algebraic-geometric codesVenkatesan Guruswami, Chaoping Xing. eccc, 27:172, 2020. [doi]

Leakage-Resilient Secret Sharing in Non-Compartmentalized ModelsFuchun Lin, Mahdi Cheraghchi, Venkatesan Guruswami, Reihaneh Safavi-Naini, Huaxiong Wang. icits 2020: [doi]

All Publications

Filter by Year

[-]
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag
OR AND NOT 1

Filter by Venue

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1

Researchr

Publications by 'Venkatesan Guruswami'

Viewing Publication 1 - 100 from 439

2025

2024

2023

2022

2021

2020

All Publications

Filter by Year [-]OR AND NOT 1

Filter by TypeOR AND NOT 1

Filter by TagOR AND NOT 1

Filter by Venue [+]OR AND NOT 1

Filter by Author [+]OR AND NOT 1

Filter by Top Terms [+]OR AND NOT 1

Researchr

Publications by 'Venkatesan Guruswami'

Viewing Publication 1 - 100 from 439

2025

2024

2023

2022

2021

2020

Filter by Year

[-]
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag
OR AND NOT 1

Filter by Venue

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1