Seminar in advanced topics in data structures (0368.434.301)

Presentations:

• "A data structure for the union-find problem having good single-operation complexity", by M. Smid.
  Powerpoint presentation by Yaron Shoham.
• Worst case analysis of set union algorithms, by R. E. Tarjan and J. Van Leeuwen.
  Presentation by Abadi Aharon and Maria Shmerman. Handout.
• Applications of path compression on balanced trees, by R. E. Tarjan.
  Presentation by Abadi Aharon and Maria Shmerman. Handout.
• Union-copy structures and dynamic segment trees, by M. J. Van Kreveld and M. H. Overmars.
  Powerpoint presentation by Eti Ezra.
• A new proof of the Garcia-Wachs algorithm, by J. H. Kingston.
  Powerpoint presentation by Dana Moshkovitz.
• Correctness of constructing optimal alphabetic trees revisited, by M. Karpinski, L. L. Larmore, and W. Rytter.
  Powerpoint presentation by Arye Barkan.
• A space-economical suffix tree construction algorithm, by E. M. McCreight
  Powerpoint presentation by Iddo Tzameret.
  Handout.
• On-line construction of suffix trees, by E. Ukkonen.
  Powerpoint presentation by Vera Asodi.
• Fast and simple algorithms for recognizing chordal comparability graphs and interval graphs, by W. L. Hsu and T. H. Ma.
  Powerpoint presentation by Asaf Shapira.
  Handout.