1: Fast Exact Dynamic Time Warping on Run-Length Encoded Time Series
2: An algorithmic approach to the existence of ideal objects in commutative algebra
3: Cache-Oblivious Priority Queues with Decrease-Key and Applications to Graph Algorithms
4: Accelerating Generalized Linear Models with MLWeaving: A One-Size-Fits-All System for Any-precision Learning (Technical Report)
5: NEARBY Platform for Automatic Asteroids Detection and EURONEAR Surveys
6: Set CRDT com M'ultiplas Pol'iticas de Resolu\c{c}~ao de Conflitos
7: The One-Way Communication Complexity of Dynamic Time Warping Distance
8: Belga B-trees
9: Understanding Sparse JL for Feature Hashing
10: How fast can we reach a target vertex in stochastic temporal graphs?
11: Scalable and Congestion-aware Routing for Autonomous Mobility-on-Demand via Frank-Wolfe Optimization
12: Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems
13: Asymptotically faster algorithm for counting self-avoiding walks and self-avoiding polygons
14: Bus Manufacturing Workshop Scheduling Method with Routing Buffer
15: Reachability and Coverage Planning for Connected Agents: Extended Version
16: Coresets for Ordered Weighted Clustering
17: Optimal (Randomized) Parallel Algorithms in the Binary-Forking Model
18: On the Maximum Weight Independent Set Problem in graphs without induced cycles of length at least five
19: conLSH: Context based Locality Sensitive Hashing for Mapping of noisy SMRT Reads
20: The k-d tree data structure and a proof for neighborhood computation in expected logarithmic time
21: New Dependencies of Hierarchies in Polynomial Optimization
22: Non-Negative Local Sparse Coding for Subspace Clustering
23: Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs
24: Efficient Shortest Path Algorithm Using An Unique And Novel Graph Matrix Representation
25: Distributed and Streaming Linear Programming in Low Dimensions
26: Covert Networks: How Hard is It to Hide?
27: An Exact Algorithm for Minimum Weight Vertex Cover Problem in Large Graphs
28: Fast Approximate Shortest Paths in the Congested Clique