T. S. Jayram
According to our database^{1},
T. S. Jayram
authored at least 57 papers
between 1994 and 2018.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at orcid.org
On csauthors.net:
Bibliography
2018
Randomized Communication versus Partition Number.
TOCT, 2018
A Note on Some Inequalities Used in Channel Polarization and Polar Coding.
IEEE Trans. Information Theory, 2018
ResourceEfficient Common Randomness and SecretKey Schemes.
Proceedings of the TwentyNinth Annual ACMSIAM Symposium on Discrete Algorithms, 2018
Simple Analyses of the Sparse JohnsonLindenstrauss Transform.
Proceedings of the 1st Symposium on Simplicity in Algorithms, 2018
2017
Randomized Communication vs. Partition Number.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017
2016
A Composition Theorem for Conical Juntas.
Proceedings of the 31st Conference on Computational Complexity, 2016
2015
On Multiplicative Weight Updates for Concave and Submodular Function Maximization.
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015
2014
Exchangeability and Realizability: De Finetti Theorems on Graphs.
Proceedings of the Approximation, 2014
2013
Optimal Bounds for JohnsonLindenstrauss Transforms and Streaming Problems with Subconstant Error.
ACM Trans. Algorithms, 2013
On the information complexity of cascaded norms with small domains.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013
Inferring connectivity model from meter measurements in distribution networks.
Proceedings of the Fourth International Conference on Future Energy Systems, 2013
Online Optimization with Dynamic Temporal Uncertainty: Incorporating Short Term Predictions for Renewable Integration in Intelligent Energy Systems.
Proceedings of the TwentySeventh AAAI Conference on Artificial Intelligence, 2013
2012
Optimal allocation of land area for a hybrid solar wind power plant.
Proceedings of the IEEE Third International Conference on Smart Grid Communications, 2012
Prediction based storage management in the smart grid.
Proceedings of the IEEE Third International Conference on Smart Grid Communications, 2012
Hedging strategies for renewable resource integration and uncertainty management in the smart grid.
Proceedings of the 3rd IEEE PES Innovative Smart Grid Technologies Europe, 2012
Online optimization for the smart (micro) grid.
Proceedings of the 3rd International Conference on EnergyEfficient Computing and Networking, 2012
2011
Optimal Bounds for JohnsonLindenstrauss Transforms and Streaming Problems with SubConstant Error.
Proceedings of the TwentySecond Annual ACMSIAM Symposium on Discrete Algorithms, 2011
2010
Lower Bounds for Edit Distance and Product Metrics via PoincaréType Inequalities.
Proceedings of the TwentyFirst Annual ACMSIAM Symposium on Discrete Algorithms, 2010
Information complexity: a tutorial.
Proceedings of the TwentyNinth ACM SIGMODSIGACTSIGART Symposium on Principles of Database Systems, 2010
2009
The Data Stream Space Complexity of Cascaded Norms.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009
On the Communication Complexity of ReadOnce AC^0 Formulae.
Proceedings of the 24th Annual IEEE Conference on Computational Complexity, 2009
Hellinger Strikes Back: A Note on the Multiparty Information Complexity of AND.
Proceedings of the Approximation, 2009
2008
The OneWay Communication Complexity of Hamming Distance.
Theory of Computing, 2008
Tight lower bounds for selection in randomly ordered streams.
Proceedings of the Nineteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2008
2007
Lower bounds for randomized read/write stream algorithms.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007
Efficient aggregation algorithms for probabilistic data.
Proceedings of the Eighteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2007
Estimating the sortedness of a data stream.
Proceedings of the Eighteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2007
Estimating statistical aggregates on probabilistic data streams.
Proceedings of the TwentySixth ACM SIGACTSIGMODSIGART Symposium on Principles of Database Systems, 2007
2006
Avatar Information Extraction System.
IEEE Data Eng. Bull., 2006
Efficient Allocation Algorithms for OLAP Over Imprecise Data.
Proceedings of the 32nd International Conference on Very Large Data Bases, 2006
The containment problem for REAL conjunctive queries with inequalities.
Proceedings of the TwentyFifth ACM SIGACTSIGMODSIGART Symposium on Principles of Database Systems, 2006
Index Coding with Side Information.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006
2005
OLAP Over Uncertain and Imprecise Data.
Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway, August 30, 2005
2004
Exponential Separation of Quantum and Classical OneWay Communication Complexity
Electronic Colloquium on Computational Complexity (ECCC), 2004
Exponential separation of quantum and classical oneway communication complexity.
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004
Generalized Opinion Pooling.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2004
Approximating Edit Distance Efficiently.
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004
The Sketching Complexity of Pattern Matching.
Proceedings of the Approximation, 2004
2003
Two applications of information complexity.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003
Cellprobe lower bounds for the partial match problem.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003
2002
Approximate counting of inversions in a data stream.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002
Counting Distinct Elements in a Data Stream.
Proceedings of the Randomization and Approximation Techniques, 6th International Workshop, 2002
An Information Statistics Approach to Data Stream and Communication Complexity.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002
Information Theory Methods in Communication Complexity.
Proceedings of the 17th Annual IEEE Conference on Computational Complexity, 2002
2001
TimeSpace Tradeoffs for Branching Programs.
J. Comput. Syst. Sci., 2001
Tighter Bounds on Preemptive Job Shop Scheduling with Two Machines.
Computing, 2001
Online server allocation in a server farm via benefit task systems.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001
Using Control Theory to Achieve Service Level Objectives In Performance Management.
Proceedings of the 2001 IEEE/IFIP International Symposium on Integrated Network Management, 2001
2000
Analysis of LargeScale Distributed Information Systems.
Proceedings of the MASCOTS 2000, Proceedings of the 8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, 29 August, 2000
Recognizing EndUser Transactions in Performance Management.
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000
1998
TimeSpace Tradeoffs for Branching Programs
Electronic Colloquium on Computational Complexity (ECCC), 1998
On Separating the ReadkTimes Branching Program Hierarchy
Electronic Colloquium on Computational Complexity (ECCC), 1998
On Separating the ReadkTimes Branching Program Hierarchy.
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998
TimeSpace Tradeoffs for Branching Programs.
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998
On the Limitations of Ordered Representations of Functions.
Proceedings of the Computer Aided Verification, 10th International Conference, 1998
1997
Efficient Oblivious Branching Programs for Threshold and Mod Functions.
J. Comput. Syst. Sci., 1997
1994
Efficient Oblivious Branching Programs for Threshold Functions
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994