## neal young / Matias96Implementation

• An experimental implementation and evaluation of data structures from Approximate data structures with applications'' [1994]. To summarize: Our results suggest that the data structure is practical and can be faster than traditional priority queues when holding a large number of keys, and that tolerance for approximate answers can lead to significant increases in speed.''