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 | 67 | 2018 |

Derandomizing local distributed algorithms under bandwidth restrictions K Censor-Hillel, M Parter, G Schwartzman Distributed Computing 33 (3), 349-366, 2020 | 66 | 2020 |

Fast distributed algorithms for testing graph properties K Censor-Hillel, E Fischer, G Schwartzman, Y Vasudev Distributed Computing 32 (1), 41-57, 2019 | 52 | 2019 |

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 | 46 | 2017 |

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 | 40 | 2017 |

Adapting local sequential algorithms to the distributed setting K Kawarabayashi, G Schwartzman arXiv preprint arXiv:1711.10155, 2017 | 16* | 2017 |

Parameterized distributed algorithms R Ben-Basat, K Kawarabayashi, G Schwartzman arXiv preprint arXiv:1807.04900, 2018 | 13 | 2018 |

A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in Rounds R Ben-Basat, G Even, K Kawarabayashi, G Schwartzman International Colloquium on Structural Information and Communication …, 2018 | 12* | 2018 |

Fast deterministic algorithms for highly-dynamic networks K Censor-Hillel, N Dafni, VI Kolobov, A Paz, G Schwartzman arXiv preprint arXiv:1901.04008, 2019 | 9 | 2019 |

Improved distributed approximations for maximum independent set K Kawarabayashi, S Khoury, A Schild, G Schwartzman arXiv preprint arXiv:1906.11524, 2019 | 8 | 2019 |

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 | 7 | 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 |

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 arXiv preprint arXiv:2205.14897, 2022 | | 2022 |

FRANCIS: Fast Reaction Algorithms for Network Coordination In Switches W Han, V Feng, G Schwartzman, M Mitzenmacher, M Yu, R Ben-Basat arXiv preprint arXiv:2204.14138, 2022 | | 2022 |

SGD Through the Lens of Kolmogorov Complexity G Schwartzman arXiv preprint arXiv:2111.05478, 2021 | | 2021 |

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 | | 2021 |

Smoothed Analysis of Population Protocols G Schwartzman, Y Sudo arXiv preprint arXiv:2105.12262, 2021 | | 2021 |

Brief Announcement: Improved Distributed Approximations for Maximum-Weight Independent Set K Kawarabayashi, S Khoury, A Schild, G Schwartzman Proceedings of the 39th Symposium on Principles of Distributed Computing …, 2020 | | 2020 |

Distributed Graph Algorithms (NII Shonan Meeting 162). G Even, G Schwartzman NII Shonan Meet. Rep. 2019, 2019 | | 2019 |