Live data from Hacker News

Ask HN: What is your favorite CS paper?

news.ycombinator.com

101–110 of 265 posts

Re: Ask HN: What is your favorite CS paper?

#102
post #75

I would never call it my "all-time favorite" (no paper qualifies for that title in my book), but Satoshi Nakamoto's paper, "Bitcoin: A Peer-to-Peer Electronic Cash System" deserves a mention here, because it proposed the first-known solution to the double-spending problem in a masterless peer-to-peer network, with Byzantine fault tolerance (i.e., in a manner resistant to fraudulent nodes attempting to game the rules)…

maybe i'm a little stringent but if if isn't peer reviewed and in a journal, i don't consider it a paper.

I guess that, given its impact, it's more peer-reviewed than most published papers.

Re: Ask HN: What is your favorite CS paper?

#103

Without a doubt. Time, Clocks, and the Ordering of Events in a Distributed System. Leslie Lamport. http://amturing.acm.org/p558-lamport.pdf My first introduction to time scales as a partial ordering. Very mind opening.

Your link is throwing a 404 for me. I found it here: https://www.ics.uci.edu/~cs230/reading/time.pdf

Re: Ask HN: What is your favorite CS paper?

#107
post #75

I would never call it my "all-time favorite" (no paper qualifies for that title in my book), but Satoshi Nakamoto's paper, "Bitcoin: A Peer-to-Peer Electronic Cash System" deserves a mention here, because it proposed the first-known solution to the double-spending problem in a masterless peer-to-peer network, with Byzantine fault tolerance (i.e., in a manner resistant to fraudulent nodes attempting to game the rules)…

maybe i'm a little stringent but if if isn't peer reviewed and in a journal, i don't consider it a paper.

Maybe it didn't appear in journals, but certainly has had much more impact than 99% of the papers in the last decade.

An amazing contrast: "Publish or perish" driven research vs "I don't want the fame, I just want to build something useful and practical".

Re: Ask HN: What is your favorite CS paper?

#108
post #20

Kademlia, a P2P distributed hash table. DHTs are very complex from the outside but very simple once you understand the building blocks. https://pdos.csail.mit.edu/~petar/papers/maymounkov-kademlia...

Hmm, I think it's important to understand Chord DHT first and only after that move on to Kademlia, then S/Kademlia and so on.

Re: Ask HN: What is your favorite CS paper?

#110
"On the criteria to be used in decomposing systems into modules" by David Parnas, 1972, the seminal paper where he brings forward the key ideas that would later be called cohesion and coupling.

https://www.cs.umd.edu/class/spring2003/cmsc838p/Design/crit...

Why it was important: you can't build big complex systems without these principles.

Some people say he was instrumental in stopping the Star Wars program, he argued it would be impossible to test outside of war (and therefore doomed).

Post reply on HN