The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Venkatesan Guruswami: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Venkatesan Guruswami
    Constructions of Codes from Number Fields. [Citation Graph (0, 0)][DBLP]
    AAECC, 2001, pp:129-140 [Conf]
  2. Venkatesan Guruswami
    Inapproximability results for set splitting and satisfiability problems with no mixed clauses. [Citation Graph (0, 0)][DBLP]
    APPROX, 2000, pp:155-166 [Conf]
  3. Venkatesan Guruswami, Atri Rudra
    Tolerant Locally Testable Codes. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2005, pp:306-317 [Conf]
  4. Venkatesan Guruswami, Luca Trevisan
    The Complexity of Making Unique Choices: Approximating 1-in- k SAT. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2005, pp:99-110 [Conf]
  5. Venkatesan Guruswami, Salil P. Vadhan
    A Lower Bound on List Size for List Decoding. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2005, pp:318-329 [Conf]
  6. Venkatesan Guruswami
    List Decoding with Side Information. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:300-0 [Conf]
  7. Venkatesan Guruswami, Sanjeev Khanna
    On the Hardness of 4-Coloring a 3-Colorable Graph. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:188-197 [Conf]
  8. Venkatesan Guruswami, Subhash Khot
    Hardness of Max 3SAT with No Mixed Clauses. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2005, pp:154-162 [Conf]
  9. Venkatesan Guruswami, Daniele Micciancio, Oded Regev
    The Complexity of the Covering Radius Problem on Lattices and Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:161-173 [Conf]
  10. Venkatesan Guruswami, Madhu Sudan
    Decoding Concatenated Codes using Soft Information. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:148-157 [Conf]
  11. Venkatesan Guruswami, Amit Sahai
    Multiclass Learning, Boosting, and Error-Correcting Codes. [Citation Graph (0, 0)][DBLP]
    COLT, 1999, pp:145-155 [Conf]
  12. Venkatesan Guruswami, Madhu Sudan
    On Representations of Algebraic-Geometric Codes for List Decoding. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:244-255 [Conf]
  13. Moses Charikar, Venkatesan Guruswami, Ravi Kumar, Sridhar Rajagopalan, Amit Sahai
    Combinatorial feature selection problems. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:631-640 [Conf]
  14. Moses Charikar, Venkatesan Guruswami, Anthony Wirth
    Clustering with Qualitative Information. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:524-533 [Conf]
  15. Venkatesan Guruswami, Daniel Lewin, Madhu Sudan, Luca Trevisan
    A Tight Characterization of NP with 3 Query PCPs. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:8-17 [Conf]
  16. Venkatesan Guruswami, Johan Håstad, Madhu Sudan
    Hardness of Approximate Hypergraph Coloring. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:149-158 [Conf]
  17. Venkatesan Guruswami, Piotr Indyk
    Expander-Based Constructions of Efficiently Decodable Codes. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:658-667 [Conf]
  18. Venkatesan Guruswami, Madhu Sudan
    Improved Decoding of Reed-Solomon and Algebraic-Geometric Codes. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:28-39 [Conf]
  19. Venkatesan Guruswami, Amit Sahai, Madhu Sudan
    "Soft-decision" Decoding of Chinese Remainder Codes. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:159-168 [Conf]
  20. Venkatesan Guruswami, Prasad Raghavendra
    Hardness of Learning Halfspaces with Noise. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:543-552 [Conf]
  21. Venkatesan Guruswami, Anindya C. Patthak
    Correlated Algebraic-Geometric Codes: Improved List Decoding over Bounded Alphabets. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:227-238 [Conf]
  22. Venkatesan Guruswami
    List Decoding from Erasures: Bounds and Code Constructions. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2001, pp:195-206 [Conf]
  23. Venkatesan Guruswami, Piotr Indyk
    Linear-Time List Decoding in Error-Free Settings: (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:695-707 [Conf]
  24. Venkatesan Guruswami
    On 2-Query Codeword Testing with Near-Perfect Completeness. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:267-276 [Conf]
  25. Parikshit Gopalan, Venkatesan Guruswami, Richard J. Lipton
    Algorithms for Modular Counting of Roots of Multivariate Polynomials. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:544-555 [Conf]
  26. Venkatesan Guruswami, Valentine Kabanets
    Hardness Amplification Via Space-Efficient Direct Products. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:556-568 [Conf]
  27. Lars Engebretsen, Venkatesan Guruswami
    Is Constraint Satisfaction Over Two Variables Always Easy? [Citation Graph (0, 0)][DBLP]
    RANDOM, 2002, pp:224-238 [Conf]
  28. Noga Alon, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan
    Guessing secrets efficiently via list decoding. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:254-262 [Conf]
  29. Yevgeniy Dodis, Venkatesan Guruswami, Sanjeev Khanna
    The 2-Catalog Segmentation Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:897-898 [Conf]
  30. Ioannis Giotis, Venkatesan Guruswami
    Correlation clustering with a fixed number of clusters. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:1167-1176 [Conf]
  31. Venkatesan Guruswami, Jason D. Hartline, Anna R. Karlin, David Kempe, Claire Kenyon, Frank McSherry
    On profit-maximizing envy-free pricing. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:1164-1173 [Conf]
  32. Venkatesan Guruswami, Piotr Indyk
    Embeddings and non-approximability of geometric problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:537-538 [Conf]
  33. Venkatesan Guruswami, Piotr Indyk
    Efficiently decodable codes meeting Gilbert-Varshamov bound for low rates. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:756-757 [Conf]
  34. Venkatesan Guruswami, Igor Shparlinski
    Unconditional proof of tightness of Johnson bound. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:754-755 [Conf]
  35. Venkatesan Guruswami, Alexander Vardy
    Maximum-likelihood decoding of Reed-Solomon codes is NP-hard. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:470-478 [Conf]
  36. Moses Charikar, Ronald Fagin, Venkatesan Guruswami, Jon M. Kleinberg, Prabhakar Raghavan, Amit Sahai
    Query strategies for priced information (extended abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:582-591 [Conf]
  37. Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev
    A new multilayered PCP and the hardness of hypergraph vertex cover. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:595-601 [Conf]
  38. Venkatesan Guruswami
    Limits to list decodability of linear codes. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:802-811 [Conf]
  39. Venkatesan Guruswami
    Better extractors for better codes? [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:436-444 [Conf]
  40. Venkatesan Guruswami, Piotr Indyk
    Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:812-821 [Conf]
  41. Venkatesan Guruswami, Piotr Indyk
    Linear time encodable and list decodable codes. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:126-135 [Conf]
  42. Venkatesan Guruswami, Sanjeev Khanna, Rajmohan Rajaraman, F. Bruce Shepherd, Mihalis Yannakakis
    Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint Paths and Related Problems. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:19-28 [Conf]
  43. Venkatesan Guruswami, Atri Rudra
    Limits to list decoding Reed-Solomon codes. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:602-609 [Conf]
  44. Venkatesan Guruswami, Atri Rudra
    Explicit capacity-achieving list-decodable codes. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:1-10 [Conf]
  45. Venkatesan Guruswami, Madhu Sudan
    List decoding algorithms for certain concatenated codes. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:181-190 [Conf]
  46. Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong
    The Vertex-Disjoint Triangles Problem. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:26-37 [Conf]
  47. Venkatesan Guruswami
    Inapproximability Results for Set Splitting and Satisfiability Problems with No Mixed Clauses. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:38, n:3, pp:451-469 [Journal]
  48. Venkatesan Guruswami, Daniele Micciancio, Oded Regev
    The complexity of the covering radius problem. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2005, v:14, n:2, pp:90-121 [Journal]
  49. Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong
    The Kr-Packing Problem. [Citation Graph (0, 0)][DBLP]
    Computing, 2001, v:66, n:1, pp:79-89 [Journal]
  50. Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev
    A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  51. Venkatesan Guruswami, Alexander Vardy
    Maximum-likelihood decoding of Reed-Solomon Codes is NP-hard [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  52. Venkatesan Guruswami
    Maximum Cut on Line and Total Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:92, n:2-3, pp:217-221 [Journal]
  53. Venkatesan Guruswami, C. Pandu Rangan
    Algorithmic aspects of clique-transversal and clique-independent sets. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:100, n:3, pp:183-202 [Journal]
  54. Venkatesan Guruswami
    Constructions of Codes from Number Fields [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:2, pp:- [Journal]
  55. Venkatesan Guruswami, Johan Håstad, Madhu Sudan
    Hardness of approximate hypergraph coloring [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:62, pp:- [Journal]
  56. Venkatesan Guruswami, Sanjeev Khanna
    On the Hardness of 4-coloring a 3-colorable Graph [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:73, pp:- [Journal]
  57. Irit Dinur, Venkatesan Guruswami, Subhash Khot
    Vertex Cover on k-Uniform Hypergraphs is Hard to Approximate within Factor (k-3-epsilon) [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:027, pp:- [Journal]
  58. Lars Engebretsen, Venkatesan Guruswami
    Is Constraint Satisfaction Over Two Variables Always Easy? [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:053, pp:- [Journal]
  59. Venkatesan Guruswami
    Better Extractors for Better Codes? [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:080, pp:- [Journal]
  60. Venkatesan Guruswami, Alexander Vardy
    Maximum-likelihood decoding of Reed-Solomon codes is NP-hard [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:040, pp:- [Journal]
  61. Venkatesan Guruswami, Atri Rudra
    Tolerant Locally Testable Codes [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:019, pp:- [Journal]
  62. Venkatesan Guruswami, Valentine Kabanets
    Hardness amplification via space-efficient direct products [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:057, pp:- [Journal]
  63. Venkatesan Guruswami
    Algebraic-geometric generalizations of the Parvaresh-Vardy codes [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:132, pp:- [Journal]
  64. Venkatesan Guruswami, Atri Rudra
    Explicit Capacity-Achieving List-Decodable Codes [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:133, pp:- [Journal]
  65. Venkatesan Guruswami, Daniel Lewin, Madhu Sudan, Luca Trevisan
    A tight characterization of NP with 3 query PCPs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:34, pp:- [Journal]
  66. Venkatesan Guruswami, Madhu Sudan
    Improved decoding of Reed-Solomon and algebraic-geometric codes. [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:43, pp:- [Journal]
  67. Venkatesan Guruswami
    The Approximability of Set Splitting Problems and Satisfiability Problems with no Mixed Clauses [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:, n:43, pp:- [Journal]
  68. Venkatesan Guruswami, C. Pandu Rangan
    A Natural Family of Optimization Problems with Arbitrarily Small Approximation Thresholds. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:68, n:5, pp:241-248 [Journal]
  69. Moses Charikar, Ronald Fagin, Venkatesan Guruswami, Jon M. Kleinberg, Prabhakar Raghavan, Amit Sahai
    Query Strategies for Priced Information. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:64, n:4, pp:785-819 [Journal]
  70. Moses Charikar, Venkatesan Guruswami, Anthony Wirth
    Clustering with qualitative information. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2005, v:71, n:3, pp:360-383 [Journal]
  71. Edith Cohen, Venkatesan Guruswami
    Guest Editors' foreword. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:68, n:4, pp:701- [Journal]
  72. Venkatesan Guruswami, Sanjeev Khanna, Rajmohan Rajaraman, F. Bruce Shepherd, Mihalis Yannakakis
    Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:67, n:3, pp:473-496 [Journal]
  73. Lars Engebretsen, Venkatesan Guruswami
    Is constraint satisfaction over two variables always easy? [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2004, v:25, n:2, pp:150-178 [Journal]
  74. Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev
    A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:5, pp:1129-1146 [Journal]
  75. Venkatesan Guruswami, Johan Håstad, Madhu Sudan
    Hardness of Approximate Hypergraph Coloring. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:6, pp:1663-1686 [Journal]
  76. Venkatesan Guruswami, Sanjeev Khanna
    On the Hardness of 4-Coloring a 3-Colorable Graph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2004, v:18, n:1, pp:30-40 [Journal]
  77. Venkatesan Guruswami
    Constructions of codes from number fields. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:3, pp:594-603 [Journal]
  78. Venkatesan Guruswami
    List decoding from erasures: bounds and code constructions. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:11, pp:2826-2833 [Journal]
  79. Venkatesan Guruswami, Johan Håstad, Madhu Sudan, David Zuckerman
    Combinatorial bounds for list decoding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:5, pp:1021-1034 [Journal]
  80. Venkatesan Guruswami, Piotr Indyk
    Linear-time encodable/decodable codes with near-optimal rate. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:10, pp:3393-3400 [Journal]
  81. Venkatesan Guruswami, Madhu Sudan
    On representations of algebraic-geometry codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:4, pp:1610-1613 [Journal]
  82. Venkatesan Guruswami, Madhu Sudan
    Improved decoding of Reed-Solomon and algebraic-geometry codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:6, pp:1757-1767 [Journal]
  83. Venkatesan Guruswami, Alexander Vardy
    Maximum-likelihood decoding of Reed-Solomon codes is NP-hard. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:7, pp:2249-2256 [Journal]
  84. Venkatesan Guruswami, Atri Rudra
    Limits to List Decoding Reed-Solomon Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:8, pp:3642-3649 [Journal]
  85. Venkatesan Guruswami, Atri Rudra
    Better Binary List-Decodable Codes Via Multilevel Concatenation. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:554-568 [Conf]
  86. Venkatesan Guruswami, Christopher Umans, Salil P. Vadhan
    Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:96-108 [Conf]
  87. Venkatesan Guruswami, Prasad Raghavendra
    A 3-query PCP over integers. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:198-206 [Conf]
  88. Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar
    Hardness of routing with congestion in directed graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:165-178 [Conf]
  89. Venkatesan Guruswami, Valentine Kabanets
    Special Issue "Conference on Computational Complexity 2006" Guest Editors' Foreword. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2007, v:16, n:2, pp:113-114 [Journal]
  90. Venkatesan Guruswami
    Iterative Decoding of Low-Density Parity Check Codes (A Survey) [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  91. Ioannis Giotis, Venkatesan Guruswami
    Correlation Clustering with a Fixed Number of Clusters [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  92. Venkatesan Guruswami
    Enumerative aspects of certain subclasses of perfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:205, n:1-3, pp:97-117 [Journal]

  93. List Decoding and Pseudorandom Constructions. [Citation Graph (, )][DBLP]


  94. Euclidean Sections of with Sublinear Randomness and Error-Correction over the Reals. [Citation Graph (, )][DBLP]


  95. Improved Inapproximability Results for Maximum k-Colorable Subgraph. [Citation Graph (, )][DBLP]


  96. Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness. [Citation Graph (, )][DBLP]


  97. Hardness Amplification within NP against Deterministic Algorithms. [Citation Graph (, )][DBLP]


  98. Soft Decoding, Dual BCH Codes, and Better List-Decodable e-Biased Codes. [Citation Graph (, )][DBLP]


  99. Every Permutation CSP of arity 3 is Approximation Resistant. [Citation Graph (, )][DBLP]


  100. Locally Testable Codes Require Redundant Testers. [Citation Graph (, )][DBLP]


  101. Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph. [Citation Graph (, )][DBLP]


  102. Agnostic Learning of Monomials by Halfspaces Is Hard. [Citation Graph (, )][DBLP]


  103. On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs. [Citation Graph (, )][DBLP]


  104. SDP Gaps for 2-to-1 and Other Label-Cover Variants. [Citation Graph (, )][DBLP]


  105. Concatenated codes can achieve list-decoding capacity. [Citation Graph (, )][DBLP]


  106. Almost Euclidean subspaces of lN1 via expander codes. [Citation Graph (, )][DBLP]


  107. List decoding tensor products and interleaved codes. [Citation Graph (, )][DBLP]


  108. Artin automorphisms, cyclotomic function fields, and folded list-decodable codes. [Citation Graph (, )][DBLP]


  109. MaxMin allocation via degree lower-bounded arborescences. [Citation Graph (, )][DBLP]


  110. On the list-decodability of random linear codes. [Citation Graph (, )][DBLP]


  111. List Error-Correction with Optimal Information Rate (Invited Talk). [Citation Graph (, )][DBLP]


  112. List Decoding of Binary Codes-A Brief Survey of Some Recent Results. [Citation Graph (, )][DBLP]


  113. Algorithms for Modular Counting of Roots of Multivariate Polynomials. [Citation Graph (, )][DBLP]


  114. Error correction up to the information-theoretic limit. [Citation Graph (, )][DBLP]


  115. Hardness Amplification via Space-Efficient Direct Products. [Citation Graph (, )][DBLP]


  116. Explicit Codes Achieving List Decoding Capacity: Error-correction with Optimal Redundancy [Citation Graph (, )][DBLP]


  117. List Decoding Tensor Products and Interleaved Codes [Citation Graph (, )][DBLP]


  118. Artin automorphisms, Cyclotomic function fields, and Folded list-decodable codes [Citation Graph (, )][DBLP]


  119. Improved Inapproximability Results for Maximum k-Colorable Subgraph [Citation Graph (, )][DBLP]


  120. Explicit Capacity-achieving Codes for Worst-Case Additive Errors [Citation Graph (, )][DBLP]


  121. On the List-Decodability of Random Linear Codes [Citation Graph (, )][DBLP]


  122. Codes for Computationally Simple Channels: Explicit Constructions with Optimal Rate [Citation Graph (, )][DBLP]


  123. Soft decoding, dual BCH codes, and better list-decodable eps-biased codes. [Citation Graph (, )][DBLP]


  124. Concatenated codes can achieve list-decoding capacity. [Citation Graph (, )][DBLP]


  125. List Decoding Tensor Products and Interleaved Codes. [Citation Graph (, )][DBLP]


  126. Constraint Satisfaction over a Non-Boolean Domain: Approximation algorithms and Unique-Games hardness. [Citation Graph (, )][DBLP]


  127. Almost Euclidean subspaces of $\ell_1^N$ via expander codes. [Citation Graph (, )][DBLP]


  128. Deterministic Hardness Amplification via Local GMD Decoding. [Citation Graph (, )][DBLP]


  129. Better Binary List-Decodable Codes via Multilevel Concatenation. [Citation Graph (, )][DBLP]


  130. Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs. [Citation Graph (, )][DBLP]


  131. Hardness of Learning Halfspaces with Noise. [Citation Graph (, )][DBLP]


  132. Hardness of Low Congestion Routing in Directed Graphs. [Citation Graph (, )][DBLP]


  133. Iterative Decoding of Low-Density Parity Check Codes (A Survey). [Citation Graph (, )][DBLP]


  134. Extractors and condensers from univariate polynomials. [Citation Graph (, )][DBLP]


Search in 0.008secs, Finished in 0.012secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002