Communication algorithms with advice
type: Item
instance of: scholarly article
title: Communication algorithms with advice
zbMATH Open document ID: 1201.68017
author: Pierre Fraigniaud
author: David Ilcinkas
author: Andrzej Pelc
published in: Journal of Computer and System Sciences
publication date: 2010-05-25T00:00:00Z
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5711901
zbMATH Keywords: algorithm
zbMATH Keywords: broadcasting
zbMATH Keywords: wakeup
zbMATH Keywords: size of advice
zbMATH Keywords: message complexity
zbMATH Keywords: network
zbMATH Keywords: graph
MaRDI profile type: Publication
full work available at URL: j.jcss.2009.07.002
OpenAlex ID: W1971694274
cites work: Compact labeling schemes for ancestor queries. (Extended abstract)
cites work: A trade-off between information and communication in broadcast protocols
cites work: The power of a pebble: Exploring and mapping directed graphs
cites work: Selective families, superimposed codes, and broadcasting on unknown radio networks. (Extended abstract)
cites work: Distributed Computing – IWDC 2005
cites work: Q3619797
cites work: Broadcasting algorithms in radio networks with unknown topology
cites work: Optimal graph exploration without good maps
cites work: Universal codeword sets and representations of the integers
cites work: Broadcasting in UDG radio networks with unknown topology
cites work: On the effect of the deployment setting on broadcasting in Euclidean radio networks
cites work: Hundreds of impossibility results for distributed computing
cites work: Tree exploration with advice
cites work: Distributed computing with advice: information sensitivity of graph coloring
cites work: Local MST computation with short advice
cites work: Faster communication in known topology radio networks
cites work: Distance labeling in graphs (extended abstract)
cites work: Fast Radio Broadcasting with Advice
cites work: Q4829032
cites work: The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors
cites work: Optimal lower bounds for some distributed algorithms for a complete network of processors
cites work: Proof labeling schemes
cites work: Optimal deterministic broadcasting in known topology radio networks
cites work: Q4002466
cites work: Graph Searching with Advice
cites work: Approximate distance oracles
DOI: 10.1016/J.JCSS.2009.07.002
description: scientific article; zbMATH DE number 5711901