| Massively Parallel and Dynamic Algorithms for Minimum Size Clustering
|
2022 |
Epasto, Alessandro |
| Testing Matrix Product States
|
2022 |
Soleimanifar, Mehdi |
| Deterministic Algorithms for the Lovász Local Lemma: Simpler, More General, and More Parallel
|
2022 |
Harris, David G. |
| Stochastic Vertex Cover with Few Queries
|
2022 |
Behnezhad, Soheil |
| Planar Multiway Cut With Terminals on Few Faces
|
2022 |
Pandey, Sukanya |
| A Lower Bound for the n-queens Problem
|
2022 |
Simkin, Michael |
| Approximating Equilibrium under Constrained Piecewise Linear Concave Utilities with Applications to Matching Markets
|
2022 |
Garg, Jugal |
| Computational Hardness of the Hylland-Zeckhauser Scheme
|
2022 |
Chen, Thomas |
| Approximate Core for Committee Selection via Multilinear Extension and Market Clearing
|
2022 |
Munagala, Kamesh |
| Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash Functions
|
2022 |
Chen, Lijie |
| The Complexity of Testing All Properties of Planar Graphs, and the Role of Isomorphism
|
2022 |
Basu, Sabyasachi |
| Average Sensitivity of Dynamic Programming
|
2022 |
Kumabe, Soh |
| Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H-Minor-Free Graphs
|
2022 |
Bandyapadhyay, Sayan |
| Distribution-free Testing for Halfspaces (Almost) Requires PAC Learning
|
2022 |
Chen, Xi |
| Balanced Allocations: Caching and Packing, Twinning and Thinning
|
2022 |
Los, Dimitrios |
| Multi-Token Markov Game with Switching Costs
|
2022 |
Li, Jian |
| Selectable Heaps and Optimal Lazy Search Trees
|
2022 |
Sandlund, Bryce |
| Efficient Generation of Elimination Trees and Graph Associahedra
|
2022 |
Cardinal, Jean |
| Enumerating k-SAT Functions
|
2022 |
Dong, Dingding |
| Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non- Uniqueness Region
|
2022 |
Chen, Zongchen |
Tag hinzufügen