Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[3]
Hilfe
Suche: Author="Jayram, T.S."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Exponential separation of quantum and classical one-way communication complexity
Ziv Bar-Yossef
,
T.S. Jayram
,
Iordanis Kerenidis
SIAM Journal on Computing
38
(1), 2008, pp. 366-384
Lower bounds for randomized read/write stream algorithms
Paul Beame
,
T.S. Jayram
,
Atri Rudra
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007)
, 2007, pp. 689-698
Exponential separation of quantum and classical one-way communication complexity
Ziv Bar-Yossef
,
T.S. Jayram
,
Iordanis Kerenidis
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, STOC'2004 (Chicago, Illinois, USA, June 13-15, 2004)
, 2004, pp. 128-137
An information statistics approach to data stream and communication complexity
Ziv Bar-Yossef
,
T.S. Jayram
,
Ravi Kumar
,
D. Sivakumar
Journal of Computer and System Sciences
68
(4), 2004, pp. 702-732
Cell-probe lower bounds for the partial match problem
T.S. Jayram
,
Subhash Khot
,
Ravi Kumar
,
Yuval Rabani
Journal of Computer and System Sciences
69
(3), 2004, pp. 435-447
Cell-probe lower bounds for the partial match problem
T.S. Jayram
,
Subhash Khot
,
Ravi Kumar
,
Yuval Rabani
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 667-672
Two applications of information complexity
T.S. Jayram
,
Ravi Kumar
,
D. Sivakumar
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 673-682
Approximate counting of inversions in a data stream
Miklós Ajtai
,
T.S. Jayram
,
Ravi Kumar
,
D. Sivakumar
Proceedings of the 34th Annual ACM Symposium on Theory of Computing, STOC'2002 (Montreal, Quebec, Canada, May 19-21, 2002)
, 2002, pp. 370-379
An information statistics approach to data stream and communication complexity
Ziv Bar-Yossef
,
T.S. Jayram
,
Ravi Kumar
,
D. Sivakumar
Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'2002 (Vancouver, BC, Canada, November 16-19, 2002)
, 2002, pp. 209-218
Time-space tradeoffs for branching programs
Paul Beame
,
T.S. Jayram
,
Michael Saks
Journal of Computer and System Sciences
63
(4), 2001, pp. 542-572
Online server allocation in a server farm via benefit task systems
T.S. Jayram
,
Tracy Kimbrel
,
Robert Krauthgamer
,
Baruch Schieber
,
Maxim Sviridenko
Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, STOC'2001 (Hersonissos, Crete, Greece, July 6-8, 2001)
, 2001, pp. 540-549