Communication algorithms with advice
DOI10.1016/J.JCSS.2009.07.002zbMATH Open1201.68017OpenAlexW1971694274MaRDI QIDQ972382FDOQ972382
Authors: Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc 
Publication date: 25 May 2010
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2009.07.002
Recommendations
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)
Cites Work
- Title not available (Why is that?)
- The power of a pebble: Exploring and mapping directed graphs
- Optimal deterministic broadcasting in known topology radio networks
- Distributed computing with advice: information sensitivity of graph coloring
- Compact labeling schemes for ancestor queries. (Extended abstract)
- Selective families, superimposed codes, and broadcasting on unknown radio networks. (Extended abstract)
- A trade-off between information and communication in broadcast protocols
- Approximate distance oracles
- Title not available (Why is that?)
- Local MST computation with short advice
- Tree exploration with advice
- Hundreds of impossibility results for distributed computing
- Universal codeword sets and representations of the integers
- Faster communication in known topology radio networks
- Broadcasting algorithms in radio networks with unknown topology
- Distance labeling in graphs (extended abstract)
- Optimal graph exploration without good maps
- Optimal lower bounds for some distributed algorithms for a complete network of processors
- The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors
- Fast Radio Broadcasting with Advice
- Title not available (Why is that?)
- Proof labeling schemes
- Graph Searching with Advice
- Distributed Computing – IWDC 2005
- Broadcasting in UDG radio networks with unknown topology
- On the effect of the deployment setting on broadcasting in Euclidean radio networks
Cited In (19)
- Edge exploration of anonymous graph by mobile agent with external help
- Topology recognition with advice
- Distributed graph searching with a sense of direction
- Fast rendezvous with advice
- Short labeling schemes for topology recognition in wireless tree networks
- Trade-offs between the size of advice and broadcasting time in trees
- Impact of knowledge on election time in anonymous networks
- Treasure hunt in graph using pebbles
- Fast radio broadcasting with advice
- Deterministic size discovery and topology recognition in radio networks with short labels
- Treasure Hunt with Advice
- Four shades of deterministic leader election in anonymous networks
- Locality and checkability in wait-free computing
- Locality and checkability in wait-free computing
- Finding the size and the diameter of a radio network using short labels
- Advice complexity of treasure hunt in geometric terrains
- Fast Radio Broadcasting with Advice
- Toward more localized local algorithms: removing assumptions concerning global knowledge
- Advice complexity of maximum independent set in sparse and bipartite graphs
This page was built for publication: Communication algorithms with advice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972382)
