PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Schieber, Baruch"

Author of the publication

copydeleteadd this publication to your clipboard
A Tight Bound for Approximating the Square Root.

, , , and . Inf. Process. Lett., 63 (4): 211-213 (1997)

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.

No persons found for author name Schieber, Baruch
add a person with the name Schieber, Baruch
 

Other publications of authors with the same name

Lower Bounds on the Depth of Monotone Arithmetic Computations., and . J. Complexity, 15 (1): 17-29 (1999)Traffic Engineering of Management Flows by Link Augmentations on Confluent Trees., , , , , and . Theory Comput. Syst., 42 (1): 2-26 (2008)Competitive Paging with Locality of Reference., , , and . J. Comput. Syst. Sci., 50 (2): 244-258 (1995)Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality., , , , and . J. Algorithms, 19 (1): 116-143 (1995)Finding the Edge Connectivity of Directed Graphs., and . J. Algorithms, 10 (1): 76-85 (1989)Fast Geometric Approximation Techniques and Geometric Embedding Problems., , , and . Theor. Comput. Sci., 106 (2): 265-281 (1992)Throughput maximization of real-time scheduling with batching., , , , , and . SODA, page 742-751. ACM/SIAM, (2002)Efficient Parallel Algorithms for Testing Connectivity and Finding Disjoint s-t Paths in Graphs (Extended Summary), and . FOCS, page 288-293. IEEE Computer Society, (1989)A Linear-time Algorithm for Computing the Intersection of All Odd Cycles in a Graph., and . Discrete Applied Mathematics, 73 (1): 27-34 (1997)On finding most uniform spanning trees., and . Discrete Applied Mathematics, 20 (2): 173-175 (1988)