Events

Lily Wang, University of Waterloo

A classical problem asks us to find, for each element $A[i]$ of an array of integers, the position of the nearest smallest element. Similarly, we can ask about the dual problem: for each element of an array of integers $A[i]$, what is the position of the furthest smaller element? 

Besat Kassaie, PhD candidate
David R. Cheriton School of Computer Science