1: Multi-Slot Tag Assignment Problem in Billboard Advertisement
2: A Tie-breaking based Local Search Algorithm for Stable Matching Problems
3: Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search
4: Entrywise Approximate Laplacian Solving
5: Efficient approximation schemes for scheduling on a stochastic number of machines
6: High-level quantum algorithm programming using Silq
7: Pareto Sums of Pareto Sets: Lower Bounds and Algorithms
8: Reducing Leximin Fairness to Utilitarian Optimization
9: Provably Efficient Infinite-Horizon Average-Reward Reinforcement Learning with Linear Function Approximation
10: Clustering with Non-adaptive Subset Queries
11: Selective algorithm processing of subset sum distributions
12: Online Combinatorial Allocations and Auctions with Few Samples
13: Tight Bounds for Classical Open Addressing
14: Learning-Augmented Frequency Estimation in Sliding Windows
15: The Sample Complexity of Smooth Boosting and the Tightness of the Hardcore Theorem
16: A novel DFS/BFS approach towards link prediction
17: Reconfiguration of labeled matchings in triangular grid graphs
18: On the complexity of the upgrading version of the maximal covering location problem
19: Optimal Offline ORAM with Perfect Security via Simple Oblivious Priority Queues
20: Lempel-Ziv (LZ77) Factorization in Sublinear Time
21: Generalized compression and compressive search of large datasets
22: Canonical forms for matrix tuples in polynomial time
23: Mimicking Networks for Constrained Multicuts in Hypergraphs
24: Quantum Channel Testing in Average-Case Distance
25: Comparing the Hardness of Online Minimization and Maximization Problems with Predictions
26: Unrolled denoising networks provably learn optimal Bayesian inference
27: Learning Partitions using Rank Queries
28: Fast decision tree learning solves hard coding-theoretic problems
29: Obstacle-Free Path Planning for Autonomous Drones Using Floyd Algorithm
30: Evaluating Optimal Safe Flows Decomposition for RNA Assembly
31: Dynamic parameterized problems on unit disk graphs
32: EF1 and EFX Orientations
33: An average case efficient algorithm for solving two variable linear diophantine equations