activity
20062024
most cited1-Wasserstein Distance on the Standard Simplex

10 citations · 21 across the 13 of their papers we have counts for

collaborators
Showing cs.DSShow all

2 papers · 1 filter

cs.DS2020

Adaptive Fibonacci and Pairing Heaps

Andrew Frohmader

This brief note presents two adaptive heap data structures and conjectures on running times.

cs.DS2018★ 1 cited

List Heaps

Andrew Frohmader

This paper presents a simple extension of the binary heap, the List Heap. We use List Heaps to demonstrate the idea of adaptive heaps: heaps whose performance is a function of both…