Travelled to:1 × Denmark
1 × Latvia
1 × Poland
3 × USA
Collaborated with:A.C.Gilbert E.Porat Y.Li R.Berinde G.Cormode P.Indyk Y.Ishai T.Malkin R.N.Wright J.A.Tropp R.Vershynin H.Q.Ngo A.Rudra
Talks about:recoveri (3) spars (3) optim (3) approxim (2) time (2) all (2) multiparti (1) algorithm (1) compress (1) foreach (1)
Person: Martin J. Strauss
DBLP: Strauss:Martin_J=
Contributed to:
20142013
2010
200920072007Wrote 6 papers:
- ICALP-v1-2014-GilbertLPS
- For-All Sparse Recovery in Near-Optimal Time (ACG, YL, EP, MJS), pp. 538–550.
- ICALP-v1-2013-GilbertNPRS
- ℓ2/ℓ2-Foreach Sparse Recovery with Low Risk (ACG, HQN, EP, AR, MJS), pp. 461–472.
- STOC-2010-GilbertLPS #approximate #metric #optimisation
- Approximate sparse recovery: optimizing time and measurements (ACG, YL, EP, MJS), pp. 475–484.
- PODS-2009-BerindeCIS #bound #fault
- Space-optimal heavy hitters with strong error bounds (RB, GC, PI, MJS), pp. 157–166.
- ICALP-2007-IshaiMSW #approximate #multi
- Private Multiparty Sampling and Approximation of Vector Combinations (YI, TM, MJS, RNW), pp. 243–254.
- STOC-2007-GilbertSTV #algorithm #performance #sketching
- One sketch for all: fast algorithms for compressed sensing (ACG, MJS, JAT, RV), pp. 237–246.