| 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 |
| Deterministic Enumeration of All Minimum k-cut-sets in Hypergraphs for Fixed k
|
2022 |
Beideman, Calvin |
| Densest Subgraph: Supermodularity, Iterative Peeling, and Flow
|
2022 |
Chekuri, Chandra |
| An Improved Local Search Algorithm for k-Median
|
2022 |
Cohen-Addad, Vincent |
| Simulating a Stack Using Queues
|
2022 |
Kaplan, Haim |
| Splay Trees on Trees
|
2022 |
Berendsohn, Benjamin Aram |
| Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent
|
2022 |
Agrawal, Akanksha |
| Subexponential Parameterized Algorithms on Disk Graphs
|
2022 |
Lokshtanov, Daniel |
| A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs
|
2022 |
Marx, Dániel |
| 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 |
Tag hinzufügen