Search the dblp DataBase

Publications of Author

1. Jessica H. Fong, Anna C. Gilbert, Sampath Kannan, Martin J. Strauss
   Better Alternatives to OSPF Routing. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 2005, v:43, n:1-2, pp:113-131 [Journal]
   
2. Edith Cohen, Martin J. Strauss
   Maintaining time-decaying stream aggregates. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2006, v:59, n:1, pp:19-36 [Journal]
   
3. Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin J. Strauss, Rebecca N. Wright
   Secure multiparty computation of approximations. [Citation Graph (0, 0)][DBLP]
   ACM Transactions on Algorithms, 2006, v:2, n:3, pp:435-472 [Journal]
   
4. Joel A. Tropp, Anna C. Gilbert, Martin J. Strauss
   Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit. [Citation Graph (0, 0)][DBLP]
   Signal Processing, 2006, v:86, n:3, pp:572-588 [Journal]
   
5. Yuval Ishai, Tal Malkin, Martin J. Strauss, Rebecca N. Wright
   Private Multiparty Sampling and Approximation of Vector Combinations. [Citation Graph (0, 0)][DBLP]
   ICALP, 2007, pp:243-254 [Conf]
   
6. Anna C. Gilbert, Martin J. Strauss, Joel A. Tropp, Roman Vershynin
   One sketch for all: fast algorithms for compressed sensing. [Citation Graph (0, 0)][DBLP]
   STOC, 2007, pp:237-246 [Conf]
   
7. Martin J. Strauss, Xuan Zheng
   Private Approximate Heavy Hitters [Citation Graph (0, 0)][DBLP]
   CoRR, 2006, v:0, n:, pp:- [Journal]
   
8. A. Robert Calderbank, Anna C. Gilbert, Martin J. Strauss
   List decoding of noisy Reed-Muller-like codes [Citation Graph (0, 0)][DBLP]
   CoRR, 2006, v:0, n:, pp:- [Journal]
   
9. Anna C. Gilbert, Martin J. Strauss, Joel A. Tropp, Roman Vershynin
   Algorithmic linear dimension reduction in the l_1 norm for sparse vectors [Citation Graph (0, 0)][DBLP]
   CoRR, 2006, v:0, n:, pp:- [Journal]
   
10. 
    Sparse Gradient Image Reconstruction Done Faster. [Citation Graph (, )][DBLP]
    
    
11. 
    Near-optimal Bayesian localization via incoherence and sparsity. [Citation Graph (, )][DBLP]
    
    
12. 
    Space-optimal heavy hitters with strong error bounds. [Citation Graph (, )][DBLP]
    
    
13. 
    Approximate sparse recovery: optimizing time and measurements. [Citation Graph (, )][DBLP]
    
    
14. 
    Fast Private Norm Estimation and Heavy Hitters. [Citation Graph (, )][DBLP]
    
    
15. 
    Fundamental performance bounds for a compressive sampling system. [Citation Graph (, )][DBLP]
    
    
16. 
    Combining geometry and combinatorics: A unified approach to sparse signal recovery [Citation Graph (, )][DBLP]
    
    
17. 
    Approximate Sparse Recovery: Optimizing Time and Measurements [Citation Graph (, )][DBLP]