…study CS, but I did read several books on algorithms. Especially notable is the seven-volume work "The Art of Computer Programming" by Donald Knuth; in particular the volumes "Fundamental Algorithms", "Sorting and Searching", and "Seminumerical Algorithms" are timeless masterpieces, entertaining and witty, and they totally nail their subject-matter. If you think CS is equivalent to "algorithms", then read these books. N.B.…
……这种保证本质上是应用数学（即计算机科学）中的一个定理。关于如何证明这类定理，一个极好的范例自然是 D. Knuth 的《计算机程序设计艺术》第 3 卷《排序与查找》。话说回来，我平时只要用堆排序就心满意足了，根本懒得去折腾平均表现更快的东西。
…Such a guarantee is essentially a theorem in applied math called computer science. A good example of how to prove such theorems is, of course, in D. Knuth, The Art of Computer Programming, Volume 3, Sorting and Searching. Again, I have been happy just to use heap sort and forget about looking for anything faster on average.
……核心的计算机科学基础，用某种常见的面向过程编程语言写点简单练习的代码，去图书馆借一本 D. Knuth 的《计算机程序设计艺术》第 3 卷《排序与查找》，搞懂大 O 表示法、堆数据结构和堆排序，作为练习写个程序，比如基于堆数据结构实现一个优先级队列，学习 Gleason 界以及堆排序是如何达到它的……
…the essential computer science, write some code in some common procedural programming language for some simple exercises, check out at the library D. Knuth's The Art of Computer Programming, Volume 3, Sorting and Searching, learn about big-O notation, the heap data structure and heap sort, as an exercise program, say, a priority queue based on the heap data structure, learn about the Gleason bound and how heap sort achieves it…
……促使我下载了 Lisp in a Box，然后买了那本二手书。最近重温时，这本书就像彗星周期一样在我的书单里进进出出。+ 《计算机程序设计艺术：第 3 卷 排序与查找》大概二十五年前我买了第一卷，大约十五年前我把它捐给了社区广播电台的图书义卖活动 [WMNF 88.5]。我花了大约 25 美元（含运费）买了二手……
…become got me to download Lisp in a Box and then buy the used copy. Currently visiting, this book orbits in and out of the rotation with a cometary periodicity. + Art of Computer Programming: Volume 3, Sorting and Searching Twenty-five years ago or so I bought volume I and about 15 years I donated it to the community radio station's books sale [WMNF 88.5]. I spent about $25 dollars including shipping for used copies of the…
Knuth, The Art Of Computer Programming V3, Sorting & Searching covered both multiply & shift and modulo prime integer hashing in some detail in its first edition written in the 1960s, published in 1973. While not "modern", Knuth has always been a bona fide classic, especially as regards hashing, and should really be cited by this survey paper, IMO. (EDIT: people now call this "Fibonacci Hashing"
……并没有系统学过 CS，但我确实读过几本关于算法的书。尤其值得一提的是高德纳（Donald Knuth）的七卷巨著《计算机程序设计艺术》；特别是《基本算法》、《排序与查找》和《半数值算法》这几卷，堪称永恒的杰作，幽默风趣，对主题的剖析入木三分。如果你以为 CS 就等于“算法”，那就去读读这些书吧。注意……
…study CS, but I did read several books on algorithms. Especially notable is the seven-volume work "The Art of Computer Programming" by Donald Knuth; in particular the volumes "Fundamental Algorithms", "Sorting and Searching", and "Seminumerical Algorithms" are timeless masterpieces, entertaining and witty, and they totally nail their subject-matter. If you think CS is equivalent to "algorithms", then read these books. N.B.…
我会推荐高德纳《计算机程序设计艺术》的第 3 卷《排序与查找》。内容极其出色，探讨得非常深入。
I would recommend "Sorting and Searching" Volume 3 from Donald Knuth's "The Art of Computer Programming". Fantastic, in-depth read.
……这种保证本质上是应用数学（即计算机科学）中的一个定理。关于如何证明这类定理，一个极好的范例自然是 D. Knuth 的《计算机程序设计艺术》第 3 卷《排序与查找》。话说回来，我平时只要用堆排序就心满意足了，根本懒得去折腾平均表现更快的东西。
…Such a guarantee is essentially a theorem in applied math called computer science. A good example of how to prove such theorems is, of course, in D. Knuth, The Art of Computer Programming, Volume 3, Sorting and Searching. Again, I have been happy just to use heap sort and forget about looking for anything faster on average.
……核心的计算机科学基础，用某种常见的面向过程编程语言写点简单练习的代码，去图书馆借一本 D. Knuth 的《计算机程序设计艺术》第 3 卷《排序与查找》，搞懂大 O 表示法、堆数据结构和堆排序，作为练习写个程序，比如基于堆数据结构实现一个优先级队列，学习 Gleason 界以及堆排序是如何达到它的……
…the essential computer science, write some code in some common procedural programming language for some simple exercises, check out at the library D. Knuth's The Art of Computer Programming, Volume 3, Sorting and Searching, learn about big-O notation, the heap data structure and heap sort, as an exercise program, say, a priority queue based on the heap data structure, learn about the Gleason bound and how heap sort achieves it…
……促使我下载了 Lisp in a Box，然后买了那本二手书。最近重温时，这本书就像彗星周期一样在我的书单里进进出出。+ 《计算机程序设计艺术：第 3 卷 排序与查找》大概二十五年前我买了第一卷，大约十五年前我把它捐给了社区广播电台的图书义卖活动 [WMNF 88.5]。我花了大约 25 美元（含运费）买了二手……
…become got me to download Lisp in a Box and then buy the used copy. Currently visiting, this book orbits in and out of the rotation with a cometary periodicity. + Art of Computer Programming: Volume 3, Sorting and Searching Twenty-five years ago or so I bought volume I and about 15 years I donated it to the community radio station's books sale [WMNF 88.5]. I spent about $25 dollars including shipping for used copies of the…
高德纳在《计算机程序设计艺术》卷三《排序与查找》第一版（写于 20 世纪 60 年代，出版于 1973 年）中，就相当详尽地涵盖了乘法移位哈希和模素数整数哈希。尽管谈不上“现代”，但 Knuth 的书历来是不折不扣的经典，尤其在哈希这一块，依我看这篇综述论文真应该引用它。（补充：人们现在把这叫做“斐波那契哈希”
Knuth, The Art Of Computer Programming V3, Sorting & Searching covered both multiply & shift and modulo prime integer hashing in some detail in its first edition written in the 1960s, published in 1973. While not "modern", Knuth has always been a bona fide classic, especially as regards hashing, and should really be cited by this survey paper, IMO. (EDIT: people now call this "Fibonacci Hashing"