3 papers
math.HO2007
Overhang
Mike Paterson, Uri Zwick
How far off the edge of the table can we reach by stacking identical, homogeneous, frictionless blocks of length 1? A classical solution achieves an overhang of , wher…
math.HO2007
Maximum overhang
Mike Paterson, Yuval Peres, Mikkel Thorup +2
How far can a stack of identical blocks be made to hang over the edge of a table? The question dates back to at least the middle of the 19th century and the answer to it was wi…
cs.DS2000
All Pairs Shortest Paths using Bridging Sets and Rectangular Matrix Multiplication
Uri Zwick
We present two new algorithms for solving the {\em All Pairs Shortest Paths} (APSP) problem for weighted directed graphs. Both algorithms use fast matrix multiplication algorithms.…