Communication vs Synchronisation in Parallel String Comparison | 0 | 0.34 | 2020 |
State-of-the-art in string similarity search and join | 17 | 0.65 | 2014 |
Four-point conditions for the TSP: The complete complexity classification. | 0 | 0.34 | 2014 |
Efficient high-similarity string comparison: the waterfall algorithm | 0 | 0.34 | 2013 |
Approximate string matching as an algebraic computation. | 0 | 0.34 | 2012 |
Towards approximate matching in compressed strings: local subsequence recognition | 6 | 0.44 | 2011 |
Boundary properties of graphs for algorithmic graph problems | 7 | 0.55 | 2011 |
Hamiltonian cycles in subcubic graphs: what makes the problem difficult | 1 | 0.37 | 2010 |
New algorithms for efficient parallel string comparison | 4 | 0.38 | 2010 |
Fast Distance Multiplication of Unit-Monge Matrices. | 11 | 0.60 | 2010 |
Parallel selection by regular sampling | 1 | 0.44 | 2010 |
Computing alignment plots efficiently | 0 | 0.34 | 2009 |
Parallel longest increasing subsequences in scalable time and memory | 3 | 0.39 | 2009 |
String comparison by transposition networks | 3 | 0.37 | 2009 |
Periodic String Comparison | 4 | 0.39 | 2009 |
Fast minimum-weight double-tree shortcutting for metric TSP: Is the best one good enough? | 3 | 0.41 | 2009 |
Semi-local longest common subsequences in subquadratic time | 19 | 0.82 | 2008 |
Packing tripods: Narrowing the density gap | 1 | 0.63 | 2007 |
Fast minimum-weight double-tree shortcutting for metric TSP | 4 | 0.45 | 2007 |
Communication-efficient parallel generic pairwise elimination | 12 | 0.74 | 2007 |
One-Sided monge TSP is NP-Hard | 1 | 0.35 | 2006 |
All semi-local longest common subsequences in subquadratic time | 6 | 0.52 | 2006 |
Longest common subsequences in permutations and maximum cliques in circle graphs | 7 | 0.48 | 2006 |
Efficient longest common subsequence computation using bulk-synchronous parallelism | 6 | 0.44 | 2006 |
Communication lower bounds for distributed-memory matrix multiplication | 104 | 4.41 | 2004 |