A Distributed (2+ε)-Approximation for Vertex Cover in O(logδ/ε log log δ) Rounds. - Reuven Bar-Yehuda; Keren Censor-Hillel; Gregory Schwartzman (PODC, 2016)

A Distributed $(2+ε)$-Approximation for Vertex Cover in $O( logΔ/ε log logΔ)$ Rounds. - Reuven Bar-Yehuda; Keren Censor-Hillel; Gregory Schwartzman (CoRR, 2016)

PODC 2016 Review. - Gregory Schwartzman (SIGACT News, 2016)

Distributed Approximation of Maximum Independent Set and Maximum Matching. - Reuven Bar-Yehuda; Keren Censor-Hillel; Mohsen Ghaffari 001; Gregory Schwartzman (PODC, 2017)

A (2 + ∊)-Approximation for Maximum Weight Matching in the Semi-Streaming Model. - Ami Paz; Gregory Schwartzman (SODA, 2017)

Adapting Sequential Algorithms to the Distributed Setting. - Gregory Schwartzman (CoRR, 2017)

A Distributed (2 + ε)-Approximation for Vertex Cover in O(log Δ / ε log log Δ) Rounds. - Reuven Bar-Yehuda; Keren Censor-Hillel; Gregory Schwartzman (J. ACM, 2017)

Algorithms for Environments with Uncertainty. - Gregory Schwartzman (2017)

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 (SIROCCO, 2018)

Adapting Local Sequential Algorithms to the Distributed Setting. - Ken-ichi Kawarabayashi; Gregory Schwartzman (DISC, 2018)

A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(log n logΔ/ log2 logΔ) Rounds. - Ran Ben-Basat; Guy Even; Ken-ichi Kawarabayashi; Gregory Schwartzman (CoRR, 2018)

Optimal Distributed Weighted Set Cover Approximation. - Ran Ben-Basat; Guy Even; Ken-ichi Kawarabayashi; Gregory Schwartzman (CoRR, 2018)

Parameterized Distributed Algorithms. - Ran Ben-Basat; Ken-ichi Kawarabayashi; Gregory Schwartzman (DISC, 2019)

Fast and Simple Deterministic Algorithms for Highly-Dynamic Networks. - Keren Censor-Hillel; Neta Dafni; Victor I. Kolobov; Ami Paz; Gregory Schwartzman (CoRR, 2019)

Improved Distributed Approximation to Maximum Independent Set. - Ken-ichi Kawarabayashi; Seri Khoury; Aaron Schild; Gregory Schwartzman (CoRR, 2019)

Fast distributed algorithms for testing graph properties. - Keren Censor-Hillel; Eldar Fischer; Gregory Schwartzman; Yadu Vasudev (Distributed Comput., 2019)

Distributed Graph Algorithms (NII Shonan Meeting 162). - Guy Even; Gregory Schwartzman (NII Shonan Meet. Rep., 2019)

A (2+ε)-Approximation for Maximum Weight Matching in the Semi-streaming Model. - Ami Paz; Gregory Schwartzman (ACM Trans. Algorithms, 2019)

Fast Deterministic Algorithms for Highly-Dynamic Networks. - Keren Censor-Hillel; Neta Dafni; Victor I. Kolobov; Ami Paz; Gregory Schwartzman (OPODIS, 2020)

Brief Announcement: Improved Distributed Approximations for Maximum-Weight Independent Set. - Ken-ichi Kawarabayashi; Seri Khoury; Aaron Schild; Gregory Schwartzman (PODC, 2020)

Improved Distributed Approximations for Maximum Independent Set. - Ken-ichi Kawarabayashi; Seri Khoury; Aaron Schild; Gregory Schwartzman (DISC, 2020)

Models of Smoothing in Dynamic Networks. - Uri Meir; Ami Paz; Gregory Schwartzman (DISC, 2020)

Derandomizing local distributed algorithms under bandwidth restrictions. - Keren Censor-Hillel; Merav Parter; Gregory Schwartzman (Distributed Comput., 2020)

Finding Subgraphs in Highly Dynamic Networks. - Keren Censor-Hillel; Victor I. Kolobov; Gregory Schwartzman (SPAA, 2021)

On the Complexity of Load Balancing in Dynamic Networks. - Seth Gilbert; Uri Meir; Ami Paz; Gregory Schwartzman (SPAA, 2021)

Smoothed Analysis of Population Protocols. - Gregory Schwartzman; Yuichi Sudo (DISC, 2021)

SGD Through the Lens of Kolmogorov Complexity. - Gregory Schwartzman (CoRR, 2021)

Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs. - Taisuke Izumi; Naoki Kitamura; Takamasa Naruse; Gregory Schwartzman (SPAA, 2022)

FRANCIS: Fast Reaction Algorithms for Network Coordination In Switches. - Wenchen Han; Vic Feng; Gregory Schwartzman; Michael Mitzenmacher; Minlan Yu; Ran Ben-Basat (CoRR, 2022)

Mini-batch k-means terminates within O(d/ϵ) iterations. - Gregory Schwartzman (ICLR, 2023)

Optimal distributed covering algorithms. - Ran Ben-Basat; Guy Even; Ken-ichi Kawarabayashi; Gregory Schwartzman (Distributed Comput., 2023)

Stochastic Distance in Property Testing. - Uri Meir; Gregory Schwartzman; Yuichi Yoshida (APPROX/RANDOM, 2024)

Local Max-Cut on Sparse Graphs. - Gregory Schwartzman (ESA, 2024)

Mini-batch Submodular Maximization. - Gregory Schwartzman (CoRR, 2024)

Exfiltration of personal information from ChatGPT via prompt injection. - Gregory Schwartzman (CoRR, 2024)

Mini-Batch Kernel k-means. - Ben Jourdan; Gregory Schwartzman (CoRR, 2024)

Coreset Spectral Clustering. - Ben Jourdan; Gregory Schwartzman; Peter Macgregor; He Sun 001 (ICLR, 2025)

Bounded Memory in Distributed Networks. - Ran Ben Basat; Keren Censor-Hillel; Yi-Jun Chang; Wenchen Han; Dean Leitersdorf; Gregory Schwartzman (SPAA, 2025)