Loading...
The system can't perform the operation now. Try again later.
Citations per year
Duplicate citations
The following articles are merged in Scholar. Their
combined citations
are counted only for the first article.
Merged citations
This "Cited by" count includes citations to the following articles in Scholar. The ones marked
*
may be different from the article in the profile.
Add co-authors
Co-authors
Follow
New articles by this author
New citations to this author
New articles related to this author's research
Email address for updates
Done
My profile
My library
Metrics
Alerts
Settings
Sign in
Sign in
Get my own profile
Cited by
All
Since 2019
Citations
10
10
h-index
2
2
i10-index
0
0
0
8
4
2022
2023
2024
1
7
2
Public access
View all
View all
1 article
0 articles
available
not available
Based on funding mandates
Co-authors
Monika Henzinger
Professor of Computer Science, Institute of Science and Technology Austria (ISTA)
Verified email at ist.ac.at
Stefan Schmid
Professor, Computer Science, TU Berlin & Weizenbaum Institute & Fraunhofer SIT
Verified email at tu-berlin.de
Follow
Antoine El-Hayek
University of Vienna
Verified email at univie.ac.at
Distributed Computing
Articles
Cited by
Public access
Co-authors
Title
Sort
Sort by citations
Sort by year
Sort by title
Cited by
Cited by
Year
Asymptotically tight bounds on the time complexity of broadcast and its variants in dynamic networks
A El-Hayek, M Henzinger, S Schmid
arXiv preprint arXiv:2211.10151
, 2022
4
2022
Brief announcement: Broadcasting time in dynamic rooted trees is linear
A El-Hayek, M Henzinger, S Schmid
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing …
, 2022
4
2022
On
-Matching and Fully-Dynamic Maximum
-Edge Coloring
A El-Hayek, K Hanauer, M Henzinger
arXiv preprint arXiv:2310.01149
, 2023
1
2023
Time complexity of broadcast and consensus for randomized oblivious message adversaries
A El-Hayek, M Henzinger, S Schmid
arXiv preprint arXiv:2302.11988
, 2023
1
2023
The system can't perform the operation now. Try again later.
Articles 1–4
Show more
Privacy
Terms
Help
About Scholar
Search help