Will Rosenbaum
Orcid: 0000-0002-7723-9090Affiliations:
- Amherst College, Amherst, MA, USA
According to our database1,
Will Rosenbaum
authored at least 26 papers
between 2014 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2014
2016
2018
2020
2022
2024
0
1
2
3
4
5
6
1
2
2
1
2
3
2
2
4
2
2
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
2023
Proceedings of the Structural Information and Communication Complexity, 2023
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023
2022
ACM Trans. Economics and Comput., September, 2022
Proceedings of the 36th International Symposium on Distributed Computing, 2022
Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity Graphs.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022
2020
Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques: Sampling Cliques is Harder Than Counting.
CoRR, 2020
CoRR, 2020
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020
Proceedings of the 26th IEEE International Symposium on Asynchronous Circuits and Systems, 2020
2019
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019
Proceedings of the 2019 IEEE Conference on Computer Communications, 2019
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019
2018
Proceedings of the 1st Symposium on Simplicity in Algorithms, 2018
Proceedings of the Approximation, 2018
2017
Proceedings of the Structural Information and Communication Complexity, 2017
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017
2016
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016
2015
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015
2014
It's Not Easy Being Three: The Approximability of Three-Dimensional Stable Matching Problems.
CoRR, 2014