| Optimal (t, r) broadcasts on the infinite grid BF Drews, PE Harris, TW Randolph Discrete Applied Mathematics 255, 183-197, 2019 | 17 | 2019 |
| Average-case subset balancing problems X Chen, Y Jin, T Randolph, RA Servedio Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022 | 10 | 2022 |
| (k, p)-Planarity: A Relaxation of Hybrid Planarity E Di Giacomo, WJ Lenhart, G Liotta, TW Randolph, A Tappini International Workshop on Algorithms and Computation, 148-159, 2018 | 9 | 2018 |
| A lower bound on cycle-finding in sparse digraphs X Chen, T Randolph, RA Servedio, T Sun Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 5 | 2020 |
| A note on the complexity of private simultaneous messages with many parties M Ball, T Randolph 3rd Conference on Information-Theoretic Cryptography (ITC 2022), 2022 | 4 | 2022 |
| Alaskan Hunting License Lotteries are Flexible and Approximately Efficient N Arnosti, T Randolph Available at SSRN 3370605, 2019 | 4 | 2019 |
| Asymptotically optimal bounds for (t, 2) broadcast domination on finite grids TW Randolph arXiv preprint arXiv:1805.06058, 2018 | 4 | 2018 |
| Subset Sum in Time X Chen, Y Jin, T Randolph, RA Servedio arXiv preprint arXiv:2301.07134, 2023 | 3 | 2023 |
| Parallel lotteries: insights from Alaskan hunting permit allocation N Arnosti, T Randolph Management Science 68 (7), 5087-5108, 2022 | 2 | 2022 |
| Testing Sumsets is Hard X Chen, S Nadimpalli, T Randolph, RA Servedio, O Zamir arXiv preprint arXiv:2401.07242, 2024 | 1 | 2024 |
| Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM T Randolph, K Węgrzycki arXiv preprint arXiv:2407.18228, 2024 | | 2024 |
| Participatory Governance in the Computer Science Theory Classroom T Randolph Proceedings of the 55th ACM Technical Symposium on Computer Science …, 2024 | | 2024 |
| Exact and Parameterized Algorithms for Subset Sum Problems T Randolph COLUMBIA UNIVERSITY, 2024 | | 2024 |
| A Lower Bound on Cycle-Finding in Sparse Digraphs X Chen, T Randolph, RA Servedio, T Sun ACM Transactions on Algorithms (TALG) 18 (4), 1-23, 2022 | | 2022 |
| A Generalization of Planar Representations for Cluster Graphs TW Randolph Williams College, 2018 | | 2018 |
| (k, p)-Planarity: A Generalization of Hybrid Planarity. E Di Giacomo, WJ Lenhart, G Liotta, TW Randolph, A Tappini CoRR, 2018 | | 2018 |
| Computing upper bounds for optimal density of broadcasts on the infinite grid BF Drews, PE Harris, TW Randolph arXiv preprint arXiv:1712.00150, 2017 | | 2017 |
| k-Ticket Lotteries: A More Flexible Mechanism for One-Sided Allocation N Arnosti, T Randolph | | |
Rocco Anthony ServedioDepartment of Computer Science, Columbia University在 columbia.edu 的电子邮件经过验证
