The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Madhu Sudan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Madhu Sudan
    Ideal Error-Correcting Codes: Unifying Algebraic and Number-Theoretic Algorithms. [Citation Graph (0, 0)][DBLP]
    AAECC, 2001, pp:36-45 [Conf]
  2. Eli Ben-Sasson, Madhu Sudan
    Robust Locally Testable Codes and Products of Codes. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:286-297 [Conf]
  3. Irit Dinur, Madhu Sudan, Avi Wigderson
    Robust Local Testability of Tensor Products of LDPC Codes. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:304-315 [Conf]
  4. Elena Grigorescu, Swastik Kopparty, Madhu Sudan
    Local Decoding and Testing for Homomorphisms. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:375-385 [Conf]
  5. Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan
    Short PCPs Verifiable in Polylogarithmic Time. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2005, pp:120-134 [Conf]
  6. Oded Goldreich, Madhu Sudan
    Computational Indistinguishability: A Sample Hierarchy. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1998, pp:24-33 [Conf]
  7. 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]
  8. Sanjeev Khanna, Madhu Sudan, Luca Trevisan
    Constraint Satisfaction: The Approximability of Minimization Problems. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:282-296 [Conf]
  9. Madhu Sudan, Luca Trevisan, Salil P. Vadhan
    Pseudorandom Generators without the XOR Lemma (Abstract). [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:4- [Conf]
  10. Benny Chor, Madhu Sudan
    A Geometric Approach to Betweenness. [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:227-237 [Conf]
  11. Venkatesan Guruswami, Madhu Sudan
    On Representations of Algebraic-Geometric Codes for List Decoding. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:244-255 [Conf]
  12. Andres Albanese, Johannes Blömer, Jeff Edmonds, Michael Luby, Madhu Sudan
    Priority Encoding Transmission [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:604-612 [Conf]
  13. Sigal Ar, Richard J. Lipton, Ronitt Rubinfeld, Madhu Sudan
    Reconstructing Algebraic Functions from Mixed Data [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:503-512 [Conf]
  14. Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy
    Proof Verification and Hardness of Approximation Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:14-23 [Conf]
  15. Mihir Bellare, Don Coppersmith, Johan Håstad, Marcos A. Kiwi, Madhu Sudan
    Linearity Testing in Characteristic Two. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:432-441 [Conf]
  16. Mihir Bellare, Oded Goldreich, Madhu Sudan
    Free Bits, PCPs and Non-Approximability - Towards Tight Results. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:422-431 [Conf]
  17. Benny Chor, Oded Goldreich, Eyal Kushilevitz, Madhu Sudan
    Private Information Retrieval. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:41-50 [Conf]
  18. Ilya Dumer, Daniele Micciancio, Madhu Sudan
    Hardness of Approximating the Minimum Distance of a Linear Code. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:475-485 [Conf]
  19. Oded Goldreich, Ronitt Rubinfeld, Madhu Sudan
    Learning Polynomials with Queries: The Highly Noisy Case. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:294-303 [Conf]
  20. Oded Goldreich, Madhu Sudan
    Locally Testable Codes and PCPs of Almost-Linear Length. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:13-22 [Conf]
  21. 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]
  22. Venkatesan Guruswami, Johan Håstad, Madhu Sudan
    Hardness of Approximate Hypergraph Coloring. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:149-158 [Conf]
  23. Venkatesan Guruswami, Madhu Sudan
    Improved Decoding of Reed-Solomon and Algebraic-Geometric Codes. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:28-39 [Conf]
  24. Venkatesan Guruswami, Amit Sahai, Madhu Sudan
    "Soft-decision" Decoding of Chinese Remainder Codes. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:159-168 [Conf]
  25. David R. Karger, Rajeev Motwani, Madhu Sudan
    Approximate Graph Coloring by Semidefinite Programming [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:2-13 [Conf]
  26. Sanjeev Khanna, Rajeev Motwani, Madhu Sudan, Umesh V. Vazirani
    On Syntactic versus Computational Views of Approximability [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:819-830 [Conf]
  27. Christos H. Papadimitriou, Prabhakar Raghavan, Madhu Sudan, Hisao Tamaki
    Motion Planning on a Graph (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:511-520 [Conf]
  28. Madhu Sudan
    Coding Theory: Tutorial and Survey. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:36-53 [Conf]
  29. Madhu Sudan
    Maximum Likelihood Decoding of Reed Solomon Codes. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:164-172 [Conf]
  30. Madhu Sudan, Luca Trevisan
    Probabilistically Checkable Proofs with Low Amortized Query Complexity. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:18-27 [Conf]
  31. Luca Trevisan, Gregory B. Sorkin, Madhu Sudan, David P. Williamson
    Gadgets, Approximation, and Linear Programming (extended abstract). [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:617-626 [Conf]
  32. Madhu Sudan
    Algorithmic Issues in Coding Theory. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1997, pp:184-199 [Conf]
  33. Nachum Shacham, Madhu Sudan, Michael Brown
    Conducting a Multiparty Multimedia Session over ATM using Hierarchically Encoded Data. [Citation Graph (0, 0)][DBLP]
    ICC (2), 1997, pp:811-815 [Conf]
  34. Madhu Sudan
    List Decoding: Algorithms and Applications. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2000, pp:25-41 [Conf]
  35. Madhu Sudan, Nachum Shacham
    Gateway Based Approach for Conducting Multiparty Multimedia Sessions over Heterogeneous Signaling Domains. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1997, pp:701-710 [Conf]
  36. Guy Even, Joseph Naor, Baruch Schieber, Madhu Sudan
    Approximating Minimum Feedback Sets and Multi-Cuts in Directed Graphs. [Citation Graph (0, 0)][DBLP]
    IPCO, 1995, pp:14-28 [Conf]
  37. Katalin Friedl, Madhu Sudan
    Some Improvements to Total Degree Tests. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1995, pp:190-198 [Conf]
  38. Madhu Sudan
    Modelling Errors and Recovery for Communication. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:25-25 [Conf]
  39. Rajendra Yavatkar, James Griffoen, Madhu Sudan
    A Reliable Dissemination Protocol for Interactive Collaborative Applications. [Citation Graph (0, 0)][DBLP]
    ACM Multimedia, 1995, pp:333-344 [Conf]
  40. Yonatan Aumann, Johan Håstad, Michael O. Rabin, Madhu Sudan
    Linear Consistency Testing. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 1999, pp:109-120 [Conf]
  41. Eli Ben-Sasson, Oded Goldreich, Madhu Sudan
    Bounds on 2-Query Codeword Testing. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2003, pp:216-227 [Conf]
  42. 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]
  43. Alok Aggarwal, Amotz Bar-Noy, Don Coppersmith, Rajiv Ramaswami, Baruch Schieber, Madhu Sudan
    Efficient Routing and Scheduling Algorithms for Optical Networks. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:412-423 [Conf]
  44. Amotz Bar-Noy, Alain J. Mayer, Baruch Schieber, Madhu Sudan
    Guaranteeing Fair Service to Persistent Dependent Tasks. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:243-252 [Conf]
  45. Lars Engebretsen, Madhu Sudan
    Harmonic broadcasting is optimal. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:431-432 [Conf]
  46. Ronitt Rubinfeld, Madhu Sudan
    Self-Testing Polynomial Functions Efficiently and Over Rational Domains. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:23-32 [Conf]
  47. Prahladh Harsha, Madhu Sudan
    Small PCPs with Low Query Complexity. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:327-338 [Conf]
  48. Gagan Aggarwal, Amos Fiat, Andrew V. Goldberg, Jason D. Hartline, Nicole Immorlica, Madhu Sudan
    Derandomization of auctions. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:619-625 [Conf]
  49. Sanjeev Arora, Madhu Sudan
    Improved Low-Degree Testing and its Applications. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:485-495 [Conf]
  50. Mihir Bellare, Madhu Sudan
    Improved non-approximability results. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:184-193 [Conf]
  51. Avrim Blum, Prasad Chalasani, Don Coppersmith, William R. Pulleyblank, Prabhakar Raghavan, Madhu Sudan
    The minimum latency problem. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:163-171 [Conf]
  52. Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan
    Robust pcps of proximity, shorter pcps and applications to coding. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:1-10 [Conf]
  53. Eli Ben-Sasson, Madhu Sudan
    Simple PCPs with poly-log rate and query complexity. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:266-275 [Conf]
  54. Eli Ben-Sasson, Madhu Sudan, Salil P. Vadhan, Avi Wigderson
    Randomness-efficient low degree tests and short PCPs via epsilon-biased sets. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:612-621 [Conf]
  55. Marshall W. Bern, Daniel H. Greene, Arvind Raghunathan, Madhu Sudan
    Online Algorithms for Locating Checkpoints [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:359-368 [Conf]
  56. Allan Borodin, Jon M. Kleinberg, Prabhakar Raghavan, Madhu Sudan, David P. Williamson
    Adversarial Queueing Theory. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:376-385 [Conf]
  57. Don Coppersmith, Madhu Sudan
    Reconstructing curves in three (and higher) dimensional space from noisy data. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:136-142 [Conf]
  58. Ronald Fagin, Anna R. Karlin, Jon M. Kleinberg, Prabhakar Raghavan, Sridhar Rajagopalan, Ronitt Rubinfeld, Madhu Sudan, Andrew Tomkins
    Random walks with ``back buttons'' (extended abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:484-493 [Conf]
  59. Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld, Madhu Sudan, Avi Wigderson
    Self-Testing/Correcting for Polynomials and for Approximate Functions [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:32-42 [Conf]
  60. Oded Goldreich, Dana Ron, Madhu Sudan
    Chinese Remaindering with Errors. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:225-234 [Conf]
  61. Venkatesan Guruswami, Madhu Sudan
    List decoding algorithms for certain concatenated codes. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:181-190 [Conf]
  62. Sanjeev Khanna, Madhu Sudan, David P. Williamson
    A Complete Classification of the Approximability of Maximization Problems Derived from Boolean Constraint Satisfaction. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:11-20 [Conf]
  63. Madhu Sudan, Luca Trevisan, Salil P. Vadhan
    Pseudorandom Generators Without the XOR Lemma (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:537-546 [Conf]
  64. Silvio Micali, Chris Peikert, Madhu Sudan, David A. Wilson
    Optimal Error Correction Against Computationally Bounded Noise. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:1-16 [Conf]
  65. Shafi Goldwasser, Madhu Sudan, Vinod Vaikuntanathan
    Distributed Computing with Imperfect Randomness. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:288-302 [Conf]
  66. Marshall W. Bern, Daniel H. Greene, Arvind Raghunathan, Madhu Sudan
    On-Line Algorithms for Locating Checkpoints. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:11, n:1, pp:33-52 [Journal]
  67. Guy Even, Joseph Naor, Baruch Schieber, Madhu Sudan
    Approximating Minimum Feedback Sets and Multicuts in Directed Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:20, n:2, pp:151-174 [Journal]
  68. Prahladh Harsha, Madhu Sudan
    Small PCPs with low query complexity. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2000, v:9, n:3-4, pp:157-201 [Journal]
  69. Sanjeev Arora, Madhu Sudan
    Improved Low-Degree Testing and its Applications. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2003, v:23, n:3, pp:365-426 [Journal]
  70. David R. Karger, Rajeev Motwani, Madhu Sudan
    Approximate Graph Coloring by Semidefinite Programming [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  71. Eli Ben-Sasson, Madhu Sudan
    Robust Locally Testable Codes and Products of Codes [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  72. Rajeev Motwani, Madhu Sudan
    Computing Roots of Graphs Is Hard. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:54, n:1, pp:81-88 [Journal]
  73. Ari Juels, Madhu Sudan
    A Fuzzy Vault Scheme. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2006, v:38, n:2, pp:237-257 [Journal]
  74. Prahladh Harsha, Madhu Sudan
    Small PCPs with low query complexity [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:61, pp:- [Journal]
  75. 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]
  76. Oded Goldreich, Madhu Sudan
    Locally Testable Codes and PCPs of Almost-Linear Length [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:050, pp:- [Journal]
  77. Eli Ben-Sasson, Oded Goldreich, Madhu Sudan
    Bounds on 2-Query Codeword Testing. [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:019, pp:- [Journal]
  78. Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan
    Robust PCPs of Proximity, Shorter PCPs and Applications to Coding [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:021, pp:- [Journal]
  79. Eli Ben-Sasson, Madhu Sudan
    Robust Locally Testable Codes and Products of Codes [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:046, pp:- [Journal]
  80. Eli Ben-Sasson, Madhu Sudan
    Simple PCPs with Poly-log Rate and Query Complexity [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:060, pp:- [Journal]
  81. Oded Goldreich, Madhu Sudan, Luca Trevisan
    From logarithmic advice to single-bit advice [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:093, pp:- [Journal]
  82. Sanjeev Khanna, Rajeev Motwani, Madhu Sudan, Umesh V. Vazirani
    On Syntactic versus Computational Views of Approximability [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:23, pp:- [Journal]
  83. Mihir Bellare, Oded Goldreich, Madhu Sudan
    Free Bits, PCP and Non-Approximability - Towards Tight Results [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:24, pp:- [Journal]
  84. Sanjeev Arora, Madhu Sudan
    Improved low-degree testing and its applications [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:3, pp:- [Journal]
  85. Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy
    Proof verification and the hardness of approximation problems. [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:8, pp:- [Journal]
  86. 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]
  87. Madhu Sudan, Luca Trevisan
    Probabilistically checkable proofs with low amortized query complexity [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:40, pp:- [Journal]
  88. 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]
  89. Oded Goldreich, Ronitt Rubinfeld, Madhu Sudan
    Learning Polynomials with Queries - The Highly Noisy Case. [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:60, pp:- [Journal]
  90. Oded Goldreich, Dana Ron, Madhu Sudan
    Chinese Remaindering with Errors [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:62, pp:- [Journal]
  91. Madhu Sudan, Luca Trevisan, Salil P. Vadhan
    Pseudorandom generators without the XOR Lemma [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:74, pp:- [Journal]
  92. Yonatan Aumann, Johan Håstad, Michael O. Rabin, Madhu Sudan
    Linear Consistency Testing [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:25, pp:- [Journal]
  93. Ilya Dumer, Daniele Micciancio, Madhu Sudan
    Hardness of Approximating the Minimum Distance of a Linear Code [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:29, pp:- [Journal]
  94. Peter Gemmell, Madhu Sudan
    Highly Resilient Correctors for Polynomials. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:43, n:4, pp:169-174 [Journal]
  95. Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy
    Proof Verification and the Hardness of Approximation Problems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1998, v:45, n:3, pp:501-555 [Journal]
  96. Alok Aggarwal, Amotz Bar-Noy, Don Coppersmith, Rajiv Ramaswami, Baruch Schieber, Madhu Sudan
    Efficient Routing in Optical Networks. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1996, v:43, n:6, pp:973-1001 [Journal]
  97. Allan Borodin, Jon M. Kleinberg, Prabhakar Raghavan, Madhu Sudan, David P. Williamson
    Adversarial queuing theory. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2001, v:48, n:1, pp:13-38 [Journal]
  98. Benny Chor, Eyal Kushilevitz, Oded Goldreich, Madhu Sudan
    Private Information Retrieval. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1998, v:45, n:6, pp:965-981 [Journal]
  99. David R. Karger, Rajeev Motwani, Madhu Sudan
    Approximate Graph Coloring by Semidefinite Programming. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1998, v:45, n:2, pp:246-265 [Journal]
  100. Oded Goldreich, Madhu Sudan
    Locally testable codes and PCPs of almost-linear length. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2006, v:53, n:4, pp:558-655 [Journal]
  101. Madhu Sudan
    Decoding of Reed Solomon Codes beyond the Error-Correction Bound. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1997, v:13, n:1, pp:180-193 [Journal]
  102. Yonatan Aumann, Johan Håstad, Michael O. Rabin, Madhu Sudan
    Linear-Consistency Testing. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:62, n:4, pp:589-607 [Journal]
  103. Oded Goldreich, Madhu Sudan
    Computational Indistinguishability: A Sample Hierarchy. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:59, n:2, pp:253-269 [Journal]
  104. Madhu Sudan
    Foreword. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:65, n:4, pp:611- [Journal]
  105. Madhu Sudan, Luca Trevisan, Salil P. Vadhan
    Pseudorandom Generators without the XOR Lemma. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:62, n:2, pp:236-266 [Journal]
  106. Lars Engebretsen, Madhu Sudan
    Harmonic broadcasting is bandwidth-optimal assuming constant bit rate. [Citation Graph (0, 0)][DBLP]
    Networks, 2006, v:47, n:3, pp:172-177 [Journal]
  107. Eli Ben-Sasson, Madhu Sudan
    Robust locally testable codes and products of codes. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2006, v:28, n:4, pp:387-402 [Journal]
  108. Sigal Ar, Richard J. Lipton, Ronitt Rubinfeld, Madhu Sudan
    Reconstructing Algebraic Functions from Mixed Data. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:2, pp:487-510 [Journal]
  109. Amotz Bar-Noy, Alain J. Mayer, Baruch Schieber, Madhu Sudan
    Guaranteeing Fair Service to Persistent Dependent Tasks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:4, pp:1168-1189 [Journal]
  110. Mihir Bellare, Oded Goldreich, Madhu Sudan
    Free Bits, PCPs, and Nonapproximability-Towards Tight Results. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:3, pp:804-915 [Journal]
  111. 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]
  112. Sanjeev Khanna, Rajeev Motwani, Madhu Sudan, Umesh V. Vazirani
    On Syntactic versus Computational Views of Approximability. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:1, pp:164-191 [Journal]
  113. Sanjeev Khanna, Madhu Sudan, Luca Trevisan, David P. Williamson
    The Approximability of Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:6, pp:1863-1920 [Journal]
  114. Ronitt Rubinfeld, Madhu Sudan
    Robust Characterizations of Polynomials with Applications to Program Testing. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:2, pp:252-271 [Journal]
  115. Luca Trevisan, Gregory B. Sorkin, Madhu Sudan, David P. Williamson
    Gadgets, Approximation, and Linear Programming. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:6, pp:2074-2097 [Journal]
  116. Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan
    Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:4, pp:889-974 [Journal]
  117. Oded Goldreich, Madhu Sudan
    Special Issue on Randomness and Complexity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:4, pp:- [Journal]
  118. Benny Chor, Madhu Sudan
    A Geometric Approach to Betweenness. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1998, v:11, n:4, pp:511-523 [Journal]
  119. Oded Goldreich, Ronitt Rubinfeld, Madhu Sudan
    Learning Polynomials with Queries: The Highly Noisy Case. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2000, v:13, n:4, pp:535-570 [Journal]
  120. Andres Albanese, Johannes Blömer, Jeff Edmonds, Michael Luby, Madhu Sudan
    Priority encoding transmission. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1737-1744 [Journal]
  121. Mihir Bellare, Don Coppersmith, Johan Håstad, Marcos A. Kiwi, Madhu Sudan
    Linearity testing in characteristic two. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1781-1795 [Journal]
  122. Ilya Dumer, Daniele Micciancio, Madhu Sudan
    Hardness of approximating the minimum distance of a linear code. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:1, pp:22-37 [Journal]
  123. Oded Goldreich, Dana Ron, Madhu Sudan
    Chinese remaindering with errors. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:4, pp:1330-1338 [Journal]
  124. 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]
  125. 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]
  126. 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]
  127. Ran Canetti, Ronald L. Rivest, Madhu Sudan, Luca Trevisan, Salil P. Vadhan, Hoeteck Wee
    Amplifying Collision Resistance: A Complexity-Theoretic Treatment. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:264-283 [Conf]

  128. Succinct Representation of Codes with Applications to Testing. [Citation Graph (, )][DBLP]


  129. 2-Transitivity Is Insufficient for Local Testability. [Citation Graph (, )][DBLP]


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


  131. Sparse Random Linear Codes are Locally Decodable and Testable. [Citation Graph (, )][DBLP]


  132. Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers. [Citation Graph (, )][DBLP]


  133. Algebraic algorithms and coding theory. [Citation Graph (, )][DBLP]


  134. Testing Linear-Invariant Non-Linear Properties. [Citation Graph (, )][DBLP]


  135. Universal semantic communication I. [Citation Graph (, )][DBLP]


  136. Decodability of group homomorphisms beyond the johnson bound. [Citation Graph (, )][DBLP]


  137. Algebraic property testing: the role of invariance. [Citation Graph (, )][DBLP]


  138. Probabilistically checkable proofs. [Citation Graph (, )][DBLP]


  139. Succinct Representation of Codes with Applications to Testing [Citation Graph (, )][DBLP]


  140. Optimal Testing of Reed-Muller Codes [Citation Graph (, )][DBLP]


  141. Universal Semantic Communication II: A Theory of Goal-Oriented Communication. [Citation Graph (, )][DBLP]


  142. Testing Linear-Invariant Non-Linear Properties. [Citation Graph (, )][DBLP]


  143. Decodability of Group Homomorphisms beyond the Johnson Bound. [Citation Graph (, )][DBLP]


  144. 2-Transitivity is Insufficient for Local Testability. [Citation Graph (, )][DBLP]


  145. Sparse Random Linear Codes are Locally Decodable and Testable. [Citation Graph (, )][DBLP]


  146. Algebraic Property Testing: The Role of Invariance. [Citation Graph (, )][DBLP]


  147. Universal Semantic Communication I. [Citation Graph (, )][DBLP]


  148. Robust Local Testability of Tensor Products of LDPC Codes. [Citation Graph (, )][DBLP]


Search in 0.001secs, Finished in 0.005secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002