| 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 |
| Planar Negative K-Cycle
|
2021 |
Gawrychowski, Pawel |
| Approximating (k,£{)-Median Clustering for Polygonal Curves
|
2021 |
Buchin, Maike |
| Planar Reachability under Single Vertex or Edge Failures
|
2021 |
Italiano, Giuseppe F. |
| How to Morph Graphs on the Torus
|
2021 |
Chambers, Erin Wolf |
| Dynamic Graph Algorithms with Batch Updates in the Massively Parallel Computation Model
|
2021 |
Nowicki, Krzysztof |
| Hardness of Approximation for Orienteering with Multiple Time Windows
|
2021 |
Garg, Naveen |
| 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