点击→阅读原文
关注微信公众号: 人工智能前沿讲习
对话框回复" book1"获取伊利诺伊大学《算法》书
本书是Jeff Erickson即将出版的免费电子教科书《算法》,以及他自1998年以来为伊利诺伊大学厄巴纳香槟分校各种计算机理论课程撰写的其他课堂讲义笔记。
文中包含书籍信息、获取方式、算法笔记、模型笔记等一系列内容,
个人主页:
http://jeffe.cs.illinois.edu/
Jeff Erickson,计算机科学教授,加州大学伯克利分校计算机科学博士毕业,1998年起就职于伊利诺伊大学厄巴那香槟分校(University of Illinois, Urbana-Champaign),研究兴趣领域为算法和数据结构等,主要教授大型算法课程,根据其个人主页信息,他的课堂讲义大受学生欢迎。
单页排版(适用于电脑屏幕观看):
http://jeffe.cs.illinois.edu/teaching/algorithms/book/Algorithms-JeffE.pdf
双页排版(适用于打印):
http://jeffe.cs.illinois.edu/teaching/algorithms/book/Algorithms-JeffE-2up.pdf
GitHub链接(进行错误跟踪):
https://github.com/jeffgerickson/algorithms
网络版本(永久副本):
https://archive.org/details/Algorithms-Jeff-Erickson
前言(8页)
http://jeffe.cs.illinois.edu/teaching/algorithms/book/!!-preface.pdf
简介(20页)
http://jeffe.cs.illinois.edu/teaching/algorithms/book/00-intro.pdf
1、递归(48页)
http://jeffe.cs.illinois.edu/teaching/algorithms/book/01-recursion.pdf
2、回溯法(26页)
http://jeffe.cs.illinois.edu/teaching/algorithms/book/02-backtracking.pdf
3、动态规划(Dynamic Programming) (62页)
http://jeffe.cs.illinois.edu/teaching/algorithms/book/03-dynprog.pdf
4、贪心算法(Greedy Algorithm)(28页)
http://jeffe.cs.illinois.edu/teaching/algorithms/book/04-greedy.pdf
5、基本图形算法(Basic Graph Algorithms)(38页)
http://jeffe.cs.illinois.edu/teaching/algorithms/book/05-graphs.pdf
6、深度优先搜索(Depth-First-Search)(32页)
http://jeffe.cs.illinois.edu/teaching/algorithms/book/06-dfs.pdf
7、最小生成树(Minimum Spanning Tree)(16页)
http://jeffe.cs.illinois.edu/teaching/algorithms/book/07-mst.pdf
8、最短路径(Shortest Paths)(35页)http://jeffe.cs.illinois.edu/teaching/algorithms/book/08-sssp.pdf
9、所有节点对之间的最短路问题(All Pair Shortest Path) (18页)
http://jeffe.cs.illinois.edu/teaching/algorithms/book/09-apsp.pdf
10、最小割与最大流(mincut & maxflow) (26页)
http://jeffe.cs.illinois.edu/teaching/algorithms/book/10-maxflow.pdf
11、流动和切割的应用(Applications of Flows and Cuts)(26页)
http://jeffe.cs.illinois.edu/teaching/algorithms/book/11-maxflowapps.pdf
12、NP-Hardness(50页)
http://jeffe.cs.illinois.edu/teaching/algorithms/book/12-nphard.pdf
以下是与教科书直接相关的更高级材料的注释,这些笔记大致与教科书章节相匹配。A.快速傅立叶变换(Fast Fourier Transform)(17页)
http://jeffe.cs.illinois.edu/teaching/algorithms/notes/A-fft.pdf
B.快速指数算法(Fast Exponential Algorithms)(14页)
http://jeffe.cs.illinois.edu/teaching/algorithms/notes/B-fastexpo.pdf
C.形式语言和自动化的动态编程(Dynamic Programming for Formal Languages and Automata)(7页,未完成)
http://jeffe.cs.illinois.edu/teaching/algorithms/notes/C-automata-dynprog.pdf
D.高级动态规化(Advanced Dynamic Programming )(18页)
http://jeffe.cs.illinois.edu/teaching/algorithms/notes/D-faster-dynprog.pdf
E.拟阵(Matroids)(8页)
http://jeffe.cs.illinois.edu/teaching/algorithms/notes/E-matroids.pdf
F.平衡与伪流(Balances and Pseudoflows)(13页)
http://jeffe.cs.illinois.edu/teaching/algorithms/notes/F-pseudoflows.pdf
G.最小费用流算法(Minimum cost flow)(16页)
http://jeffe.cs.illinois.edu/teaching/algorithms/notes/G-mincostflow.pdf
H.线性规划(Linear Programming)(21页)
http://jeffe.cs.illinois.edu/teaching/algorithms/notes/H-lp.pdf
I.线性规划算法(Linear Programming Algorithms)(18页)
http://jeffe.cs.illinois.edu/teaching/algorithms/notes/I-simplex.pdf
J.近似算法(Approximation Algorithms)(25页)
http://jeffe.cs.illinois.edu/teaching/algorithms/notes/J-approx.pdf
1、离散概率(Discrete Probability)(22页)
http://jeffe.cs.illinois.edu/teaching/algorithms/notes/01-random.pdf
2、螺丝和螺帽(Nuts and Bolts)(13页)
http://jeffe.cs.illinois.edu/teaching/algorithms/notes/02-nutsbolts.pdf
3、Treaps and Skip Lists(14页)
http://jeffe.cs.illinois.edu/teaching/algorithms/notes/03-treaps.pdf
4、Tail Inequalities(10页)
http://jeffe.cs.illinois.edu/teaching/algorithms/notes/04-chernoff.pdf
5、哈希算法(Hashing)(19页)
http://jeffe.cs.illinois.edu/teaching/algorithms/notes/05-hashing.pdf
6、Filtering and Streaming(6页)
http://jeffe.cs.illinois.edu/teaching/algorithms/notes/06-bloom.pdf
7、字符串匹配(String Matching)(14页)
http://jeffe.cs.illinois.edu/teaching/algorithms/notes/07-strings.pdf
8、Randomized Minimum Cut(7页)
http://jeffe.cs.illinois.edu/teaching/algorithms/notes/08-mincut.pdf
9、平摊分析(Amortized Analysis)(14页)
http://jeffe.cs.illinois.edu/teaching/algorithms/notes/09-amortize.pdf
10、Scapegoat and Splay Trees(15页)
http://jeffe.cs.illinois.edu/teaching/algorithms/notes/10-scapegoat-splay.pdf
11、并查集(Disjoint Set)(14页)
http://jeffe.cs.illinois.edu/teaching/algorithms/notes/11-union-find.pdf
12、Lower Bounds(6页)
http://jeffe.cs.illinois.edu/teaching/algorithms/notes/12-lowerbounds.pdf
13、对手论据(8页)
http://jeffe.cs.illinois.edu/teaching/algorithms/notes/13-adversary.pdf
附录I.归纳证明(30页)
http://jeffe.cs.illinois.edu/teaching/algorithms/notes/98-induction.pdf
附录II.解决复发问题(22页)
http://jeffe.cs.illinois.edu/teaching/algorithms/notes/99-recurrences.pdf
这些笔记涵盖了CS 374中出现的自动化和形式语言的超全资料,其中一些笔记非常精确详细。
合集(155页):
http://jeffe.cs.illinois.edu/teaching/algorithms/models/all-models.pdf
封面和前言(3页)
http://jeffe.cs.illinois.edu/teaching/algorithms/models/0-cover.pdf
1、字符串(Strings)(17页)
http://jeffe.cs.illinois.edu/teaching/algorithms/models/01-strings.pdf
2、常规语言(Regular languages)(12页)
http://jeffe.cs.illinois.edu/teaching/algorithms/models/02-regular.pdf
3、有限状态机(Finite-state automata)(24页)
http://jeffe.cs.illinois.edu/teaching/algorithms/models/03-automata.pdf
4、不确定性自动机(Nondeterministic automata )(21页)
http://jeffe.cs.illinois.edu/teaching/algorithms/models/04-nfa.pdf
5、上下文无关语言(Context-free languages)(20页)
http://jeffe.cs.illinois.edu/teaching/algorithms/models/05-context-free.pdf
6、图灵机(Turing machings)(20页)
http://jeffe.cs.illinois.edu/teaching/algorithms/models/06-turing-machines.pdf
7、不可判定性(Undecidability )(20页)
http://jeffe.cs.illinois.edu/teaching/algorithms/models/07-undecidable.pdf
8、Universal models(8页,未完成)
http://jeffe.cs.illinois.edu/teaching/algorithms/models/08-universal.pdf
9、非确定性图灵机(Nondeterministic Turing machines)(6页,未完成)
http://jeffe.cs.illinois.edu/teaching/algorithms/models/09-nondeterminism.pdf
原文链接地址:http://jeffe.cs.illinois.edu/teaching/algorithms