Foundations

Dynamic Tensor Rematerialization ICLR 2021 Edge Sampling Using Local Network Information JMLR 2021 Efficient and Local Parallel Random Walks NeurIPS 2021 Efficient Coreset Constructions via Sensitivity Sampling ACML 2021 Efficient Deformable Shape Correspondence via Multiscale Spectral Manifold Wavelets Preservation CVPR 2021 Efficient Large Scale Inlier Voting for Geometric Vision Problems ICCV 2021 Efficiently Explaining CSPs with Unsatisfiable Subset Optimization IJCAI 2021 Efficient Sampling of Dependency Structure EMNLP 2021 End-to-End Constrained Optimization Learning: A Survey IJCAI 2021 Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules IJCAI 2021 Exact Acceleration of K-Means++ and K-Means|| IJCAI 2021 Exact Recovery of Clusters in Finite Metric Spaces Using Oracle Queries COLT 2021 Exponentially Improved Dimensionality Reduction for l1: Subspace Embeddings and Independence Testing COLT 2021 Extensions of Karger's Algorithm: Why They Fail in Theory and How They Are Useful in Practice ICCV 2021 Extreme k-Center Clustering AAAI 2021 Facility’s Perspective to Fair Facility Location Problems AAAI 2021 FACS: Fast Code-based Algorithm for Coalition Structure Generation (Student Abstract) AAAI 2021 Fair Scheduling for Time-dependent Resources NeurIPS 2021 Fast Algorithms for Relational Marginal Polytopes IJCAI 2021 Faster Binary Embeddings for Preserving Euclidean Distances ICLR 2021 Faster Multi-Object Segmentation Using Parallel Quadratic Pseudo-Boolean Optimization ICCV 2021 Fast WordPiece Tokenization EMNLP 2021 Finding Consensus Bugs in Ethereum via Multi-transaction Differential Fuzzing OSDI 2021 Finding Invariants of Distributed Systems: It's a Small (Enough) World After All NSDI 2021 Finding the Hardest Formulas for Resolution (Extended Abstract) IJCAI 2021