5 citations · 14 across the 10 of their papers we have counts for
10 papers
Communication-efficient parallel Bruhat decomposition
Ioanna Evtushevskaya-Konovalova, Alexander Tiskin
The model of bulk-synchronous parallel (BSP) computation is an emerging paradigm of general-purpose parallel computing. Bruhat decomposition is an important method in numerical lin…
The Chvátal-Sankoff problem: Understanding random string comparison through stochastic processes
Alexander Tiskin
Given two equally long, uniformly random binary strings, the expected length of their longest common subsequence (LCS) is asymptotically proportional to the strings' length. Findin…
Parallel Suffix Array Construction by Accelerated Sampling
Matthew Felice Pace, Alexander Tiskin
A deterministic BSP algorithm for constructing the suffix array of a given string is presented, based on a technique which we call accelerated sampling. It runs in optimal O(n/p) l…
Computing alignment plots efficiently
Peter Krusche, Alexander Tiskin
Dot plots are a standard method for local comparison of biological sequences. In a dot plot, a substring to substring distance is computed for all pairs of fixed-size windows in th…
String comparison by transposition networks
Peter Krusche, Alexander Tiskin
Computing string or sequence alignments is a classical method of comparing strings and has applications in many areas of computing, such as signal processing and bioinformatics. Se…
Minimum-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio
Vladimir Deineko, Alexander Tiskin
The Metric Traveling Salesman Problem (TSP) is a classical NP-hard optimization problem. The double-tree shortcutting method for Metric TSP yields an exponentially-sized space of T…