![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. T. S. Jayram Douglas Burdick , Prasad Deshpande , T. S. Jayram, Raghu Ramakrishnan , Shivakumar Vaithyanathan : OLAP Over Uncertain and Imprecise Data. VLDB 2005 : 970-981 Ashutosh Garg , T. S. Jayram, Shivakumar Vaithyanathan , Huaiyu Zhu : Generalized Opinion Pooling. AMAI 2004 Ziv Bar-Yossef , T. S. Jayram, Robert Krauthgamer , Ravi Kumar : The Sketching Complexity of Pattern Matching. APPROX-RANDOM 2004 : 261-272 Ziv Bar-Yossef , T. S. Jayram, Robert Krauthgamer , Ravi Kumar : Approximating Edit Distance Efficiently. FOCS 2004 : 550-559 Ziv Bar-Yossef , T. S. Jayram, Iordanis Kerenidis : Exponential separation of quantum and classical one-way communication complexity. STOC 2004 : 128-137 Ziv Bar-Yossef , T. S. Jayram, Iordanis Kerenidis : Exponential Separation of Quantum and Classical One-Way Communication Complexity Electronic Colloquium on Computational Complexity (ECCC) (036): (2004) Ziv Bar-Yossef , T. S. Jayram, Ravi Kumar , D. Sivakumar : An information statistics approach to data stream and communication complexity. J. Comput. Syst. Sci. 68 (4): 702-732 (2004) T. S. Jayram, Subhash Khot , Ravi Kumar , Yuval Rabani : Cell-probe lower bounds for the partial match problem. J. Comput. Syst. Sci. 69 (3): 435-447 (2004) T. S. Jayram, Subhash Khot , Ravi Kumar , Yuval Rabani : Cell-probe lower bounds for the partial match problem. STOC 2003 : 667-672 T. S. Jayram, Ravi Kumar , D. Sivakumar : Two applications of information complexity. STOC 2003 : 673-682 Ziv Bar-Yossef , T. S. Jayram, Ravi Kumar , D. Sivakumar : An Information Statistics Approach to Data Stream and Communication Complexity. FOCS 2002 : 209-218 Ziv Bar-Yossef , T. S. Jayram, Ravi Kumar , D. Sivakumar : Information Theory Methods in Communication Complexity. IEEE Conference on Computational Complexity 2002 : 93-102 Ziv Bar-Yossef , T. S. Jayram, Ravi Kumar , D. Sivakumar , Luca Trevisan : Counting Distinct Elements in a Data Stream. RANDOM 2002 : 1-10 Miklós Ajtai , T. S. Jayram, Ravi Kumar , D. Sivakumar : Approximate counting of inversions in a data stream. STOC 2002 : 370-379 Sujay S. Parekh , Neha Gandhi , Joseph L. Hellerstein , Dawn M. Tilbury , T. S. Jayram, Joseph P. Bigus : Using Control Theory to Achieve Service Level Objectives In Performance Management. Real-Time Systems 23 (1-2): 127-141 (2002) T. S. Jayram, Tracy Kimbrel , Robert Krauthgamer , Baruch Schieber , Maxim Sviridenko : Online server allocation in a server farm via benefit task systems. STOC 2001 : 540-549 Eric J. Anderson , T. S. Jayram, Tracy Kimbrel : Tighter Bounds on Preemptive Job Shop Scheduling with Two Machines. Computing 67 (1): 83-90 (2001) Paul Beame , T. S. Jayram, Michael E. Saks : Time-Space Tradeoffs for Branching Programs. J. Comput. Syst. Sci. 63 (4): 542-572 (2001) Joseph L. Hellerstein , T. S. Jayram, Irina Rish : Recognizing End-User Transactions in Performance Management. AAAI/IAAI 2000 : 596-602 Joseph L. Hellerstein , T. S. Jayram, Mark S. Squillante : Analysis of Large-Scale Distributed Information Systems. MASCOTS 2000 : 164-171 1 [ 7 ] 2 [ 4 ] 3 [ 8 ] [ 9 ] [ 10 ] [ 14 ] [ 15 ] [ 16 ] [ 17 ] [ 18 ] 4 [ 3 ] 5 [ 6 ] 6 [ 20 ] 7 [ 20 ] 8 [ 6 ] 9 [ 19 ] 10 [ 1 ] [ 2 ] [ 6 ] 11 [ 15 ] [ 16 ] 12 [ 12 ] [ 13 ] 13 [ 4 ] [ 5 ] 14 [ 5 ] [ 17 ] [ 18 ] 15 [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 11 ] [ 12 ] [ 13 ] [ 14 ] [ 17 ] [ 18 ] 16 [ 6 ] 17 [ 12 ] [ 13 ] 18 [ 20 ] 19 [ 2 ] 20 [ 3 ] 21 [ 5 ] 22 [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 11 ] [ 14 ] 23 [ 1 ] 24 [ 5 ] 25 [ 6 ] 26 [ 8 ] 27 [ 19 ] [ 20 ] 28 [ 19 ] ![]() ©2006 Association for Computing Machinery |