Approximating Sumset Size

von De, Anindya
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (2022 : Online) ACM-SIAM Symposium on Discrete Algorithms (SODA22) ; Volume 4 of 5 (2022)

Testing Convex Truncation

von De, Anindya
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (34. : 2023 : Florenz; Online) Thirty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023) ; Volume 6 of 7 (2023)

The inverse shapley value problem

von De, Anindya
Veröffentlicht in Games and economic behavior (2017)

Average-Case Subset Balancing Problems

von Chen, Xi
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (2022 : Online) ACM-SIAM Symposium on Discrete Algorithms (SODA22) ; Volume 2 of 5 (2022)

Near-Optimal Average-Case Approximate Trace Reconstruction from Few Traces

von Chen, Xi
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (2022 : Online) ACM-SIAM Symposium on Discrete Algorithms (SODA22) ; Volume 2 of 5 (2022)

Algorithmic learning theory : 18th International Conference, ALT 2007, Sendai, Japan, October 1-4, 2007 ; proceedings

Veröffentlicht 2007

Approximate Trace Reconstruction from a Single Trace

von Chen, Xi
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (34. : 2023 : Florenz; Online) Thirty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023) ; Volume 1 of 7 (2023)

Polynomial-time Trace Reconstruction in the Smoothed Complexity Model

von Chen, Xi
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (32. : 2021 : Online) Thirty-second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021) ; Volume 1 of 4 (2021)