| Counting Small Permutation Patterns
|
2021 |
Even-Zohar, Chaim |
| Counting Homomorphisms to K4-minor-free Graphs, modulo 2
|
2021 |
Focke, Jacob |
| On the Orbit Closure Containment Problem and Slice Rank of Tensors
|
2021 |
Bläser, Markus |
| Dynamic Set Cover: Improved Amortized and Worst-Case Update Times
|
2021 |
Bhattacharya, Sayan |
| Coresets for Clustering in Excluded-minor Graphs and Beyond
|
2021 |
Braverman, Vladimir |
| Minimum-cost Integer Circulations in Given Homology Classes
|
2021 |
Morell, Sarah |
| Tight Bounds for Parallel Paging and Green Paging
|
2021 |
Agrawal, Kunal |
| Optimal Oblivious Priority Queues
|
2021 |
Jafargholi, Zahra |
| Connecting Robust Shuffle Privacy and Pan-Privacy
|
2021 |
Balcer, Victor |
| Efficient Document Exchange and Error Correcting Codes with Asymmetric Information
|
2021 |
Cheng, Kuan |
| Deterministic Algorithms for Decremental Shortest Paths via Layered Core Decomposition
|
2021 |
Chuzhoy, Julia |
| On Approximability of Clustering Problems without Candidate Centers
|
2021 |
Cohen-Addad, Vincent |
| EPTAS for k-Means Clustering of Affine Subspaces
|
2021 |
Eiben, Eduard |
| Online Generalized Network Design under (Dis)Economies of Scale
|
2021 |
Nagarajan, Viswanath |
| Tight Bounds for Online Graph Partitioning
|
2021 |
Henzinger, Monika |
| Online Edge Coloring Algorithms via the Nibble Method
|
2021 |
Bhattacharya, Sayan |
| Online Discrepancy Minimization for Stochastic Arrivals
|
2021 |
Bansal, Nikhil |
| Improved Deterministic Network Decomposition
|
2021 |
Ghaffari, Mohsen |
| Tight Distributed Listing of Cliques
|
2021 |
Censor-Hillel, Keren |
| Scheduling with Communication Delays via LP Hierarchies and Clustering II: Weighted Completion Times on Related Machines
|
2021 |
Davies, Sami |
Tag hinzufügen