conftrace_
← Foundations
Computer Science › Foundations ›

Algorithms

1,298 papers

Papers per year

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

Papers

Multivariate Analysis and Structural Restrictions in Computational Social Choice IJCAI 2024
Audio Fingerprinting with Holographic Reduced Representations INTERSPEECH 2024
Beam-search SIEVE for low-memory speech recognition INTERSPEECH 2024
Seeded Graph Matching for the Correlated Gaussian Wigner Model via the Projected Power Method JMLR 2024
Pygmtools: A Python Graph Matching Toolkit JMLR 2024
Random Subgraph Detection Using Queries JMLR 2024
PAMI: An Open-Source Python Library for Pattern Mining JMLR 2024
skscope: Fast Sparsity-Constrained Optimization in Python JMLR 2024
PyDMD: A Python Package for Robust Dynamic Mode Decomposition JMLR 2024
Fast Exact Retrieval for Nearest-neighbor Lookup (FERN) NAACL 2024
Source Code is a Graph, Not a Sequence: A Cross-Lingual Perspective on Code Clone Detection NAACL 2024
Sifter: An Inversion-Free and Large-Capacity Programmable Packet Scheduler NSDI 2024
Swing: Short-cutting Rings for Higher Bandwidth Allreduce NSDI 2024
OctoSketch: Enabling Real-Time, Continuous Network Monitoring over Multiple Cores NSDI 2024
Automatically Reasoning About How Systems Code Uses the CPU Cache OSDI 2024
Optimal Non-Redundant Manipulator Surface Coverage with Rank-Deficient Manipulability Constraints RSS 2024
Link Prediction for Flow-Driven Spatial Networks WACV 2024
Tight Bounds for Volumetric Spanners and Applications NIPS 2023
Three Iterations of (d − 1)-WL Test Distinguish Non Isometric Clouds of d-dimensional Points NIPS 2023
Improved Frequency Estimation Algorithms with and without Predictions NIPS 2023
A One-Size-Fits-All Approach to Improving Randomness in Paper Assignment NIPS 2023
An Efficient and Robust Framework for Approximate Nearest Neighbor Search with Attribute Constraint NIPS 2023
$k$-Means Clustering with Distance-Based Privacy NIPS 2023
Multi-Swap k-Means++ NIPS 2023
Sorting with Predictions NIPS 2023