|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 33 occurrences of 25 keywords
|
|
|
|
|
Results
Found 50 publication records. Showing 50 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | T. S. Jayram, Soumitra Pal, Vijay Arya |
Recovery of a Sparse Integer Solution to an Underdetermined System of Linear Equations  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Ziv Bar-Yossef, Yitzhak Birk, T. S. Jayram, Tomer Kol |
Index Coding With Side Information. |
IEEE Transactions on Information Theory |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | T. S. Jayram, David P. Woodruff |
Optimal Bounds for Johnson-Lindenstrauss Transforms and Streaming Problems with Sub-Constant Error. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Alexandr Andoni, T. S. Jayram, Mihai Patrascu |
Lower Bounds for Edit Distance and Product Metrics via Poincaré-Type Inequalities. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | T. S. Jayram |
Information complexity: a tutorial. |
PODS |
2010 |
DBLP DOI BibTeX RDF |
information complexity, streams, information theory, statistics, sketching, communication complexity, geometry |
| 1 | T. S. Jayram |
Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | T. S. Jayram, David P. Woodruff |
The Data Stream Space Complexity of Cascaded Norms. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | T. S. Jayram, Swastik Kopparty, Prasad Raghavendra |
On the Communication Complexity of Read-Once AC^0 Formulae. |
IEEE Conference on Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | T. S. Jayram, Andrew McGregor, S. Muthukrishnan, Erik Vee |
Estimating statistical aggregates on probabilistic data streams. |
ACM Trans. Database Syst. |
2008 |
DBLP DOI BibTeX RDF |
Probabilistic streams, frequency moments, OLAP, mean, median |
| 1 | T. S. Jayram, Ravi Kumar, D. Sivakumar |
The One-Way Communication Complexity of Hamming Distance. |
Theory of Computing |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis |
Exponential Separation of Quantum and Classical One-Way Communication Complexity. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Amit Chakrabarti, T. S. Jayram, Mihai Patrascu |
Tight lower bounds for selection in randomly ordered streams. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Douglas Burdick, Prasad M. Deshpande, T. S. Jayram, Raghu Ramakrishnan, Shivakumar Vaithyanathan |
OLAP over uncertain and imprecise data. |
VLDB J. |
2007 |
DBLP DOI BibTeX RDF |
Uncertainty, Aggregation, Ambiguous, Imprecision |
| 1 | T. S. Jayram, Satyen Kale, Erik Vee |
Efficient aggregation algorithms for probabilistic data. |
SODA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Parikshit Gopalan, T. S. Jayram, Robert Krauthgamer, Ravi Kumar |
Estimating the sortedness of a data stream. |
SODA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | T. S. Jayram, Andrew McGregor, S. Muthukrishnan, Erik Vee |
Estimating statistical aggregates on probabilistic data streams. |
PODS |
2007 |
DBLP DOI BibTeX RDF |
frequency moments, probabilistic streams, OLAP, mean, median |
| 1 | Paul Beame, T. S. Jayram, Atri Rudra |
Lower bounds for randomized read/write stream algorithms. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
communication complexity, data stream algorithms |
| 1 | T. S. Jayram, Rajasekar Krishnamurthy, Sriram Raghavan, Shivakumar Vaithyanathan, Huaiyu Zhu |
Avatar Information Extraction System. |
IEEE Data Eng. Bull. |
2006 |
DBLP BibTeX RDF |
|
| 1 | Douglas Burdick, Prasad M. Deshpande, T. S. Jayram, Raghu Ramakrishnan, Shivakumar Vaithyanathan |
Efficient Allocation Algorithms for OLAP Over Imprecise Data. |
VLDB |
2006 |
DBLP BibTeX RDF |
|
| 1 | Ziv Bar-Yossef, Yitzhak Birk, T. S. Jayram, Tomer Kol |
Index Coding with Side Information. |
FOCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | T. S. Jayram, Phokion G. Kolaitis, Erik Vee |
The containment problem for REAL conjunctive queries with inequalities. |
PODS |
2006 |
DBLP DOI BibTeX RDF |
bag semantics, bag-set semantics, conjunctive queries, undecidability, query containment, inequalities |
| 1 | Douglas Burdick, Prasad Deshpande, T. S. Jayram, Raghu Ramakrishnan, Shivakumar Vaithyanathan |
OLAP Over Uncertain and Imprecise Data. |
VLDB |
2005 |
DBLP BibTeX RDF |
|
| 1 | Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis |
Exponential Separation of Quantum and Classical One-Way Communication Complexity |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Rabani |
Cell-probe lower bounds for the partial match problem. |
J. Comput. Syst. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar |
An information statistics approach to data stream and communication complexity. |
J. Comput. Syst. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Ashutosh Garg, T. S. Jayram, Shivakumar Vaithyanathan, Huaiyu Zhu |
Generalized Opinion Pooling. |
ISAIM |
2004 |
DBLP BibTeX RDF |
|
| 1 | Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, Ravi Kumar |
The Sketching Complexity of Pattern Matching. |
APPROX-RANDOM |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, Ravi Kumar |
Approximating Edit Distance Efficiently. |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Ashutosh Garg, T. S. Jayram, Shivakumar Vaithyanathan, Huaiyu Zhu |
Generalized Opinion Pooling. |
AMAI |
2004 |
DBLP BibTeX RDF |
|
| 1 | Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis |
Exponential separation of quantum and classical one-way communication complexity. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
hidden matching, quantum computation, communication complexity, separation |
| 1 | T. S. Jayram, Ravi Kumar, D. Sivakumar |
Two applications of information complexity. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Rabani |
Cell-probe lower bounds for the partial match problem. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, Luca Trevisan |
Counting Distinct Elements in a Data Stream. |
RANDOM |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar |
An Information Statistics Approach to Data Stream and Communication Complexity. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar |
Information Theory Methods in Communication Complexity. (PDF / PS) |
IEEE Conference on Computational Complexity |
2002 |
DBLP DOI BibTeX RDF |
Fano's inequality, Maximum Likelihood Estimate Principle, Information Theory, Communication complexity |
| 1 | Miklós Ajtai, T. S. Jayram, Ravi Kumar, D. Sivakumar |
Approximate counting of inversions in a data stream. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric J. Anderson, T. S. Jayram, Tracy Kimbrel |
Tighter Bounds on Preemptive Job Shop Scheduling with Two Machines. |
Computing |
2001 |
DBLP DOI BibTeX RDF |
AMS Subject Classifications: 68Q25, 90B35 |
| 1 | Paul Beame, T. S. Jayram, Michael E. Saks |
Time-Space Tradeoffs for Branching Programs. |
J. Comput. Syst. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | T. S. Jayram, Tracy Kimbrel, Robert Krauthgamer, Baruch Schieber, Maxim Sviridenko |
Online server allocation in a server farm via benefit task systems. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph L. Hellerstein, T. S. Jayram, Mark S. Squillante |
Analysis of Large-Scale Distributed Information Systems. (PDF / PS) |
MASCOTS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph L. Hellerstein, T. S. Jayram, Irina Rish |
Recognizing End-User Transactions in Performance Management. |
AAAI/IAAI |
2000 |
DBLP BibTeX RDF |
|
| 1 | Jayram S. Thathachar |
On Separating the Read-k-Times Branching Program Hierarchy |
Electronic Colloquium on Computational Complexity (ECCC) |
1998 |
DBLP BibTeX RDF |
|
| 1 | Paul Beame, Michael E. Saks, Jayram S. Thathachar |
Time-Space Tradeoffs for Branching Programs |
Electronic Colloquium on Computational Complexity (ECCC) |
1998 |
DBLP BibTeX RDF |
|
| 1 | Jayram S. Thathachar |
On the Limitations of Ordered Representations of Functions. |
CAV |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Michael E. Saks, Jayram S. Thathachar |
Time-Space Tradeoffs for Branching Programs. |
FOCS |
1998 |
DBLP DOI BibTeX RDF |
lower bounds, branching programs, time-space tradeoffs |
| 1 | Jayram S. Thathachar |
On Separating the Read-k-Times Branching Program Hierarchy. |
STOC |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Rakesh K. Sinha, Jayram S. Thathachar |
Efficient Oblivious Branching Programs for Threshold and Mod Functions. |
J. Comput. Syst. Sci. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Rakesh K. Sinha, Jayram S. Thathachar |
Efficient Oblivious Branching Programs for Threshold Functions |
FOCS |
1994 |
DBLP DOI BibTeX RDF |
oblivious branching programs, rectifier-switching network, upper bound, branching programs, threshold functions, threshold function |
Displaying result #1 - #50 of 50 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")