Writing /home/fac/arijit/public_html/dokuwiki/data/cache/0/0f3dae15bd579c4b78137f3d0ad7d105.xhtml failed
Differences
This shows you the differences between two versions of the page.
| Next revision | Previous revision | ||
|
courses:2019:cs503:term_paper [2019/08/20 11:56] arijit created |
courses:2019:cs503:term_paper [2019/08/20 12:09] (current) arijit [Internal evaluation] |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| ======Internal evaluation====== | ======Internal evaluation====== | ||
| - | In this course you need make a presentation of some algorithms. | + | In this course you need make a presentation of some algorithms. |
| Line 10: | Line 10: | ||
| * Stable husbands - DE Knuth, R Motwani, B Pittel - Random Structures & Algorithms, 1990 | * Stable husbands - DE Knuth, R Motwani, B Pittel - Random Structures & Algorithms, 1990 | ||
| * Nested satisfiability - DE Knuth - Acta Informatica, | * Nested satisfiability - DE Knuth - Acta Informatica, | ||
| - | * | + | * Skip lists: a probabilistic alternative to balanced trees - W Pugh - Communications of the ACM, 1990 |
| + | * Sequential access in splay trees takes linear time - RE Tarjan - Combinatorica, | ||
| + | * Scapegoat trees - I Galperin, RL Rivest - Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms, 1993 | ||
| + | * Training a 3-node neural network is NP-complete - A Blum, RL Rivest - Advances in neural information processing systems, 1989 | ||
| + | * Community structure in social and biological networks - M Girvan, MEJ Newman - Proceedings of the national academy of sciences, 2002 | ||
| + | * A linear-time algorithm for a special case of disjoint set union - HN Gabow, RE Tarjan - Journal of computer and system sciences, 1985 | ||
| + | * Optimum binary search trees - DE Knuth - Acta informatica, | ||