Referenz
Schneider, J., & Wattenhofer, R. (2011). Trading Bit, Message, and Time Complexity of Distributed Algorithms Algorithm for Growth-Bounded Graphs. Paper presented at the Symposium on Distributed Computing (DISC).
Publikationsart
Beitrag in Konferenztagungsband