This is an old revision of the document!


Internal evaluation

In this course you need make a presentation of some algorithms.

  • A characterization of the minimum cycle mean in a digraph - RM Karp - Discrete mathematics, 1978
  • Binary decision diagrams - SB Akers - IEEE Transactions on computers, 1978
    • Symbolic Boolean manipulation with ordered binary-decision diagrams - RE Bryant - ACM Computing Surveys (CSUR), 1992
  • Analysis of the subtractive algorithm for greatest common divisors - AC Yao, DE Knuth - Proceedings of the National Academy of Sciences, 1975
  • Stable husbands - DE Knuth, R Motwani, B Pittel - Random Structures & Algorithms, 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