Jump to content

Shay Kutten

From Wikipedia, the free encyclopedia
Shay Kutten
Alma materTechnion – Israel Institute of Technology
Known forProof labeling schemes, self-stabilizing systems
AwardsPrize for Innovation in Distributed Computing (2024)
Scientific career
FieldsNetwork Algorithms, Distributed Computing, Network Security
InstitutionsTechnion – Israel Institute of Technology
Doctoral advisorShlomo Moran, Ephraim Korach

Shay Kutten is an Israeli computer scientist who holds the William M. Davidson Chair in Industrial Engineering and Management at the Technion – Israel Institute of Technology in Haifa, Israel.[1] He is with the Faculty of Data and Decision Sciences. His research involves Network Algorithms, distributed computing, and Network Security.

Education and career

[edit]

Kutten completed his BA, MSc, and DSc at the Technion – Israel Institute of Technology. His MSc was performed under the supervision of Imrich Chlamtac and the doctorate under the supervision of Shlomo Moran and Ephraim Korach.[2] After a post-doctorate with IBM T.J. Watson Research Center, he stayed there as a research staff member and as the group leader and manager of the network algorithms group and of the network security group he founded.[3] There, he contributed to various IBM products and received several awards. In 1996 he joined the Technion - IIT. Kutten served as the program committee chair of EATCS DISC 1998, ACM PODC 2004, and SIROCCO 2010.[4]

In 2024, Shay Kutten won the Prize for Innovation in Distributed Computing awarded annually at the SIROCCO conference. The prize was given "for his pioneering advancements in proof labeling schemes and their application to self-stabilizing systems."

References

[edit]
  1. ^ Shay Kutten' Web page.
  2. ^ Shay Kutten. "Mathematics Genealogy Project".
  3. ^ [1]. Shay Kutten, CV.
  4. ^ Kutten S. and Zerovnik J. (2010). Structural Information and Communication Complexity: 16th International Colloquium, SIROCCO 2009. Berlin, Heidelberg: Springer Science & Business Media. ISBN 978-3-642-11476-2.
[edit]