Foundations

Efficient Fault-Tolerant Search by Fast Indexing of Subnetworks AAAI 2025 Efficient Image Similarity Search with Quadtrees (Student Abstract) AAAI 2025 Eliminating Majority Illusion Is Easy AAAI 2025 Empirical Error Estimates for Graph Sparsification AISTATS 2025 Enabling Portable and High-Performance SmartNIC Programs with Alkali NSDI 2025 Enumerating Optimal Cost-Constrained Adjustment Sets UAI 2025 Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size AAAI 2025 Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures AAAI 2025 Exact Algorithms with New Upper Bounds for the Maximum k-plex Problem IJCAI 2025 Exact Community Recovery under Side Information: Optimality of Spectral Algorithms ICLR 2025 Exploiting Symmetries in MUS Computation AAAI 2025 Fair Clustering in the Sliding Window Model ICLR 2025 Fast and Stronger Lower Bounds for Planar Euclidean Shortest Paths IJCAI 2025 Fast and Synchronous Crash Consistency with Metadata Write-Once File System OSDI 2025 Fast Calculation of Feature Contributions in Boosting Trees UAI 2025 Faster Approximation Algorithms for k-Center via Data Reduction ICML 2025 Faster Global Minimum Cut with Predictions ICML 2025 Fast Min-$ε$ Segmented Regression using Constant-Time Segment Merging ICML 2025 First-Order Automata AAAI 2025 Fraud-Proof Revenue Division on Subscription Platforms ICML 2025 From Your Block to Our Block: How to Find Shared Structure Between Stochastic Block Models over Multiple Graphs AAAI 2025 Fully Dynamic Adversarially Robust Correlation Clustering in Polylogarithmic Update Time AISTATS 2025 Fully-Scalable Massively Parallel Algorithm for k-center with Outliers AAAI 2025 Fusing Reward and Dueling Feedback in Stochastic Bandits ICML 2025 Gaussian Mean Testing under Truncation AISTATS 2025