- -

Papers of Note¶

-
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.
-
-
Regular Expression Matching Can Be Simple And Fast, 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 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
-