Teaching students to recognize and implement good coding style ES Wiese, M Yen, A Chen, LA Santos, A Fox
Proceedings of the Fourth (2017) ACM Conference on Learning@ Scale, 41-50, 2017
48 2017 Partial resampling to approximate covering integer programs A Chen, DG Harris, A Srinivasan
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
19 2016 Local algorithms and the failure of log-depth quantum advantage on sparse random CSPs A Chen, N Huang, K Marwaha
arXiv preprint arXiv:2310.01563, 2023
5 2023 Autostyle: Scale-driven hint generation for coding style RR Choudhury, H Yin, J Moghadam, A Chen, A Fox
Proceedings of the 13th International Conference on Intelligent Tutoring …, 2016
5 2016 Efficient flow-based approximation algorithms for submodular hypergraph partitioning via a generalized cut-matching game K Ameranis, A Chen, L Orecchia, E Tani
arXiv e-prints, arXiv: 2301.08920, 2023
3 2023 Partial resampling to approximate covering integer programs A Chen, DG Harris, A Srinivasan
Random Structures & Algorithms 58 (1), 68-93, 2021
3 2021 Cut Sparsification of the Clique Beyond the Ramanujan Bound: A Separation of Cut Versus Spectral Sparsification∗ A Chen, J Shi, L Trevisan
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
2 2022 Preliminary evidence for learning good coding style with AutoStyle A Chen, E Wiese, HZ Yin, R Choudhury, A Fox
Third Symposium on Learning With MOOCs (LWMOOC III). Philadelphia, PA, 2016
1 2016 Top- ranking with a monotone adversary Y Yang, A Chen, L Orecchia, C Ma
arXiv preprint arXiv:2402.07445, 2024
2024 Hypergraph Diffusions and Resolvents for Norm-Based Hypergraph Laplacians K Ameranis, A Chen, A DePavia, L Orecchia, E Tani
arXiv preprint arXiv:2307.11042, 2023
2023 Submodular Hypergraph Partitioning: Metric Relaxations and Fast Algorithms via an Improved Cut-Matching Game A Chen, L Orecchia, E Tani
arXiv preprint arXiv:2301.08920, 2023
2023