StringologyTimes

Data Structures and Algorithms: 2009/12/08-14

1: Energy Efficient Scheduling via Partial Shutdown
2: Algorithms and Hardness for Subspace Approximation
3: A survey on algorithmic aspects of modular decomposition
4: Decoherence in Search Algorithms
5: An exact algorithm for graph partitioning
6: Lexicographic Multi-objective Geometric Programming Problems
7: Efficient Gaussian Elimination on a 2D SIMD Array of Processors without Column Broadcasts
8: Renewal theory in analysis of tries and strings
9: Computing a Discrete Logarithm in O(n^3)
10: Faster Algorithms for Finding and Counting Subgraphs
11: Succinct Coverage Oracles
12: Distributed Branching Bisimulation Minimization by Inductive Signatures
13: Construction Sequences and Certifying 3-Connectedness
14: Global Alignment of Molecular Sequences via Ancestral State Reconstruction