1: Random walks which prefer unvisited edges. Exploring high girth even degree expanders in linear time
2: Learning Topic Models - Going beyond SVD
3: Succinct Posets
4: Parallel and sequential in-place permuting and perfect shuffling using involutions
5: Approximating the Expansion Profile and Almost Optimal Local Graph Clustering
6: On Chubanov’s method for Linear Programming
7: Computing Constrained Cramer Rao Bounds
8: Adaptive Techniques to find Optimal Planar Boxes
9: On Thresholds for the Appearance of 2-cores in Mixed Hypergraphs
10: The Johnson-Lindenstrauss Transform Itself Preserves Differential Privacy
11: Modeling Relational Data via Latent Factor Blockmodel
12: Privacy via the Johnson-Lindenstrauss Transform
13: On Vertex Sparsifiers with Steiner Nodes
14: Disconnectivity and Relative Positions in Simultaneous Embeddings
15: Improved Randomized Online Scheduling of Intervals and Jobs
16: Label-Guided Graph Exploration with Adjustable Ratio of Labels
17: Algorithms for Junctions in Directed Acyclic Graphs