A tale of Santa Claus, hypergraphs and matroids S Davies, T Rothvoss, Y Zhang
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
27 2020 Reconstructing trees from traces S Davies, MZ Racz, C Rashtchian
Conference On Learning Theory, 961-978, 2019
20 2019 Approximate trace reconstruction: Algorithms S Davies, MZ Rácz, BG Schiffer, C Rashtchian
2021 IEEE International Symposium on Information Theory (ISIT), 2525-2530, 2021
17 2021 Scheduling with communication delays via LP hierarchies and clustering S Davies, J Kulkarni, T Rothvoss, J Tarnawski, Y Zhang
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
14 2020 Scheduling with communication delays via LP hierarchies and clustering II: weighted completion times on related machines S Davies, J Kulkarni, T Rothvoss, J Tarnawski, Y Zhang
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
13 2021 Lower bounds on the total variation distance between mixtures of two Gaussians S Davies, A Mazumdar, S Pal, C Rashtchian
International Conference on Algorithmic Learning Theory, 319-341, 2022
8 2022 Approximate trace reconstruction S Davies, MZ Rácz, C Rashtchian, BG Schiffer
arXiv preprint arXiv:2012.06713, 2020
8 2020 Fast combinatorial algorithms for min max correlation clustering S Davies, B Moseley, H Newman
International Conference on Machine Learning, 7205-7230, 2023
7 2023 Predictive flows for faster ford-fulkerson S Davies, B Moseley, S Vassilvitskii, Y Wang
International Conference on Machine Learning, 7231-7248, 2023
7 2023 On the hardness of scheduling with non-uniform communication delays S Davies, J Kulkarni, T Rothvoss, S Sandeep, J Tarnawski, Y Zhang
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
3 2022 Balancing flow time and energy consumption S Davies, S Khuller, S Zhang
Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and …, 2022
2 2022 Reconstructing trees from traces S Davies, MZ Rácz, C Rashtchian
The Annals of Applied Probability 31 (6), 2772-2810, 2021
1 2021 Robust Factorizations and Colorings of Tensor Graphs J Brakensiek, S Davies
SIAM Journal on Discrete Mathematics 38 (1), 883-916, 2024
2024 Online Flexible Busy Time Scheduling on Heterogeneous Machines G Calinescu, S Davies, S Khuller, S Zhang
arXiv preprint arXiv:2402.11109, 2024
2024 One Partition Approximating All -norm Objectives in Correlation Clustering S Davies, B Moseley, H Newman
arXiv preprint arXiv:2308.01534, 2023
2023 Designing Scheduling Algorithms via a Mathematical Perspective S Davies
University of Washington, 2021
2021