Gregory Schwartzman

CoRR, 2024

2023

Optimal distributed covering algorithms.

[BibT_eX]

[DOI]

Distributed Comput., March, 2023

Local Max-Cut on Sparse Graphs.

[BibT_eX]

[DOI]

CoRR, 2023

Mini-batch k-means terminates within O(d/ϵ) iterations.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International Conference on Learning Representations, 2023

2022

FRANCIS: Fast Reaction Algorithms for Network Coordination In Switches.

[BibT_eX]

[DOI]

CoRR, 2022

Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs.

[BibT_eX]

[DOI]

Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

2021

SGD Through the Lens of Kolmogorov Complexity.

[BibT_eX]

[DOI]

CoRR, 2021

Smoothed Analysis of Population Protocols.

[BibT_eX]

[DOI]

Yuichi Sudo

Proceedings of the 35th International Symposium on Distributed Computing, 2021

On the Complexity of Load Balancing in Dynamic Networks.

[BibT_eX]

[DOI]

Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

Finding Subgraphs in Highly Dynamic Networks.

[BibT_eX]

[DOI]

Victor I. Kolobov

Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

2020

Derandomizing local distributed algorithms under bandwidth restrictions.

[BibT_eX]

[DOI]

Merav Parter

Distributed Comput., 2020

Models of Smoothing in Dynamic Networks.

[BibT_eX]

[DOI]

Uri Meir

Ami Paz

Proceedings of the 34th International Symposium on Distributed Computing, 2020

Improved Distributed Approximations for Maximum Independent Set.

[BibT_eX]

[DOI]

Seri Khoury

Aaron Schild

Proceedings of the 34th International Symposium on Distributed Computing, 2020

Brief Announcement: Improved Distributed Approximations for Maximum-Weight Independent Set.

[BibT_eX]

[DOI]

Seri Khoury

Aaron Schild

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Fast Deterministic Algorithms for Highly-Dynamic Networks.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Principles of Distributed Systems, 2020

2019

A (2+ε)-Approximation for Maximum Weight Matching in the Semi-streaming Model.

[BibT_eX]

[DOI]

Ami Paz

ACM Trans. Algorithms, 2019

Distributed Graph Algorithms (NII Shonan Meeting 162).

[BibT_eX]

[DOI]

NII Shonan Meet. Rep., 2019

Fast distributed algorithms for testing graph properties.

[BibT_eX]

[DOI]

Distributed Comput., 2019

Improved Distributed Approximation to Maximum Independent Set.

[BibT_eX]

[DOI]

Seri Khoury

Aaron Schild

CoRR, 2019

Fast and Simple Deterministic Algorithms for Highly-Dynamic Networks.

[BibT_eX]

[DOI]

CoRR, 2019

Parameterized Distributed Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Distributed Computing, 2019

2018

Optimal Distributed Weighted Set Cover Approximation.

[BibT_eX]

[DOI]

CoRR, 2018

A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(log n logΔ/ log<sup>2</sup> logΔ) Rounds.

[BibT_eX]

[DOI]

CoRR, 2018

Adapting Local Sequential Algorithms to the Distributed Setting.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Distributed Computing, 2018

A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(\log N\log \varDelta /\log ^2\log \varDelta ) Rounds.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2018

2017

Algorithms for Environments with Uncertainty.

[BibT_eX]

[DOI]

PhD thesis, 2017

A Distributed (2 + ε)-Approximation for Vertex Cover in O(log Δ / ε log log Δ) Rounds.

[BibT_eX]

[DOI]

Reuven Bar-Yehuda

J. ACM, 2017

Adapting Sequential Algorithms to the Distributed Setting.

[BibT_eX]

[DOI]

CoRR, 2017

A (2 + ∊)-Approximation for Maximum Weight Matching in the Semi-Streaming Model.

[BibT_eX]

[DOI]

Ami Paz

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Distributed Approximation of Maximum Independent Set and Maximum Matching.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

2016

PODC 2016 Review.

[BibT_eX]

[DOI]

SIGACT News, 2016

A Distributed $(2+ε)$-Approximation for Vertex Cover in $O(\logΔ/ε\log\logΔ)$ Rounds.

[BibT_eX]

[DOI]

Reuven Bar-Yehuda

CoRR, 2016

A Distributed (2+ε)-Approximation for Vertex Cover in O(logδ/ε log log δ) Rounds.

[BibT_eX]

[DOI]

Reuven Bar-Yehuda