| A stable marriage requires communication YA Gonczarowski, N Nisan, R Ostrovsky, W Rosenbaum Games and Economic Behavior 118 (November 2019), 626-647, 2019 | 151* | 2019 |
| On sampling edges almost uniformly T Eden, W Rosenbaum arXiv preprint arXiv:1706.09748, 2017 | 39 | 2017 |
| Lower bounds for approximating graph parameters via communication complexity T Eden, W Rosenbaum arXiv preprint arXiv:1709.04262, 2017 | 23 | 2017 |
| Space-time tradeoffs for distributed verification R Ostrovsky, M Perry, W Rosenbaum Structural Information and Communication Complexity: 24th International …, 2017 | 19* | 2017 |
| The arboricity captures the complexity of sampling edges T Eden, D Ron, W Rosenbaum arXiv preprint arXiv:1902.08086, 2019 | 18 | 2019 |
| Fast distributed almost stable matchings R Ostrovsky, W Rosenbaum Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing …, 2015 | 15 | 2015 |
| 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 | 9 | 2020 |
| Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity Graphs T Eden, D Ron, W Rosenbaum 49th International Colloquium on Automata, Languages, and Programming (ICALP …, 2022 | 8* | 2022 |
| Fault tolerant gradient clock synchronization J Bund, C Lenzen, W Rosenbaum Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019 | 7 | 2019 |
| 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 | 7 | 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 | 6 | 2014 |
| 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 | 5 | 2019 |
| 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 | 4 | 2020 |
| Stable matchings with restricted preferences: Structure and complexity CT Cheng, W Rosenbaum ACM Transactions on Economics and Computation 10 (3), 1-45, 2023 | 3 | 2023 |
| Finding a winning strategy for Wordle is NP-complete W Rosenbaum arXiv preprint arXiv:2204.04104, 2022 | 2 | 2022 |
| Simple Counting and Sampling Algorithms for Graphs with Bounded Pathwidth CT Cheng, W Rosenbaum arXiv preprint arXiv:2008.08479, 2020 | 2 | 2020 |
| 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 |
| Space-optimal packet routing on trees B Patt-Shamir, W Rosenbaum IEEE INFOCOM 2019-IEEE Conference on Computer Communications, 1036-1044, 2019 | 1 | 2019 |
| Distributed Almost Stable Matchings WB Rosenbaum University of California, Los Angeles, 2016 | 1 | 2016 |
| Analysis on Circles: A Modern View of Fourier Series WB Rosenbaum Reed College, 2009 | 1 | 2009 |
Rafail OstrovskyNorman E. Friedman Distinguished Professor of Computer Science and MathematicsVerified email at cs.ucla.edu
