2. Refereed Conference Proceedings

Preprints & In Submission
  • Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems (with Jukka Suomela). (arXiv)
2019
  • Space-Optimal Nearly-Local Forwarding on Trees (with Boaz Patt-Shamir). IEEE International Conference on Computer Communications (INFOCOM) 2019. (IEEE)
  • The Arboricity Captures the Complexity of Sampling Edges (with Talya Eden and Dana Ron). International Colloquium on Automata, Languages and Programming (ICALP) 2019. (DROPS, arXiv)
  • With Great Speed Come Small Buffers: Space-Bandwidth Tradeoffs for Routing (with Avery Miller and Boaz Patt-Shamir). ACM Symposium on Principles of Distributed Computing (PODC) 2019. (ACM-DL, arXiv)
  • Fault Tolerant Gradient Clock Synchronization (with Johannes Bund and Christoph Lenzen). ACM Symposium on Principles of Distributed Computing (PODC) 2019. (ACM-DL, arXiv)
2018
  • On Sampling Edges Almost Uniformly (with Talya Eden). Symposium on Simplicity in Algorithms (SOSA) 2018. (DROPS, arXiv)
  • Lower Bounds for Approximating Graph Parameters via Communication Complexity (with Talya Eden). The 21st International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX) 2018. (DROPS, arXiv)
2017
  • The Space Requirement of Local Forwarding on Acyclic Networks (with Boaz Patt-Shamir). ACM Symposium on Principles of Distributed Computing (PODC), 2017. (ACM-DL)
  • Space-Time Tradeoffs for Distributed Verification (with Rafail Ostrovsky and Mor Perry). International Colloquium on Structural Information and Communication
    Complexity (SIROCCO), 2017. (LNCS, arXiv)
2016
  • Brief Announcement: Space-Time Tradeoffs for Distributed Verification (with Mor Baruch and Rafail Ostrovsky). ACM Symposium on Principles of Distributed Computing (PODC), 2016. (ACM-DL)
2015
  • Fast Distributed Almost Stable Matchings (with Rafail Ostrovsky). ACM Symposium on Principles of Distributed Computed (PODC), 2015. (ACM-DL, arXiv)
  • A Stable Marriage Requires Communication (with Yannai Gonczarowski, Noam Nisan, and Rafail Ostrovsky). ACM-SIAM Symposium on Discrete Algorithms (SODA), 2015. (ACM-DL, arXiv)
    • Invited to appear in a special issue of Games and Economic Behavior.
  • It’s Not Easy Being Three: The Approximability of Three-Dimensional Stable Matching Problems (with Rafail Ostrovsky). International Workshop on Matching Under Preferences (MATCH-UP), 2015. (arXiv)

Will Rosenbaum

comments powered by Disqus