1: Mixtures of Gaussians are Privately Learnable with a Polynomial Number of Samples
2: On generalized corners and matrix multiplication
3: Noisy Computing of the $\mathsf{OR}$ and $\mathsf{MAX}$ Functions
4: Hardness of Approximating Bounded-Degree Max 2-CSP and Independent Set on k-Claw-Free Graphs
5: Shortest Path with Positive Disjunctive Constraints – a Parameterized Perspective
6: Value-Compressed Sparse Column (VCSC): Sparse Matrix Storage for Redundant Data
7: Quantum Algorithm for Maximum Biclique Problem
8: Recursive Error Reduction for Regular Branching Programs
9: On Interactive Coding Schemes with Adaptive Termination
10: Parallel Submodular Function Minimization
11: A constant factor approximation for Nash social welfare with subadditive valuations
12: Hutchinson’s Estimator is Bad at Kronecker-Trace-Estimation
13: How to assign volunteers to tasks compatibly ? A graph theoretic and parameterized approach
14: Parallel RAM from Cyclic Circuits
15: Streaming Semidefinite Programs: $O(\sqrt{n})$ Passes, Small Space and Fast Runtime
16: 2-Approximation for Prize-Collecting Steiner Forest
17: Graph Matching in Correlated Stochastic Block Models for Improved Graph Clustering
18: Data Summarization beyond Monotonicity: Non-monotone Two-Stage Submodular Maximization
19: Influence Maximization in Ising Models
20: Two-way Linear Probing Revisited
21: Testing Spreading Behavior in Networks with Arbitrary Topologies
22: Let them have CAKES: A Cutting-Edge Algorithm for Scalable, Efficient, and Exact Search on Big Data
23: Sumplete is Hard, Even with Two Different Numbers
24: Concentration of Submodular Functions and Read-k Families Under Negative Dependence
25: Errors are Robustly Tamed in Cumulative Knowledge Processes
26: Concurrent Composition for Interactive Differential Privacy with Adaptive Privacy-Loss Parameters
27: Private Distribution Testing with Heterogeneous Constraints: Your Epsilon Might Not Be Mine
28: Proceedings of the 31st International Symposium on Graph Drawing and Network Visualization (GD 2023)
29: The Time Complexity of Fully Sparse Matrix Multiplication
30: Fault-Tolerant Spanners against Bounded-Degree Edge Failures: Linearly More Faults, Almost For Free
31: Undetectable Selfish Mining
32: Harvesting Brownian Motion: Zero Energy Computational Sampling
33: Breaking the k/log k Barrier in Collective Tree Exploration via Tree-Mining
34: International Competition on Graph Counting Algorithms 2023
35: A Fast Optimization View: Reformulating Single Layer Attention in LLM Based on Tensor and SVM Trick, and Solving It in Matrix Multiplication Time
36: Massively-Parallel Heat Map Sorting and Applications To Explainable Clustering
37: On Supmodular Matrices
38: Dynamic programming on bipartite tree decompositions