World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
51
Citations
9279
World Ranking
5386
National Ranking
2465

Research.com Recognitions

  • 2017 - ACM Senior Member

Overview

Baruch Schieber is affiliated with the New Jersey Institute of Technology in the United States. Their research spans multiple areas within computer science and engineering, focusing particularly on algorithms, graph theory, optimization, and network communications.

The scientist's main fields of study include:

  • Computer Science
  • Engineering

Within these disciplines, they have specialized in several subfields:

  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Electrical and Electronic Engineering
  • Information Systems
  • Industrial and Manufacturing Engineering

The primary topics covered in their work involve:

  • Complexity and Algorithms in Graphs
  • Optimization and Search Problems
  • Advanced Graph Theory Research
  • Scheduling and Optimization Algorithms
  • Game Theory and Voting Systems
  • Energy Harvesting in Wireless Networks
  • Optimization and Packing Problems

They have contributed articles to various publication venues, including:

  • arXiv (Cornell University)
  • Proceedings of the VLDB Endowment
  • Proceedings of the 2022 International Conference on Management of Data
  • ACM Transactions on Algorithms
  • Journal of Scheduling

Recent publications by Baruch Schieber include:

  • Optimal Preprocessing for Answering On-Line Product Queries, 2024, arXiv (Cornell University)
  • Rank Aggregation with Proportionate Fairness, 2022, Proceedings of the 2022 International Conference on Management of Data
  • Fully Dynamic MIS in Uniformly Sparse Graphs, 2020, ACM Transactions on Algorithms
  • Satisfying complex top-k fairness constraints by preference substitutions, 2022, Proceedings of the VLDB Endowment
  • The preemptive resource allocation problem, 2023, Journal of Scheduling

Baruch Schieber has collaborated frequently with several coauthors, including:

  • Shlomi Dolev
  • Soroush Vahidi
  • Hadas Shachnai
  • Senjuti Basu Roy
  • Bhargav Samineni

In recognition of their contributions to the field, Baruch Schieber was named an ACM Senior Member in 2017.

Best Publications

  • On Finding Lowest Common Ancestors: Simplification and Parallelization

    Baruch Schieber;Uzi Vishkin

  • A unified approach to approximating resource allocation and scheduling

    Amotz Bar-Noy;Reuven Bar-Yehuda;Ari Freund;Joseph (Seffi) Naor

  • Approximating Minimum Feedback Sets and Multicuts in Directed Graphs

    Guy Even;Joseph Naor;Baruch Schieber;Madhu Sudan

  • Minimizing Service and Operation Costs of Periodic Scheduling

    Amotz Bar-Noy;Randeep Bhatia;Joseph Seffi Naor;Baruch Schieber

  • Buffer Overflow Management in QoS Switches

    Alexander Kesselman;Zvi Lotker;Yishay Mansour;Boaz Patt-Shamir

  • Navigating in Unfamiliar Geometric Terrain

    Avrim Blum;Prabhakar Raghavan;Baruch Schieber

  • Divide-and-conquer approximation algorithms via spreading metrics

    Guy Even;Joseph Seffi Naor;Satish Rao;Baruch Schieber

  • Approximating the Throughput of Multiple Machines in Real-Time Scheduling

    Amotz Bar-Noy;Sudipto Guha

  • Approximating the throughput of multiple machines under real-time scheduling

    Amotz Bar-Noy;Sudipto Guha;Joseph (Seffi) Naor;Baruch Schieber

  • Parallel construction of a suffix tree with applications

    A. Apostolico;C. Iliopoulos;G. M. Landau;B. Schieber

  • Efficient routing and scheduling algorithms for optical networks

    Alok Aggarwal;Amotz Bar-Noy;Don Coppersmith;Rajiv Ramaswami

  • Parallel ear decomposition search (EDS) and st -numbering in graphs

    Yael Maon;Baruch Schieber;Uzi Vishkin

  • Resource optimization in QoS multicast routing of real-time multimedia

    Moses Charikar;Joseph (Seffi) Naor;Baruch Schieber

  • Highly parallelizable problems

    O. Berkman;Dany Breslauer;Zvi Galil;Baruch Schieber

  • Competitive paging with locality of reference

    Allan Borodin;Prabhakar Raghavan;Sandy Irani;Baruch Schieber

  • Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values

    Omer Berkman;Baruch Schieber;Uzi Vishkin;Uzi Vishkin

  • Finding a minimum-weightk-link path in graphs with the concave Monge property and applications

    A. Aggarwal;B. Schieber;T. Tokuyama

  • The Canadian Traveller Problem

    Amotz Bar-Noy;Baruch Schieber

  • The complexity of finding most vital arcs and nodes

    Baruch Schieber;Amotz Bar-Noy;Samir Khuller

  • Efficient routing in optical networks

    Alok Aggarwal;Amotz Bar-Noy;Don Coppersmith;Rajiv Ramaswami

  • Scalable Fair Clustering

    Arturs Backurs;Piotr Indyk;Krzysztof Onak;Baruch Schieber

  • Fast approximate graph partitioning algorithms

    Guy Even;Joseph (Seffi) Naor;Satish Rao;Baruch Schieber

Frequent Co-Authors

Amotz Bar-Noy
Amotz Bar-Noy City University of New York
Joseph (Seffi) Naor
Joseph (Seffi) Naor Technion – Israel Institute of Technology
Yishay Mansour
Yishay Mansour Tel Aviv University
Uzi Vishkin
Uzi Vishkin University of Maryland, College Park
Maxim Sviridenko
Maxim Sviridenko Yahoo (United States)
Prabhakar Raghavan
Prabhakar Raghavan Google (United States)
Guy Even
Guy Even Tel Aviv University
Alok Aggarwal
Alok Aggarwal IBM (United States)
Gad M. Landau
Gad M. Landau University of Haifa
Don Coppersmith
Don Coppersmith IBM (United States)

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring Computer Science in the USA opens doors to a variety of related online degrees and flexible career routes. Many students and working professionals look for accessible ways to upgrade their education without disrupting their schedules. Fast and affordable online programs are making advanced degrees more attainable than ever.

For those aiming for the highest level of academic achievement at a lower cost, consider the most affordable online doctoral programs. These programs can help you achieve a terminal degree while minimizing educational debt.

If your focus is on education leadership, you might explore the easiest edd programs, which offer accelerated pathways to an EdD in a flexible format.

Looking to enter the workforce quickly? There are fast track associates degree online options that can be completed in as little as six months, helping you start or pivot your tech career sooner.

Those interested in business and tech management should explore the cheapest online business management degree programs, perfect for developing skills essential for IT project management and leadership roles.

Best Scientists Citing Baruch Schieber

Trending Scientists

Recently Published Articles