Baruch Schieber
Professor, Computer Science
4207 Guttenberg Information Technologies Center (GITC)
About Me
Baruch Schieber is a professor in the Department of Computer Science at the New Jersey Institute of Technology’s Ying WU College of Computing. Prior to joining NJIT, Baruch was a Distinguished Research Staff Member in IBM Research, and a member of the IBM Academy of Technology. Baruch managed the “Mathematics of AI” group in IBM Research with the mission of performing ground-breaking research in the mathematical foundations of AI including the design of efficient and parallel algorithms for machine learning, development of efficient algorithms for deep learning, and applying mathematical-programming techniques to obtain high-quality interpretable models. Baruch has led and participated in several ground-breaking AI and business analytics projects for over two decades, including a continual fleet optimization project that was featured in the New York Times, Business Week, Fast Company and Forbes. And, an integrated data analytics, simulation, and optimization of airport-security resource allocation for the US Transportation Security Administration. Baruch has published more than 140 papers in leading scientific journals and conferences and is the co-inventor of five patents.
Education
Ph.D.
; Tel Aviv University
; Computer Science
; 1987
M.S. ; Israel Institute of Technology ; Computer Science ; 1984
B.S. ; Israel Institute of Technology ; Computer Science ; 1980
M.S. ; Israel Institute of Technology ; Computer Science ; 1984
B.S. ; Israel Institute of Technology ; Computer Science ; 1980
Website
2025 Fall Courses
CS 114 - INTRO TO COMPUTER SCIENCE II
CS 792 - PRE-DOCTORAL RESEARCH
CS 700B - MASTER'S PROJECT
CS 725 - INDEPENDENT STUDY I
CS 726 - INDEPENDENT STUDY II
CS 488 - INDEPENDENT STUDY IN CS
CS 489 - COMPUTER SCIENCE RESEARCH PROJ
CS 701B - MASTER'S THESIS
CS 114 - INTRO TO COMPUTER SCIENCE II - HONORS
CS 790A - DOCT DISSERTATION & RES
CS 792 - PRE-DOCTORAL RESEARCH
CS 700B - MASTER'S PROJECT
CS 725 - INDEPENDENT STUDY I
CS 726 - INDEPENDENT STUDY II
CS 488 - INDEPENDENT STUDY IN CS
CS 489 - COMPUTER SCIENCE RESEARCH PROJ
CS 701B - MASTER'S THESIS
CS 114 - INTRO TO COMPUTER SCIENCE II - HONORS
CS 790A - DOCT DISSERTATION & RES
Teaching Interests
Algorithms and Data Structures
Past Courses
CS 388: ANDROID APPLICATION DEVELOPMENT
CS 506: FOUND COMPUTER SCIENCE
CS 610: DATA STRUCTURE & ALG
CS 792: PRE-DOCTORAL RESEARCH
CS 506: FOUND COMPUTER SCIENCE
CS 610: DATA STRUCTURE & ALG
CS 792: PRE-DOCTORAL RESEARCH
Research Interests
Algorithm design; Combinatorial optimization
Chapter
Shlomi Dolev, Komal Kumari, Sharad Mehrotra, Baruch M. Schieber, Shantanu Sharma.
"Brief Announcement: Make Master Private-Keys Secure by Keeping It Public."
"Lecture Notes in Computer Science,"
pp. 338-343. Springer Nature Switzerland, 2025.
Baruch M. Schieber. "Brief Announcement: Towards Proportionate Fair Assignment." "Lecture Notes in Computer Science," pp. 255-259. Springer Nature Switzerland, 2025.
Shlomi Dolev, Komal Kumari, Sharad Mehrotra, Baruch M. Schieber, Shantanu Sharma. "Reminisce for Securing Private-Keys in Public." "Lecture Notes in Computer Science," pp. 338-343. Springer Nature Switzerland, 2025.
Baruch M. Schieber, Bhargav Samineni, Soroush Vahidi. "Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput." "Lecture Notes in Computer Science," pp. 305-316. Springer Nature Switzerland, 2023.
Baruch M. Schieber, Pranav Sitaraman. "Quick Minimization of Tardy Processing Time on a Single Machine." "Lecture Notes in Computer Science," pp. 637-643. Springer Nature Switzerland, 2023.
Baruch M. Schieber. "Parallel lowest common ancestor computation." In Reif, J.H., eds., pp. 259--273. Morgan Kaufmann Publishers, 1994.
Baruch M. Schieber. "Brief Announcement: Towards Proportionate Fair Assignment." "Lecture Notes in Computer Science," pp. 255-259. Springer Nature Switzerland, 2025.
Shlomi Dolev, Komal Kumari, Sharad Mehrotra, Baruch M. Schieber, Shantanu Sharma. "Reminisce for Securing Private-Keys in Public." "Lecture Notes in Computer Science," pp. 338-343. Springer Nature Switzerland, 2025.
Baruch M. Schieber, Bhargav Samineni, Soroush Vahidi. "Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput." "Lecture Notes in Computer Science," pp. 305-316. Springer Nature Switzerland, 2023.
Baruch M. Schieber, Pranav Sitaraman. "Quick Minimization of Tardy Processing Time on a Single Machine." "Lecture Notes in Computer Science," pp. 637-643. Springer Nature Switzerland, 2023.
Baruch M. Schieber. "Parallel lowest common ancestor computation." In Reif, J.H., eds., pp. 259--273. Morgan Kaufmann Publishers, 1994.
Journal Article
Baruch M. Schieber, Bhargav Samineni, Soroush Vahidi.
"Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput."
Algorithmica .
Senjuti Basu Roy, Baruch M. Schieber, Nimrod Talmon. 2024. "Fairness in Preference Queries: Social Choice Theories Meet Data Management." Proceedings of the VLDB Endowment , vol. 17 , no. 12 , pp. 4225--4228.
Kanthi Sarpatwar, Baruch M. Schieber, Hadas Shachnai. 2024. "The Preemptive Resource Allocation Problem." Journal of Scheduling , vol. 27 , no. 1 , pp. 103-118.
Baruch M. Schieber. 2020. "Fully dynamic MIS in uniformly sparse graphs.." ACM Transactions on Algorithms .
Viswanath Nagarajan, Baruch M. Schieber, Hadas Shachnai. 2020. "The Euclidean k-Supplier Problem." Mathematics of Operations Research , vol. 45 , pp. 1-14.
Senjuti Basu Roy, Baruch M. Schieber, Nimrod Talmon. 2024. "Fairness in Preference Queries: Social Choice Theories Meet Data Management." Proceedings of the VLDB Endowment , vol. 17 , no. 12 , pp. 4225--4228.
Kanthi Sarpatwar, Baruch M. Schieber, Hadas Shachnai. 2024. "The Preemptive Resource Allocation Problem." Journal of Scheduling , vol. 27 , no. 1 , pp. 103-118.
Baruch M. Schieber. 2020. "Fully dynamic MIS in uniformly sparse graphs.." ACM Transactions on Algorithms .
Viswanath Nagarajan, Baruch M. Schieber, Hadas Shachnai. 2020. "The Euclidean k-Supplier Problem." Mathematics of Operations Research , vol. 45 , pp. 1-14.
SHOW MORE
Conference Proceeding
"Partially Disjoint Shortest Paths and Near-Shortest Paths Trees"
2024.
"Rank aggregation with proportionate fairness"
2022.
"Satisfying Complex Top-k Fairness Constraints by Preference Substitutions"
VLDB, 2022.
"Maximizing Throughput in Flow Shop Real-Time Scheduling"
The 23rd International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2020), Leibniz International Proceedings in Informatics (LIPIcs), August, 2020.
"The Preemptive Resource Allocation Problem"
Proc. 39th Conf. on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), December, 2019.
2024.
"Rank aggregation with proportionate fairness"
2022.
"Satisfying Complex Top-k Fairness Constraints by Preference Substitutions"
VLDB, 2022.
"Maximizing Throughput in Flow Shop Real-Time Scheduling"
The 23rd International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2020), Leibniz International Proceedings in Informatics (LIPIcs), August, 2020.
"The Preemptive Resource Allocation Problem"
Proc. 39th Conf. on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), December, 2019.
SHOW MORE
Conference Paper
"Promoting Fairness and Priority in Selecting k-Winners Using IRV"
30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD), August, 2024.
"Approximations and Hardness of Packing Partially Ordered Items"
Workshop on Graph-Theoretic Concepts in Computer Science, June, 2024.
"Parallel Longest Common SubSequence Analysis In Chapel"
IEEE, September, 2023.
30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD), August, 2024.
"Approximations and Hardness of Packing Partially Ordered Items"
Workshop on Graph-Theoretic Concepts in Computer Science, June, 2024.
"Parallel Longest Common SubSequence Analysis In Chapel"
IEEE, September, 2023.