| 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 |
| The Fine-Grained Complexity of Computing the Tutte Polynomial of a Linear Matroid
|
2021 |
Björklund, Andreas |
| Nearly Optimal Average-Case Complexity of Counting Bicliques under SETH
|
2021 |
Hirahara, Shuichi |
| Concentration Bounds for almost k-Wise Independence with Applications to Non-Uniform Security
|
2021 |
Gravin, Nick |
| Dimension-Preserving Reductions between SVP and CVP in Different p-Norms
|
2021 |
Aggarwal, Divesh |
| Incremental Single Source Shortest Paths in Sparse Digraphs
|
2021 |
Chechik, Shiri |
| Approximate Distance Oracles Subject to Multiple Vertex Failures
|
2021 |
Duan, Ran |
| Deep Weisfeiler Leman
|
2021 |
Grohe, Martin |
Tag hinzufügen