Abstract
Celebrating Shmuels Zaks’ 60th birthday and his remarkable career, the focus of this talk is on his early contributions to Distributed Computing. In particular, in this talk I examine how this young combinatorialist/graph theorist, upon discovering the beauty and fun of distributed algorithms, was so captured by the area that he never left it. In these early explorations, his research contributions have been many, some very important (e.g. lower bound for election in complete graphs) and some very beautiful (e.g. guessing games in synchronous networks). In this talk, a few of these research results are described and commented, and some of his other contributions to the Distributed Computing community during those years are highlighted.
Chapter PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Santoro, N. (2009). Shmuel Zaks - The Early Years: A Combinatorialist in Distributed Computing. In: Keidar, I. (eds) Distributed Computing. DISC 2009. Lecture Notes in Computer Science, vol 5805. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04355-0_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-04355-0_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04354-3
Online ISBN: 978-3-642-04355-0
eBook Packages: Computer ScienceComputer Science (R0)