Gregory Schwartzman

From MaRDI portal
Person:1660918



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

DEBUG first row: length=10 | [1]=https://portal.mardi4nfdi.de/wiki/Public | [2]=Fast deterministic algorithms for highly | [3]=https://portal.mardi4nfdi.de/entity/Q683 | [4]=2026-03-31 | [5]=Q6834017 | [6]=https://portal.mardi4nfdi.de/entity/Q597 | [7]=Paper | [8]=8180979 | [9]=  | [10]= 
PublicationDate of PublicationType
Fast deterministic algorithms for highly-dynamic networks
 
row10=  | journal=  | arxivId= 
2026-03-31Paper
scientific article; zbMATH DE number 7774285 (Why is no real title available?)
 
row10=  | journal=  | arxivId= 
2023-12-08Paper
Models of smoothing in dynamic networks
 
row10=  | journal=  | arxivId= 
2023-11-02Paper
Improved distributed approximations for maximum independent set
 
row10=  | journal=  | arxivId= 
2023-11-02Paper
Optimal distributed covering algorithms
Distributed Computing
row10=  | journal=Distributed Computing | arxivId= 
2023-03-14Paper
Derandomizing local distributed algorithms under bandwidth restrictions
 
row10=  | journal=  | arxivId= 
2023-02-03Paper
Optimal distributed covering algorithms
 
row10=  | journal=  | arxivId= 
2023-02-03Paper
Parameterized distributed algorithms
 
row10=  | journal=  | arxivId= 
2023-02-03Paper
Adapting local sequential algorithms to the distributed setting
 
row10=  | journal=  | arxivId= 
2022-07-21Paper
Brief Announcement: Improved Distributed Approximations for Maximum-Weight Independent Set
Proceedings of the 39th Symposium on Principles of Distributed Computing
row10=  | journal=Proceedings of the 39th Symposium on Principles of Distributed Computing | arxivId= 
2021-03-15Paper
Optimal Distributed Covering Algorithms
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing
row10=  | journal=Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | arxivId= 
2021-01-20Paper
Derandomizing local distributed algorithms under bandwidth restrictions
Distributed Computing
row10=  | journal=Distributed Computing | arxivId= 
2020-06-15Paper
A \((2+\epsilon)\)-approximation for maximum weight matching in the semi-streaming model
ACM Transactions on Algorithms
row10=  | journal=ACM Transactions on Algorithms | arxivId= 
2019-03-28Paper
Fast distributed algorithms for testing graph properties
Distributed Computing
row10=  | journal=Distributed Computing | arxivId= 
2019-03-21Paper
A deterministic distributed 2-approximation for weighted vertex cover in \(O(\log N\log\varDelta/\log^2\log\varDelta)\) rounds
 
row10=  | journal=  | arxivId= 
2019-01-30Paper
Fast distributed algorithms for testing graph properties
Lecture Notes in Computer Science
row10=  | journal=Lecture Notes in Computer Science | arxivId= 
2018-08-16Paper
A \((2 + \epsilon)\)-approximation for maximum weight matching in the semi-streaming model
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
row10=  | journal=Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | arxivId= 
2018-07-16Paper
A Distributed (2 + ε)-Approximation for Vertex Cover in O(log Δ / ε log log Δ) Rounds
Journal of the ACM
row10=  | journal=Journal of the ACM | arxivId= 
2018-05-17Paper
Distributed approximation of maximum independent set and maximum matching
Proceedings of the ACM Symposium on Principles of Distributed Computing
row10=  | journal=Proceedings of the ACM Symposium on Principles of Distributed Computing | arxivId= 
2017-10-11Paper
A Distributed (2+ε)-Approximation for Vertex Cover in O(logδ/ε log log δ) Rounds
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing
row10=  | journal=Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | arxivId= 
2017-09-29Paper


Research outcomes over time


This page was built for person: Gregory Schwartzman