[0] http://www.cyberciti.biz/tips/howto-crack-wirless-wep-104.ht... "The actual computation takes about 3 seconds"
[1] http://www.renderlab.net/projects/WPA-tables/ "computed hash tables for the 1000 most common SSIDs against a million common passphrases"
[2] http://securityandthe.net/2008/10/12/russian-researchers-ach... "This means that a WPA or WPA2 key could be cracked in days or weeks instead of years."
For WEP, the actual cracking is the easiest part, it's gathering all the IVs that's a hassle.
For WPA, the rainbow tables only cover common SSIDs and passwords, which doesn't really give you a very high probability of cracking it. The research in the third link you posted hasn't been made practical yet, as far as I know.
WPA on the other hand cannot be broken like this. WPA is broken by capturing the handshake between the router and a user. This handshake can then be brute forced with a dictionary. The reason it's so difficult to crack is because the encryption key is salted with the essid of the router making rainbow tables extremely difficult to pre-compute. However, if the user uses a standard essid that came with the router, then pre-computed rainbow tables can most likely be found for it. They can be computed though while capturing the handshake, and I find it's beneficial to create the rainbow tables if you have a large dictionary.
Take a look at aircrack-ng for a lot more detail. This is just a basic overview of it all.