Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Elkin
- > Home > Persons > Michael Elkin
Publications
- 2022
[j52]Leonid Barenboim, Michael Elkin, Uri Goldenberg:
Locally-iterative Distributed (Δ + 1)-coloring and Applications. J. ACM 69(1): 5:1-5:26 (2022)- 2018
- [j40]Leonid Barenboim, Michael Elkin, Cyril Gavoille:
A fast network-decomposition algorithm and its applications to constant-time distributed computation. Theor. Comput. Sci. 751: 2-23 (2018) - [c52]Leonid Barenboim, Michael Elkin, Uri Goldenberg:
Locally-Iterative Distributed (Δ+ 1): -Coloring below Szegedy-Vishwanathan Barrier, and Applications to Self-Stabilization and to Restricted-Bandwidth Models. PODC 2018: 437-446 - 2017
- [c47]Leonid Barenboim, Michael Elkin, Tzalik Maimon:
Deterministic Distributed (Delta + o(Delta))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity. PODC 2017: 175-184 - [i24]Leonid Barenboim, Michael Elkin, Uri Goldenberg:
Locally-Iterative Distributed (Delta + 1)-Coloring below Szegedy-Vishwanathan Barrier, and Applications to Self-Stabilization and to Restricted-Bandwidth Models. CoRR abs/1712.00285 (2017) - 2016
- [j38]Leonid Barenboim, Michael Elkin, Seth Pettie, Johannes Schneider:
The Locality of Distributed Symmetry Breaking. J. ACM 63(3): 20:1-20:45 (2016) - [i18]Leonid Barenboim, Michael Elkin, Tzalik Maimon:
Deterministic Distributed (Delta + o(Δ))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity. CoRR abs/1610.06759 (2016) - 2015
- [c40]Leonid Barenboim, Michael Elkin, Cyril Gavoille:
A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation - (Extended Abstract). SIROCCO 2015: 209-223 - [i16]Leonid Barenboim, Michael Elkin, Cyril Gavoille:
A Fast Network-Decomposition Algorithm and its Applications to Constant-Time Distributed Computation. CoRR abs/1505.05697 (2015) - 2014
- [j30]Leonid Barenboim, Michael Elkin:
Combinatorial algorithms for distributed graph coloring. Distributed Comput. 27(2): 79-93 (2014) - [j29]Leonid Barenboim, Michael Elkin, Fabian Kuhn:
Distributed (Delta+1)-Coloring in Linear (in Delta) Time. SIAM J. Comput. 43(1): 72-95 (2014) - 2013
- [b1]Leonid Barenboim, Michael Elkin:
Distributed Graph Coloring: Fundamentals and Recent Developments. Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers 2013, ISBN 9781627050180, pp. 1-171 - [j27]Leonid Barenboim, Michael Elkin:
Distributed deterministic edge coloring using bounded neighborhood independence. Distributed Comput. 26(5-6): 273-287 (2013) - 2012
- [c32]Leonid Barenboim, Michael Elkin, Seth Pettie, Johannes Schneider:
The Locality of Distributed Symmetry Breaking. FOCS 2012: 321-330 - [i11]Leonid Barenboim, Michael Elkin, Seth Pettie, Johannes Schneider:
Fast Distributed Algorithms for Maximal Matching and Maximal Independent Set. CoRR abs/1202.1983 (2012) - 2011
- [j25]Leonid Barenboim, Michael Elkin:
Deterministic Distributed Vertex Coloring in Polylogarithmic Time. J. ACM 58(5): 23:1-23:25 (2011) - [c29]Leonid Barenboim, Michael Elkin:
Distributed deterministic edge coloring using bounded neighborhood independence. PODC 2011: 129-138 - [c28]Leonid Barenboim, Michael Elkin:
Combinatorial Algorithms for Distributed Graph Coloring. DISC 2011: 66-81 - 2010
- [j21]Leonid Barenboim, Michael Elkin:
Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition. Distributed Comput. 22(5-6): 363-379 (2010) - [c26]Leonid Barenboim, Michael Elkin:
Deterministic distributed vertex coloring in polylogarithmic time. PODC 2010: 410-419 - [i6]Leonid Barenboim, Michael Elkin:
Deterministic Distributed Vertex Coloring in Polylogarithmic Time. CoRR abs/1003.1608 (2010) - [i5]Leonid Barenboim, Michael Elkin:
Distributed Deterministic Edge Coloring using Bounded Neighborhood Independence. CoRR abs/1010.2454 (2010) - 2009
- [c23]Leonid Barenboim, Michael Elkin:
Distributed (delta+1)-coloring in linear (in delta) time. STOC 2009: 111-120 - 2008
- [c20]Leonid Barenboim, Michael Elkin:
Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition. PODC 2008: 25-34 - [i3]Leonid Barenboim, Michael Elkin:
Distributed (Delta + 1)-coloring in linear (in Delta) time. CoRR abs/0812.1379 (2008)
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 2024-02-04 00:36 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:
