The following pages link to T. S. Jayram (Q211559):
Displaying 17 items.
- An information statistics approach to data stream and communication complexity (Q598248) (← links)
- Time-space tradeoffs for branching programs (Q1604208) (← links)
- Optimal Bounds for Johnson-Lindenstrauss Transforms and Streaming Problems with Subconstant Error (Q2933656) (← links)
- (Q2934610) (← links)
- (Q2934613) (← links)
- Exchangeability and Realizability: De Finetti Theorems on Graphs (Q2969661) (← links)
- On Multiplicative Weight Updates for Concave and Submodular Function Maximization (Q2989031) (← links)
- (Q3002795) (← links)
- Lower bounds for randomized read/write stream algorithms (Q3549671) (← links)
- Approximate counting of inversions in a data stream (Q3579234) (← links)
- (Q3579381) (← links)
- Exponential separation of quantum and classical one-way communication complexity (Q3580963) (← links)
- Two applications of information complexity (Q3581283) (← links)
- Exponential Separation of Quantum and Classical One-Way Communication Complexity (Q3614162) (← links)
- Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND (Q3638903) (← links)
- Simple Analyses of the Sparse Johnson-Lindenstrauss Transform. (Q5240430) (← links)
- (Q5368739) (← links)
