The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

T. S. Jayram: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Joseph L. Hellerstein, T. S. Jayram, Irina Rish
    Recognizing End-User Transactions in Performance Management. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 2000, pp:596-602 [Conf]
  2. Ashutosh Garg, T. S. Jayram, Shivakumar Vaithyanathan, Huaiyu Zhu
    Generalized Opinion Pooling. [Citation Graph (0, 0)][DBLP]
    AMAI, 2004, pp:- [Conf]
  3. Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, Ravi Kumar
    The Sketching Complexity of Pattern Matching. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:261-272 [Conf]
  4. Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar
    Information Theory Methods in Communication Complexity. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:93-102 [Conf]
  5. Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, Ravi Kumar
    Approximating Edit Distance Efficiently. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:550-559 [Conf]
  6. Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar
    An Information Statistics Approach to Data Stream and Communication Complexity. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:209-218 [Conf]
  7. Ziv Bar-Yossef, Yitzhak Birk, T. S. Jayram, Tomer Kol
    Index Coding with Side Information. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:197-206 [Conf]
  8. Joseph L. Hellerstein, T. S. Jayram, Mark S. Squillante
    Analysis of Large-Scale Distributed Information Systems. [Citation Graph (0, 0)][DBLP]
    MASCOTS, 2000, pp:164-171 [Conf]
  9. T. S. Jayram, Phokion G. Kolaitis, Erik Vee
    The containment problem for REAL conjunctive queries with inequalities. [Citation Graph (0, 0)][DBLP]
    PODS, 2006, pp:80-89 [Conf]
  10. Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, Luca Trevisan
    Counting Distinct Elements in a Data Stream. [Citation Graph (0, 0)][DBLP]
    RANDOM, 2002, pp:1-10 [Conf]
  11. Miklós Ajtai, T. S. Jayram, Ravi Kumar, D. Sivakumar
    Approximate counting of inversions in a data stream. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:370-379 [Conf]
  12. Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis
    Exponential separation of quantum and classical one-way communication complexity. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:128-137 [Conf]
  13. T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Rabani
    Cell-probe lower bounds for the partial match problem. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:667-672 [Conf]
  14. T. S. Jayram, Tracy Kimbrel, Robert Krauthgamer, Baruch Schieber, Maxim Sviridenko
    Online server allocation in a server farm via benefit task systems. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:540-549 [Conf]
  15. T. S. Jayram, Ravi Kumar, D. Sivakumar
    Two applications of information complexity. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:673-682 [Conf]
  16. Douglas Burdick, Prasad Deshpande, T. S. Jayram, Raghu Ramakrishnan, Shivakumar Vaithyanathan
    OLAP Over Uncertain and Imprecise Data. [Citation Graph (0, 0)][DBLP]
    VLDB, 2005, pp:970-981 [Conf]
  17. Douglas Burdick, Prasad M. Deshpande, T. S. Jayram, Raghu Ramakrishnan, Shivakumar Vaithyanathan
    Efficient Allocation Algorithms for OLAP Over Imprecise Data. [Citation Graph (0, 0)][DBLP]
    VLDB, 2006, pp:391-402 [Conf]
  18. Eric J. Anderson, T. S. Jayram, Tracy Kimbrel
    Tighter Bounds on Preemptive Job Shop Scheduling with Two Machines. [Citation Graph (0, 0)][DBLP]
    Computing, 2001, v:67, n:1, pp:83-90 [Journal]
  19. T. S. Jayram, Rajasekar Krishnamurthy, Sriram Raghavan, Shivakumar Vaithyanathan, Huaiyu Zhu
    Avatar Information Extraction System. [Citation Graph (0, 0)][DBLP]
    IEEE Data Eng. Bull., 2006, v:29, n:1, pp:40-48 [Journal]
  20. Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis
    Exponential Separation of Quantum and Classical One-Way Communication Complexity [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:036, pp:- [Journal]
  21. Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar
    An information statistics approach to data stream and communication complexity. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:68, n:4, pp:702-732 [Journal]
  22. Paul Beame, T. S. Jayram, Michael E. Saks
    Time-Space Tradeoffs for Branching Programs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:63, n:4, pp:542-572 [Journal]
  23. T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Rabani
    Cell-probe lower bounds for the partial match problem. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:69, n:3, pp:435-447 [Journal]
  24. 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. [Citation Graph (0, 0)][DBLP]
    Real-Time Systems, 2002, v:23, n:1-2, pp:127-141 [Journal]
  25. Douglas Burdick, Prasad M. Deshpande, T. S. Jayram, Raghu Ramakrishnan, Shivakumar Vaithyanathan
    OLAP over uncertain and imprecise data. [Citation Graph (0, 0)][DBLP]
    VLDB J., 2007, v:16, n:1, pp:123-144 [Journal]
  26. T. S. Jayram, Andrew McGregor, S. Muthukrishnan, Erik Vee
    Estimating statistical aggregates on probabilistic data streams. [Citation Graph (0, 0)][DBLP]
    PODS, 2007, pp:243-252 [Conf]
  27. Parikshit Gopalan, T. S. Jayram, Robert Krauthgamer, Ravi Kumar
    Estimating the sortedness of a data stream. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:318-327 [Conf]
  28. T. S. Jayram, Satyen Kale, Erik Vee
    Efficient aggregation algorithms for probabilistic data. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:346-355 [Conf]
  29. Paul Beame, T. S. Jayram, Atri Rudra
    Lower bounds for randomized read/write stream algorithms. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:689-698 [Conf]

  30. Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND. [Citation Graph (, )][DBLP]


  31. On the Communication Complexity of Read-Once AC^0 Formulae. [Citation Graph (, )][DBLP]


  32. The Data Stream Space Complexity of Cascaded Norms. [Citation Graph (, )][DBLP]


  33. Information complexity: a tutorial. [Citation Graph (, )][DBLP]


  34. Tight lower bounds for selection in randomly ordered streams. [Citation Graph (, )][DBLP]


  35. Lower Bounds for Edit Distance and Product Metrics via Poincaré-Type Inequalities. [Citation Graph (, )][DBLP]


Search in 7.134secs, Finished in 7.136secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002