default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGregory Schwartzman
Person information
- affiliation: JAIST, Ishikawa, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c21]Uri Meir, Gregory Schwartzman, Yuichi Yoshida:
Stochastic Distance in Property Testing. APPROX/RANDOM 2024: 57:1-57:13- [c20]Gregory Schwartzman:
Local Max-Cut on Sparse Graphs. ESA 2024: 98:1-98:6 - [i26]Gregory Schwartzman:
Mini-batch Submodular Maximization. CoRR abs/2401.12478 (2024) - [i25]Gregory Schwartzman:
Exfiltration of personal information from ChatGPT via prompt injection. CoRR abs/2406.00199 (2024) - [i24]Uri Meir, Gregory Schwartzman, Yuichi Yoshida:
Stochastic Distance in Property Testing. CoRR abs/2407.14080 (2024) - [i23]Ben Jourdan, Gregory Schwartzman:
Mini-Batch Kernel k-means. CoRR abs/2410.05902 (2024) - 2023
- [j6]Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman:
Optimal distributed covering algorithms. Distributed Comput. 36(1): 45-55 (2023) - [c19]Gregory Schwartzman:
Mini-batch k-means terminates within O(d/ϵ) iterations. ICLR 2023 - [i22]Gregory Schwartzman:
Mini-batch k-means terminates within O(d/ε) iterations. CoRR abs/2304.00419 (2023) - [i21]Gregory Schwartzman:
Local Max-Cut on Sparse Graphs. CoRR abs/2311.00182 (2023) - 2022
- [c18]Taisuke Izumi, Naoki Kitamura, Takamasa Naruse, Gregory Schwartzman:
Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs. SPAA 2022: 11-22 - [i20]Wenchen Han, Vic Feng, Gregory Schwartzman, Michael Mitzenmacher, Minlan Yu, Ran Ben-Basat:
FRANCIS: Fast Reaction Algorithms for Network Coordination In Switches. CoRR abs/2204.14138 (2022) - [i19]Taisuke Izumi, Naoki Kitamura, Takamasa Naruse, Gregory Schwartzman:
Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs. CoRR abs/2205.14897 (2022) - 2021
- [c17]Keren Censor-Hillel, Victor I. Kolobov, Gregory Schwartzman:
Finding Subgraphs in Highly Dynamic Networks. SPAA 2021: 140-150 - [c16]Seth Gilbert
, Uri Meir, Ami Paz, Gregory Schwartzman:
On the Complexity of Load Balancing in Dynamic Networks. SPAA 2021: 254-264 - [c15]Gregory Schwartzman, Yuichi Sudo:
Smoothed Analysis of Population Protocols. DISC 2021: 34:1-34:19 - [i18]Gregory Schwartzman, Yuichi Sudo:
Smoothed Analysis of Population Protocols. CoRR abs/2105.12262 (2021) - [i17]Seth Gilbert, Uri Meir, Ami Paz, Gregory Schwartzman:
On the Complexity of Load Balancing in Dynamic Networks. CoRR abs/2105.13194 (2021) - [i16]Gregory Schwartzman:
SGD Through the Lens of Kolmogorov Complexity. CoRR abs/2111.05478 (2021) - 2020
- [j5]Keren Censor-Hillel, Merav Parter, Gregory Schwartzman:
Derandomizing local distributed algorithms under bandwidth restrictions. Distributed Comput. 33(3-4): 349-366 (2020) - [c14]Keren Censor-Hillel, Neta Dafni, Victor I. Kolobov, Ami Paz, Gregory Schwartzman:
Fast Deterministic Algorithms for Highly-Dynamic Networks. OPODIS 2020: 28:1-28:16 - [c13]Ken-ichi Kawarabayashi, Seri Khoury, Aaron Schild, Gregory Schwartzman:
Brief Announcement: Improved Distributed Approximations for Maximum-Weight Independent Set. PODC 2020: 283-285 - [c12]Ken-ichi Kawarabayashi, Seri Khoury, Aaron Schild, Gregory Schwartzman:
Improved Distributed Approximations for Maximum Independent Set. DISC 2020: 35:1-35:16 - [c11]Uri Meir, Ami Paz, Gregory Schwartzman:
Models of Smoothing in Dynamic Networks. DISC 2020: 36:1-36:16 - [i15]Keren Censor-Hillel, Victor I. Kolobov, Gregory Schwartzman:
Finding Subgraphs in Highly Dynamic Networks. CoRR abs/2009.08208 (2020) - [i14]Uri Meir, Ami Paz, Gregory Schwartzman:
Models of Smoothing in Dynamic Networks. CoRR abs/2009.13006 (2020)
2010 – 2019
- 2019
- [j4]Keren Censor-Hillel, Eldar Fischer, Gregory Schwartzman, Yadu Vasudev:
Fast distributed algorithms for testing graph properties. Distributed Comput. 32(1): 41-57 (2019) - [j3]Ami Paz, Gregory Schwartzman:
A (2+ε)-Approximation for Maximum Weight Matching in the Semi-streaming Model. ACM Trans. Algorithms 15(2): 18:1-18:15 (2019) - [c10]Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman:
Optimal Distributed Covering Algorithms. PODC 2019: 104-106 - [c9]Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman:
Optimal Distributed Covering Algorithms. DISC 2019: 5:1-5:15 - [c8]Ran Ben-Basat, Ken-ichi Kawarabayashi, Gregory Schwartzman:
Parameterized Distributed Algorithms. DISC 2019: 6:1-6:16 - [i13]Keren Censor-Hillel, Neta Dafni, Victor I. Kolobov, Ami Paz, Gregory Schwartzman:
Fast and Simple Deterministic Algorithms for Highly-Dynamic Networks. CoRR abs/1901.04008 (2019) - [i12]Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman:
Optimal Distributed Covering Algorithms. CoRR abs/1902.09377 (2019) - [i11]Ken-ichi Kawarabayashi, Seri Khoury, Aaron Schild, Gregory Schwartzman:
Improved Distributed Approximation to Maximum Independent Set. CoRR abs/1906.11524 (2019) - [i10]Guy Even, Gregory Schwartzman:
Distributed Graph Algorithms (NII Shonan Meeting 162). NII Shonan Meet. Rep. 2019 (2019) - 2018
- [c7]Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman:
A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(\log N\log \varDelta /\log ^2\log \varDelta ) Rounds. SIROCCO 2018: 226-236 - [c6]Ken-ichi Kawarabayashi, Gregory Schwartzman:
Adapting Local Sequential Algorithms to the Distributed Setting. DISC 2018: 35:1-35:17 - [i9]Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman:
A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(log n logΔ/ log2 logΔ) Rounds. CoRR abs/1804.01308 (2018) - [i8]Ran Ben-Basat, Ken-ichi Kawarabayashi, Gregory Schwartzman:
Parameterized Distributed Algorithms. CoRR abs/1807.04900 (2018) - [i7]Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman:
Optimal Distributed Weighted Set Cover Approximation. CoRR abs/1808.05809 (2018) - 2017
- [b1]Gregory Schwartzman:
Algorithms for Environments with Uncertainty. Technion - Israel Institute of Technology, Israel, 2017 - [j2]Reuven Bar-Yehuda, Keren Censor-Hillel, Gregory Schwartzman:
A Distributed (2 + ε)-Approximation for Vertex Cover in O(log Δ / ε log log Δ) Rounds. J. ACM 64(3): 23:1-23:11 (2017) - [c5]Reuven Bar-Yehuda, Keren Censor-Hillel, Mohsen Ghaffari, Gregory Schwartzman:
Distributed Approximation of Maximum Independent Set and Maximum Matching. PODC 2017: 165-174 - [c4]Ami Paz, Gregory Schwartzman:
A (2 + ∊)-Approximation for Maximum Weight Matching in the Semi-Streaming Model. SODA 2017: 2153-2161 - [c3]Keren Censor-Hillel, Merav Parter, Gregory Schwartzman:
Derandomizing Local Distributed Algorithms under Bandwidth Restrictions. DISC 2017: 11:1-11:16 - [i6]Ami Paz, Gregory Schwartzman:
A (2+ε)-Approximation for Maximum Weight Matching in the Semi-Streaming Model. CoRR abs/1702.04536 (2017) - [i5]Reuven Bar-Yehuda, Keren Censor-Hillel, Mohsen Ghaffari, Gregory Schwartzman:
Distributed Approximation of Maximum Independent Set and Maximum Matching. CoRR abs/1708.00276 (2017) - [i4]Gregory Schwartzman:
Adapting Sequential Algorithms to the Distributed Setting. CoRR abs/1711.10155 (2017) - 2016
- [j1]Gregory Schwartzman:
PODC 2016 Review. SIGACT News 47(4): 35-38 (2016) - [c2]Reuven Bar-Yehuda, Keren Censor-Hillel, Gregory Schwartzman:
A Distributed (2+ε)-Approximation for Vertex Cover in O(logδ/ε log log δ) Rounds. PODC 2016: 3-8 - [c1]Keren Censor-Hillel, Eldar Fischer, Gregory Schwartzman, Yadu Vasudev:
Fast Distributed Algorithms for Testing Graph Properties. DISC 2016: 43-56 - [i3]Reuven Bar-Yehuda, Keren Censor-Hillel, Gregory Schwartzman:
A Distributed $(2+ε)$-Approximation for Vertex Cover in $O(\logΔ/ε\log\logΔ)$ Rounds. CoRR abs/1602.03713 (2016) - [i2]Keren Censor-Hillel, Eldar Fischer, Gregory Schwartzman, Yadu Vasudev:
Fast Distributed Algorithms for Testing Graph Properties. CoRR abs/1602.03718 (2016) - [i1]Keren Censor-Hillel, Merav Parter, Gregory Schwartzman:
Derandomizing Local Distributed Algorithms under Bandwidth Restrictions. CoRR abs/1608.01689 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
