1 paper
Sara Khichane, Vincent Neiger
The fastest known algorithms for dealing with structured matrices, in the sense of the displacement rank measure, are randomized. For handling classical displacement structures, th…