Ron Shamir
| Ron Shamir | |
|---|---|
 |
|
| Born |
29 November 1953 Jerusalem, Israel |
| Nationality | Israeli |
| Fields |
Bioinformatics Design and analysis of algorithms Algorithmic graph theory |
| Institutions | Tel Aviv University Blavatnik School of Computer Science |
| Alma mater |
Tel-Aviv University Hebrew University of Jerusalem University of California |
| Doctoral advisor |
Richard M. Karp Ilan Adler |
| Doctoral students |
|
| Known for | The Edmond J. Safra Center for Bioinformatics Tel Aviv University B.Sc. program in Bioinformatics Expander software |
| Notable awards |
|
|
Website www |
|
Ron Shamir (Hebrew: רון שמיר; born 29 November 1953) is an Israeli professor of computer science known for his work in graph theory and in computational biology. He holds the Raymond and Beverly Sackler Chair in Bioinformatics, and is the founder and head of the Edmond J. Safra Center for Bioinformatics at Tel Aviv University.
Ron Shamir was born in Jerusalem, Israel in 1953, the eldest son of Varda and Raphael Shamir. His father's Sepharadic family has lived in the old city of Jerusalem for . His mother’s parents were pioneers who came from Russia to Israel in the Third Aliyah in the early 1920s. He has two younger sisters, Daphna and Gadit.
Shamir studied in Gymnasia Rehavia, Jerusalem, for 12 years. In high school, he was active in the scouts and in athletics; among other accomplishments, he won the Jerusalem high school championship in shot put.
Shamir started his B.Sc. studies in mathematics and physics at Tel-Aviv University (1973–1975) and completed his degree at the Hebrew University of Jerusalem (1975–1977). He later began M.Sc. studies in operations research at Tel-Aviv University under the supervision of Uri Yechiali, and then joined the PhD program at the IEOR department of UC Berkeley, where he studied from 1981–1984. His PhD thesis was conducted under the supervision of Richard Karp and Ilan Adler.
Shamir started his research career in operations research, studying optimization problems related to linear programming and to the simplex method. His PhD thesis with Adler and Karp dealt with average case analysis of the Simplex Method, and showed that a certain Simplex variant was quadratic under a simple input data model. Similar results were given at the same time by Michael Todd and by Adler and Nimrod Megiddo. He later worked with Dorit S. Hochbaum on efficient algorithms for structured optimization problems.
...
Wikipedia