StringologyTimes

Data Structures and Algorithms: 2011/11/01-07

1: Multicommodity Flows and Cuts in Polymatroidal Networks
2: Optimization of Convex Functions with Random Pursuit
3: Nearly Complete Graphs Decomposable into Large Induced Matchings and their Applications
4: Anonymous Meeting in Networks
5: Outlier Detection for DNA Fragment Assembly
6: Pancake Flipping is Hard
7: Evaluating geometric queries using few arithmetic operations
8: Computing Optimal Cycle Mean in Parallel on CUDA
9: A Primal Dual Algorithm for a Heterogeneous Traveling Salesman Problem
10: Clique cover and graph separation: New incompressibility results
11: Beating Randomized Response on Incoherent Matrices
12: Towards “Intelligent Compression” in Streams: A Biased Reservoir Sampling based Bloom Filter Approach
13: Multidimensional Balanced Allocation for Multiple Choice & (1 + Beta) Processes
14: On the Value of Job Migration in Online Makespan Minimization
15: Perfectly Balanced Allocation With Estimated Average Using Expected Constant Retries
16: The black-and-white coloring problem on distance hereditary graphs and strongly chordal graphs
17: Active Property Testing
18: Improved integer programming models for simple assembly line balancing and related problems
19: Computing a Nonnegative Matrix Factorization – Provably
20: Many Sparse Cuts via Higher Eigenvalues
21: Multi-way spectral partitioning and higher-order Cheeger inequalities
22: Design and Simulation of an 8-bit Dedicated Processor for calculating the Sine and Cosine of an Angle using the CORDIC Algorithm
23: Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs
24: A Compressed Self-Index for Genomic Databases
25: Generalised k-Steiner Tree Problems in Normed Planes
26: Approximating the Exponential, the Lanczos Method and an \tilde{O}(m)-Time Spectral Algorithm for Balanced Separator
27: The Gathering Problem for Two Oblivious Robots with Unreliable Compasses
28: Improved Smoothed Analysis of Multiobjective Optimization