A hundred impossibility proofs for distributed computing
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
A trade-off between information and communication in broadcast protocols
Journal of the ACM (JACM)
A lower bound for radio broadcast
Journal of Computer and System Sciences
Approximation Algorithms for Minimum-Time Broadcast
SIAM Journal on Discrete Mathematics
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Compact labeling schemes for ancestor queries
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Selective families, superimposed codes, and broadcasting on unknown radio networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Labeling schemes for flow and connectivity
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
The impact of information on broadcasting time in linear radio networks
Theoretical Computer Science
The power of a pebble: exploring and mapping directed graphs
Information and Computation
Sublogarithmic approximation for telephone multicast: path out of jungle (extended abstract)
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Journal of the ACM (JACM)
Optimal graph exploration without good maps
Theoretical Computer Science
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Broadcasting in undirected ad hoc radio networks
Distributed Computing - Special issue: PODC 02
Oracle size: a new measure of difficulty for communication tasks
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Broadcasting algorithms in radio networks with unknown topology
Journal of Algorithms
Broadcasting in geometric radio networks
Journal of Discrete Algorithms
Local MST computation with short advice
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
IEEE Transactions on Computers
Optimal deterministic broadcasting in known topology radio networks
Distributed Computing
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Tree exploration with an oracle
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Distributed computing with advice: information sensitivity of graph coloring
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Online Computation with Advice
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Fast radio broadcasting with advice
Theoretical Computer Science
Communication algorithms with advice
Journal of Computer and System Sciences
DISC'10 Proceedings of the 24th international conference on Distributed computing
Online computation with advice
Theoretical Computer Science
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
We study the problem of the amount of information required to perform fast broadcasting in tree networks. The source located at the root of a tree has to disseminate a message to all nodes. In each round each informed node can transmit to one child. Nodes do not know the topology of the tree but an oracle knowing it can give a string of bits of advice to the source which can then pass it down the tree with the source message. The quality of a broadcasting algorithm with advice is measured by its competitive ratio: the worst case ratio, taken over n-node trees, between the time of this algorithm and the optimal broadcasting time in the given tree. Our goal is to find a trade-off between the size of advice and the best competitive ratio of a broadcasting algorithm for n-node trees. We establish such a trade-off with an approximation factor of Onε), for an arbitrarily small positive constant ε. This is the first problem for which a trade-off between the amount of provided information and the efficiency of the solution is shown for arbitrary size of advice.