Author image not provided
 Madhu Sudan

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article31.80
Citation Count3,912
Publication count123
Publication years1991-2017
Available for download47
Average downloads per article574.83
Downloads (cumulative)27,017
Downloads (12 Months)964
Downloads (6 Weeks)81
ACM Fellow
SEARCH
ROLE
Arrow RightAuthor only
· Advisor only
· All roles


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


123 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 123
Result page: 1 2 3 4 5 6 7

Sort by:

1
January 2017 SODA '17: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 2,   Downloads (12 Months): 22,   Downloads (Overall): 22

Full text available: PDFPDF
We consider the problem of estimating the value of MAX-CUT in a graph in the streaming model of computation. We show that there exists a constant ϵ * > 0 such that any randomized streaming algorithm that computes a (1 + ϵ * )-approximation to MAX-CUT requires Ω( n ) ...

2
November 2016 Algorithmica: Volume 76 Issue 3, November 2016
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

Communication in "natural" settings, e.g., between humans, is distinctly different from that in classical designed settings, in that the former is invariably characterized by the sender and receiver not being in perfect agreement with each other. Solutions to classical communication problems thus have to overcome an extra layer of uncertainty ...
Keywords: Source coding, Communication complexity, Graph coloring

3 published by ACM
January 2015 ITCS '15: Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 0,   Downloads (12 Months): 11,   Downloads (Overall): 37

Full text available: PDFPDF
The communication complexity of many fundamental problems reduces greatly when the communicating parties share randomness that is independent of the inputs to the communication task. Natural communication processes (say between humans) however often involve large amounts of shared correlations among the communicating players, but rarely allow for perfect sharing of ...
Keywords: communication complexity, invariance principle, randomness

4
January 2015 SODA '15: Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 0,   Downloads (12 Months): 5,   Downloads (Overall): 25

Full text available: PDFPDF
Locally testable codes (LTCs) of constant minimum (absolute) distance that allow the tester to make a nearly linear number of queries have become the focus of attention recently, due to their connections to central questions in approximability theory. In particular, the binary Reed-Muller code of block length N and absolute ...

5
January 2015 SODA '15: Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 1,   Downloads (12 Months): 12,   Downloads (Overall): 55

Full text available: PDFPDF
We consider the problem of estimating the value of max cut in a graph in the streaming model of computation. At one extreme, there is a trivial 2-approximation for this problem that uses only O (log n ) space, namely, count the number of edges and output half of this ...

6 published by ACM
May 2014 STOC '14: Proceedings of the forty-sixth annual ACM symposium on Theory of computing
Publisher: ACM
Bibliometrics:
Citation Count: 11
Downloads (6 Weeks): 5,   Downloads (12 Months): 24,   Downloads (Overall): 113

Full text available: PDFPDF
We consider the task of interactive communication in the presence of adversarial errors and present tight bounds on the tolerable error-rates in a number of different settings. Most significantly, we explore adaptive interactive communication where the communicating parties decide who should speak next based on the history of the interaction. ...
Keywords: error rate, adaptivity, adversarial errors, coding for interactive communication

7 published by ACM
January 2014 ITCS '14: Proceedings of the 5th conference on Innovations in theoretical computer science
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 0,   Downloads (12 Months): 5,   Downloads (Overall): 50

Full text available: PDFPDF
Communication in "natural" settings, e.g., between humans, is distinctly different than that in classical designed settings, in that the former is characterized by the sender and receiver not being in perfect agreement with each other. Solutions to classical communication problems thus have to overcome an extra layer of uncertainty introduced ...
Keywords: communication complexity, source coding, graph coloring

8 published by ACM
January 2014 ITCS '14: Proceedings of the 5th conference on Innovations in theoretical computer science
Publisher: ACM
Bibliometrics:
Citation Count: 7
Downloads (6 Weeks): 1,   Downloads (12 Months): 19,   Downloads (Overall): 120

Full text available: PDFPDF
Local algorithms on graphs are algorithms that run in parallel on the nodes of a graph to compute some global structural feature of the graph. Such algorithms use only local information available at nodes to determine local aspects of the global structure, while also potentially using some randomness. Research over ...
Keywords: lower bounds, local algorithms, random graphs

9 published by ACM
January 2014 ACM SIGMETRICS Performance Evaluation Review: Volume 41 Issue 3, December 2013
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 1,   Downloads (12 Months): 14,   Downloads (Overall): 78

Full text available: PDFPDF
We study an admissions control problem, where a queue with service rate 1 - p receives incoming jobs at rate λ ε (1? p , 1), and the decision maker is allowed to redirect away jobs up to a rate of p , with the objective of minimizing the time-average ...

10
January 2014 SODA '14: Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 8
Downloads (6 Weeks): 2,   Downloads (12 Months): 21,   Downloads (Overall): 54

