Andreas M. Tillmann

Computational Mechanics · 2012

A researcher in the Science corpus: 1 paper; trusts 16 researchers and is trusted by 5 researchers here, as inferred from the citation graph.

Subfields

• Computational Mechanics — 16 citations into it; #6,084 of 10,001 by trust here, #7,501 by citations
• Applied Mathematics — 5 citations into it
• Computer Networks and Communications — 5 citations into it

Whom Andreas M. Tillmann trusts overall

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

1. Joel A. Tropp
2. David L. Donoho
3. Mark A. Davenport
4. Michael Elad
5. Afonso S. Bandeira
6. Richard Baraniuk
7. E.J. Candes
8. Ronald A. DeVore
9. Michael B. Wakin
10. Gitta Kutyniok

Who trusts Andreas M. Tillmann overall

1. Afonso S. Bandeira
2. Andreas Bollig
3. Edgar Dobriban
4. Christoph Studer
5. Dustin G. Mixon

Papers from Andreas M. Tillmann's perspective

Ordered by how strongly the researchers Andreas M. Tillmann trusts endorse each paper. Same corpus, a different order for every researcher.

1. Decoding by linear programming
2. Greed is good: algorithmic results for sparse approximation (IEEE Transactions on Information Theory)
3. Atomic Decomposition by Basis Pursuit
4. A Simple Proof of the Restricted Isometry Property for Random Matrices
5. Compressed sensing and best k-term approximation
6. Sparse Approximate Solutions to Linear Systems
7. Uncertainty principles and ideal atomic decomposition
8. Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ1 minimization
9. Compressed Sensing
10. Regression Shrinkage and Selection via the Lasso

Their papers

• The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing (2012) — 403 citations