There is (was?) also Gnokii [1] for old Nokia phones, which I've used successfully. I even managed to port a small part of it to Arduino to send a message automatically (code [2] and write-up [3]), but these days there are shields with much better interfaces than the Nokia FBus (e.g. using the SIM900 chip [4]).

1: http://www.gnokii.org/ 2: https://github.com/giech/arduino_nokia_6310i 3: https://ilias.giechaskiel.com/posts/arduino_sms/index.html 4: http://www.simcom.ee/modules/gsm-gprs/sim900/

Thanks for this! It's really hard to browse/search for MOOCs.

That said, looking at your site now it does seem to have a problem with courses being listed as "always available". A couple of examples:

[1] https://www.coursebuffet.com/course/1081/202-Logic:-Language... [2] https://www.coursebuffet.com/course/1253/270-Digital-Systems

Thanks for letting us know. We are working on a new way of updating courses dates/course status.

It can, but it is highly non-trivial. Here are a couple of 2015 papers on OpenSSL verification from the same group at Princeton:

SHA verification (ACM TOPLAS): https://www.cs.princeton.edu/~appel/papers/verif-sha.pdf

HMAC verification (Usenix Security): http://www.cs.princeton.edu/~appel/papers/verified-hmac.pdf

There is also this (unrelated) repository for doing more hardware-oriented hacks (i.e. programming the microcontroller): https://github.com/dekuNukem/Amazon_Dash_Button

Edit: Just saw that this was also posted in this comment's thread https://news.ycombinator.com/item?id=10075734

Sorry if this is not the correct way to phrase this, but why post this again when it was on the front page less than a week ago? https://news.ycombinator.com/item?id=9938893

Why did you not ask the same question when the link was posted 5 days ago? That was the second time it was submitted by the same person in as many days. The real question is who cares? If it gets voted to the front page it is because people want to see it...

Selected Papers in Anonymity -- xvirk 8 hours ago 3 comments (http://freehaven.net/anonbib/)

Selected Papers in Anonymity -- ShaneWilton 6 days ago 14 comments (http://freehaven.net/anonbib/date.html#)

Selected Papers in Anonymity -- ShaneWilton 7 days ago 0 comments (http://freehaven.net/anonbib/date.html)

Selected Papers in Anonymity -- sj4nz a year ago 0 comments (http://freehaven.net/anonbib/#2014)

Anonbib - Selected Papers in Anonymity -- fs111 4 years ago 0 comments (http://www.freehaven.net/anonbib/)

Selected Papers in Anonymity [1977-2010] -- gbrindisi 5 years ago 0 comments (http://freehaven.net/anonbib/topic.html)

Because it had been posted over a year ago prior to being posted a week ago. And yes, you are right in pointing out that the same person submitted it twice in two days, but the first time it appears that nobody saw it. IMO, this is within the HN repost guidelines, but that's a matter of interpretation.

But I agree with you that "If it gets voted to the front page it is because people want to see it..."

On a more serious note, targeted ads when implemented incorrectly can lead to privacy violations by leaking information about the viewer of the ad: http://theory.stanford.edu/~korolova/Privacy_violations_usin...

Not related to this year's competition, but you may also be interested in the hall of fame [1], which contains many well-known names.

[1] https://www.imo-official.org/hall.aspx

My anecdotal experience is that most may start with math for their first degree, but then (or during) pivot to some related but more applied area like CS, Econ, etc.

His Philosophy-Complexity paper is also fantastic, in case you have not read it already: http://www.scottaaronson.com/papers/philos.pdf

It has also been discussed most recently here: https://news.ycombinator.com/item?id=9061744

Thanks. I'll definitely be reading those.

Aaronson's talk on Computational Complexity and the Anthropic Principle [1] also looks interesting.

[1] http://www.scottaaronson.com/talks/anthropic.html

The idea is that as time goes by, computers become twice as fast (Moore's law), but problems also become twice as big. With a quadratic algorithm, you will need twice as much time to solve the problems of the bigger size, even on the faster computer. See page 22 of http://www.cs.princeton.edu/courses/archive/spr15/cos126/lec...