1: BITS-Tree-An Efficient Data Structure for Segment Storage and Query Processing
2: An Algorithmic Pipeline for Analyzing Multi-parametric Flow Cytometry Data
3: Fast generation of complex networks with underlying hyperbolic geometry
4: Efficient Algorithms for the Order Preserving Pattern Matching Problem
5: Lower Bounds in the Preprocessing and Query Phases of Routing Algorithms
6: Algorithms for Scheduling Malleable Cloud Tasks
7: Transductive Multi-view Zero-Shot Learning
8: Scalable Multi-Output Label Prediction: From Classifier Chains to Classifier Trellises
9: Navigability is a Robust Property
10: A practical index for approximate dictionary matching with few mismatches
11: Evacuating Robots from a Disk Using Face-to-Face Communication
12: Stochastic Block Model and Community Detection in the Sparse Graphs: A spectral algorithm with optimal rate of recovery
13: Output-sensitive algorithms for sumset and sparse polynomial multiplication