Baruch Schieber

Q: What Schools Are Affiliated With Baruch Schieber

Baruch Schieber is affiliated with the following schools: Technion – Israel Institute of Technology, New Jersey Institute of Technology, Tel Aviv University

Baruch Schieber's AcademicInfluence.com Rankings

Baruch Schieber

Computer Science

#8479

World Rank

#8912

Historical Rank

Database

#8188

World Rank

#8540

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Baruch Schieber Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Baruch M. Schieber is a Professor of the Department of Computer Science at the New Jersey Institute of Technology and Director of the Institute for Future Technologies. Early life and education Baruch Schieber was born in Tel Aviv and was raised in Givatayim . His father was a bank branch manager and his mother a housemaker. He graduated from Zeitlin High School in 1976.

(See a Problem?)

Baruch Schieber's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

On Finding Lowest Common Ancestors: Simplification and Parallelization (1988) (548)
A unified approach to approximating resource allocation and scheduling (2001) (357)
Approximating Minimum Feedback Sets and Multicuts in Directed Graphs (1998) (284)
Competitive paging with locality of reference (1991) (257)
Minimizing service and operation costs of periodic scheduling (2002) (249)
Divide-and-conquer approximation algorithms via spreading metrics (1995) (221)
Buffer overflow management in QoS switches (2001) (214)
Navigating in unfamiliar geometric terrain (1991) (207)
Approximating the Throughput of Multiple Machines in Real-Time Scheduling (2002) (184)
Efficient routing and scheduling algorithms for optical networks (1994) (163)
Fast approximate graph partitioning algorithms (1997) (154)
Scalable Fair Clustering (2019) (139)
Parallel Ear Decomposition Search (EDS) and st-Numbering in Graphs (1986) (132)
Optimal Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values (1993) (122)
Highly parallelizable problems (1989) (112)
The complexity of finding most vital arcs and nodes (1995) (107)
The Canadian Traveller Problem (1991) (105)
Approximating Minimum Feedback Sets and Multi-Cuts in Directed Graphs (1995) (98)
A quasi-PTAS for unsplittable flow on line graphs (2006) (96)
Resource optimization in QoS multicast routing of real-time multimedia (2004) (96)
A unified approach to approximating resource allocation and scheduling (2000) (87)
Efficient routing in optical networks (1996) (86)
The angular-metric traveling salesman problem (1997) (86)
Computing a minimum-weight k-link path in graphs with the concave Monge property (1995) (82)
On-line dynamic programming with applications to the prediction of RNA secondary structure (1991) (80)
Finding a minimum-weightk-link path in graphs with the concave Monge property and applications (1994) (80)
An Efficient Algorithm for the All Pairs Suffix-Prefix Problem (1992) (79)
A sublinear space, polynomial time algorithm for directed s-t connectivity (1992) (78)
Multicasting in heterogeneous networks (1998) (78)
Bandwidth allocation with preemption (1995) (74)
Fully dynamic maximal independent set with sublinear update time (2018) (60)
Efficient recovery from power outage (extended abstract) (1999) (60)
Message Multicasting in Heterogeneous Networks (2000) (59)
Further Improvements in Competitive Guarantees for QoS Buffering (2004) (56)
Finding a minimum weight K-link path in graphs with Monge property and applications (1993) (56)
Fast deflection routing for packets and worms (1993) (56)
Approximating the throughput of multiple machines under real-time scheduling (1999) (56)
Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas (2002) (53)
Parallel construction of a suffix tree with applications (1988) (53)
Efficient parallel algorithms for testing connectivity and finding disjoint s-t paths in graphs (1989) (52)
Deterministic Many-to-Many Hot Potato Routing (1997) (51)
Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs (2008) (48)
Optimal multiple message broadcasting in telephone-like communication systems (1994) (47)
On Independent Spanning Trees (1992) (44)
Guaranteeing fair service to persistent dependent tasks (1995) (43)
Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications (2000) (43)
Pushing dependent data in clients-providers-servers systems (2000) (42)
Computing the minimum DNF representation of Boolean functions defined by intervals (2005) (38)
Throughput maximization of real-time scheduling with batching (2002) (36)
Fully Dynamic Maximal Independent Set with Sublinear in n Update Time (2018) (35)
Lower bounds for integer greatest common divisor computations (1988) (35)
Non-Preemptive Min-Sum Scheduling with Resource Augmentation (2007) (34)
Minimizing Busy Time in Multiple Machine Real-time Scheduling (2010) (34)
Computing global combine operations in the multi-port postal model (1993) (31)
Minimizing Setup and Beam-On Times in Radiation Therapy (2006) (29)
Efficient minimum cost matching using quadrangle inequality (1992) (29)
Lower Bounds for Computations with the Floor Operation (1989) (29)
Fast geometric approximation techniques and geometric embedding problems (1989) (28)
On finding most uniform spanning trees (1988) (28)
Improved approximations for shallow-light spanning trees (1997) (28)
Dynamic pricing for impatient bidders (2007) (27)
Subgraph Counting: Color Coding Beyond Trees (2016) (27)
Calling Names on Nameless Networks (1994) (26)
Slowing sequential algorithms for obtaining fast distributed and parallel algorithms: maximum matchings (1986) (26)
Minimizing migrations in fair multiprocessor scheduling of persistent tasks (2004) (23)
Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality (1995) (23)
Fully Dynamic MIS in Uniformly Sparse Graphs (2018) (23)
Parallel Construction of a Suffix Tree (Extended Abstract) (1987) (23)
Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm (1990) (22)
An Optimal Algorithm for computing Census Functions in Message-Passing Systems (1993) (22)
Sparse LCS Common Substring Alignment (2003) (22)
How much can hardware help routing? (1997) (21)
Finding the Edge Connectivity of Directed Graphs (1989) (21)
Real-time scheduling to minimize machine busy times (2015) (20)
OPTIMAL PREPROCESSING FOR S ANSWERING ON-LINE PRODUCT QUERIE (1987) (19)
The Euclidean k-Supplier Problem (2013) (18)
Improved approximations of crossings in graph drawings (2000) (18)
Online server allocation in a server farm via benefit task systems (2001) (18)
Pushing Dependent Data in Clients–Providers–Servers Systems (2003) (18)
Calling names in nameless networks (1989) (18)
optimal Computation of Census Functions in the Postal Model (1995) (17)
Constrained Submodular Maximization via Greedy Local Search (2017) (17)
Resource optimization in QoS multicast routing of real-time multimedia (2000) (16)
The Power of Multimedia: Combining Point-to-Point and Multiaccess Networks (2018) (16)
Globally Optimal Symbolic Regression (2017) (16)
Vehicle Routing and Staffing for Sedan Service (2006) (16)
Competitive dynamic bandwidth allocation (1998) (14)
A fast parallel algorithm for finding the convex hull of a sorted point set (1996) (14)
The complexity of approximating the square root (1989) (14)
Re-Use Dynamic Programming for Sequence Alignment: An Algorithmic Toolkit (2005) (14)
All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns (2013) (14)
A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness (2003) (13)
How much can hardware help routing? (1993) (12)
Highly Parallelizable Problems (Extended Abstract) (1989) (12)
Inventory allocation and transportation scheduling for logistics of network-centric military operations (2007) (12)
A Linear-time Algorithm for Computing the Intersection of All Odd Cycles in a Graph (1997) (11)
Computing external farthest neighbors for a simple polygon (2015) (11)
E cient Routing in Optical Networks (1996) (10)
The intractability of bounded protocols for on-line sequence transmission over non-FIFO channels (1992) (10)
Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract). (1995) (9)
The edge versus path incidence matrix of series-parallel graphs and greedy packing (2001) (9)
A deterministicO(k3)-competitivek-server algorithm for the circle (1994) (8)
The intractability of bounded protocols for non-FIFO channels (1989) (8)
Parallel Algorithms for Maximum Bipartite Matchings and Maximum 0-1 Flows (1989) (8)
Improved selection in totally monotone arrays (1993) (7)
Brief Announcement: Flexible Resource Allocation for Clouds and All-Optical Networks (2016) (6)
The power of multimedia: combining point-to point and multi-access networks (1988) (5)
Fast exponentiation using the truncation operation (1992) (5)
A Tight Bound for Approximating the Square Root (1997) (5)
Parallel Ear Decomposition Search (EDS) and St-Numbering in Graphs (Extended Abstract) (1986) (5)
The Approximability of the Binary Paintshop Problem (2013) (5)
Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy (2011) (4)
Fast Deflection Routing for Packets and Worms (Extended Summary). (1993) (4)
Lower bounds on the depth of monotone arithmetic computations (1992) (4)
Competitive Paging with Locality of Reference (Preliminary Version) (1991) (3)
Complexity and inapproximability results for the Power Edge Set problem (2018) (3)
Interleaved Algorithms for Constrained Submodular Function Maximization (2017) (2)
Rank Aggregation with Proportionate Fairness (2022) (2)
Generalized Assignment of Time-Sensitive Item Groups (2018) (2)
Efficient Parallel Algorithms for Testing Connectivity and Finding Disjoint s-t Paths in Graphs (Extended Summary) (1989) (2)
Flexible Resource Allocation to Interval Jobs (2019) (2)
Real-Time k-bounded Preemptive Scheduling (2016) (2)
Flexible Resource Allocation for Clouds and All-Optical Networks (2016) (1)
Traffic Engineering of Management Flows by Link Augmentations on Confluent Trees (2005) (1)
EÆcient Recovery from Power Outage ( Extended Summary ) (1)
A Theory and Algorithms for Combinatorial Reoptimization (2017) (1)
Navigating in Unfamiliar Geometric Terrain (Preliminary Version) (1991) (1)
Brief Announcement: Approximation Algorithms for Preemptive Resource Allocation (2018) (1)
Generalized Assignment via Submodular Optimization with Reserved Capacity (2019) (1)
Improved Selection on Totally Monotone Arrays (1991) (1)
Spreading Metric Based Graph Partitioning Algorithms (1997) (0)
XX : 2 Generalized Assignment via Submodular Optimization bins (2019) (0)
Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput (2022) (0)
The Container Selection Problem (2015) (0)
The Preemptive Resource Allocation Problem (2018) (0)
Aumann and Rabani On-line Admission Control and Circuit Routing for High Performance Computing and Communication. 4.2 from Throughput to Realization 5 Routing on the Hypercube (0)
Satisfying Complex Top-k Fairness Constraints by Preference Substitutions (2022) (0)
Real-time scheduling to minimize machine busy times (2014) (0)
The Complexity of Approximating the Square Root (Extended Summary) (1989) (0)
5. Conclusion and Open Problems Step 4.3 for Each Internal Node Build Tablem , 1 for Array M in M , Level of the Tree Number of Children per Node (0)
Partially Disjoint k Shortest Paths (2022) (0)
Complexity and inapproximability results for the Power Edge Set problem (2017) (0)
Flexible Resource Allocation for Optical Networks (2014) (0)
Buffer Over ¤ ow Management in QoS Switches Extended (2001) (0)
Theorem 3.3 the Optimal Ooset for River Routing Can Be Found with O(n Lglg N) (0)
Maximizing Throughput in Flow Shop Real-Time Scheduling (2020) (0)
Quick Minimization of Tardy Processing Time on a Single Machine (2023) (0)
Flexible Resource Allocation to Interval Jobs (2019) (0)
Proof. Reduction from Planar 3-sat. 2 5 Conclusions 4 Translators in General Wdm Networks (1998) (0)
Preface (2007) (0)
How well can Priceline sell airline tickets ? (0)
Sek and S. Suri. Farthest Neighbors, Maximum Spanning Trees and Related Problems In (0)
Lower Bounds for Constant Depth Circuits for Preex Problems, in Proc. of 10th International 5. Conclusion and Open Problems (1992) (0)
Navigating in Unfamiliar Geometric Terrain (Extended Summary) (1991) (0)
Competitive Paging with Locality of Reference (Brief Summary) (1991) (0)

This paper list is powered by the following services:

Other Resources About Baruch Schieber

en.wikipedia.org

What Schools Are Affiliated With Baruch Schieber?

Baruch Schieber is affiliated with the following schools: