| A stable marriage requires communication YA Gonczarowski, N Nisan, R Ostrovsky, W Rosenbaum Games and Economic Behavior 118 (November 2019), 626-647, 2019 | 250* | 2019 |
| On sampling edges almost uniformly T Eden, W Rosenbaum arXiv preprint arXiv:1706.09748, 2017 | 22 | 2017 |
| Lower bounds for approximating graph parameters via communication complexity T Eden, W Rosenbaum arXiv preprint arXiv:1709.04262, 2017 | 15 | 2017 |
| Space-time tradeoffs for distributed verification R Ostrovsky, M Perry, W Rosenbaum International Colloquium on Structural Information and Communication …, 2017 | 15* | 2017 |
| Fast distributed almost stable matchings R Ostrovsky, W Rosenbaum Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing …, 2015 | 12 | 2015 |
| The arboricity captures the complexity of sampling edges T Eden, D Ron, W Rosenbaum arXiv preprint arXiv:1902.08086, 2019 | 5 | 2019 |
| It's Not Easy Being Three: The Approximability of Three-Dimensional Stable Matching Problems R Ostrovsky, W Rosenbaum arXiv preprint arXiv:1412.1130, 2014 | 5 | 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 | 4 | 2017 |
| Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems W Rosenbaum, J Suomela Proceedings of the 39th Symposium on Principles of Distributed Computing, 89-98, 2020 | 2 | 2020 |
| With Great Speed Come Small Buffers: Space-Bandwidth Tradeoffs for Routing A Miller, B Patt-Shamir, W Rosenbaum Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019 | 2 | 2019 |
| 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 |
| Simple Counting and Sampling Algorithms for Graphs with Bounded Pathwidth CT Cheng, W Rosenbaum arXiv preprint arXiv:2008.08479, 2020 | 1 | 2020 |
| Stable Matchings with Restricted Preferences: Structure and Complexity CT Cheng, W Rosenbaum arXiv preprint arXiv:2008.08480, 2020 | 1 | 2020 |
| PALS: Plesiochronous and locally synchronous systems J Bund, M Függer, C Lenzen, M Medina, W Rosenbaum 2020 26th IEEE International Symposium on Asynchronous Circuits and Systems …, 2020 | 1 | 2020 |
| Analysis on Circles: A Modern View of Fourier Series WB Rosenbaum Reed College, 2009 | 1 | 2009 |
| Almost Optimal Bounds for Sublinear-Time Sampling of -Cliques: Sampling Cliques is Harder Than Counting T Eden, D Ron, W Rosenbaum arXiv preprint arXiv:2012.04090, 2020 | | 2020 |
| Fault Tolerant Gradient Clock Synchronization J Bund, C Lenzen, W Rosenbaum Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019 | | 2019 |
| Space-Optimal Packet Routing on Trees B Patt-Shamir, W Rosenbaum IEEE INFOCOM 2019-IEEE Conference on Computer Communications, 1036-1044, 2019 | | 2019 |
| Distributed Almost Stable Matchings WB Rosenbaum UCLA, 2016 | | 2016 |
| Introduction to Communication Complexity W Rosenbaum | | |
Rafail OstrovskyProfessor of Computer Science and Professor of Mathematics, UCLAVerified email at cs.ucla.edu
