Martin Strauss

Martin J. Strauss

2009
55	EE	Yuval Ishai, Tal Malkin, Martin J. Strauss, Rebecca N. Wright: Private multiparty sampling and approximation of vector combinations. Theor. Comput. Sci. 410(18): 1730-1745 (2009)
2008
54	EE	Martin Strauss, Michael Kipp: ERIC: a generic rule-based framework for an affective embodied commentary agent. AAMAS (1) 2008: 97-104
53	EE	Stephen Pfetsch, Tamer Ragheb, Jason N. Laska, Hamid Nejati, Anna C. Gilbert, Martin Strauss, Richard G. Baraniuk, Yehia Massoud: On the feasibility of hardware implementation of sub-Nyquist random-sampling based analog-to-information conversion. ISCAS 2008: 1480-1483
52	EE	Joe Kilian, André Madeira, Martin J. Strauss, Xuan Zheng: Fast Private Norm Estimation and Heavy Hitters. TCC 2008: 176-193
51	EE	R. Berinde, Anna C. Gilbert, Piotr Indyk, Howard J. Karloff, Martin J. Strauss: Combining geometry and combinatorics: A unified approach to sparse signal recovery CoRR abs/0804.4666: (2008)
2007
50	EE	Yuval Ishai, Tal Malkin, Martin J. Strauss, Rebecca N. Wright: Private Multiparty Sampling and Approximation of Vector Combinations. ICALP 2007: 243-254
49	EE	Ray Maleh, Anna C. Gilbert, Martin J. Strauss: Sparse Gradient Image Reconstruction Done Faster. ICIP (2) 2007: 77-80
48	EE	Anna C. Gilbert, Martin J. Strauss, Joel A. Tropp, Roman Vershynin: One sketch for all: fast algorithms for compressed sensing. STOC 2007: 237-246
2006
47	EE	Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin J. Strauss, Rebecca N. Wright: Secure multiparty computation of approximations. ACM Transactions on Algorithms 2(3): 435-472 (2006)
46	EE	A. Robert Calderbank, Anna C. Gilbert, Martin J. Strauss: List decoding of noisy Reed-Muller-like codes CoRR abs/cs/0607098: (2006)
45	EE	Anna C. Gilbert, Martin J. Strauss, Joel A. Tropp, Roman Vershynin: Algorithmic linear dimension reduction in the l_1 norm for sparse vectors CoRR abs/cs/0608079: (2006)
44	EE	Martin J. Strauss, Xuan Zheng: Private Approximate Heavy Hitters CoRR abs/cs/0609166: (2006)
43	EE	Edith Cohen, Martin J. Strauss: Maintaining time-decaying stream aggregates. J. Algorithms 59(1): 19-36 (2006)
42	EE	Joel A. Tropp, Anna C. Gilbert, Martin J. Strauss: Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit. Signal Processing 86(3): 572-588 (2006)
2005
41	EE	S. Muthukrishnan, Martin Strauss, X. Zheng: Workload-Optimal Histograms on Streams. ESA 2005: 734-745
40	EE	A. Robert Calderbank, Anna C. Gilbert, Kirill Levchenko, S. Muthukrishnan, Martin Strauss: Improved range-summable random variable construction algorithms. SODA 2005: 840-849
39	EE	Jessica H. Fong, Anna C. Gilbert, Sampath Kannan, Martin J. Strauss: Better Alternatives to OSPF Routing. Algorithmica 43(1-2): 113-131 (2005)
38	EE	Anna C. Gilbert, Yannis Kotidis, S. Muthukrishnan, Martin Strauss: Domain-Driven Data Synopses for Dynamic Quantiles. IEEE Trans. Knowl. Data Eng. 17(7): 927-938 (2005)
2003
37	EE	S. Muthukrishnan, Martin Strauss: Maintenance of Multidimensional Histograms. FSTTCS 2003: 352-362
36		Joel A. Tropp, Anna C. Gilbert, S. Muthukrishnan, Martin Strauss: Improved sparse approximation over quasiincoherent dictionaries. ICIP (1) 2003: 37-40
35	EE	Edith Cohen, Martin Strauss: Maintaining time-decaying stream aggregates. PODS 2003: 223-233
34	EE	S. Muthukrishnan, Martin Strauss: Rangesum histograms. SODA 2003: 233-242
33	EE	Anna C. Gilbert, S. Muthukrishnan, Martin Strauss: Approximation of functions over redundant dictionaries using coherence. SODA 2003: 243-252
32	EE	Anna C. Gilbert, Yannis Kotidis, S. Muthukrishnan, Martin Strauss: One-Pass Wavelet Decompositions of Data Streams. IEEE Trans. Knowl. Data Eng. 15(3): 541-554 (2003)
2002
31	EE	Sudipto Guha, Piotr Indyk, S. Muthukrishnan, Martin Strauss: Histogramming Data Streams with Fast Per-Item Processing. ICALP 2002: 681-692
30	EE	Anna C. Gilbert, Sudipto Guha, Piotr Indyk, S. Muthukrishnan, Martin Strauss: Near-optimal sparse fourier representations via sampling. STOC 2002: 152-161
29	EE	Anna C. Gilbert, Sudipto Guha, Piotr Indyk, Yannis Kotidis, S. Muthukrishnan, Martin Strauss: Fast, small-space algorithms for approximate histogram maintenance. STOC 2002: 389-398
28	EE	Anna C. Gilbert, Yannis Kotidis, S. Muthukrishnan, Martin Strauss: How to Summarize the Universe: Dynamic Maintenance of Quantiles. VLDB 2002: 454-465
27	EE	Joan Feigenbaum, Sampath Kannan, Martin Strauss, Mahesh Viswanathan: Testing and Spot-Checking of Data Streams. Algorithmica 34(1): 67-80 (2002)
26	EE	Joan Feigenbaum, Sampath Kannan, Martin Strauss, Mahesh Viswanathan: An Approximate L1-Difference Algorithm for Massive Data Streams. SIAM J. Comput. 32(1): 131-151 (2002)
2001
25	EE	Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin Strauss, Rebecca N. Wright: Secure Multiparty Computation of Approximations. ICALP 2001: 927-938
24	EE	Anna C. Gilbert, Yannis Kotidis, S. Muthukrishnan, Martin Strauss: Optimal and Approximate Computation of Summary Statistics for Range Aggregates. PODS 2001
23	EE	Anna C. Gilbert, Yannis Kotidis, S. Muthukrishnan, Martin Strauss: Surfing Wavelets on Streams: One-Pass Summaries for Approximate Aggregate Queries. VLDB 2001: 79-88
22	EE	Jessica H. Fong, Martin Strauss: An Approximate Lp Difference Algorithm for Massive Data Streams. Discrete Mathematics & Theoretical Computer Science 4(2): 301-322 (2001)
2000
21	EE	Joan Feigenbaum, Sampath Kannan, Martin Strauss, Mahesh Viswanathan: Testing and spot-checking of data streams (extended abstract). SODA 2000: 165-174
20	EE	Jessica H. Fong, Martin Strauss: An Approximate Lp-Difference Algorithm for Massive Data Streams. STACS 2000: 193-204
19	EE	Jack H. Lutz, Martin Strauss: Bias Invariance of Small Upper Spans. STACS 2000: 74-86
18		Harry Buhrman, Dieter van Melkebeek, Kenneth W. Regan, D. Sivakumar, Martin Strauss: A Generalization of Resource-Bounded Measure, with Application to the BPP vs. EXP Problem. SIAM J. Comput. 30(2): 576-601 (2000)
1999
17	EE	William Aiello, Aviel D. Rubin, Martin Strauss: Using Smartcards to Secure a Personalized Gambling Device. ACM Conference on Computer and Communications Security 1999: 128-137
16	EE	Joan Feigenbaum, Sampath Kannan, Martin Strauss, Mahesh Viswanathan: An Approximate L1-Difference Algorithm for Massive Data Streams. FOCS 1999: 501-511
15	EE	Haim Kaplan, Martin Strauss, Mario Szegedy: Just the Fax - Differentiating Voice and Fax Phone Lines Using Call Billing Data. SODA 1999: 935-936
1998
14	EE	Matt Blaze, Gerrit Bleumer, Martin Strauss: Divertible Protocols and Atomic Proxy Cryptography. EUROCRYPT 1998: 127-144
13	EE	Matt Blaze, Joan Feigenbaum, Martin Strauss: Compliance Checking in the PolicyMaker Trust Management System. Financial Cryptography 1998: 254-274
12		Harry Buhrman, Dieter van Melkebeek, Kenneth W. Regan, D. Sivakumar, Martin Strauss: A Generalization of Resource-Bounded Measure, With an Application (Extended Abstract). STACS 1998: 161-171
11	EE	Harry Buhrman, Dieter van Melkebeek, Kenneth W. Regan, Martin Strauss, D. Sivakumar: A Generalization of Resource-Bounded Measure, With Application to the BPP vs. EXP Problem Electronic Colloquium on Computational Complexity (ECCC) 5(58): (1998)
1997
10	EE	Jin-yi Cai, D. Sivakumar, Martin Strauss: Constant Depth Circuits and the Lutz Hypothesis. FOCS 1997: 595-604
9		Joan Feigenbaum, Martin Strauss: An Information-Theoretic Treatment of Random-Self-Reducibility (Extended Abstract). STACS 1997: 523-534
8	EE	Yang-Hua Chu, Joan Feigenbaum, Brian A. LaMacchia, Paul Resnick, Martin Strauss: REFEREE: Trust Management for Web Applications. Computer Networks 29(8-13): 953-964 (1997)
7		Martin Strauss: Measure on P: Strength of the Notion. Inf. Comput. 136(1): 1-23 (1997)
6	EE	Martin Strauss: Normal Numbers and Sources for BPP. Theor. Comput. Sci. 178(1-2): 155-169 (1997)
1995
5		Eric Allender, Martin Strauss: Measure on P: Robustness of the Notion. MFCS 1995: 129-138
4		Martin Strauss: Normal Numbers and Sources for BPP. STACS 1995: 515-526
3	EE	Eric Allender, Martin Strauss: Measure on P: Robustness of the Notion Electronic Colloquium on Computational Complexity (ECCC) 2(28): (1995)
1994
2		Eric Allender, Martin Strauss: Measure on Small Complexity Classes, with Applications for BPP FOCS 1994: 807-818
1	EE	Eric Allender, Martin Strauss: Measure on Small Complexity Classes, with Applications for BPP Electronic Colloquium on Computational Complexity (ECCC) 1(4): (1994)

Coauthor Index

1	William Aiello	[17]
2	Eric Allender	[1] [2] [3] [5]
3	Richard G. Baraniuk	[53]
4	R. Berinde	[51]
5	Matt Blaze	[13] [14]
6	Gerrit Bleumer	[14]
7	Harry Buhrman	[11] [12] [18]
8	Jin-yi Cai	[10]
9	A. Robert Calderbank	[40] [46]
10	Yang-Hua Chu	[8]
11	Edith Cohen	[35] [43]
12	Joan Feigenbaum	[8] [9] [13] [16] [21] [25] [26] [27] [47]
13	Jessica H. Fong	[20] [22] [39]
14	Anna C. Gilbert	[23] [24] [28] [29] [30] [32] [33] [36] [38] [39] [40] [42] [45] [46] [48] [49] [51] [53]
15	Sudipto Guha	[29] [30] [31]
16	Piotr Indyk	[29] [30] [31] [51]
17	Yuval Ishai	[25] [47] [50] [55]
18	Sampath Kannan	[16] [21] [26] [27] [39]
19	Haim Kaplan	[15]
20	Howard J. Karloff	[51]
21	Joe Kilian	[52]
22	Michael Kipp	[54]
23	Yannis Kotidis	[23] [24] [28] [29] [32] [38]
24	Brian A. LaMacchia	[8]
25	Jason N. Laska	[53]
26	Kirill Levchenko	[40]
27	Jack H. Lutz	[19]
28	André Madeira	[52]
29	Ray Maleh	[49]
30	Tal Malkin	[25] [47] [50] [55]
31	Yehia Massoud	[53]
32	Dieter van Melkebeek	[11] [12] [18]
33	S. Muthukrishnan (S. Muthu Muthukrishnan)	[23] [24] [28] [29] [30] [31] [32] [33] [34] [36] [37] [38] [40] [41]
34	Hamid Nejati	[53]
35	Kobbi Nissim	[25] [47]
36	Stephen Pfetsch	[53]
37	Tamer Ragheb	[53]
38	Kenneth W. Regan	[11] [12] [18]
39	Paul Resnick	[8]
40	Aviel D. Rubin	[17]
41	D. Sivakumar	[10] [11] [12] [18]
42	Mario Szegedy	[15]
43	Joel A. Tropp	[36] [42] [45] [48]
44	Roman Vershynin	[45] [48]
45	Mahesh Viswanathan	[16] [21] [26] [27]
46	Rebecca N. Wright	[25] [47] [50] [55]
47	X. Zheng	[41]
48	Xuan Zheng	[44] [52]

Colors in the list of coauthors