← Foundations
Computer Science › Foundations ›

Algorithms

1295 directly classified papers

Papers per year

Papers

Sequential Signal Mixing Aggregation for Message Passing Graph Neural Networks NIPS 2024
Adversarially Robust Dense-Sparse Tradeoffs via Heavy-Hitters NIPS 2024
Engineering an Exact Pseudo-Boolean Model Counter AAAI 2024
SAT-Based Tree Decomposition with Iterative Cascading Policy Selection AAAI 2024
First Passage Percolation with Queried Hints AISTATS 2024
Rethinking the Soft Conflict Pseudo Boolean Constraint on MaxSAT Local Search Solvers IJCAI 2024
LinNet: Linear Network for Efficient Point Cloud Representation Learning NIPS 2024
Model Counting and Sampling via Semiring Extensions AAAI 2024
Low-Distortion Clustering with Ordinal and Limited Cardinal Information AAAI 2024
SVARM-IQ: Efficient Approximation of Any-order Shapley Interactions through Stratification AISTATS 2024
Proportional Representation in Metric Spaces and Low-Distortion Committee Selection AAAI 2024
John Ellipsoids via Lazy Updates NIPS 2024
Robust Self-calibration of Focal Lengths from the Fundamental Matrix CVPR 2024
Probabilistic Sampling of Balanced K-Means using Adiabatic Quantum Computing CVPR 2024
Online Algorithms with Costly Predictions AISTATS 2023
4 and 7-bit Labeling for Projective and Non-Projective Dependency Trees EMNLP 2023
Morphological Inflection with Phonological Features ACL 2023
Complex-to-Real Sketches for Tensor Products with Applications to the Polynomial Kernel AISTATS 2023
Finite Entailment of UCRPQs over ALC Ontologies (Extended Abstract) IJCAI 2023
A Formal Perspective on Byte-Pair Encoding ACL 2023
Three Iterations of (d − 1)-WL Test Distinguish Non Isometric Clouds of d-dimensional Points NIPS 2023
Fair Division with Two-Sided Preferences IJCAI 2023
RON: One-Way Circular Shortest Routing to Achieve Efficient and Bounded-waiting Spinlocks OSDI 2023
Counting Knot Mosaics with ALLSAT (Student Abstract) AAAI 2023
Efficient Object Search in Game Maps IJCAI 2023