Timothy W. Randolph

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

Collaborative distances:

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

2024

Testing Sumsets is Hard.

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

CoRR, 2024

Participatory Governance in the Computer Science Theory Classroom.

Tim Randolph

Proceedings of the 55th ACM Technical Symposium on Computer Science Education, 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

A Lower Bound on Cycle-Finding in Sparse Digraphs.

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

ACM Trans. Algorithms, 2022

Parallel Lotteries: Insights from Alaskan Hunting Permit Allocation.

Nick Arnosti, Timothy W. Randolph

Manag. Sci., 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

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