Ruth Shrairman

Relaxed Heaps: An Alternative to Fibonacci Heaps, (1998)

Driscoll, James R., Gabow, Harold N., Shrairman, Ruth, Tarjan, Robert E.

The relaxed heap is a priority queue data structure that achieves the same amortized time bounds as the Fibonacci heap - a sequence of m decrease key and n delete min operations takes time O(m + n...

R²-heaps with suspended relaxation for manipulating priority queues and : a new algorithm for reweighting graphs / (1995)

Shrairman, Ruth.

Thesis (Ph. D.)--University of Colorado, 1995.