![]() |
Jayram S. Thathachar
List of publications from the DBLP Bibliography Server - FAQ
| 2008 | ||
|---|---|---|
| 40 | EE | Amit Chakrabarti, T. S. Jayram, Mihai Patrascu: Tight lower bounds for selection in randomly ordered streams. SODA 2008: 720-729 |
| 39 | EE | T. S. Jayram, Andrew McGregor, S. Muthukrishnan, Erik Vee: Estimating statistical aggregates on probabilistic data streams. ACM Trans. Database Syst. 33(4): (2008) |
| 38 | EE | Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis: Exponential Separation of Quantum and Classical One-Way Communication Complexity. SIAM J. Comput. 38(1): 366-384 (2008) |
| 37 | EE | T. S. Jayram, Ravi Kumar, D. Sivakumar: The One-Way Communication Complexity of Hamming Distance. Theory of Computing 4(1): 129-135 (2008) |
| 2007 | ||
| 36 | EE | T. S. Jayram, Andrew McGregor, S. Muthukrishnan, Erik Vee: Estimating statistical aggregates on probabilistic data streams. PODS 2007: 243-252 |
| 35 | EE | Parikshit Gopalan, T. S. Jayram, Robert Krauthgamer, Ravi Kumar: Estimating the sortedness of a data stream. SODA 2007: 318-327 |
| 34 | EE | T. S. Jayram, Satyen Kale, Erik Vee: Efficient aggregation algorithms for probabilistic data. SODA 2007: 346-355 |
| 33 | EE | Paul Beame, T. S. Jayram, Atri Rudra: Lower bounds for randomized read/write stream algorithms. STOC 2007: 689-698 |
| 32 | EE | Douglas Burdick, Prasad M. Deshpande, T. S. Jayram, Raghu Ramakrishnan, Shivakumar Vaithyanathan: OLAP over uncertain and imprecise data. VLDB J. 16(1): 123-144 (2007) |
| 2006 | ||
| 31 | EE | Ziv Bar-Yossef, Yitzhak Birk, T. S. Jayram, Tomer Kol: Index Coding with Side Information. FOCS 2006: 197-206 |
| 30 | EE | T. S. Jayram, Phokion G. Kolaitis, Erik Vee: The containment problem for REAL conjunctive queries with inequalities. PODS 2006: 80-89 |
| 29 | EE | Douglas Burdick, Prasad M. Deshpande, T. S. Jayram, Raghu Ramakrishnan, Shivakumar Vaithyanathan: Efficient Allocation Algorithms for OLAP Over Imprecise Data. VLDB 2006: 391-402 |
| 28 | EE | T. S. Jayram, Rajasekar Krishnamurthy, Sriram Raghavan, Shivakumar Vaithyanathan, Huaiyu Zhu: Avatar Information Extraction System. IEEE Data Eng. Bull. 29(1): 40-48 (2006) |
| 2005 | ||
| 27 | EE | Douglas Burdick, Prasad Deshpande, T. S. Jayram, Raghu Ramakrishnan, Shivakumar Vaithyanathan: OLAP Over Uncertain and Imprecise Data. VLDB 2005: 970-981 |
| 2004 | ||
| 26 | EE | Ashutosh Garg, T. S. Jayram, Shivakumar Vaithyanathan, Huaiyu Zhu: Generalized Opinion Pooling. AMAI 2004 |
| 25 | EE | Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, Ravi Kumar: The Sketching Complexity of Pattern Matching. APPROX-RANDOM 2004: 261-272 |
| 24 | EE | Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, Ravi Kumar: Approximating Edit Distance Efficiently. FOCS 2004: 550-559 |
| 23 | EE | Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis: Exponential separation of quantum and classical one-way communication complexity. STOC 2004: 128-137 |
| 22 | EE | 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) |
| 21 | EE | 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) |
| 20 | EE | 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) |
| 2003 | ||
| 19 | EE | T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Rabani: Cell-probe lower bounds for the partial match problem. STOC 2003: 667-672 |
| 18 | EE | T. S. Jayram, Ravi Kumar, D. Sivakumar: Two applications of information complexity. STOC 2003: 673-682 |
| 2002 | ||
| 17 | EE | Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar: An Information Statistics Approach to Data Stream and Communication Complexity. FOCS 2002: 209-218 |
| 16 | EE | Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar: Information Theory Methods in Communication Complexity. IEEE Conference on Computational Complexity 2002: 93-102 |
| 15 | EE | Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, Luca Trevisan: Counting Distinct Elements in a Data Stream. RANDOM 2002: 1-10 |
| 14 | EE | Miklós Ajtai, T. S. Jayram, Ravi Kumar, D. Sivakumar: Approximate counting of inversions in a data stream. STOC 2002: 370-379 |
| 13 | 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) | |
| 2001 | ||
| 12 | EE | 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 |
| 11 | EE | Eric J. Anderson, T. S. Jayram, Tracy Kimbrel: Tighter Bounds on Preemptive Job Shop Scheduling with Two Machines. Computing 67(1): 83-90 (2001) |
| 10 | EE | Paul Beame, T. S. Jayram, Michael E. Saks: Time-Space Tradeoffs for Branching Programs. J. Comput. Syst. Sci. 63(4): 542-572 (2001) |
| 2000 | ||
| 9 | Joseph L. Hellerstein, T. S. Jayram, Irina Rish: Recognizing End-User Transactions in Performance Management. AAAI/IAAI 2000: 596-602 | |
| 8 | EE | Joseph L. Hellerstein, T. S. Jayram, Mark S. Squillante: Analysis of Large-Scale Distributed Information Systems. MASCOTS 2000: 164-171 |
| 1998 | ||
| 7 | Jayram S. Thathachar: On the Limitations of Ordered Representations of Functions. CAV 1998: 232-243 | |
| 6 | EE | Paul Beame, Michael E. Saks, Jayram S. Thathachar: Time-Space Tradeoffs for Branching Programs. FOCS 1998: 254-263 |
| 5 | EE | Jayram S. Thathachar: On Separating the Read-k-Times Branching Program Hierarchy. STOC 1998: 653-662 |
| 4 | EE | Jayram S. Thathachar: On Separating the Read-k-Times Branching Program Hierarchy Electronic Colloquium on Computational Complexity (ECCC) 5(2): (1998) |
| 3 | EE | Paul Beame, Michael E. Saks, Jayram S. Thathachar: Time-Space Tradeoffs for Branching Programs Electronic Colloquium on Computational Complexity (ECCC) 5(53): (1998) |
| 1997 | ||
| 2 | Rakesh K. Sinha, Jayram S. Thathachar: Efficient Oblivious Branching Programs for Threshold and Mod Functions. J. Comput. Syst. Sci. 55(3): 373-384 (1997) | |
| 1994 | ||
| 1 | Rakesh K. Sinha, Jayram S. Thathachar: Efficient Oblivious Branching Programs for Threshold Functions FOCS 1994: 309-317 | |