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
Hilfe
Suche: Author="Strauss, Martin"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
For-all sparse recovery in near-optimal time
Anna C. Gilbert
,
Yi Li
,
Ely Porat
,
Martin J. Strauss
Lecture Notes in Computer Science
8572
, 2014, pp. 538-550
\ell_2/\ell_2
-foreach sparse recovery with low risk
Anna C. Gilbert
,
Hung Q. Ngo
,
Ely Porat
,
Atri Rudra
,
Martin J. Strauss
Lecture Notes in Computer Science
7965
, 2013, pp. 461-472
Approximate sparse recovery: Optimizing time and measurements
Anna C. Gilbert
,
Yi Li
,
Ely Porat
,
Martin J. Strauss
SIAM Journal on Computing
41
(2), 2012, pp. 436-453
Approximate sparse recovery: Optimizing time and measurements
Anna C. Gilbert
,
Yi Li
,
Ely Porat
,
Martin J. Strauss
Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC'2010 (Cambridge, Massachusetts, June 5-8, 2010)
, 2010, pp. 475-484
Private multiparty sampling and approximation of vector combinations
Yuval Ishai
,
Tal Malkin
,
Martin J. Strauss
,
Rebecca N. Wright
Theoretical Computer Science
410
(18), 2009, pp. 1730-1745
Private multiparty sampling and approximation of vector combinations
Yuval Ishai
,
Tal Malkin
,
Martin J. Strauss
,
Rebecca N. Wright
Lecture Notes in Computer Science
4596
, 2007, pp. 243-254
Maintaining time-decaying stream aggregates
Edith Cohen
,
Martin J. Strauss
Journal of Algorithms
59
(1), 2006, pp. 19-36
Better alternatives to OSFP routing
Jessica H. Fong
,
Anna C. Gilbert
,
Sampath Kannan
,
Martin J. Strauss
Algorithmica
43
(1-2), 2005, pp. 113-131
Maintenance of multidimensional histograms
S. Muthukrishnan
,
Martin Strauss
Lecture Notes in Computer Science
2914
, 2003, pp. 352-362
An approximate
L^1
-difference algorithm for massive data streams
Joan Feigenbaum
,
Sampath Kannan
,
Martin J. Strauss
,
Mahesh Viswanathan
SIAM Journal on Computing
32
(1), 2002-2003, pp. 131-151
Fast, small-space algorithms for approximate histogram maintenance
Anna C. Gilbert
,
Sudipto Guha
,
Piotr Indyk
,
Yannis Kotidis
,
S. Muthukrishnan
,
Martin J. Strauss
Proceedings of the 34th Annual ACM Symposium on Theory of Computing, STOC'2002 (Montreal, Quebec, Canada, May 19-21, 2002)
, 2002, pp. 389-398
Histogramming data streams with fast per-item processing
Sudipto Guha
,
Piotr Indyk
,
S. Muthukrishnan
,
Martin J. Strauss
Lecture Notes in Computer Science
2380
, 2002, pp. 681-692
Secure multiparty computation of approximations
Joan Feigenbaum
,
Yuval Ishai
,
Tal Malkin
,
Kobbi Nissim
,
Martin J. Strauss
,
Rebecca N. Wright
Lecture Notes in Computer Science
2076
, 2001, pp. 927-938
A generalization of resource-bounded measure, with application to the BPP vs. EXP problem
Harry Buhrman
,
Dieter van Melkebeek
,
Kenneth W. Regan
,
D. Sivakumar
,
Martin Strauss
SIAM Journal on Computing
30
(2), 2000, pp. 576-601
An approximate
\L^p
-difference algorithm for massive data streams
Jessica H. Fong
,
Martin J. Strauss
Lecture Notes in Computer Science
1770
, 2000, pp. 193-204
Bias invariance of small upper spans
Jack H. Lutz
,
Martin J. Strauss
Lecture Notes in Computer Science
1770
, 2000, pp. 74-86
Just the fax - Differentiating voice and fax phone lines using call billing data
Haim Kaplan
,
Martin Strauss
,
Mario Szegedy
Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'99 (Baltimore, Maryland, January 17-19, 1999)
, 1999, pp. 935-936
A generalization of resource-bounded measure, with an application
Harry Buhrman
,
Dieter van Melkebeek
,
Kenneth W. Regan
,
D. Sivakumar
,
Martin Strauss
Lecture Notes in Computer Science
1373
, 1998, pp. 161-171
Constant depth circuits and the Lutz hypothesis
Jin-Yi Cai
,
D. Sivakumar
,
Martin Strauss
Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, FOCS'97 (Miami Beach, Florida, October 20-22, 1997)
, 1997, pp. 595-604
An information-theoretic treatment of random-self-reducibility
Joan Feigenbaum
,
Martin Strauss
Lecture Notes in Computer Science
1200
, 1997, pp. 523-534
Measure on P: Strength of the notion
Martin Strauss
Information and Computation
136
(1), 1997, pp. 1-23
Normal numbers and sources for BPP
Martin Strauss
Theoretical Computer Science
178
(1-2), 1997, pp. 155-169
Measure on
P
: Robustness of the notion
Eric Allender
,
Martin Strauss
Lecture Notes in Computer Science
969
, 1995, pp. 129-138
Normal numbers and sources for BPP
Martin Strauss
Lecture Notes in Computer Science
900
, 1995, pp. 515-526
Measure on small complexity classes, with applications for BPP
Eric Allender
,
Martin Strauss
Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994)
, 1994, pp. 807-818