
Information Spread with Error Correction
We study the process of information dispersal in a network with communic...
read it

Linear Space Streaming Lower Bounds for Approximating CSPs
We consider the approximability of constraint satisfaction problems in t...
read it

Streaming approximation resistance of every ordering CSP
An ordering constraint satisfaction problem (OCSP) is given by a positiv...
read it

Approximability of all finite CSPs in the dynamic streaming setting
A constraint satisfaction problem (CSP), MaxCSP( F), is specified by a ...
read it

Idealtheoretic Explanation of Capacityachieving Decoding
In this work, we present an abstract framework for some algebraic error...
read it

Approximability of all Boolean CSPs in the dynamic streaming setting
A Boolean constraint satisfaction problem (CSP), MaxCSP(f), is a maximi...
read it

Pointhyperplane incidence geometry and the logrank conjecture
We study the logrank conjecture from the perspective of incidence geome...
read it

Decoding Multivariate Multiplicity Codes on Product Sets
The multiplicity SchwartzZippel lemma bounds the total multiplicity of ...
read it

Limitations of MeanBased Algorithms for Trace Reconstruction at Small Distance
Trace reconstruction considers the task of recovering an unknown string ...
read it

A Selfcontained Analysis of the LempelZiv Compression Algorithm
This article gives a selfcontained analysis of the performance of the L...
read it

Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time
We present the first algorithm for maintaining a maximal independent set...
read it

Round Complexity of Common Randomness Generation: The Amortized Setting
We study the effect of rounds of interaction on the common randomness ge...
read it

Communication for Generating Correlation: A Survey
The task of manipulating correlated random variables in a distributed se...
read it

Polar Codes with exponentially small error at finite block length
We show that the entire class of polar codes (up to a natural necessary ...
read it

Algorithmic Polarization for Hidden Markov Models
Using a mild variant of polar codes we design linear compression schemes...
read it

CommunicationRounds Tradeoffs for Common Randomness and Secret Key Generation
We study the role of interaction in the Common Randomness Generation (CR...
read it

Synchronization Strings: List Decoding for Insertions and Deletions
We study codes that are listdecodable under insertions and deletions. S...
read it

General Strong Polarization
Arı kan's exciting discovery of polar codes has provided an altogether n...
read it

Local decoding and testing of polynomials over grids
The wellknown DeMilloLiptonSchwartzZippel lemma says that nvariate ...
read it

Performance of the Survey Propagationguided decimation algorithm for the random NAEKSAT problem
We show that the Survey Propagationguided decimation algorithm fails to...
read it
Madhu Sudan
is this you? claim profile
Gordon McKay Professor of Computer Science, Harvard John A. Paulson School of Engineering and Applied Sciences