The layout of virtual paths in ATM networks
IEEE/ACM Transactions on Networking (TON)
Approximating the traffic grooming problem
Journal of Discrete Algorithms
| Hi-index | 0.00 |
Shmuel Zaks received his BSc (cum laude) and MSc degrees in Mathematics from the Technion, Haifa, Israel, in 1971 and 1972, respectively, and his PhD degree in Computer Science from the University of Illinois at Urbana-Champaign in 1979. He is a full professor at the Department of Computer Science at the Technion, where he has been since 1979. He is an author over 100 journal and conference papers, which span his research interests, including Distributed Computing, ATM networks, Optical Networks, Graph and Combinatorial Algorithms, and Discrete Mathematics. I had the honor to be supervised by Shmuel Zaks (and jointly of Shlomo Moran) during my MSc studies in years 1982-1985. At that period the main research interest of Shmuel was Distributed Algorithms, and my MSc thesis was on this subject. His numerous contributions to this field are subject of another talk. In the first half of the 1990's his major contributions was in the field of ATM networks. In part of this talk I will describe a beautiful result from [CGZ96]. He has numerous contributions in Optical Networks. I had the opportunity to collaborate with him in part of these works, which are mostly approximation algorithms to NP-hard optimization problems. In my talk will describe one of these results ([FMSZ08]). Shmuel is a father of 4 children and grandfather of 4 grandchildren. It is impossible to talk about him without mentioning that he is an exceptional family man and enjoys helping people at every possible occasion and in every possible way.