MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named Venkatesan Guruswami – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

52 documents found, showing 1 through 10. Next 10 →

ATOM

Query-efficient Checking of Proofs and Improved PCP Characterizations of NP
by Venkatesan Guruswami — 1999
… and Improved PCP Characterizations of NP by Venkatesan Guruswami Submitted to the Department of Electrical…
Add To MetaCart

Better extractors for better codes
by Venkatesan Guruswami — 2004 — Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004
… 2004 ACM 1-58113-852-0/04/0006 ...$5.00. Venkatesan Guruswami Department of Computer Science…
Cited by 10 (0 self) – Add To MetaCart

List Decoding from Erasures: Bounds and Code Constructions
by Venkatesan Guruswami — 2001 — IEEE Transactions on Information Theory
…List Decoding from Erasures: Bounds and Code Constructions Venkatesan Guruswami y University…
Cited by 3 (1 self) – Add To MetaCart

Constructions of Codes from Number Fields
by Venkatesan Guruswami — 2003 — IEEE Transactions on Information Theory
…Constructions of Codes from Number Fields Venkatesan Guruswami University of California…
Cited by 2 (0 self) – Add To MetaCart

Linear time encodable and list decodable codes
by Venkatesan Guruswami — 2003 — In Proceedings of the 35th ACM Symposium on Theory of Computing
…Linear Time Encodable and List Decodable Codes Venkatesan Guruswami Department of Computer Science…
Cited by 3 (0 self) – Add To MetaCart

Inapproximability Results for Set Splitting and Satisfiability Problems with no Mixed Clauses
by Venkatesan Guruswami — 2000
… Venkatesan Guruswami University of California at Berkeley Computer Science Division Berkeley, CA 94720. Email…
Cited by 7 (0 self) – Add To MetaCart

Limits to List Decodability of Linear Codes
by Venkatesan Guruswami — 2002 — In Proc. 34th ACM Symp. on Theory of Computing
…Limits to List Decodability of Linear Codes Venkatesan Guruswami yz University of California…
Cited by 10 (6 self) – Add To MetaCart

Rapidly Mixing Markov Chains: A Comparison of Techniques
by Venkatesan Guruswami — 2000 — A Survey
…Rapidly Mixing Markov Chains: A Comparison of Techniques (A Survey) Venkatesan Guruswami MIT…
Cited by 7 (0 self) – Add To MetaCart

Correlated Algebraic-Geometric codes: Improved list decoding over bounded alphabets
by Venkatesan Guruswami, Anindya, C. Patthak — 2006 — In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS
… DECODING OVER BOUNDED ALPHABETS VENKATESAN GURUSWAMI AND ANINDYA C. PATTHAK Abstract. We define a new…
Cited by 2 (2 self) – Add To MetaCart

Hardness amplification via space-efficient direct products
by Venkatesan Guruswami, Valentine Kabanets — 2006 — In Proc. of the 7th Latin American Symposium on Theoretical Informatics (LATIN’06
…HARDNESS AMPLIFICATION VIA SPACE-EFFICIENT DIRECT PRODUCTS Venkatesan Guruswami and Valentine…
Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB