Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarMartin Strauss 0001
Martin J. Strauss
Person information
- affiliation: University of Michigan, Ann Arbor, MI, USA
- affiliation (1997 - 2004): AT&T Labs-Research, Florham Park, NJ, USA
- affiliation (PhD 1996): Rutgers University, New Brunswick, NJ, USA
Other persons with the same name
- Martin Strauss
- Martin Strauss 0002 — DFKI, Saarbrücken, Germany
- Martin Strauss 0003 — University of Erlangen-Nuremberg, Digital Sports Group, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – today
- 2018
[r2]- 2017
- [j21]Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss:
For-All Sparse Recovery in Near-Optimal Time. ACM Trans. Algorithms 13(3): 32:1-32:26 (2017) - [i14]Amanda Bower, Sarah N. Kitchen, Laura Niss, Martin J. Strauss, Alexander Vargas, Suresh Venkatasubramanian:
Fair Pipelines. CoRR abs/1707.00391 (2017) - 2016
- [p1]S. Muthukrishnan, Martin Strauss:
Approximate Histogram and Wavelet Summaries of Streaming Data. Data Stream Management 2016: 263-281 - 2015
- [j20]Petros Boufounos, Volkan Cevher, Anna C. Gilbert, Yi Li, Martin J. Strauss:
What's the Frequency, Kenneth?: Sublinear Fourier Sampling Off the Grid. Algorithmica 73(2): 261-288 (2015) - 2014
- [c46]Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss:
For-All Sparse Recovery in Near-Optimal Time. ICALP (1) 2014: 538-550 - [i13]Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss:
For-all Sparse Recovery in Near-Optimal Time. CoRR abs/1402.1726 (2014) - 2013
- [c45]Anna C. Gilbert, Hung Q. Ngo, Ely Porat, Atri Rudra, Martin J. Strauss:
ℓ2/ℓ2-Foreach Sparse Recovery with Low Risk. ICALP (1) 2013: 461-472 - [i12]Anna C. Gilbert, Hung Q. Ngo, Ely Porat, Atri Rudra, Martin J. Strauss:
L2/L2-foreach sparse recovery with low risk. CoRR abs/1304.6232 (2013) - 2012
- [j19]Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss:
Approximate Sparse Recovery: Optimizing Time and Measurements. SIAM J. Comput. 41(2): 436-453 (2012) - [c44]Petros Boufounos, Volkan Cevher, Anna C. Gilbert, Yi Li, Martin J. Strauss:
What's the Frequency, Kenneth?: Sublinear Fourier Sampling Off the Grid. APPROX-RANDOM 2012: 61-72 - [c43]Anna C. Gilbert, Brett Hemenway, Atri Rudra, Martin J. Strauss, Mary Wootters:
Recovering simple signals. ITA 2012: 382-391 - [c42]
- [c41]Anna C. Gilbert, Brett Hemenway, Martin J. Strauss, David P. Woodruff, Mary Wootters:
Reusable low-error compressive sampling schemes through privacy. SSP 2012: 536-539 - 2011
- [c40]Brett Hemenway, Rafail Ostrovsky, Martin J. Strauss, Mary Wootters:
Public Key Locally Decodable Codes with Short Keys. APPROX-RANDOM 2011: 605-615 - [i11]Brett Hemenway, Rafail Ostrovsky, Martin Strauss, Mary Wootters:
Public Key Locally Decodable Codes with Short Keys. Electronic Colloquium on Computational Complexity (ECCC) 18: 118 (2011) - 2010
- [j18]Radu Berinde, Piotr Indyk, Graham Cormode, Martin J. Strauss:
Space-optimal heavy hitters with strong error bounds. ACM Trans. Database Syst. 35(4): 26:1-26:28 (2010) - [c39]Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss:
Approximate sparse recovery: optimizing time and measurements. STOC 2010: 475-484 - [i10]Ely Porat, Martin J. Strauss:
Sublinear Time, Measurement-Optimal, Sparse Recovery For All. CoRR abs/1012.1886 (2010)
2000 – 2009
- 2009
- [j17]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) - [c38]Volkan Cevher, Petros Boufounos, Richard G. Baraniuk, Anna C. Gilbert, Martin J. Strauss:
Near-optimal Bayesian localization via incoherence and sparsity. IPSN 2009: 205-216 - [c37]Radu Berinde, Graham Cormode, Piotr Indyk, Martin J. Strauss:
Space-optimal heavy hitters with strong error bounds. PODS 2009: 157-166 - [r1]
- [i9]Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss:
Approximate Sparse Recovery: Optimizing Time and Measurements. CoRR abs/0912.0229 (2009) - 2008
- [c36]Anna C. Gilbert, Martin J. Strauss:
Fundamental performance bounds for a compressive sampling system. ICASSP 2008: 3841-3844 - [c35]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 - [c34]Joe Kilian, André Madeira, Martin J. Strauss, Xuan Zheng:
Fast Private Norm Estimation and Heavy Hitters. TCC 2008: 176-193 - [i8]Radu 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
- [j16]Anna C. Gilbert, Martin J. Strauss:
Analysis of Data Streams: Computational and Algorithmic Challenges. Technometrics 49(3): 346-356 (2007) - [c33]Yuval Ishai, Tal Malkin, Martin J. Strauss, Rebecca N. Wright:
Private Multiparty Sampling and Approximation of Vector Combinations. ICALP 2007: 243-254 - [c32]Mark A. Iwen, Gurjit S. Mandair, Michael D. Morris, Martin Strauss:
Fast Line-Based Imaging of Small Sample Features. ICASSP (1) 2007: 421-424 - [c31]Ray Maleh, Anna C. Gilbert, Martin J. Strauss:
Sparse Gradient Image Reconstruction Done Faster. ICIP (2) 2007: 77-80 - [c30]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
- [j15]Edith Cohen, Martin J. Strauss:
Maintaining time-decaying stream aggregates. J. Algorithms 59(1): 19-36 (2006) - [j14]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) - [j13]Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin J. Strauss, Rebecca N. Wright:
Secure multiparty computation of approximations. ACM Trans. Algorithms 2(3): 435-472 (2006) - [i7]A. Robert Calderbank, Anna C. Gilbert, Martin J. Strauss:
List decoding of noisy Reed-Muller-like codes. CoRR abs/cs/0607098 (2006) - [i6]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) - [i5]
- 2005
- [j12]Jessica H. Fong, Anna C. Gilbert, Sampath Kannan, Martin J. Strauss:
Better Alternatives to OSPF Routing. Algorithmica 43(1-2): 113-131 (2005) - [j11]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) - [c29]S. Muthukrishnan, Martin Strauss, Xian Zheng:
Workload-Optimal Histograms on Streams. ESA 2005: 734-745 - [c28]Joel A. Tropp, Anna C. Gilbert, Martin J. Strauss:
Simultaneous sparse approximation via greedy pursuit. ICASSP (5) 2005: 721-724 - [c27]A. Robert Calderbank, Anna C. Gilbert, Kirill Levchenko, S. Muthukrishnan, Martin Strauss:
Improved range-summable random variable construction algorithms. SODA 2005: 840-849 - 2003
- [j10]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) - [c26]
- [c25]Joel A. Tropp, Anna C. Gilbert, S. Muthukrishnan, Martin Strauss:
Improved sparse approximation over quasiincoherent dictionaries. ICIP (1) 2003: 37-40 - [c24]
- [c23]
- [c22]Anna C. Gilbert, S. Muthukrishnan, Martin Strauss:
Approximation of functions over redundant dictionaries using coherence. SODA 2003: 243-252 - 2002
- [j9]Joan Feigenbaum, Sampath Kannan, Martin Strauss, Mahesh Viswanathan:
Testing and Spot-Checking of Data Streams. Algorithmica 34(1): 67-80 (2002) - [j8]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) - [c21]Sudipto Guha, Piotr Indyk, S. Muthukrishnan, Martin Strauss:
Histogramming Data Streams with Fast Per-Item Processing. ICALP 2002: 681-692 - [c20]Anna C. Gilbert, Sudipto Guha, Piotr Indyk, S. Muthukrishnan, Martin Strauss:
Near-optimal sparse fourier representations via sampling. STOC 2002: 152-161 - [c19]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 - [c18]Anna C. Gilbert, Yannis Kotidis, S. Muthukrishnan, Martin Strauss:
How to Summarize the Universe: Dynamic Maintenance of Quantiles. VLDB 2002: 454-465 - 2001
- [j7]Jessica H. Fong, Martin Strauss:
An Approximate Lp Difference Algorithm for Massive Data Streams. Discrete Mathematics & Theoretical Computer Science 4(2): 301-322 (2001) - [c17]Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin Strauss, Rebecca N. Wright:
Secure Multiparty Computation of Approximations. ICALP 2001: 927-938 - [c16]Anna C. Gilbert, Yannis Kotidis, S. Muthukrishnan, Martin Strauss:
Optimal and Approximate Computation of Summary Statistics for Range Aggregates. PODS 2001 - [c15]Anna C. Gilbert, Yannis Kotidis, S. Muthukrishnan, Martin Strauss:
Surfing Wavelets on Streams: One-Pass Summaries for Approximate Aggregate Queries. VLDB 2001: 79-88 - [i4]Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin Strauss, Rebecca N. Wright:
Secure Multiparty Computation of Approximations. IACR Cryptology ePrint Archive 2001: 24 (2001) - 2000
- [j6]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) - [c14]Joan Feigenbaum, Sampath Kannan, Martin Strauss, Mahesh Viswanathan:
Testing and spot-checking of data streams (extended abstract). SODA 2000: 165-174 - [c13]
- [c12]Jessica H. Fong, Martin Strauss:
An Approximate Lp-Difference Algorithm for Massive Data Streams. STACS 2000: 193-204
1990 – 1999
- 1999
- [c11]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 - [c10]Joan Feigenbaum, Sampath Kannan, Martin Strauss, Mahesh Viswanathan:
An Approximate L1-Difference Algorithm for Massive Data Streams. FOCS 1999: 501-511 - [c9]Haim Kaplan, Martin Strauss, Mario Szegedy:
Just the Fax - Differentiating Voice and Fax Phone Lines Using Call Billing Data. SODA 1999: 935-936 - 1998
- [c8]Matt Blaze, Gerrit Bleumer, Martin Strauss:
Divertible Protocols and Atomic Proxy Cryptography. EUROCRYPT 1998: 127-144 - [c7]Matt Blaze, Joan Feigenbaum, Martin Strauss:
Compliance Checking in the PolicyMaker Trust Management System. Financial Cryptography 1998: 254-274 - [c6]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 - [i3]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
- [j5]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) - [j4]Matt Blaze, Joan Feigenbaum, Paul Resnick, Martin Strauss:
Managing trust in an information-labeling system. European Transactions on Telecommunications 8(5): 491-501 (1997) - [j3]
- [j2]
- [j1]Yang-Hua Chu, Joan Feigenbaum, Brian A. LaMacchia, Paul Resnick, Martin Strauss:
Referee: trust management for Web applications. World Wide Web Journal 2: 127-139 (1997) - [c5]Jin-yi Cai, D. Sivakumar, Martin Strauss:
Constant Depth Circuits and the Lutz Hypothesis. FOCS 1997: 595-604 - [c4]Joan Feigenbaum, Martin Strauss:
An Information-Theoretic Treatment of Random-Self-Reducibility (Extended Abstract). STACS 1997: 523-534 - 1995
- [c3]
- [c2]
- [i2]Eric Allender, Martin Strauss:
Measure on P: Robustness of the Notion. Electronic Colloquium on Computational Complexity (ECCC) 2(28) (1995) - 1994
- [c1]Eric Allender, Martin Strauss:
Measure on Small Complexity Classes, with Applications for BPP. FOCS 1994: 807-818 - [i1]Eric Allender, Martin Strauss:
Measure on Small Complexity Classes, with Applications for BPP. Electronic Colloquium on Computational Complexity (ECCC) 1(4) (1994)
Coauthor Index
maintained by 
, founded at 
, founded at 
last updated on 2019-02-16 23:20 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
