Seguir
Tim Randolph
Tim Randolph
PhD Student, Columbia University
Dirección de correo verificada de columbia.edu - Página principal
Título
Citado por
Citado por
Año
Optimal (t, r) broadcasts on the infinite grid
BF Drews, PE Harris, TW Randolph
Discrete Applied Mathematics 255, 183-197, 2019
162019
(kp)-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
92018
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
82022
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
52020
Asymptotically optimal bounds for (t, 2) broadcast domination on finite grids
TW Randolph
arXiv preprint arXiv:1805.06058, 2018
42018
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
32022
Alaskan Hunting License Lotteries are Flexible and Approximately Efficient
N Arnosti, T Randolph
Available at SSRN 3370605, 2019
32019
Subset Sum in Time
X Chen, Y Jin, T Randolph, RA Servedio
arXiv preprint arXiv:2301.07134, 2023
22023
Parallel lotteries: insights from Alaskan hunting permit allocation
N Arnosti, T Randolph
Management Science 68 (7), 5087-5108, 2022
22022
Testing Sumsets is Hard
X Chen, S Nadimpalli, T Randolph, RA Servedio, O Zamir
arXiv preprint arXiv:2401.07242, 2024
12024
Participatory Governance in the Computer Science Theory Classroom
T Randolph
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
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–16