publications

a compendium of my publications

2020

  1. PALS: Plesiochronous and Locally Synchronous Systems
    Bund, Johannes, Függer, Matthias, Lenzen, Christoph, Medina, Moti, and Rosenbaum, Will
    In 26th IEEE International Symposium on Asynchronous Circuits and Systems, ASYNC 2020, Salt Lake City, UT, USA, May 17-20, 2020 2020
  2. Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems
    Rosenbaum, Will, and Suomela, Jukka
    In PODC ’20: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, August 3-7, 2020 2020

2019

  1. A stable marriage requires communication
    Gonczarowski, Yannai A., Nisan, Noam, Ostrovsky, Rafail, and Rosenbaum, Will
    Games and Economic Behavior 2019
  2. The Arboricity Captures the Complexity of Sampling Edges
    Eden, Talya, Ron, Dana, and Rosenbaum, Will
    In 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9-12, 2019, Patras, Greece. 2019
  3. With Great Speed Come Small Buffers: Space-Bandwidth Tradeoffs for Routing
    Miller, Avery, Patt-Shamir, Boaz, and Rosenbaum, Will
    In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, Toronto, ON, Canada, July 29 - August 2, 2019. 2019
  4. Fault Tolerant Gradient Clock Synchronization
    Bund, Johannes, Lenzen, Christoph, and Rosenbaum, Will
    In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, Toronto, ON, Canada, July 29 - August 2, 2019. 2019
  5. Space-Optimal Packet Routing on Trees
    Patt-Shamir, Boaz, and Rosenbaum, Will
    In 2019 IEEE Conference on Computer Communications, INFOCOM 2019, Paris, France, April 29 - May 2, 2019 2019

2018

  1. Lower Bounds for Approximating Graph Parameters via Communication Complexity
    Eden, Talya, and Rosenbaum, Will
    In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2018, August 20-22, 2018 - Princeton, NJ, USA 2018
  2. On Sampling Edges Almost Uniformly
    Eden, Talya, and Rosenbaum, Will
    In 1st Symposium on Simplicity in Algorithms, SOSA 2018, January 7-10, 2018, New Orleans, LA, USA 2018

2017

  1. The Space Requirement of Local Forwarding on Acyclic Networks
    Patt-Shamir, Boaz, and Rosenbaum, Will
    In Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2017, Washington, DC, USA, July 25-27, 2017 2017
  2. Space-Time Tradeoffs for Distributed Verification
    Ostrovsky, Rafail, Perry, Mor, and Rosenbaum, Will
    In Structural Information and Communication Complexity - 24th International Colloquium, SIROCCO 2017, Porquerolles, France, June 19-22, 2017, Revised Selected Papers 2017

2016

  1. Brief Announcement: Space-Time Tradeoffs for Distributed Verification
    Baruch, Mor, Ostrovsky, Rafail, and Rosenbaum, Will
    In Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC 2016, Chicago, IL, USA, July 25-28, 2016 2016
  2. Distributed Almost Stable Matchings (PhD Thesis)
    Rosenbaum, William Bailey
    2016

2015

  1. Fast Distributed Almost Stable Matchings
    Ostrovsky, Rafail, and Rosenbaum, Will
    In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebastián, Spain, July 21 - 23, 2015 2015
  2. A Stable Marriage Requires Communication
    Gonczarowski, Yannai A., Nisan, Noam, Ostrovsky, Rafail, and Rosenbaum, Will
    In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015 2015
  3. It’s Not Easy Being Three: The Approximability of Three-Dimensional Stable Matching Problems
    Ostrovsky, Rafail, and Rosenbaum, Will
    In Proceedings of the 3rd International Workshop on Matching Under Preferences 2015