summaryrefslogtreecommitdiff
path: root/docs/papers.md
diff options
context:
space:
mode:
authorOwen Jacobson <owen@grimoire.ca>2020-01-28 23:34:06 -0500
committerOwen Jacobson <owen@grimoire.ca>2020-01-28 23:34:06 -0500
commit34708dfa902afabf4833c25233132e56514915de (patch)
tree0f4fd5c2c8d782885c5b821114b060e89fce1dcd /docs/papers.md
parent9bf334de6a2a17371eae9bcdf342c416332350aa (diff)
parent6a7b97b436a5a20c172e6b04bf0caa37d544fde4 (diff)
Switch to mkdocs.
Diffstat (limited to 'docs/papers.md')
-rw-r--r--docs/papers.md32
1 files changed, 32 insertions, 0 deletions
diff --git a/docs/papers.md b/docs/papers.md
new file mode 100644
index 0000000..cc70b76
--- /dev/null
+++ b/docs/papers.md
@@ -0,0 +1,32 @@
+# Papers of Note
+
+* 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].
+
+* [Regular Expression Matching Can Be Simple And Fast][10], Russ Cox's empirical research into degenerate cases in common regular expression implementations and a proposed implementation based on Thomson's NFA construction.
+
+* [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
+[10]: https://swtch.com/~rsc/regexp/regexp1.html