A stable marriage requires communication YA Gonczarowski, N Nisan, R Ostrovsky, W Rosenbaum Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014 | 22 | 2014 |

On sampling edges almost uniformly T Eden, W Rosenbaum arXiv preprint arXiv:1706.09748, 2017 | 10 | 2017 |

Space-time tradeoffs for distributed verification R Ostrovsky, M Perry, W Rosenbaum International Colloquium on Structural Information and Communication …, 2017 | 8* | 2017 |

Fast distributed almost stable matchings R Ostrovsky, W Rosenbaum Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing …, 2015 | 6* | 2015 |

Lower bounds for approximating graph parameters via communication complexity T Eden, W Rosenbaum arXiv preprint arXiv:1709.04262, 2017 | 4 | 2017 |

It's Not Easy Being Three: The Approximability of Three-Dimensional Stable Matching Problems R Ostrovsky, W Rosenbaum arXiv preprint arXiv:1412.1130, 2014 | 3 | 2014 |

The space requirement of local forwarding on acyclic networks B Patt-Shamir, W Rosenbaum Proceedings of the ACM Symposium on Principles of Distributed Computing, 13-22, 2017 | 2 | 2017 |

Brief announcement: Space-time tradeoffs for distributed verification M Baruch, R Ostrovsky, W Rosenbaum Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016 | 2 | 2016 |

Fault Tolerant Gradient Clock Synchronization J Bund, C Lenzen, W Rosenbaum arXiv preprint arXiv:1902.08042, 2019 | | 2019 |

With Great Speed Come Small Buffers: Space-Bandwidth Tradeoffs for Routing A Miller, B Patt-Shamir, W Rosenbaum arXiv preprint arXiv:1902.08069, 2019 | | 2019 |

The Arboricity Captures the Complexity of Sampling Edges T Eden, D Ron, W Rosenbaum arXiv preprint arXiv:1902.08086, 2019 | | 2019 |

Distributed Almost Stable Matchings WB Rosenbaum UCLA, 2016 | | 2016 |

Introduction to Communication Complexity W Rosenbaum | | |