1k citations · 1.7k across the 27 of their papers we have counts for
3 papers · 1 filter
On the String Consensus Problem and the Manhattan Sequence Consensus Problem
Tomasz Kociumaka, Jakub W. Pachocki, Jakub Radoszewski +2
In the Manhattan Sequence Consensus problem (MSC problem) we are given integer sequences, each of length , and we are to find an integer sequence of length (called a…
Stretching Stretch
Michael B. Cohen, Gary L. Miller, Jakub W. Pachocki +2
We give a generalized definition of stretch that simplifies the efficient construction of low-stretch embeddings suitable for graph algorithms. The generalization, based on discoun…
Preconditioning in Expectation
Michael B. Cohen, Rasmus Kyng, Jakub W. Pachocki +2
We show that preconditioners constructed by random sampling can perform well without meeting the standard requirements of iterative methods. When applied to graph Laplacians, this…