| Derandomizing local distributed algorithms under bandwidth restrictions K Censor-Hillel, M Parter, G Schwartzman Distributed Computing 33 (3-4), 349-366, 2020 | 75 | 2020 |
| A (2+ ε)-approximation for maximum weight matching in the semi-streaming model A Paz, G Schwartzman ACM Transactions on Algorithms (TALG) 15 (2), 1-15, 2018 | 70 | 2018 |
| Fast distributed algorithms for testing graph properties K Censor-Hillel, E Fischer, G Schwartzman, Y Vasudev Distributed Computing 32, 41-57, 2019 | 56 | 2019 |
| Distributed approximation of maximum independent set and maximum matching R Bar-Yehuda, K Censor-Hillel, M Ghaffari, G Schwartzman Proceedings of the ACM Symposium on Principles of Distributed Computing, 165-174, 2017 | 44 | 2017 |
| A distributed (2+ ε)-approximation for vertex cover in o (logδ/ε log log δ) rounds R Bar-Yehuda, K Censor-Hillel, G Schwartzman Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016 | 33 | 2016 |
| A distributed (2+ ε)-approximation for vertex cover in o (log δ/ε log log δ) rounds R Bar-Yehuda, K Censor-Hillel, G Schwartzman Journal of the ACM (JACM) 64 (3), 1-11, 2017 | 24 | 2017 |
| Adapting local sequential algorithms to the distributed setting K Kawarabayashi, G Schwartzman arXiv preprint arXiv:1711.10155, 2017 | 15 | 2017 |
| Parameterized distributed algorithms R Ben-Basat, K Kawarabayashi, G Schwartzman arXiv preprint arXiv:1807.04900, 2018 | 12 | 2018 |
| A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in Rounds R Ben-Basat, G Even, K Kawarabayashi, G Schwartzman Structural Information and Communication Complexity: 25th International …, 2018 | 9 | 2018 |
| Optimal distributed covering algorithms R Ben Basat, G Even, K Kawarabayashi, G Schwartzman Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019 | 8 | 2019 |
| Improved distributed approximations for maximum independent set K Kawarabayashi, S Khoury, A Schild, G Schwartzman arXiv preprint arXiv:1906.11524, 2019 | 8 | 2019 |
| Finding subgraphs in highly dynamic networks K Censor-Hillel, VI Kolobov, G Schwartzman Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and …, 2021 | 4 | 2021 |
| Fast deterministic algorithms for highly-dynamic networks K Censor-Hillel, N Dafni, VI Kolobov, A Paz, G Schwartzman arXiv preprint arXiv:1901.04008, 2019 | 4 | 2019 |
| Models of smoothing in dynamic networks U Meir, A Paz, G Schwartzman arXiv preprint arXiv:2009.13006, 2020 | 3 | 2020 |
| Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs T Izumi, N Kitamura, T Naruse, G Schwartzman Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and …, 2022 | 2 | 2022 |
| On the complexity of load balancing in dynamic networks S Gilbert, U Meir, A Paz, G Schwartzman Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and …, 2021 | 2 | 2021 |
| SGD Through the Lens of Kolmogorov Complexity G Schwartzman arXiv preprint arXiv:2111.05478, 2021 | 1 | 2021 |
| Smoothed Analysis of Population Protocols G Schwartzman, Y Sudo arXiv preprint arXiv:2105.12262, 2021 | 1 | 2021 |
| Optimal Distributed Covering Algorithms RB Basat, G Even, K Kawarabayashi, G Schwartzman Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019 | 1 | 2019 |
| Optimal distributed weighted set cover approximation R Ben-Basat, G Even, K Kawarabayashi, G Schwartzman arXiv preprint arXiv:1808.05809, 2018 | 1 | 2018 |
