The following pages link to Amit Chakrabarti (Q343860):
Displaying 45 items.
- Certifying equality with limited interaction (Q343864) (← links)
- The query complexity of estimating weighted averages (Q766183) (← links)
- Approximation algorithms for the unsplittable flow problem (Q868438) (← links)
- Submodular maximization meets streaming: matchings, matroids, and more (Q896286) (← links)
- (Q2762499) (← links)
- Evasiveness of subgraph containment and related properties (Q2784484) (← links)
- A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube (Q2819559) (← links)
- Robust lower bounds for communication and stream computation (Q2830872) (← links)
- Information cost tradeoffs for augmented index and streaming language recognition (Q2839171) (← links)
- A near-optimal algorithm for estimating the entropy of a stream (Q2930333) (← links)
- A quasi-PTAS for unsplittable flow on line graphs (Q2931432) (← links)
- (Q2934611) (← links)
- Beyond set disjointness (Q2943615) (← links)
- Certifying Equality With Limited Interaction. (Q2969646) (← links)
- Combinatorial theorems about embedding trees on the real line (Q3005116) (← links)
- An Optimal Randomized Cell Probe Lower Bound for Approximate Nearest Neighbor Searching (Q3053154) (← links)
- Everywhere-Tight Information Cost Tradeoffs for Augmented Index (Q3088117) (← links)
- Information Complexity versus Corruption and Applications to Orthogonality and Gap-Hamming (Q3167419) (← links)
- An improved approximation algorithm for resource allocation (Q3189033) (← links)
- Improved lower bounds on the randomized complexity of graph properties (Q3437025) (← links)
- Nearly Private Information Retrieval (Q3525586) (← links)
- (Q3579381) (← links)
- Better Gap-Hamming Lower Bounds via Better Round Elimination (Q3588428) (← links)
- Functional Monitoring without Monotonicity (Q3638026) (← links)
- Annotations in Data Streams (Q3638037) (← links)
- (Q4411277) (← links)
- (Q4535024) (← links)
- Incidence Geometries and the Pass Complexity of Semi-Streaming Set Cover (Q4575677) (← links)
- A depth-five lower bound for iterated matrix multiplication (Q4601828) (← links)
- (Q4601830) (← links)
- (Q4636608) (← links)
- (Q4737541) (← links)
- An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance (Q4907584) (← links)
- (Q4910715) (← links)
- Annotations in Data Streams (Q4962165) (← links)
- Vertex Ordering Problems in Directed Graph Streams (Q5146890) (← links)
- Verifiable Stream Computation and Arthur--Merlin Communication (Q5232326) (← links)
- On Density, Threshold and Emptiness Queries for Intervals in the Streaming Model (Q5275378) (← links)
- (Q5302089) (← links)
- Annotations for Sparse Data Streams (Q5384013) (← links)
- When the cut condition is enough (Q5415462) (← links)
- (Q5692703) (← links)
- (Q5875530) (← links)
- (Q6062143) (← links)
- (Q6126266) (← links)
