← Foundations
Computer Science › Foundations ›

Algorithms

1295 directly classified papers

Papers per year

Papers

Exact ASP Counting with Compact Encodings AAAI 2024
Learning Small Decision Trees with Few Outliers: A Parameterized Perspective AAAI 2024
Foundations of Reactive Synthesis for Declarative Process Specifications AAAI 2024
A Compiler for Weak Decomposable Negation Normal Form AAAI 2024
Approximation Algorithms for Preference Aggregation Using CP-Nets AAAI 2024
Complexity of Credulous and Skeptical Acceptance in Epistemic Argumentation Framework AAAI 2024
Unravelling Expressive Delegations: Complexity and Normative Analysis AAAI 2024
HDQMF: Holographic Feature Decomposition Using Quantum Algorithms CVPR 2024
On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions? AAAI 2024
The Complexity of Optimizing Atomic Congestion AAAI 2024
Double Auction on Diffusion Network AAAI 2024
Opponent-Model Search in Games with Incomplete Information AAAI 2024
A Structure-Aware Framework for Learning Device Placements on Computation Graphs NIPS 2024
Strategyproof Mechanisms for Group-Fair Obnoxious Facility Location Problems AAAI 2024
Towards Optimal Subsidy Bounds for Envy-Freeable Allocations AAAI 2024
Adversarially Robust Dense-Sparse Tradeoffs via Heavy-Hitters NIPS 2024
PyFoma: a Python finite-state compiler module ACL 2024
Pygmtools: A Python Graph Matching Toolkit JMLR 2024
Proportional Representation in Metric Spaces and Low-Distortion Committee Selection AAAI 2024
Low-Distortion Clustering with Ordinal and Limited Cardinal Information AAAI 2024
PAMI: An Open-Source Python Library for Pattern Mining JMLR 2024
Disjoint Partial Enumeration without Blocking Clauses AAAI 2024
Random Subgraph Detection Using Queries JMLR 2024
SAT-Based Algorithms for Regular Graph Pattern Matching AAAI 2024
SVARM-IQ: Efficient Approximation of Any-order Shapley Interactions through Stratification AISTATS 2024