Timothy W. Randolph

According to our database, Timothy W. Randolph authored at least 14 papers between 2018 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2025

Testing Sumsets Is Hard.

Xi Chen, Shivam Nadimpalli, Tim Randolph, Rocco A. Servedio, Or Zamir

Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

2024

Exact and Parameterized Algorithms for Subset Sum Problems

Timothy W. Randolph

PhD thesis, 2024

A Survey of Undergraduate Theory of Computing Curricula.

Ryan E. Dougherty, Tim Randolph, Tzu-Yi Chen, Jeff Erickson, Matthew Ferland, Dennis Komm, Jonathan Liu, Timothy Ng, Seth Poulsen, Smaranda Sandu, Michael Shindler, Edward Talmage, Thomas Zeume

Proceedings of the 2024 ACM Virtual Global Computing Education Conference V. 2, 2024

Participatory Governance in the Computer Science Theory Classroom.

Tim Randolph

Proceedings of the 55th ACM Technical Symposium on Computer Science Education, 2024

Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM.

Tim Randolph, Karol Wegrzycki

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

2023

Subset Sum in Time 2^n/2 / poly(n).

Xi Chen, Yaonan Jin, Tim Randolph, Rocco A. Servedio

Proceedings of the Approximation, 2023

2022

Average-Case Subset Balancing Problems.

Xi Chen, Yaonan Jin, Tim Randolph, Rocco A. Servedio

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

A Note on the Complexity of Private Simultaneous Messages with Many Parties.

Marshall Ball, Tim Randolph

Proceedings of the 3rd Conference on Information-Theoretic Cryptography, 2022

2021

(<i>k</i>, <i>p</i>)-planarity: A relaxation of hybrid planarity.

Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Timothy W. Randolph, Alessandra Tappini

Theor. Comput. Sci., 2021

Parallel Lotteries: Insights from Alaskan Hunting Permit Allocation.

Nick Arnosti, Tim Randolph

Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

2020

A Lower Bound on Cycle-Finding in Sparse Digraphs.

Xi Chen, Tim Randolph, Rocco A. Servedio, Timothy Sun

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019

Optimal (t, r) broadcasts on the infinite grid.

Benjamin F. Drews, Pamela E. Harris, Timothy W. Randolph

Discret. Appl. Math., 2019

(k, p)-Planarity: A Relaxation of Hybrid Planarity.

Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Timothy W. Randolph, Alessandra Tappini

Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

2018

(k, p)-Planarity: A Generalization of Hybrid Planarity.

Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Timothy W. Randolph, Alessandra Tappini

CoRR, 2018