Algorithms

Bicriteria Approximation Algorithms for the Submodular Cover Problem NeurIPS 2023 Can You Improve My Code? Optimizing Programs with Local Search IJCAI 2023 CausalSim: A Causal Framework for Unbiased Trace-Driven Simulation NSDI 2023 Certified CNF Translations for Pseudo-Boolean Solving (Extended Abstract). IJCAI 2023 Characterizing Structural Hardness of Logic Programs: What Makes Cycles and Reachability Hard for Treewidth? AAAI 2023 Chordal Averaging on Flag Manifolds and Its Applications ICCV 2023 Circuit Minimization with QBF-Based Exact Synthesis AAAI 2023 ClusterFuG: Clustering Fully connected Graphs by Multicut ICML 2023 Clustering What Matters: Optimal Approximation for Clustering with Outliers AAAI 2023 Co-Certificate Learning with SAT Modulo Symmetries IJCAI 2023 Community Detection in the Hypergraph SBM: Exact Recovery Given the Similarity Matrix COLT 2023 Complex-to-Real Sketches for Tensor Products with Applications to the Polynomial Kernel AISTATS 2023 Composable Coresets for Determinant Maximization: Greedy is Almost Optimal NeurIPS 2023 Computing (1+epsilon)-Approximate Degeneracy in Sublinear Time IJCAI 2023 Computing all Optimal Partial Transports ICLR 2023 Coneheads: Hierarchy Aware Attention NeurIPS 2023 Conjugate Product Graphs for Globally Optimal 2D-3D Shape Matching CVPR 2023 Consonant is all you need: a compact representation of English text for efficient NLP EMNLP 2023 Constructive TT-representation of the tensors given as index interaction functions with applications ICLR 2023 Counting Knot Mosaics with ALLSAT (Student Abstract) AAAI 2023 CRISP: Curriculum based Sequential neural decoders for Polar code family ICML 2023 Data Structures for Density Estimation ICML 2023 Daycare Matching in Japan: Transfers and Siblings AAAI 2023 Detection-Recovery and Detection-Refutation Gaps via Reductions from Planted Clique COLT 2023 Detection-Recovery Gap for Planted Dense Cycles COLT 2023