64 citations · 130 across the 14 of their papers we have counts for
1 paper · 2 filters
Peter Huggins
We consider the classic problem of designing heaps. Standard binary heaps run faster in practice than Fibonacci heaps but have worse time guarantees. Here we present a new type of…