Dates:April 1, 1992 - September 15, 1994
Currently with:University of Ioannina, Greece
While at the Center, he worked on problems involving partitions of (portions of) the three-dimensional space into tetrahedra, determining the maximum number of faulty processing elements that can be replaced in the single-track model for fault-tolerant array processors, and establishing upper and lower bounds on minimal cuts in trees.
Because he believes that algorithms are more effectively explained through animation, Leonidas has implemented and animated his tetrahedralization algorithms using the visualization and video recording facilities of the Center. Finally, Leonidas is very much interested in learning foreign languages, and in his spare time, he enjoys playing volleyball, skiing (in the winter), and swimming and canoeing (in the summer).
Created: Nov 19 1995 --- Last modified: Nov 10 12:15:02 1997