The following pages link to Jaikumar Radhakrishnan (Q6481475):
Displaying 1 item.
- (Q202094) (redirect page) (← links)
- Streaming algorithms for language recognition problems (Q391078) (← links)
- (Q679457) (redirect page) (← links)
- Greed is good: Approximating independent sets in sparse and bounded-degree graphs (Q679458) (← links)
- Random measurement bases, quantum state distinction and applications to the hidden subgroup problem (Q835652) (← links)
- Complete partitions of graphs (Q949754) (← links)
- Improved bounds for covering complete uniform hypergraphs (Q1190514) (← links)
- Directed monotone contact networks for threshold functions (Q1327314) (← links)
- \(\Sigma\Pi\Sigma\) threshold formulas (Q1340142) (← links)
- Better lower bounds for monotone threshold formulas (Q1356879) (← links)
- The complexity of parallel prefix problems on small domains (Q1373137) (← links)
- A tradeoff between search and update in dictionaries (Q1607123) (← links)
- Essential covers of the cube by hyperplanes (Q1770439) (← links)
- Minimizing branching vertices in distance-preserving subgraphs (Q2330556) (← links)
- Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons (Q2575833) (← links)
- On converting CNF to DNF (Q2576880) (← links)
- Coordination Complexity (Q2800576) (← links)
- Greed is good (Q2817635) (← links)
- An Entropy-Based Proof for the Moore Bound for Irregular Graphs (Q2821702) (← links)
- (Q2921751) (← links)
- (Q3129921) (← links)
- Online Set Packing (Q3143291) (← links)
- Expansion properties of (secure) wireless networks (Q3189062) (← links)
- On Dinur’s proof of the PCP theorem (Q3430210) (← links)
- A property of quantum relative entropy with an application to privacy in quantum communication (Q3452229) (← links)
- (Q3579444) (← links)
- (Q3579504) (← links)
- Data Structures for Storing Small Sets in the Bitprobe Model (Q3586392) (← links)
- Gap Amplification in PCPs Using Lazy Random Walks (Q3613752) (← links)
- (Q4228438) (← links)
- (Q4228451) (← links)
- (Q4268459) (← links)
- (Q4415257) (← links)
- A note on scrambling permutations (Q4419290) (← links)
- (Q4449184) (← links)
- (Q4471362) (← links)
- Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem (Q4472443) (← links)
- (Q4598278) (← links)
- (Q4633849) (← links)
- The Zero-Error Randomized Query Complexity of the Pointer Function (Q4636563) (← links)
- (Q4636637) (← links)
- (Q4698692) (← links)
- (Q4796182) (← links)
- Pi-sigma-pi threshold formulas (Q4887487) (← links)
- More on a Problem of Zarankiewicz (Q4909543) (← links)
- Improved bounds and algorithms for hypergraph 2-coloring (Q4943351) (← links)
- Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators (Q4943700) (← links)
- Subspace Polynomials and Limits to List Decoding of Reed–Solomon Codes (Q4976034) (← links)
- The Communication Complexity of Correlation (Q4976061) (← links)
- Bounds on the Zero-Error List-Decoding Capacity of the <i>q</i>/(<i>q</i> – 1) Channel (Q5030282) (← links)
- Improved approximations of independent sets in bounded-degree graphs (Q5054761) (← links)
- The randomized complexity of maintaining the minimum (Q5054803) (← links)
- Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes (Q5089193) (← links)
- Distance-Preserving Subgraphs of Interval Graphs (Q5111726) (← links)
- Online set packing and competitive scheduling of multi-part tasks (Q5176219) (← links)
- Streaming Algorithms for 2-Coloring Uniform Hypergraphs (Q5199282) (← links)
- An Improved Bound on the Zero-Error List-Decoding Capacity of the 4/3 Channel (Q5211632) (← links)
- Set membership with a few bit probes (Q5363093) (← links)
- Tight bounds for communication-assisted agreement distillation (Q5368740) (← links)
- Separation Between Deterministic and Randomized Query Complexity (Q5376437) (← links)
- Zero Error List-Decoding Capacity of the q/(q–1) Channel (Q5385980) (← links)
- Mathematical Foundations of Computer Science 2003 (Q5431349) (← links)
- Tradeoffs in Depth-Two Superconcentrators (Q5449814) (← links)
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (Q5479374) (← links)
- Lower bounds for adaptive locally decodable codes (Q5704840) (← links)
- Automata, Languages and Programming (Q5716763) (← links)
- The communication complexity of pointer chasing (Q5943092) (← links)
- An entropy proof of Bregman's theorem (Q5961543) (← links)
- (Q6187044) (← links)
