Advanced search    

Search: authors:"Venkatesan Guruswami"

14 papers found.
Use AND, OR, NOT, +word, -word, "long phrase", (parentheses) to fine-tune your search.

Secret Sharing with Binary Shares

, SG 3 Venkatesan Guruswami Computer Science Department, Carnegie Mellon University , USA 4 Mahdi Cheraghchi Department of Computing, Imperial College London , UK Shamir's celebrated secret sharing ... Singapore Ministry of Education under Research Grant MOE2016-T2-2-014(S) and RG133/17(S). The research of Venkatesan Guruswami was supported in part by United States NSF grants CCF-1422045 and CCF-1563742

How Long Can Optimal Locally Repairable Codes Bel

, Pittsburgh, USA. 3 Venkatesan Guruswami 4 Nanyang Technological University, Singapore, and the Center of Mathematical Sciences and Applications, Harvard University

Polar Codes with Exponentially Small Error at Finite Block Length

15213 , USA 2 Venkatesan Guruswami 3 Harvard John A. Paulson School of Engineering and Applied Sciences, Harvard University , 33 Oxford Street, Cambridge, MA 02138 , USA 4 Jarosław Błasiok 5 Harvard

How Long Can Optimal Locally Repairable Codes Bel

, Carnegie Mellon University , Pittsburgh, USA. 3 Venkatesan Guruswami A locally repairable code (LRC) with locality r allows for the recovery of any erased codeword

Lossless Dimension Expanders via Linearized Polynomials and Subspace Designs

, USA, 15213 1 Department of Carnegie Mellon University 5000 Forbes Ave , Pittsburgh, PA, USA, 15213 , USA 2 Venkatesan Guruswami 3 School of Physical and ... . 2010 .v006a012. Michael A Forbes and Venkatesan Guruswami . Dimension expanders via rank condensers . In Approximation, Randomization, and Combinatorial Optimization . Algorithms and Techniques , pages

Hardness of Rainbow Coloring Hypergraphs

A hypergraph is k-rainbow colorable if there exists a vertex coloring using k colors such that each hyperedge has all the k colors. Unlike usual hypergraph coloring, rainbow coloring becomes harder as the number of colors increases. This work studies the rainbow colorability of hypergraphs which are guaranteed to be nearly balanced rainbow colorable. Specifically, we show that...

Efficiently Decodable Codes for the Binary Deletion Channel

Bi such that Bi ? Ai always, Bi takes values in [0, ?], and E[Bi] = ?. Applying Lemma 2 gives Pr = exp ? 1 2 3 Joshua Brakensiek , Venkatesan Guruswami, and Samuel Zbarsky . Efficient low-redundancy ... codes for correcting multiple deletions . In Proceedings of the Twenty-Seventh Annual ACMSIAM Symposium on Discrete Algorithms , pages 1884 - 1892 , 2016 . Boris Bukh , Venkatesan Guruswami, and Johan H

Sum-of-Squares Certificates for Maxima of Random Tensors on the Sphere

preprint arXiv:1404.5236 , 2014 . Electronic Colloquium on Computational Complexity (ECCC) , 23 : 185 , 2016 . URL: https: // Vijay Bhattiprolu , Venkatesan Guruswami

Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph

. Approximating s-t minimum cuts in O?(n2) time . Proceedings of the 28th annual ACM symposium on Theory of computing , pages 47 - 55 , 1996 . Lars Engebretsen and Venkatesan Guruswami . Is constraint satisfaction ... semidefinite programming . J. ACM , 42 ( 6 ): 1115 - 1145 , 1995 . doi: 10 .1145/227683.227684. Venkatesan Guruswami and Euiwoong Lee . Towards a characterization of approximation resistance for symmetric CSPs

Subspace Designs Based on Algebraic Function Fields

. Extended full version available as ECCC Technical Report TR14-162. Venkatesan Guruswami . Cyclotomic function fields, Artin-Frobenius automorphisms, and list error-correction with optimal rate . Algebra and ... Number Theory , 4 ( 4 ): 433 - 463 , 2010 . Preliminary version in STOC 2009 . Venkatesan Guruswami . Linear-algebraic list decoding of folded Reed-Solomon codes . In Proceedings of the 26th IEEE

An Entropy Sumset Inequality and Polynomially Fast Convergence to Shannon Capacity Over All Alphabets

1493 - 1495 , 2009 . In Proceedings of the 2013 IEEE International Symposium on Information Theory , Istanbul, Turkey, July 7- 12 , 2013 , pages 1127 - 1131 , 2013 . Venkatesan Guruswami and Ameya ... Velingker . An entropy sumset inequality and polynomially fast convergence to shannon capacity over all alphabets . Electronic Colloquium on Computational Complexity (ECCC) , 21 : 165 , 2014 . Venkatesan

Polar Codes: Reliable Communication with Complexity Polynomial in the Gap to Shannon Capacity (Invited Talk)

Shannon's monumental 1948 work laid the foundations for the rich fields of information and coding theory. The quest for efficient coding schemes to approach Shannon capacity has occupied researchers ever since, with spectacular progress enabling the widespread use of error-correcting codes in practice. Yet the theoretical problem of approaching capacity arbitrarily closely with...

Special Issue “Conference on Computational Complexity 2006” Guest Editors’ Foreword

SPECIAL ISSUE CONFERENCE ON COMPUTATIONAL COMPLEXITY 2006 GUEST EDITORS' FOREWORD Venkatesan Guruswami Guest Editor 0 1 0 School of Computing Science Simon Fraser University Vancouver , B.C ... Editor-in-Chief Joachim von zur Gathen for inviting us to edit this special issue! Valentine Kabanets; Guest Editor - Venkatesan Guruswami Guest Editor Valentine Kabanets Guest Editor

The complexity of the covering radius problem

Venkatesan Guruswami Department of Computer Science University of Washington Seattle, WA 98195, U.S.A.