| Efficient Linear and Affine Codes for Correcting Insertions/Deletions
|
2021 |
Cheng, Kuan |
| Polynomial-time Trace Reconstruction in the Smoothed Complexity Model
|
2021 |
Chen, Xi |
| Non-linear Hamilton Cycles in Linear Quasi-Random Hypergraphs
|
2021 |
Han, Jie |
| How Many Vertices Does a Random Walk Miss in a Network with Moderately Increasing the Number of Vertices?
|
2021 |
Kijima, Shuji |
| A Polynomial Time Algorithm for the k-Disjoint Shortest Paths Problem
|
2021 |
Lochet, William |
| Directed Shortest Paths via Approximate Cost Balancing
|
2021 |
Orlin, James B. |
| On Tolerant Distribution Testing in the Conditional Sampling Model
|
2021 |
Narayanan, Shyam |
| Approximation Algorithms and Hardness for Strong Unique Games
|
2021 |
Ghoshal, Suprovat |
| The Demand Query Model for Bipartite Matching
|
2021 |
Nisan, Noam |
| A Fast Minimum Degree Algorithm and Matching Lower Bound
|
2021 |
Cummings, Robert |
| Explicit Two-deletion Codes with Redundancy Matching the Existential Bound
|
2021 |
Guruswami, Venkatesan |
| Solving Hard Cut Problems via Flow-Augmentation
|
2021 |
Kim, Eun Jung |
| FPT-Approximation for FPT Problems
|
2021 |
Lokshtanov, Daniel |
| Efficient Computation of Representative Weight Functions with Applications to Parameterized Counting
|
2021 |
Lokshtanov, Daniel |
| All-Pairs LCA in DAGs: Breaking through the O(n2.5) barrier
|
2021 |
Grandoni, Fabrizio |
| Random Restrictions of High Dimensional Distributions and Uniformity Testing with Subcube Conditioning
|
2021 |
Canonne, Clément L. |
| SoS Degree Reduction with Applications to Clustering and Robust Moment Estimation
|
2021 |
Steurer, David |
| Uncertainty about Uncertainty: Optimal Adaptive Algorithms for Estimating Mixtures of Unknown Coins
|
2021 |
Lee, Jasper C. H. |
| Treewidth-Pliability and PTAS for Max-CSPs
|
2021 |
Romero, Miguel |
| Optimal ℓ1 Column Subset Selection and a Fast PTAS for Low Rank Approximation
|
2021 |
Mahankali, Arvind V. |
Tag hinzufügen