StringologyTimes

Data Structures and Algorithms: 2013/3/15-21

1: Distributed Dominating Sets on Grids
2: Computing Traversal Times on Dynamic Markovian Paths
3: Ultra-fast Multiple Genome Sequence Matching Using GPU
4: Potential Maximal Clique Algorithms for Perfect Phylogeny Problems
5: Computing convolution on grammar-compressed text
6: Two exact algorithms for the generalized assignment problem
7: A relation between additive and multiplicative complexity of Boolean functions
8: An analytic approach to the asymptotic variance of trie statistics and related structures
9: About Inverse 3-SAT
10: Finding all Convex Cuts of a Plane Graph in Polynomial Time
11: 2-stack pushall sortable permutations
12: Geospatial Optimization Problems
13: Maximum Edge-Disjoint Paths in $k$-sums of Graphs
14: Multi-dimensional sparse structured signal approximation using split Bregman iterations
15: Optimal Partitioning for Dual-Pivot Quicksort