1: 2-Bit Random Projections, NonLinear Estimators, and Approximate Near Neighbor Search
2: High-performance generation of the Hamiltonian and Overlap matrices in FLAPW methods
3: Clustering subgaussian mixtures by semidefinite programming
4: Non-preemptive Scheduling in a Smart Grid Model and its Implications on Machine Minimization
5: siEDM: an efficient string index and search algorithm for edit distance with moves
6: On the Hardness of Partially Dynamic Graph Problems and Connections to Diameter
7: Online Bounded Analysis
8: Analysing Survey Propagation Guided Decimation on Random Formulas
9: Fast Online k-nn Graph Building
10: Principal Component Projection Without Principal Component Analysis
11: Fast Cross-Polytope Locality-Sensitive Hashing
12: Streaming PCA: Matching Matrix Bernstein and Near-Optimal Finite Sample Guarantees for Oja’s Algorithm
13: Synthesis of fast multiplication algorithms for arbitrary tensors
14: Improved Bounds for Shortest Paths in Dense Distance Graphs
15: Scalable Generation of Scale-free Graphs
16: On the Power of Advice and Randomization for Online Bipartite Matching
17: Lens depth function and k-relative neighborhood graph: versatile tools for ordinal data analysis
18: Paging with Multiple Caches
19: Faster Algorithms for the Maximum Common Subtree Isomorphism Problem
20: Approximate Hamming distance in a stream
21: Computing approximate PSD factorizations
22: The robust recoverable spanning tree problem with interval costs is polynomially solvable
23: TRI`EST: Counting Local and Global Triangles in Fully-dynamic Streams with Fixed Memory Size
24: Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs
25: Bayesian Exploration: Incentivizing Exploration in Bayesian Games
26: Noisy population recovery in polynomial time
27: Adaptive Learning with Robust Generalization Guarantees
28: A Note on Modeling Self-Suspending Time as Blocking Time in Real-Time Systems
29: On Satisfiability Problems with a Linear Structure
30: How effective can simple ordinal peer grading be?
31: Zero-Suppressed Computation: A New Computation Inspired by ZDDs
32: Capacitated Kinetic Clustering in Mobile Networks by Optimal Transportation Theory
33: Streaming Verification of Graph Properties
34: An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model
35: Stable Marriage with Covering Constraints: A Complete Computational Trichotomy
36: Theoretical Analysis of the $k$-Means Algorithm - A Survey
37: Construction of Gene and Species Trees from Sequence Data incl. Orthologs, Paralogs, and Xenologs
38: Balanced Allocation: Patience is not a Virtue
39: Cortical Computation via Iterative Constructions
40: Certified Universal Gathering in $R^2$ for Oblivious Mobile Robots
41: Approximation Complexity of Max-Cut on Power Law Graphs
42: Graph Isomorphism for unit square graphs
43: Exact Weighted Minwise Hashing in Constant Time
44: On the Distributed Complexity of Large-Scale Graph Computations
45: On the computational complexity of minimum-concave-cost flow in a two-dimensional grid
46: Online Tree Caching