( en | de | ru )

 

Disambiguation of "Schieber, Baruch"

Author of the publication

copydeleteadd this publication to your clipboard
A unified approach to approximating resource allocation and scheduling.

, , , , and . J. ACM, 48 (5): 1069-1090 (2001)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Baruch Baruch

Bernhard Baruch

Otto Baruch

Wolfgang Baruch

Rudolf Baruch

 

Other publications of authors with the same name

Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications., , , and . ISTCS, page 78-88. IEEE Computer Society, (1996)The Preemptive Resource Allocation Problem., , and . FSTTCS, volume 150 of LIPIcs, page 26:1-26:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Slowing Sequential Algorithms for Obtaining Fast Distributed and Parallel Algorithms: Maximum Matchings., and . PODC, page 282-292. ACM, (1986)Improved Selection on Totally Monotone Arrays., , and . FSTTCS, volume 560 of Lecture Notes in Computer Science, page 347-359. Springer, (1991)Improved selection in totally monotone arrays., , , and . Int. J. Comput. Geom. Appl., 3 (2): 115-132 (1993)Fast Geometric Approximation Techniques and Geometric Embedding Problems., , , and . Theor. Comput. Sci., 106 (2): 265-281 (1992)Competitive Paging with Locality of Reference., , , and . J. Comput. Syst. Sci., 50 (2): 244-258 (1995)Partially Disjoint k Shortest Paths., , , and . CoRR, (2022)Throughput maximization of real-time scheduling with batching., , , , , and . SODA, page 742-751. ACM/SIAM, (2002)Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality., , , , and . J. Algorithms, 19 (1): 116-143 (1995)