← Foundations
Computer Science › Foundations ›

Algorithms

1295 directly classified papers

Papers per year

Papers

Quantum Algorithms for Sampling Log-Concave Distributions and Estimating Normalizing Constants NIPS 2022
Online Algorithms for the Santa Claus Problem NIPS 2022
Sublinear Algorithms for Hierarchical Clustering NIPS 2022
Self-Explaining Deviations for Coordination NIPS 2022
The Bullets Puzzle: A Paper-and-Pencil Minesweeper AAAI 2022
Searching for BurgerFormer with Micro-Meso-Macro Space Design ICML 2022
Correlation Clustering via Strong Triadic Closure Labeling: Fast Approximation Algorithms and Practical Lower Bounds ICML 2022
Practical Almost-Linear-Time Approximation Algorithms for Hybrid and Overlapping Graph Clustering ICML 2022
A Scalable Parallel Algorithm for Balanced Sampling (Student Abstract) AAAI 2022
Differentially Private Approximate Quantiles ICML 2022
Adapting k-means Algorithms for Outliers ICML 2022
Domain-Lifted Sampling for Universal Two-Variable Logic and Extensions AAAI 2022
A*+BFHS: A Hybrid Heuristic Search Algorithm AAAI 2022
Certified Symmetry and Dominance Breaking for Combinatorial Optimisation AAAI 2022
Extended Goal Recognition Design with First-Order Computation Tree Logic AAAI 2022
New Results in Bounded-Suboptimal Search AAAI 2022
Let’s Agree to Degree: Comparing Graph Convolutional Networks in the Message-Passing Framework ICML 2021
Fixed-Parameter and Approximation Algorithms for PCA with Outliers ICML 2021
Cyclically Equivariant Neural Decoders for Cyclic Codes ICML 2021
Additive Error Guarantees for Weighted Low Rank Approximation ICML 2021
A Decomposition Model for Stereo Matching CVPR 2021
Hyperdimensional Computing as a Framework for Systematic Aggregation of Image Descriptors CVPR 2021
Fast WordPiece Tokenization EMNLP 2021
Splitting EUD Graphs into Trees: A Quick and Clatty Approach ACL 2021
A Root of a Problem: Optimizing Single-Root Dependency Parsing EMNLP 2021