From Amortized to Worst Case Delay in Enumeration Algorithms

Florent Capelli, Yann Strozecki

The quality of enumeration algorithms is often measured by their delay, that is, the maximal time spent between the output of two distinct solutions. If the goal is to enumerate $t…