A little late to the question, but there are a couple of good resources I found which were extremely useful in getting a good understanding of the field. Aside from the seminal papers you listed, I encourage you to take a look at the texts below. Note that CS is vast field, and there are countless papers on this subject, so do tailor your study to whatever objective you have.
$\textbf{1)}$ Holger Rauhut's text, "Compressive Sensing and Structured Random Matrices".
This text is available online for free when you do a google search of it. The first 100 pages give a very good overview of the different approaches in compressive sensing. It discusses popular conditions for uniform recovery of all s-sparse vectors through the RIP property and also mentions some other conditions which guarantee $l_0-l_1$ minimization equivalence. In addition, the first 100 pages also go into detail on non-uniform recovery via random sampling, which is an integral part of compressive sensing.
$\textbf{2)}$ "The Restricted Isometry Property and Its Implications for Compressed Sensing" by Emmanuel Candes
This short paper gives a very quick overview of Candes/Tao's seminal paper on RIP in compressive sensing. I find this to be very concise if you do not want to delve into the original paper, which is much longer. I think this is a good read for anyone interested in the field because RIP conditions are not only integral to the field, but the proofs to these elegant theorems can be understood with elementary mathematical knowledge.
$\textbf{3)}$ "RIPless theory of Compressive Sensing" by Candes/Plan
This paper contains more recent results to compressive sensing via random sampling. The field itself has moved quite a lot from 2005-2006, and this paper contains an overarching theory for when s-sparse vectors can be recovered exactly from $l_1$-minimization.