Differences

This shows you the differences between two versions of the page.

Link to this comparison view

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]
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. ​Please provide details of your group and topics [[https://​docs.google.com/​spreadsheets/​d/​CS5031WIoI2qYHiEj-rDymrm8RhvjMFBJxWNRtRTbZfEFjwSU/​edit?​usp=sharing|here]]
  
  
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,​ 1990    * Nested satisfiability - DE Knuth - Acta Informatica,​ 1990 
-  * +  * 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,​ 1985 
 +  * 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,​ 1971