conftrace_
← Computer Science
Computer Science ›

Foundations

1,623 papers (0 classified directly here)

Subtopics

Algorithms (1,298) Graph Theory (190) Formal Languages (113) Programming Languages (46) Data Structures (39)

Papers per year

1
7
34
188
122
'05
'10
'15
'20
'25

Papers (including subtopics)

Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time ICML 2021
Putting the “Learning" into Learning-Augmented Algorithms for Frequency Estimation ICML 2021
Dimensionality Reduction for the Sum-of-Distances Metric ICML 2021
Let’s Agree to Degree: Comparing Graph Convolutional Networks in the Message-Passing Framework ICML 2021
A Novel Sequential Coreset Method for Gradient Descent Algorithms ICML 2021
Instance-Optimal Compressed Sensing via Posterior Sampling ICML 2021
In-Database Regression in Input Sparsity Time ICML 2021
Streaming and Distributed Algorithms for Robust Column Subset Selection ICML 2021
Online Selection Problems against Constrained Adversary ICML 2021
Projection techniques to update the truncated SVD of evolving matrices with applications ICML 2021
Online Unrelated Machine Load Balancing with Predictions Revisited ICML 2021
Near-Optimal Algorithms for Explainable k-Medians and k-Means ICML 2021
Hierarchical Clustering of Data Streams: Scalable Algorithms and Approximation Guarantees ICML 2021
Path Planning using Neural A* Search ICML 2021
Deep Latent Graph Matching ICML 2021
Diversity in Kemeny Rank Aggregation: A Parameterized Approach IJCAI 2021
Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules IJCAI 2021
Guaranteeing Maximin Shares: Some Agents Left Behind IJCAI 2021
Surprisingly Popular Voting Recovers Rankings, Surprisingly! IJCAI 2021
Dynamic Proportional Rankings IJCAI 2021
Participatory Budgeting with Project Groups IJCAI 2021
Winner Determination and Strategic Control in Conditional Approval Voting IJCAI 2021
Matchings with Group Fairness Constraints: Online and Offline Algorithms IJCAI 2021
Reducing SAT to Max2SAT IJCAI 2021
Efficiently Explaining CSPs with Unsatisfiable Subset Optimization IJCAI 2021