Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The computational power of beeps

From MaRDI portal
Publication:1664124
Jump to:navigation, search

DOI10.1007/978-3-662-48653-5_3zbMath1394.68014arXiv1508.03859OpenAlexW2220195453MaRDI QIDQ1664124

Calvin Newport

Publication date: 24 August 2018

Full work available at URL: https://arxiv.org/abs/1508.03859



Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14)


Related Items (5)

Design patterns in beeping algorithms: examples, emulation, and analysis ⋮ Counting in one-hop beeping networks ⋮ Unnamed Item ⋮ Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses ⋮ Asynchronous Broadcasting with Bivalent Beeps







This page was built for publication: The computational power of beeps

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1664124&oldid=13977334"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 04:46.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki