Martin J. Strauss

Computational Mechanics · 2001–2008

A researcher in the Science corpus: 8 papers; trusts 13 researchers and is trusted by 52 researchers here, as inferred from the citation graph.

Subfields

• Computational Mechanics — 32 citations into it; #631 of 10,001 by trust here, #493 by citations
• Artificial Intelligence — 26 citations into it
• Signal Processing — 22 citations into it; #640 of 7,572 by trust here, #770 by citations
• Computer Networks and Communications — 18 citations into it
• Biomedical Engineering — 15 citations into it; #485 of 10,734 by trust here, #2,627 by citations
• Computational Theory and Mathematics — 14 citations into it
• Applied Mathematics — 7 citations into it; #4,086 of 7,620 by trust here, #1,356 by citations
• Algorithms & Complexity — 5 citations into it

Whom Martin J. Strauss trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Joel A. Tropp
2. Piotr Indyk
3. Anna C. Gilbert
4. David L. Donoho
5. E.J. Candes
6. Sudipto Guha

Who trusts Martin J. Strauss overall

1. Yonina C. Eldar
2. S. Muthu Muthukrishnan
3. Anna C. Gilbert
4. Moshe Mishali
5. Gitta Kutyniok
6. Graham Cormode
7. Marco F. Duarte
8. Deanna Needell
9. Shihao Ji
10. Andreas Bollig

Papers from Martin J. Strauss's perspective

Ordered by how strongly the researchers Martin J. Strauss trusts endorse each paper. Same corpus, a different order for every researcher.

1. CoSaMP: Iterative signal recovery from incomplete and inaccurate samples (arXiv.org)
2. High-Dimensional Centrally Symmetric Polytopes with Neighborliness Proportional to Dimension (Discrete & Computational Geometry)
3. Greed is good: algorithmic results for sparse approximation (IEEE Transactions on Information Theory)
4. Uniform Uncertainty Principle and Signal Recovery via Regularized Orthogonal Matching Pursuit (Foundations of Computational Mathematics)
5. Sparse channel estimation via matching pursuit with application to equalization (IEEE Transactions on Communications)
6. Learning decision trees using the Fourier spectrum
7. Near-optimal sparse fourier representations via sampling
8. Data-streams and histograms (Symposium on the Theory of Computing)
9. Analog-to-Information Conversion via Random Demodulation (2006 IEEE Dallas/CAS Workshop on Design, Applications, Integration and Software)
10. Clustering data streams (Proceedings 41st Annual Symposium on Foundations of Computer Science)

Their papers

• Secure multiparty computation of approximations (2001) — 208 citations
• Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit (2006) — 1,400 citations
• One sketch for all: fast algorithms for compressed sensing (2007) — 311 citations
• Combining geometry and combinatorics: A unified approach to sparse signal recovery (2008) — 451 citations
• Simultaneous sparse approximation via greedy pursuit (2005) — 311 citations
• Near-optimal sparse fourier representations via sampling (2002) — 292 citations
• Fast, small-space algorithms for approximate histogram maintenance (2002) — 305 citations
• Surfing Wavelets on Streams: One-Pass Summaries for Approximate Aggregate Queries (2001) — 464 citations