Michael Segal (Communication Systems Engineering): Difference between revisions
GoingBatty (talk | contribs) |
m The Turtle Ninja moved page Michael Segal to Michael Segal (Communication Systems Engineering) |
||
(26 intermediate revisions by 19 users not shown) | |||
Line 1: | Line 1: | ||
{{Short description|Israeli academic (born 1972)}} |
|||
{{distinguish|Michael Siegal}} |
|||
{{Infobox scientist |
{{Infobox scientist |
||
|name = Michael Segal |
| name = Michael Segal |
||
|image = Michael Segal.jpg |
| image = Michael Segal.jpg |
||
| |
| caption = Segal in 2007 |
||
| |
| birth_date = {{birth year and age|1972}} |
||
⚫ | |||
|birth_date = {{birth year and age|1972}} |
|||
⚫ | |||
⚫ | |||
| |
| fields = [[Computer Science]] |
||
⚫ | |||
|citizenship = |
|||
⚫ | |||
⚫ | |||
⚫ | |||
|fields = [[Computer Science]] |
|||
| |
| thesis_year = 2000 |
||
⚫ | |||
⚫ | |||
⚫ | |||
⚫ | |||
|academic_advisors = |
|||
|doctoral_students = |
|||
⚫ | |||
|thesis_year = 2000 |
|||
|notable_students = |
|||
⚫ | |||
|author_abbrev_bot = |
|||
|author_abbrev_zoo = |
|||
|influences = |
|||
|influenced = |
|||
⚫ | |||
|signature = |
|||
|footnotes = |
|||
}} |
}} |
||
'''Michael Segal''' (Hebrew: מיכאל סגל; Russian: Михаил Сегал, born 1972 in Kishinev, USSR) is a |
'''Michael Segal''' (Hebrew: מיכאל סגל; Russian: Михаил Сегал, born 1972 in [[Chișinău|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. |
||
== Career == |
|||
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.<ref>{{mathgenealogy|id=97412}}</ref> |
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.<ref>{{mathgenealogy|id=97412}}</ref> |
||
After continuing his studies with [[David G. Kirkpatrick]] at University of British Columbia,<ref>{{cite web|website=cs.ubc.ca |url=http://www.cs.ubc.ca|title=Computer Science at UBC}}</ref> and Pacific Institute for the Mathematical Studies <ref>{{cite web|website=pims.math.ca |url=http://www.pims.math.ca/scientific/postdoctoral/postdoctoral-fellows|title=Postdoctoral Fellows | Pacific Institute for the Mathematical Sciences - PIMS}}</ref> 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 |
After continuing his studies with [[David G. Kirkpatrick]] at University of British Columbia,<ref>{{cite web|website=cs.ubc.ca |url=http://www.cs.ubc.ca|title=Computer Science at UBC}}</ref> and Pacific Institute for the Mathematical Studies <ref>{{cite web|website=pims.math.ca |url=http://www.pims.math.ca/scientific/postdoctoral/postdoctoral-fellows|title=Postdoctoral Fellows | Pacific Institute for the Mathematical Sciences - PIMS}}</ref> 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 and 2010. |
||
He is known (equally with his coauthors) for being first to analyze the analytical performance of the well-known Least Cluster |
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.<ref>{{cite journal|title=Approximation Algorithms for the Mobile Piercing Set Problem with Applications to Clustering in Ad-Hoc Networks|journal= |
Change (LCC) algorithm that is widely used in ad hoc networks for re-clustering in order to reduce the number of modifications.<ref>{{cite journal|title=Approximation Algorithms for the Mobile Piercing Set Problem with Applications to Clustering in Ad-Hoc Networks|journal= Mobile Networks and Applications|volume=9 | issue = 2 |pages=151–161|url=https://link.springer.com/article/10.1023%2FB%3AMONE.0000013626.53247.1c|doi=10.1023/B:MONE.0000013626.53247.1c|year=2004|last1=Huang|first1=Hai|author2-link=Andréa W. Richa |last2=Richa|first2=Andréa W.|last3=Segal|first3=Michael|citeseerx=10.1.1.6.8134}}</ref> He also was one of the first to introduce and analyze the construction of multi-criteria spanners for ad hoc networks. |
||
Segal has published |
Segal has published nearly 200 scientific papers and was a recipient of the Toronto Prize for Research in 2010.<ref>{{cite web|url = http://in.bgu.ac.il/en/Pages/news/segal_editor.aspx|title = Ben-Gurion University of the Negev - Prof. Michael Segal appointed Editor-in-Chief of the Journal of Computer and System Sciences}}</ref> |
||
He is serving as the Editor-in-Chief<ref>{{cite web| |
He is serving as the Editor-in-Chief for the [[Journal of Computer and System Sciences]].<ref>{{cite web|title=Journal of Computer and System Sciences|work=Elsevier Journals |url=http://www.journals.elsevier.com/journal-of-computer-and-system-sciences}}</ref><ref>{{cite web|url = http://article.wn.com/view/2014/05/11/Prof_Michael_Segal_appointed_EditorinChief_of_the_Journal_of/|title = Prof. Michael Segal appointed Editor-in-Chief of the Journal of Computer and System Sciences (Ben-Gurion University of the Negev)}}</ref> |
||
Currently he is heading the Engineering program studies in Eilat campus at [[Ben-Gurion University of the Negev]]. He has served several times as a head of the University Regulations Committee and Disciplinary court. |
|||
Along with his Ben-Gurion University professorship, he |
Along with his Ben-Gurion University professorship, he held visiting professor positions at [[Cambridge University]], [[University of Liverpool]] and [[Lancaster University]]. |
||
Prof. Segal is the member of the Committee for Information and Communication Technology Standards of [[Standards Institute of Israel]]. |
|||
==References== |
==References== |
||
{{Reflist}} |
{{Reflist}} |
||
==External links== |
|||
{{Dead Sea Scrolls}} |
|||
{{Authority control}} |
{{Authority control}} |
||
{{DEFAULTSORT:Segal, Michael}} |
{{DEFAULTSORT:Segal, Michael}} |
||
[[Category:1972 births]] |
[[Category:1972 births]] |
||
⚫ | |||
[[Category:Ben-Gurion University of the Negev alumni]] |
|||
[[Category:Academic staff of Ben-Gurion University of the Negev]] |
|||
[[Category:Israeli computer scientists]] |
[[Category:Israeli computer scientists]] |
||
[[Category:Israeli mathematicians]] |
[[Category:Israeli mathematicians]] |
||
⚫ | |||
[[Category:Researchers in geometric algorithms]] |
[[Category:Researchers in geometric algorithms]] |
Latest revision as of 18:30, 23 November 2024
Michael Segal | |
---|---|
Born | 1972 (age 51–52) |
Nationality | Israeli |
Alma mater | Ben-Gurion University of the Negev |
Known for | Works in Wireless ad hoc networks Wireless Sensor Networks |
Awards | Toronto Prize (2010) |
Scientific career | |
Fields | Computer Science |
Thesis | Covering point sets and accompanying problems (2000) |
Doctoral advisor | Klara Kedem |
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.
Career
[edit]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 and 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 nearly 200 scientific papers and was a recipient of the Toronto Prize for Research in 2010.[5] He is serving as the Editor-in-Chief for the Journal of Computer and System Sciences.[6][7] Currently he is heading the Engineering program studies in Eilat campus at Ben-Gurion University of the Negev. He has served several times as a head of the University Regulations Committee and Disciplinary court. Along with his Ben-Gurion University professorship, he held visiting professor positions at Cambridge University, University of Liverpool and Lancaster University. Prof. Segal is the member of the Committee for Information and Communication Technology Standards of Standards Institute of Israel.
References
[edit]- ^ Michael Segal at the Mathematics Genealogy Project
- ^ "Computer Science at UBC". cs.ubc.ca.
- ^ "Postdoctoral Fellows | Pacific Institute for the Mathematical Sciences - PIMS". pims.math.ca.
- ^ Huang, Hai; Richa, Andréa W.; Segal, Michael (2004). "Approximation Algorithms for the Mobile Piercing Set Problem with Applications to Clustering in Ad-Hoc Networks". Mobile Networks and Applications. 9 (2): 151–161. CiteSeerX 10.1.1.6.8134. doi:10.1023/B:MONE.0000013626.53247.1c.
- ^ "Ben-Gurion University of the Negev - Prof. Michael Segal appointed Editor-in-Chief of the Journal of Computer and System Sciences".
- ^ "Journal of Computer and System Sciences". Elsevier Journals.
- ^ "Prof. Michael Segal appointed Editor-in-Chief of the Journal of Computer and System Sciences (Ben-Gurion University of the Negev)".