1. Christoph Ambühl . 2005 . An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks. In Automata, Languages and Programming , 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11--15, 2005, Proceedings (Lecture Notes in Computer Science , Vol. 3580). Springer, 1139-- 1150 . Christoph Ambühl. 2005. An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks. In Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11--15, 2005, Proceedings (Lecture Notes in Computer Science, Vol. 3580). Springer, 1139--1150.
2. John Augustine , William K. Moses Jr ., and Gopal Pandurangan . 2022. Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds. arXiv preprint arXiv:2204.08385 ( 2022 ). John Augustine, William K. Moses Jr., and Gopal Pandurangan. 2022. Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds. arXiv preprint arXiv:2204.08385 (2022).
3. Leonid Barenboim and Tzalik Maimon . 2021. Deterministic Logarithmic Completeness in the Distributed Sleeping Model . In 35th International Symposium on Distributed Computing, DISC 2021 , October 4--8, 2021, Freiburg, Germany (Virtual Conference) (LIPIcs , Vol. 209), Seth Gilbert (Ed.). Schloss Dagstuhl - Leibniz- Zentrum für Informatik, 10:1--10: 19 . https://doi.org/10.4230/LIPIcs.DISC.2021.10 10.4230/LIPIcs.DISC.2021.10 Leonid Barenboim and Tzalik Maimon. 2021. Deterministic Logarithmic Completeness in the Distributed Sleeping Model. In 35th International Symposium on Distributed Computing, DISC 2021, October 4--8, 2021, Freiburg, Germany (Virtual Conference) (LIPIcs, Vol. 209), Seth Gilbert (Ed.). Schloss Dagstuhl - Leibniz- Zentrum für Informatik, 10:1--10:19. https://doi.org/10.4230/LIPIcs.DISC.2021.10
4. The Energy Complexity of Broadcast
5. Sleeping is Efficient: MIS in
O
(1)-rounds Node-averaged Awake Complexity