Optimal bounds for Johnson-Lindenstrauss transforms and streaming problems with subconstant error
- T.S. Jayram
- David P. Woodruff
- 2013
- ACM Transactions on Algorithms
Publications
Date
Featured collections
Popular topics
48 results for T. S. Jayram
Estimating statistical aggregates on probabilistic data streams
- T.S. Jayram
- Andrew McGregor
- et al.
- 2008
- ACM TODS
Exponential separation of quantum and classical one-way communication complexity
- Bar-Yossef Ziv
- T.S. Jayram
- et al.
- 2008
- SIAM Journal on Computing
Cell-probe lower bounds for the partial match problem
- T.S. Jayram
- Subhash Khot
- et al.
- 2004
- Journal of Computer and System Sciences
An information statistics approach to data stream and communication complexity
- Ziv Bar-Yossef
- T.S. Jayram
- et al.
- 2004
- Journal of Computer and System Sciences
Information theory methods in communication complexity
- Ziv Bar-Yossef
- T.S. Jayram
- et al.
- 2002
- Proceedings of the Annual IEEE Conference on Computational Complexity
Tighter bounds on preemptive job shop scheduling with two machines
- E.J. Anderson
- T.S. Jayram
- et al.
- 2001
- Computing (Vienna/New York)
Time-space tradeoffs for branching programs
- Paul Beame
- T.S. Jayram
- et al.
- 2001
- Journal of Computer and System Sciences