Master’s Thesis Presentation • Systems and Networking — High Performance Web Servers
Srihari Radhakrishnan, Master’s candidate
David R. Cheriton School of Computer Science
Srihari Radhakrishnan, Master’s candidate
David R. Cheriton School of Computer Science
Hao Tan, Master’s candidate
David R. Cheriton School of Computer Science
Joshua Cheng, Master’s candidate
David R. Cheriton School of Computer Science
Yingluo Xun, Master’s candidate
David R. Cheriton School of Computer Science
Michael Farag, Master’s candidate
David R. Cheriton School of Computer Science
Hung Viet Pham, PhD candidate
David R. Cheriton School of Computer Science
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?
Kyle Jamieson
Department of Computer Science, Princeton University
Shrinu Kushagra, PhD candidate
David R. Cheriton School of Computer Science
Besat Kassaie, PhD candidate
David R. Cheriton School of Computer Science