conftrace_
← Foundations
Computer Science › Foundations ›

Algorithms

1,298 papers

Papers per year

1
6
27
149
97
'05
'10
'15
'20
'25

Papers

Improved Coresets and Sublinear Algorithms for Power Means in Euclidean Spaces NIPS 2021
Efficient and Local Parallel Random Walks NIPS 2021
A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs NIPS 2021
Fair Scheduling for Time-dependent Resources NIPS 2021
Optimal Sketching for Trace Estimation NIPS 2021
Learning to Schedule Heuristics in Branch and Bound NIPS 2021
Reusing Combinatorial Structure: Faster Iterative Projections over Submodular Base Polytopes NIPS 2021
Bringing UMAP Closer to the Speed of Light with GPU Acceleration AAAI 2021
A SAT-based Resolution of Lam's Problem AAAI 2021
Optimising Automatic Calibration of Electric Muscle Stimulation AAAI 2021
Certifying Parity Reasoning Efficiently Using Pseudo-Boolean Proofs AAAI 2021
Backdoor Decomposable Monotone Circuits and Propagation Complete Encodings AAAI 2021
On Continuous Local BDD-Based Search for Hybrid SAT Solving AAAI 2021
The Power of Literal Equivalence in Model Counting AAAI 2021
Parallel Constraint Acquisition AAAI 2021
Towards More Practical and Efficient Automatic Dominance Breaking AAAI 2021
Satisfiability and Algorithms for Non-uniform Random k-SAT AAAI 2021
Extreme k-Center Clustering AAAI 2021
Rejection Sampling for Weighted Jaccard Similarity Revisited AAAI 2021
Persuading Voters in District-based Elections AAAI 2021
Proportional Representation under Single-Crossing Preferences Revisited AAAI 2021
Computational Analyses of the Electoral College: Campaigning Is Hard But Approximately Manageable AAAI 2021
Present-Biased Optimization AAAI 2021
Facility’s Perspective to Fair Facility Location Problems AAAI 2021
Targeted Negative Campaigning: Complexity and Approximations AAAI 2021