T. S. Jayram

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
Simple Analyses of the Sparse Johnson-Lindenstrauss Transform.	2019-10-25	Paper
A Note on Some Inequalities Used in Channel Polarization and Polar Coding	2018-09-19	Paper
Resource-Efficient Common Randomness and Secret-Key Schemes	2018-03-15	Paper
https://portal.mardi4nfdi.de/entity/Q5368739	2017-10-10	Paper
https://portal.mardi4nfdi.de/entity/Q5365016	2017-09-29	Paper
Index Coding With Side Information	2017-07-27	Paper
On Multiplicative Weight Updates for Concave and Submodular Function Maximization	2017-05-19	Paper
Exchangeability and Realizability: De Finetti Theorems on Graphs	2017-03-22	Paper
Online server allocation in a server farm via benefit task systems	2015-02-27	Paper
https://portal.mardi4nfdi.de/entity/Q2934610	2014-12-18	Paper
https://portal.mardi4nfdi.de/entity/Q2934613	2014-12-18	Paper
Optimal Bounds for Johnson-Lindenstrauss Transforms and Streaming Problems with Subconstant Error	2014-12-05	Paper
The Data Stream Space Complexity of Cascaded Norms	2014-07-25	Paper
https://portal.mardi4nfdi.de/entity/Q5417617	2014-05-22	Paper
https://portal.mardi4nfdi.de/entity/Q3002795	2011-05-24	Paper
Two applications of information complexity	2010-08-16	Paper
Cell-probe lower bounds for the partial match problem	2010-08-16	Paper
Exponential separation of quantum and classical one-way communication complexity	2010-08-15	Paper
https://portal.mardi4nfdi.de/entity/Q3579381	2010-08-06	Paper
Approximate counting of inversions in a data stream	2010-08-05	Paper
Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND	2009-10-28	Paper
Exponential Separation of Quantum and Classical One-Way Communication Complexity	2009-03-16	Paper
Lower bounds for randomized read/write stream algorithms	2009-01-05	Paper
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques	2005-08-25	Paper
Cell-probe lower bounds for the partial match problem	2004-11-18	Paper
An information statistics approach to data stream and communication complexity	2004-08-06	Paper
https://portal.mardi4nfdi.de/entity/Q4440423	2003-12-17	Paper
Time-space tradeoffs for branching programs	2002-07-04	Paper
Tighter bounds on preemptive job shop scheduling with two machines	2001-10-16	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: T. S. Jayram