Michael Segal

Michael Segal
Born 1972 (age 43–44)
Chișinău, Soviet Union
Nationality Israeli
Fields Computer Science
Alma mater Ben-Gurion University of the Negev
Thesis Covering point sets and accompanying problems (2000)
Doctoral advisor Klara Kedem
Known for Works in Wireless ad hoc networks
Wireless Sensor Networks
Notable awards Toronto Prize (2010)

Michael Segal (Hebrew: מיכאל סגל; Russian: Михаил Сегал, born 1972 in Kishinev, USSR) is a Professor of Communication Systems Engineering at Ben-Gurion University of the Negev, known for his work in ad-hoc and sensor networks.

After completing his undergraduate studies at Ben-Gurion University in 1994, Segal received a Ph.D. in Mathematics and Computer Science from Ben-Gurion University in 2000 under the supervision of Klara Kedem. The topic of his PhD Dissertation was: Covering point sets and accompanying problems.[1]

After continuing his studies with David G. Kirkpatrick at University of British Columbia,[2] and Pacific Institute for the Mathematical Studies [3] he joined the faculty at Ben-Gurion University in 2000, where he also served as the head of the Communication Systems Engineering department between 2005-2010. He is known (equally with his coauthors) for being first to analyze the analytical performance of the well-known Least Cluster Change (LCC) algorithm that is widely used in ad hoc networks for re-clustering in order to reduce the number of modifications.[4] He also was one of the first to introduce and analyze the construction of multi-criteria spanners for ad hoc networks.

Segal has published over 140 scientific papers and was a recipient of the Toronto Prize for Research in 2010.[5] He is serving as the Editor-in-Chief[6][7] for the Journal of Computer and System Sciences. Along with his Ben-Gurion University professorship, he also is visiting professor at Cambridge University.

References

  1. ↑ Michael Segal at the Mathematics Genealogy Project
  2. ↑ http://www.cs.ubc.ca. Missing or empty |title= (help); External link in |website= (help);
  3. ↑ http://www.pims.math.ca/scientific/postdoctoral/postdoctoral-fellows. Missing or empty |title= (help); External link in |website= (help);
  4. ↑ "Approximation Algorithms for the Mobile Piercing Set Problem with Applications to Clustering in Ad-Hoc Networks". ACM Mobile Networks and Applications. 9 (2): 151–161. doi:10.1023/B:MONE.0000013626.53247.1c.
  5. ↑ http://in.bgu.ac.il/en/Pages/news/segal_editor.aspx. Missing or empty |title= (help); External link in |website= (help);
  6. ↑ http://www.journals.elsevier.com/journal-of-computer-and-system-sciences. Missing or empty |title= (help); External link in |website= (help); >
  7. ↑ http://article.wn.com/view/2014/05/11/Prof_Michael_Segal_appointed_EditorinChief_of_the_Journal_of/. Missing or empty |title= (help); External link in |website= (help);


This article is issued from Wikipedia - version of the 7/6/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.