1: On an Algorithm for Obtaining All Binary Matrices of Special Class Related to V. E. Tarakanov’s Formula
2: Random Permutations, Random Sudoku Matrices and Randomized Algorithms
3: Some Combinatorial Problems on Binary Matrices in Programming Courses
4: Property-Testing in Sparse Directed Graphs: 3-Star-Freeness and Connectivity
5: Cache-Oblivious Peeling of Random Hypergraphs
6: Sherali-Adams gaps, flow-cover inequalities and generalized configurations for capacity-constrained Facility Location
7: The Input/Output Complexity of Triangle Enumeration
8: Design and Analysis of an Estimation of Distribution Approximation Algorithm for Single Machine Scheduling in Uncertain Environments
9: Understanding Alternating Minimization for Matrix Completion
10: Faster and Sample Near-Optimal Algorithms for Proper Learning Mixtures of Gaussians
11: Bandits and Experts in Metric Spaces
12: Orienting Fully Dynamic Graphs with Worst-Case Time Bounds
13: Vertex Disjoint Path in Upward Planar Graphs
14: Efficient construction of the lattice of frequent closed patterns and simultaneous extraction of generic bases of rules
15: The Parameterized Complexity of Reasoning Problems Beyond NP
16: Beating the Generator-Enumeration Bound for $p$-Group Isomorphism
17: Optimal Error Rates for Interactive Coding II: Efficiency and List Decoding
18: Optimal Error Rates for Interactive Coding I: Adaptivity and Other Settings
19: Exponential lower bounds on the size of approximate formulations in the natural encoding for Capacitated Facility Location
20: Welfare Maximization and Truthfulness in Mechanism Design with Ordinal Preferences
21: A Distributed Algorithm for Constructing a Minimum Diameter Spanning Tree
22: Approximating the Stationary Probability of a Single State in a Markov chain
23: RAM-Efficient External Memory Sorting