Gregory Schwartzman

Japan Advanced Institute of Science and Technology — Japan

Computer Science · Physical Sciences

9h-index229citations46works0.32yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Complexity and Algorithms in Graphs(36), Optimization and Search Problems(17), Advanced Graph Theory Research(8), Cryptography and Data Security(7), Privacy-Preserving Technologies in Data(6)

Publications46 total

Bounded Memory in Distributed Networks
2025· 1 citedOpen Access
Mini-batch Submodular Maximization
arXiv (Cornell University)·2024Open Access
Stochastic Distance in Property Testing
arXiv (Cornell University)·2024Open Access
Local Max-Cut on Sparse Graphs
arXiv (Cornell University)·2023Open Access
Mini-batch $k$-means terminates within $O(d/ε)$ iterations
arXiv (Cornell University)·2023Open Access
Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs
2022· 2 citedOpen Access
Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs
arXiv (Cornell University)·2022Open Access
FRANCIS: Fast Reaction Algorithms for Network Coordination In Switches
arXiv (Cornell University)·2022· 1 citedOpen Access
SGD Through the Lens of Kolmogorov Complexity
arXiv (Cornell University)·2021Open Access
On the Complexity of Load Balancing in Dynamic Networks
2021· 3 cited
Finding Subgraphs in Highly Dynamic Networks
2021· 1 citedOpen Access
On the Complexity of Load Balancing in Dynamic Networks
arXiv (Cornell University)·2021Open Access
Optimal distributed covering algorithms
Distributed Computing·2021· 3 citedOpen Access
Smoothed Analysis of Population Protocols.
arXiv (Cornell University)·2021Open Access
Fast Deterministic Algorithms for Highly-Dynamic Networks
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2021· 3 citedOpen Access
Smoothed Analysis of Population Protocols
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2021Open Access
Brief Announcement: Improved Distributed Approximations for Maximum-Weight Independent Set
2020· 3 cited
Derandomizing local distributed algorithms under bandwidth restrictions
Distributed Computing·2020· 11 citedOpen Access
Models of Smoothing in Dynamic Networks
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2020· 1 citedOpen Access
Improved Distributed Approximations for Maximum Independent Set
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2020· 2 citedOpen Access
page 1 of 3Next →

Frequent Co-authors

Keren Censor-Hillel(16), Ken‐ichi Kawarabayashi(13), Ran Ben Basat(10), Ami Paz(9), Reuven Bar-Yehuda(7), Guy Even(7), Victor I. Kolobov(4), Uri Meir(4), Seri Khoury(4), Aaron Schild(4), Mohsen Ghaffari(3), Eldar Fischer(3), Yadu Vasudev(3), Neta Dafni(3), Seth Gilbert(2), Taisuke Izumi(2), Takamasa Naruse(2), Yuichi Sudo(2), Merav Parter(1), Naoki Kitamura(1)