World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
51
Citations
9279
World Ranking
5387
National Ranking
2466

Baruch Schieber publications per year

1986: 3 publications 1987: 1 publications 1988: 6 publications 1989: 11 publications 1990: 2 publications 1991: 11 publications 1992: 9 publications 1993: 8 publications 1994: 4 publications 1995: 9 publications 1996: 3 publications 1997: 7 publications 1998: 6 publications 1999: 6 publications 2000: 5 publications 2001: 5 publications 2002: 2 publications 2003: 5 publications 2004: 3 publications 2005: 3 publications 2006: 5 publications 2007: 5 publications 2008: 1 publications 2009: 1 publications 2010: 2 publications 2011: 2 publications 2012: 0 publications 2013: 1 publications 2014: 0 publications 2015: 2 publications 2016: 5 publications 2017: 2 publications 2018: 7 publications 2019: 6 publications 2020: 3 publications 2021: 0 publications 2022: 4 publications 2023: 6 publications 2024: 9 publications 2025: 3 publications
1986 2025

173 publications in total across all disciplines

Baruch Schieber publication distribution in Computer Science in 2027

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2027. The highlighted bar marks where Baruch Schieber sits on this spectrum.

32–41 publications: 7 scientists 42–51 publications: 22 scientists 52–61 publications: 82 scientists 62–71 publications: 134 scientists 72–81 publications: 249 scientists 82–91 publications: 324 scientists 92–101 publications: 421 scientists 102–111 publications: 420 scientists 112–121 publications: 497 scientists 122–131 publications: 544 scientists 132–141 publications: 555 scientists 142–151 publications: 609 scientists 152–161 publications: 559 scientists 162–171 publications: 534 scientists 172–181 publications: 556 scientists 182–191 publications: 583 scientists 192–201 publications: 519 scientists 202–211 publications: 508 scientists 212–221 publications: 490 scientists 222–231 publications: 437 scientists 232–241 publications: 423 scientists 242–251 publications: 408 scientists 252–261 publications: 377 scientists 262–271 publications: 301 scientists 272–281 publications: 335 scientists 282–291 publications: 320 scientists 292–301 publications: 293 scientists 302–311 publications: 250 scientists 312–321 publications: 238 scientists 322–331 publications: 206 scientists 332–341 publications: 209 scientists 342–351 publications: 208 scientists 352–361 publications: 162 scientists 362–371 publications: 176 scientists 372–381 publications: 127 scientists 382–391 publications: 158 scientists 392–401 publications: 128 scientists 402–411 publications: 104 scientists 412–421 publications: 94 scientists 422–431 publications: 99 scientists 432–441 publications: 83 scientists 442–451 publications: 108 scientists 452–461 publications: 73 scientists 462–471 publications: 77 scientists 472–481 publications: 69 scientists 482–491 publications: 84 scientists 492–501 publications: 62 scientists 502–511 publications: 54 scientists 512–521 publications: 57 scientists 522–531 publications: 51 scientists 532–541 publications: 51 scientists 542–551 publications: 32 scientists 552–561 publications: 38 scientists 562–571 publications: 28 scientists 572–581 publications: 43 scientists 582–591 publications: 33 scientists 592–601 publications: 41 scientists 602–611 publications: 32 scientists 612–621 publications: 28 scientists 622–631 publications: 25 scientists 632–641 publications: 27 scientists 642–651 publications: 17 scientists 652–661 publications: 20 scientists 662–671 publications: 17 scientists 672–681 publications: 15 scientists 682–691 publications: 14 scientists 692–701 publications: 21 scientists 702–711 publications: 13 scientists 712–721 publications: 12 scientists 722–731 publications: 19 scientists 732–741 publications: 14 scientists 742–751 publications: 12 scientists 752–761 publications: 10 scientists 762–771 publications: 10 scientists 772–781 publications: 11 scientists 782–791 publications: 10 scientists 792–801 publications: 11 scientists 802–811 publications: 8 scientists 812–821 publications: 8 scientists 822–831 publications: 7 scientists 832–841 publications: 11 scientists 842–851 publications: 10 scientists 852–861 publications: 5 scientists 862–871 publications: 9 scientists 872–881 publications: 4 scientists 882–891 publications: 6 scientists 892–901 publications: 3 scientists 902–911 publications: 6 scientists 912–921 publications: 3 scientists 922–931 publications: 2 scientists 932–941 publications: 2 scientists 942–951 publications: 2 scientists 952–961 publications: 3 scientists 962–971 publications: 3 scientists 972–981 publications: 3 scientists 982–990 publications: 5 scientists 991+ publications: 100 scientists
32 publications 991+

This scientist: 165 publications — 33rd percentile

33% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

Baruch Schieber D-index placement in Computer Science in 2027

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2027. The highlighted bar marks where Baruch Schieber sits on this spectrum.

30–31 D-Index: 879 scientists 32–33 D-Index: 983 scientists 34–35 D-Index: 918 scientists 36–37 D-Index: 990 scientists 38–39 D-Index: 968 scientists 40–41 D-Index: 907 scientists 42–43 D-Index: 821 scientists 44–45 D-Index: 763 scientists 46–47 D-Index: 689 scientists 48–49 D-Index: 543 scientists 50–51 D-Index: 543 scientists 52–53 D-Index: 518 scientists 54–55 D-Index: 500 scientists 56–57 D-Index: 458 scientists 58–59 D-Index: 400 scientists 60–61 D-Index: 337 scientists 62–63 D-Index: 308 scientists 64–65 D-Index: 292 scientists 66–67 D-Index: 249 scientists 68–69 D-Index: 213 scientists 70–71 D-Index: 192 scientists 72–73 D-Index: 189 scientists 74–75 D-Index: 165 scientists 76–77 D-Index: 139 scientists 78–79 D-Index: 119 scientists 80–81 D-Index: 121 scientists 82–83 D-Index: 113 scientists 84–85 D-Index: 88 scientists 86–87 D-Index: 87 scientists 88–89 D-Index: 75 scientists 90–91 D-Index: 69 scientists 92–93 D-Index: 57 scientists 94–95 D-Index: 46 scientists 96–97 D-Index: 38 scientists 98–99 D-Index: 34 scientists 100–101 D-Index: 36 scientists 102–103 D-Index: 27 scientists 104–105 D-Index: 37 scientists 106–107 D-Index: 18 scientists 108–109 D-Index: 31 scientists 110–111 D-Index: 19 scientists 112–113 D-Index: 16 scientists 114–115 D-Index: 12 scientists 116–117 D-Index: 20 scientists 118–119 D-Index: 15 scientists 120–121 D-Index: 5 scientists 122–123 D-Index: 20 scientists 124–125 D-Index: 8 scientists 126–127 D-Index: 5 scientists 128–129 D-Index: 7 scientists 130 D-Index: 3 scientists 131+ D-Index: 98 scientists
30 D-Index 131+

This scientist: 51 D-Index — 63rd percentile

63% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

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