| 2025 | ICLR | Coreset Spectral Clustering. | Ben Jourdan, Gregory Schwartzman, Peter Macgregor, He Sun |
| 2025 | SPAA | Bounded Memory in Distributed Networks. | Ran Ben Basat, Keren Censor-Hillel, Yi-Jun Chang, Wenchen Han, Dean Leitersdorf, Gregory Schwartzman |
| 2024 | ESA | Local Max-Cut on Sparse Graphs. | Gregory Schwartzman |
| 2023 | ICLR | Mini-batch k-means terminates within O(d/ϵ) iterations. | Gregory Schwartzman |
| 2022 | SPAA | Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs. | Taisuke Izumi, Naoki Kitamura, Takamasa Naruse, Gregory Schwartzman |
| 2021 | SPAA | Finding Subgraphs in Highly Dynamic Networks. | Keren Censor-Hillel, Victor I. Kolobov, Gregory Schwartzman |
| 2021 | SPAA | On the Complexity of Load Balancing in Dynamic Networks. | Seth Gilbert, Uri Meir, Ami Paz, Gregory Schwartzman |
| 2020 | OPODIS | Fast Deterministic Algorithms for Highly-Dynamic Networks. | Keren Censor-Hillel, Neta Dafni, Victor I. Kolobov, Ami Paz, Gregory Schwartzman |
| 2020 | PODC | Brief Announcement: Improved Distributed Approximations for Maximum-Weight Independent Set. | Ken-ichi Kawarabayashi, Seri Khoury, Aaron Schild, Gregory Schwartzman |
| 2019 | PODC | Optimal Distributed Covering Algorithms. | Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman |
| 2018 | SIROCCO | A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(\log N\log \varDelta /\log ^2\log \varDelta ) Rounds. | Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman |
| 2017 | PODC | Distributed Approximation of Maximum Independent Set and Maximum Matching. | Reuven Bar-Yehuda, Keren Censor-Hillel, Mohsen Ghaffari, Gregory Schwartzman |
| 2017 | SODA | A (2 + ∊)-Approximation for Maximum Weight Matching in the Semi-Streaming Model. | Ami Paz, Gregory Schwartzman |
| 2016 | PODC | A Distributed (2+ε)-Approximation for Vertex Cover in O(logδ/ε log log δ) Rounds. | Reuven Bar-Yehuda, Keren Censor-Hillel, Gregory Schwartzman |