Approximating the Size of a Radio Network in Beeping Model-Reference-Cited by-同舟云学术

Approximating the Size of a Radio Network in Beeping Model

Published:2016 Issue: Volume: Page:358-373
ISSN:0302-9743
Container-title:Structural Information and Communication Complexity
language:
Short-container-title:

Author:

Brandes Philipp,Kardas Marcin,Klonowski Marek,Pająk Dominik,Wattenhofer Roger

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-48314-6_23

Reference25 articles.

1. Afek, Y., Alon, N., Bar-Joseph, Z., Cornejo, A., Haeupler, B., Kuhn, F.: Beeping a maximal independent set. Distrib. Comput. 26(4), 195–208 (2013)

2. Lecture Notes in Computer Science;JL Bordim,1999

3. Lecture Notes in Computer Science;I Caragiannis,2005

4. Chakrabarti, A., Regev, O.: An optimal lower bound on the communication complexity of gap-hamming-distance. In: Fortnow, L., Vadhan, S.P. (eds.) Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6–8 June 2011, pp. 51–60. ACM (2011). http://doi.acm.org/10.1145/1993636.1993644

5. Chassaing, P., Gerin, L.: Efficient estimation of the cardinality of large data sets. In: 4th Colloquium on Mathematics and Computer Science, DMTCS Proceedings, pp. 419–422 (2006)

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On Size Hiding Protocols in Beeping Model;Euro-Par 2023: Parallel Processing;2023

2. Estimating Nodes’ Number in a Nanonetwork Using Two Algorithms;Intelligent Sustainable Systems;2023

3. Naming Processes in Multichannels with Beeps in the Weak Model;Lecture Notes in Networks and Systems;2021-07-13

4. Distributed voting in beep model;Signal Processing;2020-12

5. Noisy Beeps;Proceedings of the 39th Symposium on Principles of Distributed Computing;2020-07-31