| 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 | 21 | 2014 |
| On Sampling Edges Almost Uniformly T Eden, W Rosenbaum arXiv preprint arXiv:1706.09748, 2017 | 9 | 2017 |
| Fast distributed almost stable matchings R Ostrovsky, W Rosenbaum Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing …, 2015 | 7* | 2015 |
| Space-time tradeoffs for distributed verification R Ostrovsky, M Perry, W Rosenbaum International Colloquium on Structural Information and Communication …, 2017 | 6 | 2017 |
| Lower Bounds for Approximating Graph Parameters via Communication Complexity T Eden, W Rosenbaum arXiv preprint arXiv:1709.04262, 2017 | 3 | 2017 |
| Space-time tradeoffs for distributed verification M Baruch, R Ostrovsky, W Rosenbaum arXiv preprint arXiv:1605.06814, 2016 | 3 | 2016 |
| 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 |
| 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 |
| 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 | 1 | 2017 |
| Distributed Almost Stable Matchings WB Rosenbaum UCLA, 2016 | | 2016 |
| Introduction to Communication Complexity W Rosenbaum | | |
Rafail OstrovskyProfessor of Computer Science, Professor of Mathematics, UCLAVerified email at cs.ucla.edu