Distributed MIS in O(log log n) Awake Complexity
暂无分享,去创建一个
[1] John E. Augustine,et al. Brief Announcement: Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds , 2022, PODC.
[2] M. Ghaffari,et al. Average Awake Complexity of MIS and Matching , 2022, SPAA.
[3] Gopal Pandurangan,et al. Awake-Efficient Distributed Algorithms for Maximal Independent Set , 2022, IEEE International Conference on Distributed Computing Systems.
[4] Thomas P. Hayes,et al. How to Wake Up Your Neighbors: Safe and Nearly Optimal Generic Energy Conservation in Radio Networks , 2022, DISC.
[5] Gopal Pandurangan,et al. Sleeping is Superefficient: MIS in Exponentially Better Awake Complexity , 2022, ArXiv.
[6] Leonid Barenboim,et al. Deterministic Logarithmic Completeness in the Distributed Sleeping Model , 2021, DISC.
[7] Fabian Kuhn,et al. Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees , 2021, PODC.
[8] Thomas P. Hayes,et al. Brief Announcement: Wake Up and Join Me! An Energy Efficient Algorithm for Maximal Matching in Radio Networks , 2021, Distributed Computing.
[9] Thomas P. Hayes,et al. The Energy Complexity of BFS in Radio Networks , 2020, PODC.
[10] Mohsen Ghaffari,et al. Improved Deterministic Network Decomposition , 2020, SODA.
[11] Soumyottam Chatterjee,et al. Sleeping is Efficient: MIS in O(1)-rounds Node-averaged Awake Complexity , 2020, PODC.
[12] Václav Rozhon,et al. Polylogarithmic-time deterministic network decomposition and distributed derandomization , 2019, STOC.
[13] Jukka Suomela,et al. Lower Bounds for Maximal Matchings and Maximal Independent Sets , 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).
[14] Christian Konrad,et al. MIS in the Congested Clique Model in O(log log Δ) Rounds , 2018, ArXiv.
[15] Thomas P. Hayes,et al. The Energy Complexity of Broadcast , 2017, PODC.
[16] Manuela Fischer,et al. Tight Analysis of Parallel Randomized Greedy MIS , 2017, SODA.
[17] Seth Pettie,et al. Exponential separations in the energy complexity of leader election , 2016, STOC.
[18] Krzysztof Krzywdzinski,et al. Distributed algorithms for random graphs , 2015, Theor. Comput. Sci..
[19] Michael A. Bender,et al. Resource-Competitive Algorithms , 2015, SIGA.
[20] Mohsen Ghaffari,et al. An Improved Distributed Algorithm for Maximal Independent Set , 2015, SODA.
[21] Ely Porat,et al. (Near) optimal resource-competitive broadcast with jamming , 2014, SPAA.
[22] Wendi B. Heinzelman,et al. An adaptive sensor sleeping solution based on sleeping multipath routing and duty-cycled MAC protocols , 2013, ACM Trans. Sens. Networks.
[23] Marek Klonowski,et al. Energy-Efficient Leader Election Protocols for Single-Hop Radio Networks , 2013, 2013 42nd International Conference on Parallel Processing.
[24] Maxwell Young,et al. Making evildoers pay: resource-competitive broadcast in sensor networks , 2012, PODC '12.
[25] Guy E. Blelloch,et al. Greedy sequential maximal independent set and matching are parallel on average , 2012, SPAA '12.
[26] Leonid Barenboim,et al. The Locality of Distributed Symmetry Breaking , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[27] Cynthia A. Phillips,et al. Sleeping on the Job: Energy-Efficient and Robust Broadcast for Radio Networks , 2011, Algorithmica.
[28] Christoph Lenzen,et al. MIS on trees , 2011, PODC '11.
[29] Roger Wattenhofer,et al. Local Computation , 2010, J. ACM.
[30] Leonid Barenboim,et al. Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition , 2008, PODC '08.
[31] Rong Zheng,et al. On-demand power management for ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[32] Miroslaw Kutylowski,et al. Efficient algorithms for leader election in radio networks , 2002, PODC '02.
[33] Martin Nilsson,et al. Investigating the energy consumption of a wireless network interface in an ad hoc networking environment , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).
[34] Stephan Olariu,et al. Randomized Leader Election Protocols in Radio Networks with No Collision Detection , 2000, ISAAC.
[35] Prabhakar Raghavan,et al. Parallel graph algorithms that are efficient on average , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[36] Michael Luby,et al. A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.
[37] Noga Alon,et al. A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.
[38] Roger Wattenhofer,et al. Local Computation , 2010, J. ACM.
[39] Qin Wang,et al. A Realistic Power Consumption Model for Wireless Sensor Network Devices , 2006, 2006 3rd Annual IEEE Communications Society on Sensor and Ad Hoc Communications and Networks.
[40] C. Siva Ram Murthy,et al. Ad Hoc Wireless Networks: Architectures and Protocols , 2004 .
[41] David Peleg,et al. Distributed Computing: A Locality-Sensitive Approach , 1987 .