| 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 |
| Competitive Data-Structure Dynamization
|
2021 |
Mathieu, Claire |
| Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles
|
2021 |
Bera, Suman K. |
| Planar Distance Oracles with Better Time-Space Tradeoffs
|
2021 |
Long, Yaowei |
| Improved Algorithms for Solving Polynomial Systems over GF(2) by Multiple Parity-Counting
|
2021 |
Dinur, Itai |
| On Indexing and Compressing Finite Automata
|
2021 |
Cotumaccio, Nicola |
| A Topological Characterization of Modulo-p Arguments and Implications for Necklace Splitting
|
2021 |
Filos-Ratsikas, Aris |
| Consistent k-Clustering for General Metrics
|
2021 |
Fichtenberger, Hendrik |
Tag hinzufügen