dblp.uni-trier.dewww.uni-trier.de

Madhu Sudan

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

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

Coauthor Index

1Alok Aggarwal [11] [29]
2Gagan Aggarwal [119]
3Andres Albanese [13] [31]
4Noga Alon [102] [136]
5Sigal Ar [5] [47]
6Sanjeev Arora [6] [39] [40] [52] [54] [107]
7Yonatan Aumann [71] [74] [90]
8Amotz Bar-Noy [11] [18] [29] [49]
9Mihir Bellare [9] [16] [21] [22] [30] [50]
10Eli Ben-Sasson [106] [108] [110] [112] [113] [114] [115] [116] [117] [120] [121] [124] [125] [139]
11Marshall W. Bern [1] [8]
12Arnab Bhattacharyya [141] [150]
13Johannes Blömer [13] [31]
14Avrim Blum [10]
15Allan Borodin [35] [92]
16Michael Brown [44]
17Ran Canetti [138]
18Prasad Chalasani [10]
19Victor Chen [141] [150]
20Benny Chor [23] [25] [46] [51]
21Don Coppersmith [10] [11] [21] [29] [30] [109]
22Irit Dinur [128] [132] [143] [145]
23Ilya Dumer [70] [76] [105]
24Jeff Edmonds [13] [31]
25Lars Engebretsen [101] [126]
26Guy Even [20] [63]
27Ronald Fagin [84]
28Amos Fiat [119]
29Katalin Friedl [19]
30Peter Gemmell [2] [3]
31Andrew V. Goldberg [119]
32Oded Goldreich [16] [22] [23] [24] [50] [51] [56] [57] [61] [64] [68] [73] [77] [80] [100] [104] [106] [110] [111] [114] [116] [121] [123] [124] [127]
33Shafi Goldwasser [122]
34Daniel H. Greene [1] [8]
35Jim Griffioen [26]
36Elena Grigorescu [131] [142] [143] [145] [148]
37Venkatesan Guruswami [58] [60] [65] [66] [69] [81] [85] [87] [88] [89] [93] [97] [99] [102] [103] [136]
38Prahladh Harsha [82] [83] [94] [114] [116] [121] [124]
39Jason D. Hartline [119]
40Johan Håstad [21] [30] [71] [74] [81] [88] [90] [97] [99]
41Nicole Immorlica [119]
42Brendan Juba [134] [140] [146]
43Ari Juels [129]
44David R. Karger [15] [53] [62]
45Anna R. Karlin [84]
46Tali Kaufman [102] [133] [135] [136] [137] [142] [144] [148]
47Sanjeev Khanna [12] [17] [32] [33] [34] [41] [43] [48] [78]
48Marcos A. Kiwi [21] [30]
49Jon M. Kleinberg [35] [84] [92]
50Swastik Kopparty [131] [143] [145]
51Eyal Kushilevitz [23] [51]
52Daniel Lewin [60] [65]
53Richard J. Lipton [2] [5] [47]
54Michael Luby [13] [31]
55Carsten Lund [6] [52] [54]
56Alain J. Mayer [18] [49]
57Silvio Micali [118]
58Daniele Micciancio [70] [76] [105]
59Rajeev Motwani [6] [7] [12] [15] [17] [48] [52] [53] [54] [62]
60Joseph Naor (Seffi Naor) [20] [63]
61Christos H. Papadimitriou [14]
62Chris Peikert [118]
63William R. Pulleyblank [10]
64Michael O. Rabin [71] [74] [90]
65Prabhakar Raghavan [10] [14] [35] [84] [92]
66Arvind Raghunathan [1] [8]
67Sridhar Rajagopalan [84]
68Rajiv Ramaswami [11] [29]
69Ronald L. Rivest [138]
70Dana Ron [56] [73] [80]
71Ronitt Rubinfeld [2] [4] [5] [24] [28] [47] [57] [77] [84]
72Amit Sahai [87]
73Baruch Schieber [11] [18] [20] [29] [49] [63]
74Nachum Shacham [42] [44]
75Gregory B. Sorkin [36] [79]
76Mario Szegedy [6] [52] [54]
77Hisao Tamaki [14]
78Andrew Tomkins [84]
79Luca Trevisan [32] [36] [43] [55] [59] [60] [65] [67] [72] [75] [78] [79] [91] [111] [138]
80Salil P. Vadhan [55] [72] [75] [91] [108] [114] [116] [121] [124] [138]
81Vinod Vaikuntanathan (V. Vinod) [122]
82Umesh V. Vazirani [12] [17] [48]
83Hoeteck Wee [138]
84Avi Wigderson [2] [108] [128] [132]
85David P. Williamson [33] [35] [36] [41] [78] [79] [92]
86David A. Wilson [118]
87Ning Xie [141] [150]
88Rajendra Yavatkar [26]
89David Zuckerman [99]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)