| |||||||||||||||
![]() |
| ||||||||||||||
| ![]() |
SHINING STARS 2000 CMU Professor Wins Kanellakis Theory and Practice Award
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. CMU is still basking in the glow of last year's Kanellakis Award, which was given to Randy Bryant, Ed Clarke, and Ken McMillan (PhD alumnus), and E. Allen Emerson of the University of Texas for their work on symbolic model checking. |
|||||||||||||||
|