Full text available: PDFPDF
We present a streaming algorithm that makes one pass over the edges of an unweighted graph presented in random order, and produces a polylogarithmic approximation to the size of the maximum matching in the graph, while using only polylogarithmic space. Prior to this work the only approximations known were a ...

11
March 2013 Computational Complexity: Volume 22 Issue 1, March 2013
Publisher: Birkhauser Verlag
Bibliometrics:
Citation Count: 1

A basic goal in property testing is to identify a minimal set of features that make a property testable. For the case when the property to be tested is membership in a binary linear error-correcting code, Alon et al . (Trans Inf Theory, 51(11):4032---4039, 2005) had conjectured that the presence ...
Keywords: 2-transitivity, 68Q01, locally testable codes, Affine invariance

12 published by ACM
January 2013 ITCS '13: Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Publisher: ACM
Bibliometrics:
Citation Count: 11
Downloads (6 Weeks): 0,   Downloads (12 Months): 12,   Downloads (Overall): 75

Full text available: PDFPDF
In this work we explore error-correcting codes derived from the "lifting" of "affine-invariant" codes. Affine-invariant codes are simply linear codes whose coordinates are a vector space over a field and which are invariant under affine-transformations of the coordinate space. Lifting takes codes defined over a vector space of small dimension ...
Keywords: locally correctible codes, affine-invariance, locally testable codes, nikodym sets, property testing, lifting

13 published by ACM
May 2012 Journal of the ACM (JACM): Volume 59 Issue 2, April 2012
Publisher: ACM
Bibliometrics:
Citation Count: 5
Downloads (6 Weeks): 3,   Downloads (12 Months): 67,   Downloads (Overall): 1,111

Full text available: PDFPDF
We put forward a general theory of goal-oriented communication , where communication is not an end in itself, but rather a means to achieving some goals of the communicating parties. Focusing on goals provides a framework for addressing the problem of potential “misunderstanding” during communication, where the misunderstanding arises from ...
Keywords: Semantic communication, interoperability

14
November 2011 Journal of Algebraic Combinatorics: An International Journal: Volume 34 Issue 3, November 2011
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 0

For a finite vector space V and a nonnegative integer r �dim� V , we estimate the smallest possible size of a subset of V , containing a translate of every r -dimensional subspace. In particular, we show that if K � V is the smallest subset with this property, ...
Keywords: Kakeya problem, Polynomial method, Kakeya set, Finite field

15
August 2011 APPROX'11/RANDOM'11: Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 4

Despite its many applications, to program checking, probabilistically checkable proofs, locally testable and locally decodable codes, and cryptography, "algebraic property testing" is not well-understood. A significant obstacle to a better understanding, was a lack of a concrete definition that abstracted known testable algebraic properties and reflected their testability. This obstacle ...
Keywords: error-correcting codes, direct sums, property testing, symmetries

16
August 2011 APPROX'11/RANDOM'11: Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

Affine-invariant properties are an abstract class of properties that generalize some central algebraic ones, such as linearity and low-degree-ness, that have been studied extensively in the context of property testing. Affine invariant properties consider functions mapping a big field F q n to the subfield F q and include all ...
Keywords: direct sums, property testing, symmetries, error-correcting codes

17
June 2011 CCC '11: Proceedings of the 2011 IEEE 26th Annual Conference on Computational Complexity
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 4

Locally testable codes, i.e., codes where membership in the code is testable with a constant number of queries, have played a central role in complexity theory. It is well known that a code must be a ``low-density parity check'' (LDPC) code for it to be locally testable, but few LDPC ...
Keywords: Property testing, Invariance, Error-correcting codes

18 published by ACM
June 2011 PODC '11: Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 3,   Downloads (12 Months): 26,   Downloads (Overall): 141

Full text available: PDFPDF
We put forward a general theory of goal-oriented communication , where communication is not an end in itself, but rather a means to achieving some goals of the communicating parties. Focusing on goals provides a framework for addressing the problem of potential "misunderstanding" during communication, where the misunderstanding arises from ...
Keywords: semantic communication

19 published by ACM
April 2011 Communications of the ACM: Volume 54 Issue 4, April 2011
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0,   Downloads (12 Months): 6,   Downloads (Overall): 737

Full text available: HtmlHtml  PDFPDF

20 published by ACM
March 2011 ACM SIGACT News: Volume 42 Issue 1, March 2011
Publisher: ACM
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 0,   Downloads (12 Months): 6,   Downloads (Overall): 113

Full text available: PDFPDF
The last two decades have seen enormous progress in the development of sublinear-time algorithms -- i.e., algorithms that examine/reveal properties of "data" in less time than it would take to read all of the data. A large, and important, subclass of such properties turn out to be "linear". In particular, ...
Keywords: tensor products, property testing, symmetries, error-correcting codes



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us