Seminar in advanced topics in data structures (0368.434.301) Fall 2001

Forthcoming presentations:

• "Storing a sparse table with O(1) worst case access time" by M. L. Fredman and J. Komlos and E. Szemeredi.
  Daniel Gordon
• "Design and implementation of an efficient priority queue" by P. van Emde Boaz, R. Kaas, and E. Zijlstra.
  (According to lecture notes by Knuth)
  Yulik Feldman ppt presentation
• "New trie data structures which support very fast search operations" by D. Willard
  Jacob Katz ppt presentation
• "Dynamic Perfect Hashing: Upper and Lower Bounds" by Martin Dietzfelbinger, Anna Karlin, Kurt Mehlhorn, Friedhelm Meyer Auf Der Heide, Hans Rohnert, and Robert E. Tarjan
  Tomer Shlomi ppt presentation
• "An improved algorithm for the rectangle enclosure problem" by D.T. Lee, F.P. Preparata
  Anatoli Uchitel ppt presentation
  "The rectangle enclosure and point-dominance problems revisited" P. Gupta, R. Janardan, M. Smid, B. Dasgupta
  Anatoli Uchitel ppt presentation
• "Adding range restriction capabilities to dynamic data structures", by G. Lueker and D. Willard
  Ohad Shacham ppt presentation
• "Dynamic Fractional cascading" by K. Mehlhorn and S. Naher
  Elik Etzion ppt presentation
• "Cache-oblivious B-trees" by M. Bender, E. Demaine, and M. Farach
  Gregory Giguashvili ppt presentation
• "A sparse table implementation of priority queues" by A. Itai and A. G. Konheim and M. Rodeh
  Yaniv Nachum ppt presentation