Compact Data structures and Applications

גיל אינציגר, הרצאה סמינריונית לדוקטורט
יום רביעי, 28.1.2015, 16:30
טאוב 601
Prof. R. Friedman

This talk surveys several state of the art techniques to approximate sets and multi sets efficiently. While Bloom filters and their variants are well researched, this talk argues that compact hash table encoding is a better approach. To back up this claim, we introduce two novel data structures that are more space efficient than previously suggested alternatives. The talk will also present novel applications to approximate multi set representation in the field of cache management and distributed routing.

בחזרה לאינדקס האירועים