Baruch Schieber | |
|---|---|
 | |
| Born | December 1958 |
| Alma mater | Technion, Tel Aviv University |
| Scientific career | |
| Fields | Computer Science |
| Institutions | New Jersey Institute of Technology, IBM T.J. Watson Research Center |
| Thesis | The design and analysis of parallel algorithms (1987) |
| Doctoral advisor | Uzi Vishkin |
Baruch M. Schieber (Hebrew: ברוך שיבר; born: December 1958) is a Professor of the Department of Computer Science at the New Jersey Institute of Technology (NJIT)[1] and Director of the Institute for Future Technologies.[2]
Early life and education
Baruch Schieber was born in Tel Aviv and was raised in Givatayim (a suburb of Tel Aviv). His father was a bank branch manager and his mother a housemaker. He graduated from Zeitlin High School in 1976.[3]
Upon high school graduation, he began his academic studies at the Computer Science department of the Technion - Israel Institute of Technology in 1977 and received his B.Sc. in 1980 (summa cum laude). He then started his 5-year military service in unit 8200 of the Israeli Intelligence and reached the rank of lieutenant. While in the army he received his M.Sc. from the Computer Science department of the Technion - Israel Institute of Technology in 1984. He continued his Ph.D. studies at Tel Aviv University until 1987. His thesis on the design and analysis of parallel algorithms was supervised by Dr. Uzi Vishkin.[3]
From 1987 to 1989 Schieber was a Postdoctoral Fellow at the Theory of Computation, Mathematical Sciences Department of IBM T.J. Watson Research Center, Yorktown Heights, New York.[3]
Career
Schieber joined IBM T.J. Watson Research Center at Yorktown Heights in 1989 as a Research Staff Member in the Theory of Computation, Mathematical Sciences Department. In 1995 he became the manager of the department. From 2001 to 2015 Schieber served as the manager of the Optimization Center, Business Analytics and Mathematical Sciences Department of IBM T.J. Watson Research Center, and in 2017 he became Manager of the Center for Optimization, Mathematics, and Algorithms there. In 2017 Schieber became Manager of the Mathematics of AI, IBM Research AI at IBM T.J. Watson Research Center.[3]
In 2018 he joined the New Jersey Institute of Technology as a Professor and chair of the Department of Computer Science (until June 2022). In July 2022 he became Director of the Institute for Future Technologies, a partnership of Ben-Gurion University and NJIT.[2][4]
Schieber is an Associate Editor of ACM Transactions on Algorithms since the inception of the journal in 2004.[5] He was a Guest Editor of IBM Journal of Research and Development special issue on Business Optimization, and an Associate Editor of the Journal of Algorithms from 1998 to 2003.[6] He was also a member of the executive board at the Center for Discrete Mathematics and Theoretical Computer Science (DIMACS) until 2018, and continues to serve on its executive committee.[7]
Research and publications
Schieber's research work focuses on algorithms, optimization and business analytics. His work includes the development of fast, provably efficient, approximation algorithms for intractable combinatorial optimization problems. For these problems, which defy exhaustive search solutions, searching for near optimal solutions is a pragmatic and viable strategy. Schieber considered such intractable business optimization problems in areas like scheduling and network design and devised general techniques for solving them.[citation needed]
Two examples for his techniques are: A unified approach to approximating maximum throughput in resource allocation and scheduling,[8] and a divide-and-conquer approximation paradigm for approximating NP-hard graph optimization problems via Spreading Metrics.[9]
Honors and awards
Schieber is a recipient of the Israel Defense Prize for major technological contributions to Israeli defense systems in 1984.[10] While at IBM he received eight technical achievement awards for various projects.[3]
Media
Schieber's research projects have been featured in major publications, including The New York Times,[11] Forbes,[12] The Economist,[13] Newsweek[14] and more.[15]
Personal life
Schieber is married and has two daughters. They live in White Plains, New York.[3]
References
- ^ "Administration and Faculty". NJIT - Department of Computer Science.
- ^ a b "Staff | Institute for Future Technologies". futuretechnologies.njit.edu. Retrieved 2022-08-10.
- ^ a b c d e f "BARUCH M. SCHIEBER" (PDF). NJIT.
- ^ "Institute for Future Technologies | Institute for Future Technologies". futuretechnologies.njit.edu. Retrieved 2022-08-10.
- ^ "ACM Transactions on Algorithms - Editorial Board". ACM.
- ^ "Editorial Board". Journal of Algorithms. 61 (2): CO2. 2006. doi:10.1016/S0196-6774(06)00066-6.
- ^ "Governance". Center for Discrete Mathematics and Theoretical Computer Science.
- ^ Bar-Noy, Amotz; Bar-Yehuda Reuven; Freund Ari; Naor Joseph (Seffi); Schieber Baruch M. (2001). "A unified approach to approximating resource allocation and scheduling". Journal of the ACM. 48 (5): 1069–1090. doi:10.1145/502102.502107. S2CID 12329294.
- ^ Even, Guy; Naor Joseph (Seffi); Rao Satish; Schieber Baruch M. (2000). "Divide-and-conquer approximation algorithms via spreading metrics". Journal of the ACM. 47 (4): 585–616. doi:10.1145/347476.347478. S2CID 18736238.
- ^ "Ministry of Defense (in Hebrew)" (PDF). Ministry of Defense (Israel). 20 December 2021.
- ^ "Creating the jobs of the future". The New York Times. 17 April 2006.
- ^ "Hurry Up And Wait". Forbes. 15 October 2000.
- ^ "Always-on People". The Economist. 2 February 2002.
- ^ "Augmented intelligence, not artificial (in Polish)". Newsweek Polska. 9 June 2019.
- ^ "Turning Math into Cash". MIT Technology Review. 23 February 2010.
External links
- Baruch Schieber's page, NJIT
- Baruch Schieber's personal page, GitHub
- Schieber and Vishkin's algorithm explained on Don Knuth's Annual Christmas Tree Lecture at Stanford University (starting at 39:20) YouTube
- Baruch Schieber publications indexed by Google Scholar
This page was last edited on 5 October 2023, at 14:31