Splay Trees – award winning
Danny Sleator of Carnegie Mellon University and Bob Tarjan of Princeton University have been awarded the 1999 Kanellakis Theory and Practice Award by the ACM for their invention of the Splay Tree data structure. This prestigious award “honors specific theoretical accomplishments that have had a significant and demonstrable effect on the practice of computing”.
“Splay Trees are a simple, elegant and efficient self-adjusting data structure for storing ordered sets. They’ve found their way into the Linux and NT kernels, the GCC compiler, FORE routers, and a myriad of other important applications.”