| Faster Algorithm for Turn-based Stochastic Games with Bounded Treewidth
|
2023 |
Chatterjee, Krishnendu |
| Online Lewis Weight Sampling
|
2023 |
Woodruff, David P. |
| Query Complexity of the Metric Steiner Tree Problem
|
2023 |
Chen, Yu |
| Differentially Private All-Pairs Shortest Path Distances: Improved Algorithms and Lower Bounds
|
2023 |
Chen, Justin Y. |
| Simple, Deterministic, Fast (but Weak) Approximations to Edit Distance and Dyck Edit Distance
|
2023 |
Koucký, Michal |
| Optimal Square Detection Over General Alphabets
|
2023 |
Ellert, Jonas |
| Spatial Mixing and the Random-Cluster Dynamics on Lattices
|
2023 |
Gheissari, Reza |
| Cubic GOIdreich-LeVin
|
2023 |
Li, Dain Kim, Anqi |
| Almost Tight Error Bounds on Differentially Private Continual Counting
|
2023 |
Henzinger, Monika |
| Time-Space Tradeoffs for Element Distinctness and Set Intersection via Pseudorandomness
|
2023 |
Lyu, Xin |
| Almost-Linear Planted Cliques Elude the Metropolis Process
|
2023 |
Chen, Zongchen |
| The Need for Seed (in the abstract Tile Assembly Model)
|
2023 |
Alseth, Andrew |
| Traversing the FFT Computation Tree for Dimension-Independent Sparse Fourier Transforms
|
2023 |
Bringmann, Karl |
| Private Query Release via the Johnson-Lindenstrauss Transform
|
2023 |
Nikolov, Aleksandar |
| Stronger Privacy Amplification by Shuffling for Rényi and Approximate Differential Privacy
|
2023 |
Feldman, Vitaly |
| Private Convex Optimization in General Norms
|
2023 |
Gopi, Sivakanth |
| Super-resolution and Robust Sparse Continuous Fourier Transform in Any Constant Dimension: Nearly Linear Time and Sample Complexity
|
2023 |
Jin, Yaonan |
| Sublinear-Time Algorithms for Max Cut, Max E2Lin(q), and Unique Label Cover on Expanders
|
2023 |
Peng, Pan |
| Breaking the O(n)-Barrier in the Construction of Compressed Suffix Arrays and Suffix Trees
|
2023 |
Kempa, Dominik |
| Quantum Speed-ups for String Synchronizing Sets, Longest Common Substring, and k-mismatch Matching
|
2023 |
Jin, Ce |
Tag hinzufügen