Algorithms & Complexity
Computer Science 1
Group
Home
News
Team
Directions
Research
Topics and Projects
Publications
UflLib
Teaching
Sommer 25
Previous Semesters
BSc/MSc Thesis
Misc
Schulprojekte
ADYN
CS @ RWTH
RWTH
back to main page
Changelog Notes - Theory of Distributed Systems
April 14:
Section 3.3: Convergecast of sums of m-bit numbers has message complexity O(nm/log n) and time complexity O(Depth(T) m / log n)