1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
|
# Papers of Note
On Slack:
> [Ben W](https://twitter.com/bwarren24):
>
> What are people's favorite CS papers?
* Perlman, Radia (1985). "An Algorithm for Distributed Computation of a Spanning Tree in an Extended LAN". ACM SIGCOMM Computer Communication Review. 15 (4): 44–53. doi:10.1145/318951.319004.
* The related Algorhyme, also by Perlman.
* Guy Lewis Steele, Jr.. "Debunking the 'Expensive Procedure Call' Myth, or, Procedure Call Implementations Considered Harmful, or, Lambda: The Ultimate GOTO". MIT AI Lab. AI Lab Memo AIM-443. October 1977.
* What Every Computer Scientist Should Know About Floating-Point Arithmetic, by David Goldberg, published in the March, 1991 issue of Computing Surveys. Copyright 1991, Association for Computing Machinery, Inc.
* RFC 1925.
* The above-cited Thomson NFA paper on regular expressions.
* The Eight Fallacies of Distributed Computing.
* HAKMEM is another good one. It's _dense_ but rewarding.
* Kahan, William (January 1965), "Further remarks on reducing truncation errors", Communications of the ACM, 8 (1): 40, doi:10.1145/363707.363723
|
