1: The SuperM-Tree: Indexing metric spaces with sized objects
2: Compressing Gradient Optimizers via Count-Sketches
3: An Extension of Linear-size Suffix Tries for Parameterized Strings
4: The Application of Bipartite Matching in Assignment Problem
5: An efficient sorting algorithm - Ultimate Heapsort(UHS)
6: Decentralized Stochastic Optimization and Gossip Algorithms with Compressed Communication
7: Grid Graph Reachability
8: StaTIX - Statistical Type Inference on Linked Data
9: Scheduling with Predictions and the Price of Misprediction
10: Accuracy Evaluation of Overlapping and Multi-resolution Clustering Algorithms on Large Datasets
11: Itemsets for Real-valued Datasets
12: A Billion Updates per Second Using 30,000 Hierarchical In-Memory D4M Databases
13: Stochastic Enumeration with Importance Sampling
14: A Sequential Importance Sampling Algorithm for Estimating Linear Extensions
15: Study, representation and applications of hypergraph minimal transversals
16: A Faster FPTAS for Knapsack Problem With Cardinality Constraint
17: Ranking Episodes using a Partition Model
18: Can SGD Learn Recurrent Neural Networks with Provable Generalization?
19: Regular Languages meet Prefix Sorting
20: A Unified Framework for Marketing Budget Allocation
21: A New Class of Searchable and Provably Highly Compressible String Transformations
22: Safe projections of binary data sets
23: Distances between Data Sets Based on Summary Statistics
24: (Near) Optimal Adaptivity Gaps for Stochastic Multi-Value Probing
25: Faster way to agony: Discovering hierarchies in directed graphs
26: Discovering Nested Communities
27: Differentially Private Release of High-Dimensional Datasets using the Gaussian Copula
28: Window-based Streaming Graph Partitioning Algorithm
29: An Optimal Algorithm for Online Freeze-tag
30: Riemannian optimization with a preconditioning scheme on the generalized Stiefel manifold
31: Network Resilience Assessment via QoS Degradation Metrics: An Algorithmic Approach
32: Discovering bursts revisited: guaranteed optimization of the model parameters
33: Hamiltonicity below Dirac’s condition
34: Hierarchical Matrix Operations on GPUs: Matrix-Vector Multiplication and Compression
35: Inferring the strength of social ties: a community-driven approach
36: Dynamic hierarchies in temporal directed networks
37: Average-case complexity of a branch-and-bound algorithm for min dominating set
38: A Composable Coreset for k-Center in Doubling Metrics
39: Fast Mean Estimation with Sub-Gaussian Rates
40: Testing Markov Chains without Hitting
41: Firefighting on Trees
42: Top Tree Compression of Tries
43: Toward a Dichotomy for Approximation of $H$-coloring
44: Tiers for peers: a practical algorithm for discovering hierarchy in weighted networks
45: New Amortized Cell-Probe Lower Bounds for Dynamic Problems
46: Finding Good Itemsets by Packing Data
47: On Mean Estimation for General Norms with Statistical Queries
48: A fast algorithm for constructing balanced binary search trees
49: Going Far From Degeneracy