Timothy W. Randolph

Orcid: 0000-0003-4287-0680

Affiliations:
  • Columbia University, New York, NY, USA


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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Testing Sumsets is Hard.
CoRR, 2024

A Survey of Undergraduate Theory of Computing Curricula.
Proceedings of the 2024 ACM Virtual Global Computing Education Conference V. 2, 2024

Participatory Governance in the Computer Science Theory Classroom.
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.
Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

2023
Subset Sum in Time 2<sup>n/2</sup> / poly(n).
Proceedings of the Approximation, 2023

2022
A Lower Bound on Cycle-Finding in Sparse Digraphs.
ACM Trans. Algorithms, 2022

Parallel Lotteries: Insights from Alaskan Hunting Permit Allocation.
Manag. Sci., 2022

Average-Case Subset Balancing Problems.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

A Note on the Complexity of Private Simultaneous Messages with Many Parties.
Proceedings of the 3rd Conference on Information-Theoretic Cryptography, 2022

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

2019
Optimal (t, r) broadcasts on the infinite grid.
Discret. Appl. Math., 2019

(k, p)-Planarity: A Relaxation of Hybrid Planarity.
Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

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


  Loading...