T. S. Jayram

Jayram S. Thathachar

	2012
c35		Balakrishnan Narayanaswamy, Vikas K. Garg, T. S. Jayram: Online optimization for the smart (micro) grid. e-Energy 2012: 19
	2011
j12		Ziv Bar-Yossef, Yitzhak Birk, T. S. Jayram, Tomer Kol: Index Coding With Side Information. IEEE Transactions on Information Theory 57(3): 1479-1494 (2011)
c34		T. S. Jayram, David P. Woodruff: Optimal Bounds for Johnson-Lindenstrauss Transforms and Streaming Problems with Sub-Constant Error. SODA 2011: 1-10
i4		T. S. Jayram, Soumitra Pal, Vijay Arya: Recovery of a Sparse Integer Solution to an Underdetermined System of Linear Equations. CoRR abs/1112.1757 (2011)
	2010
c33		T. S. Jayram: Information complexity: a tutorial. PODS 2010: 159-168
c32		Alexandr Andoni, T. S. Jayram, Mihai Patrascu: Lower Bounds for Edit Distance and Product Metrics via Poincaré-Type Inequalities. SODA 2010: 184-192
	2009
c31		T. S. Jayram: Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND. APPROX-RANDOM 2009: 562-573
c30		T. S. Jayram, Swastik Kopparty, Prasad Raghavendra: On the Communication Complexity of Read-Once AC^0 Formulae. IEEE Conference on Computational Complexity 2009: 329-340
c29		T. S. Jayram, David P. Woodruff: The Data Stream Space Complexity of Cascaded Norms. FOCS 2009: 765-774
	2008
j11		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)
j10		T. S. Jayram, Ravi Kumar, D. Sivakumar: The One-Way Communication Complexity of Hamming Distance. Theory of Computing 4(1): 129-135 (2008)
j9		T. S. Jayram, Andrew McGregor, S. Muthukrishnan, Erik Vee: Estimating statistical aggregates on probabilistic data streams. ACM Trans. Database Syst. 33(4) (2008)
c28		Amit Chakrabarti, T. S. Jayram, Mihai Patrascu: Tight lower bounds for selection in randomly ordered streams. SODA 2008: 720-729
	2007
j8		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)
c27		T. S. Jayram, Andrew McGregor, S. Muthukrishnan, Erik Vee: Estimating statistical aggregates on probabilistic data streams. PODS 2007: 243-252
c26		Parikshit Gopalan, T. S. Jayram, Robert Krauthgamer, Ravi Kumar: Estimating the sortedness of a data stream. SODA 2007: 318-327
c25		T. S. Jayram, Satyen Kale, Erik Vee: Efficient aggregation algorithms for probabilistic data. SODA 2007: 346-355
c24		Paul Beame, T. S. Jayram, Atri Rudra: Lower bounds for randomized read/write stream algorithms. STOC 2007: 689-698
	2006
j7		T. S. Jayram, Rajasekar Krishnamurthy, Sriram Raghavan, Shivakumar Vaithyanathan, Huaiyu Zhu: Avatar Information Extraction System. IEEE Data Eng. Bull. 29(1): 40-48 (2006)
c23		Ziv Bar-Yossef, Yitzhak Birk, T. S. Jayram, Tomer Kol: Index Coding with Side Information. FOCS 2006: 197-206
c22		T. S. Jayram, Phokion G. Kolaitis, Erik Vee: The containment problem for REAL conjunctive queries with inequalities. PODS 2006: 80-89
c21		Douglas Burdick, Prasad M. Deshpande, T. S. Jayram, Raghu Ramakrishnan, Shivakumar Vaithyanathan: Efficient Allocation Algorithms for OLAP Over Imprecise Data. VLDB 2006: 391-402
	2005
c20		Douglas Burdick, Prasad Deshpande, T. S. Jayram, Raghu Ramakrishnan, Shivakumar Vaithyanathan: OLAP Over Uncertain and Imprecise Data. VLDB 2005: 970-981
	2004
j6		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)
j5		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)
c19		Ashutosh Garg, T. S. Jayram, Shivakumar Vaithyanathan, Huaiyu Zhu: Generalized Opinion Pooling. AMAI 2004
c18		Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, Ravi Kumar: The Sketching Complexity of Pattern Matching. APPROX-RANDOM 2004: 261-272
c17		Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, Ravi Kumar: Approximating Edit Distance Efficiently. FOCS 2004: 550-559
c16		Ashutosh Garg, T. S. Jayram, Shivakumar Vaithyanathan, Huaiyu Zhu: Generalized Opinion Pooling. ISAIM 2004
c15		Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis: Exponential separation of quantum and classical one-way communication complexity. STOC 2004: 128-137
i3		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)
	2003
c14		T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Rabani: Cell-probe lower bounds for the partial match problem. STOC 2003: 667-672
c13		T. S. Jayram, Ravi Kumar, D. Sivakumar: Two applications of information complexity. STOC 2003: 673-682
	2002
j4		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)
c12		Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar: Information Theory Methods in Communication Complexity. IEEE Conference on Computational Complexity 2002: 93-102
c11		Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar: An Information Statistics Approach to Data Stream and Communication Complexity. FOCS 2002: 209-218
c10		Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, Luca Trevisan: Counting Distinct Elements in a Data Stream. RANDOM 2002: 1-10
c9		Miklós Ajtai, T. S. Jayram, Ravi Kumar, D. Sivakumar: Approximate counting of inversions in a data stream. STOC 2002: 370-379
	2001
j3		Eric J. Anderson, T. S. Jayram, Tracy Kimbrel: Tighter Bounds on Preemptive Job Shop Scheduling with Two Machines. Computing 67(1): 83-90 (2001)
j2		Paul Beame, T. S. Jayram, Michael E. Saks: Time-Space Tradeoffs for Branching Programs. J. Comput. Syst. Sci. 63(4): 542-572 (2001)
c8		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. Integrated Network Management 2001: 841-854
c7		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
	2000
c6		Joseph L. Hellerstein, T. S. Jayram, Irina Rish: Recognizing End-User Transactions in Performance Management. AAAI/IAAI 2000: 596-602
c5		Joseph L. Hellerstein, T. S. Jayram, Mark S. Squillante: Analysis of Large-Scale Distributed Information Systems. MASCOTS 2000: 164-171
	1998
c4		Jayram S. Thathachar: On the Limitations of Ordered Representations of Functions. CAV 1998: 232-243
c3		Paul Beame, Michael E. Saks, Jayram S. Thathachar: Time-Space Tradeoffs for Branching Programs. FOCS 1998: 254-263
c2		Jayram S. Thathachar: On Separating the Read-k-Times Branching Program Hierarchy. STOC 1998: 653-662
i2		Jayram S. Thathachar: On Separating the Read-k-Times Branching Program Hierarchy. Electronic Colloquium on Computational Complexity (ECCC) 5(2) (1998)
i1		Paul Beame, Michael E. Saks, Jayram S. Thathachar: Time-Space Tradeoffs for Branching Programs. Electronic Colloquium on Computational Complexity (ECCC) 5(53) (1998)
	1997
j1		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
c1		Rakesh K. Sinha, Jayram S. Thathachar: Efficient Oblivious Branching Programs for Threshold Functions. FOCS 1994: 309-317

Coauthor Index

Colors in the list of coauthors

Last update Mon May 20 17:16:03 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page