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
26
27
28
29
30
31
32
33
34
35
36
|
# 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"][1]. ACM SIGCOMM Computer Communication Review. 15 (4): 44–53. doi:10.1145/318951.319004.
* [The related Algorhyme][2], also by Perlman.
* Guy Lewis Steele, Jr.. "[Debunking the 'Expensive Procedure Call' Myth, or, Procedure Call Implementations Considered Harmful, or, Lambda: The Ultimate GOTO][3]". MIT AI Lab. AI Lab Memo AIM-443. October 1977.
* [What Every Computer Scientist Should Know About Floating-Point Arithmetic][4], by David Goldberg, published in the March, 1991 issue of Computing Surveys. Copyright 1991, Association for Computing Machinery, Inc.
* [RFC 1925][5].
* [The above-cited Thomson NFA paper][6] on regular expressions.
* [The Eight Fallacies of Distributed Computing][7].
* [HAKMEM][8] is another good one. It's _dense_ but rewarding.
* Kahan, William (January 1965), "[Further remarks on reducing truncation errors][9]", Communications of the ACM, 8 (1): 40, doi:10.1145/363707.363723
[1]: https://www.researchgate.net/publication/238778689_An_Algorithm_for_Distributed_computation_of_a_Spanning_Tree_in_an_Extended_LAN
[2]: http://etherealmind.com/algorhyme-radia-perlman/
[3]: https://dspace.mit.edu/bitstream/handle/1721.1/5753/AIM-443.pdf
[4]: https://docs.oracle.com/cd/E19957-01/806-3568/ncg_goldberg.html
[5]: https://www.ietf.org/rfc/rfc1925.txt
[6]: https://www.fing.edu.uy/inco/cursos/intropln/material/p419-thompson.pdf
[7]: http://wiki.c2.com/?EightFallaciesOfDistributedComputing
[8]: http://w3.pppl.gov/~hammett/work/2009/AIM-239-ocr.pdf
[9]: https://dl.acm.org/citation.cfm?id=363723
|
