Travelled to:
1 × Canada
1 × China
1 × Greece
1 × Korea
1 × Norway
5 × USA
Collaborated with:
R.Kumar E.Vee D.Sivakumar ∅ D.Burdick R.Ramakrishnan S.Vaithyanathan P.Beame A.Rudra P.G.Kolaitis Z.Bar-Yossef I.Kerenidis A.McGregor S.Muthukrishnan S.Khot Y.Rabani M.Ajtai P.M.Deshpande P.Deshpande T.Kimbrel R.Krauthgamer B.Schieber M.Sviridenko
Talks about:
data (4) complex (3) stream (3) algorithm (2) imprecis (2) problem (2) server (2) inform (2) lower (2) bound (2)
Person: T. S. Jayram
DBLP: Jayram:T=_S=
Contributed to:
Wrote 11 papers:
- PODS-2010-Jayram #complexity #tutorial
- Information complexity: a tutorial (TSJ), pp. 159–168.
- PODS-2007-JayramMMV #data type #probability #statistics
- Estimating statistical aggregates on probabilistic data streams (TSJ, AM, SM, EV), pp. 243–252.
- STOC-2007-BeameJR #algorithm #bound #random
- Lower bounds for randomized read/write stream algorithms (PB, TSJ, AR), pp. 689–698.
- PODS-2006-JayramKV #problem #query
- The containment problem for REAL conjunctive queries with inequalities (TSJ, PGK, EV), pp. 80–89.
- VLDB-2006-BurdickDJRV #algorithm #performance
- Efficient Allocation Algorithms for OLAP Over Imprecise Data (DB, PMD, TSJ, RR, SV), pp. 391–402.
- VLDB-2005-BurdickDJRV #nondeterminism
- OLAP Over Uncertain and Imprecise Data (DB, PD, TSJ, RR, SV), pp. 970–981.
- STOC-2004-Bar-YossefJK #communication #complexity #exponential #quantum
- Exponential separation of quantum and classical one-way communication complexity (ZBY, TSJ, IK), pp. 128–137.
- STOC-2003-JayramKKR #bound #problem
- Cell-probe lower bounds for the partial match problem (TSJ, SK, RK, YR), pp. 667–672.
- STOC-2003-JayramKS #complexity
- Two applications of information complexity (TSJ, RK, DS), pp. 673–682.
- STOC-2002-AjtaiJKS #approximate #data type
- Approximate counting of inversions in a data stream (MA, TSJ, RK, DS), pp. 370–379.
- STOC-2001-JayramKKSS #online
- Online server allocation in a server farm via benefit task systems (TSJ, TK, RK, BS, MS), pp. 540–549.