1: Efficient Irregular Wavefront Propagation Algorithms on Hybrid CPU-GPU Machines
2: Thompson Sampling for Contextual Bandits with Linear Payoffs
3: Further Optimal Regret Bounds for Thompson Sampling
4: Graphs: Associated Markov Chains
5: A search for Wilson primes
6: Eight-Fifth Approximation for TSP Paths
7: Improved in-place associative integer sorting
8: Submodularity in Batch Active Learning and Survey Problems on Gaussian Random Fields
9: The non-adaptive query complexity of testing k-parities
10: Profitable Scheduling on Multiple Speed-Scalable Processors
11: On morphological hierarchical representations for image processing and spatial data clustering
12: A Randomized Parallel Algorithm with Run Time $O(n^2)$ for Solving an $n \times n$ System of Linear Equations
13: A combinatorial algorithm to generate all spanning trees of a weighted graph in order of increasing cost
14: QuickHeapsort: Modifications and improved analysis
15: Edge Routing with Ordered Bundles
16: Four Soviets Walk the Dog-Improved Bounds for Computing the Fr'echet Distance
17: Sparsification of Motion-Planning Roadmaps by Edge Contraction
18: Minimum weight spanning trees of weighted scale free networks
19: Deterministic algorithms for skewed matrix products
20: Bouma2 - A Quasi-Stateless, Tunable Multiple String-Match Algorithm
21: Distributing an Exact Algorithm for Maximum Clique: maximising the costup
22: One-side Energy costs of the RBO receiver
23: Counting inequivalent monotone Boolean functions
24: Sorting distinct integers using improved in-place associative sort
25: Energy Aware, Scalable, K-Hop Based Cluster Formation In MANET
26: Algorithms of Fast Search of Center, Radius and Diameter on Weighted Graphs
27: Counting common substrings effectively