ghratch

4 ms·

1.
by ghratch 14y ago
I hope this doesn't come across as snarky, but this is very apropos for me. I'm currently taking 6.856 at MIT, Randomized Algorithms, and one of the core lessons from the class is that random guessing is frequently a superior strategy. You
2.
Goldwasser, Micali Receive ACM Turing Award for Advances in Cryptography(acm.org)
4 points by ghratch 14y ago|0 comments
3.
by ghratch 14y ago
I thought spanning trees were elected/discovered automatically by the routers themselves instead of being manually set up.
4.
by ghratch 14y ago
On Linux you could try using the Fast Reversible Debugger ( https://github.com/fred-dbg/fred ) for its memory-accurate record/replay feature. Full disclosure: I was a contributor on that project at one point.
5.
by ghratch 14y ago
As I stated in a previous comment, it's called "incremental search" and you can do it in vim. Look here for how: http://linuxcommando.blogspot.com/2008/06/smart-case-insensi...
6.
by ghratch 14y ago
How is this better or different than incremental search? Incremental search means it jumps to the first match as soon as you start typing after '/': you don't need to press enter. Try this combination of options to get functionality similar
7.
The Architecture of High-Performance Parallel I/O [pdf](mcs.anl.gov)
1 points by ghratch 14y ago|0 comments
8.
by ghratch 14y ago
I find this extremely interesting. I'm a programmer who has had some mental block when it comes to "real math" (whatever that means). I'm very eager to change how I think about math to try to break through the mental barrier. Do you have an
9.
by ghratch 14y ago
There is an open-source (but Linux only) project called FReD which does reversible debugging for C and C++ programs: https://github.com/fred-dbg/fred It works without modifying the program (e.g. no recompilation step necessary) or the deb