The Distributed Wireless Gathering Problem (Q3511417)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	The Distributed Wireless Gathering Problem	scientific article

Statements

scholarly article

0 references

The Distributed Wireless Gathering Problem (English)

0 references

Vincenzo Bonifaci

0 references

0 references

Alberto Marchetti-Spaccamela

0 references

0 references

Algorithmic Aspects in Information and Management

0 references

publication date

10 July 2008

0 references

full work available at URL

http://hdl.handle.net/11590/381241

0 references

MaRDI profile type

MaRDI publication profile

0 references

Universal-stability results and performance bounds for greedy contention-resolution protocols

0 references

On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization

0 references

Multiple Communication in Multihop Radio Networks

0 references

An Approximation Algorithm for the Wireless Gathering Problem

0 references

The Distributed Wireless Gathering Problem

0 references

Adversarial queuing theory

0 references

Multi-processor scheduling to minimize flow time with ε resource augmentation

0 references

Analysis of Backoff Protocols for Multiple Access Channels

0 references

Speed is as powerful as clairvoyance

0 references

0 references

Maximal independent sets in radio networks

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-540-68880-8_9

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3511417

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3511417&oldid=35063575"