2017 - ACM Senior Member
Baruch Schieber spends much of his time researching Combinatorics, Approximation algorithm, Time complexity, Mathematical optimization and Path. His research in Combinatorics intersects with topics in Discrete mathematics, Parallel algorithm and Function problem. As part of his studies on Approximation algorithm, Baruch Schieber frequently links adjacent subjects like Multicast.
Baruch Schieber interconnects Enhanced Data Rates for GSM Evolution, Unit and Topology in the investigation of issues within Time complexity. His work investigates the relationship between Mathematical optimization and topics such as Fair-share scheduling that intersect with problems in Dynamic bandwidth allocation, Dynamic priority scheduling and Bandwidth allocation. His study in Path is interdisciplinary in nature, drawing from both Robot and Artificial intelligence.
Baruch Schieber mainly focuses on Combinatorics, Discrete mathematics, Time complexity, Approximation algorithm and Mathematical optimization. His Combinatorics research integrates issues from Computational complexity theory, Parallel algorithm, Upper and lower bounds and Computation tree. His Discrete mathematics research is multidisciplinary, incorporating elements of Path, Computation and Directed acyclic graph.
His work deals with themes such as Function, Dynamic programming, Online algorithm and Lowest common ancestor, which intersect with Time complexity. His biological study spans a wide range of topics, including Euclidean space and Fair-share scheduling. His work on Greedy algorithm as part of general Mathematical optimization research is often related to Schedule, thus linking different fields of science.
Baruch Schieber mostly deals with Combinatorics, Sublinear function, Maximal independent set, Approximation algorithm and Graph. His Submodular set function study in the realm of Combinatorics interacts with subjects such as Suffix tree. As a member of one scientific family, Baruch Schieber mostly works in the field of Sublinear function, focusing on e and, on occasion, Enhanced Data Rates for GSM Evolution, Dynamic problem and Randomized algorithm.
His Approximation algorithm study necessitates a more in-depth grasp of Mathematical optimization. His Graph study also includes
Combinatorics, Time complexity, Sublinear function, Maximal independent set and Algorithm are his primary areas of study. Baruch Schieber has included themes like Metric, Measure, Class, Theory of computation and Optimization problem in his Combinatorics study. His studies deal with areas such as Scalability, Algorithmics, Lowest common ancestor, Parallel algorithm and Search algorithm as well as Time complexity.
His research on Sublinear function concerns the broader Discrete mathematics. His studies in Maximal independent set integrate themes in fields like Range and Randomized algorithm. The concepts of his Algorithm study are interwoven with issues in Point, Center, Complement and Cluster analysis.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
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.
Journal of the ACM (2001)
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.
Mathematics of Operations Research (2002)
Buffer Overflow Management in QoS Switches
Alexander Kesselman;Zvi Lotker;Yishay Mansour;Boaz Patt-Shamir.
SIAM Journal on Computing (2004)
Navigating in Unfamiliar Geometric Terrain
Avrim Blum;Prabhakar Raghavan;Baruch Schieber.
SIAM Journal on Computing (1997)
Divide-and-conquer approximation algorithms via spreading metrics
Guy Even;Joseph Seffi Naor;Satish Rao;Baruch Schieber.
Journal of the ACM (2000)
Approximating the throughput of multiple machines under real-time scheduling
Amotz Bar-Noy;Sudipto Guha;Joseph (Seffi) Naor;Baruch Schieber.
symposium on the theory of computing (1999)
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.
symposium on discrete algorithms (1994)
If you think any of the details on this page are incorrect, let us know.
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: