Pages that link to "Item:Q3474265"

The following pages link to A trade-off between information and communication in broadcast protocols (Q3474265):

Displaying 38 items.

• Convergecast and broadcast by power-aware mobile agents (Q261352) (← links)
• Tight bounds for distributed minimum-weight spanning tree verification (Q372968) (← links)
• Trade-offs between the size of advice and broadcasting time in trees (Q547287) (← links)
• Messy broadcasting - decentralized broadcast schemes with limited knowledge (Q628314) (← links)
• A \(2\cdot | E |\)-bit distributed algorithm for the directed Euler trail problem (Q685488) (← links)
• Broadcasting in geometric radio networks (Q924558) (← links)
• Communication algorithms with advice (Q972382) (← links)
• A bandwidth latency tradeoff for broadcast and reduction (Q1007568) (← links)
• Deterministic broadcasting time with partial knowledge of the network. (Q1401209) (← links)
• Information-theoretic broadcast with dishonest majority for long messages (Q1629421) (← links)
• Compact routing messages in self-healing trees (Q1686108) (← links)
• Sense of direction in distributed computing (Q1870525) (← links)
• Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model (Q1981632) (← links)
• Fooling views: a new lower bound technique for distributed computations under congestion (Q2220402) (← links)
• Message lower bounds via efficient network synchronization (Q2292919) (← links)
• Energy-optimal broadcast and exploration in a tree using mobile agents (Q2330122) (← links)
• Efficient communication in unknown networks (Q2747804) (← links)
• Message Lower Bounds via Efficient Network Synchronization (Q2835018) (← links)
• Asynchronous Broadcasting with Bivalent Beeps (Q2835032) (← links)
• Time-Efficient Broadcast in Radio Networks (Q3404475) (← links)
• Local Maps: New Insights into Mobile Agent Algorithms (Q3540225) (← links)
• Communication-Space Tradeoffs for Unrestricted Protocols (Q4302289) (← links)
• Message complexity versus space complexity in fault tolerant broadcast protocols (Q4730761) (← links)
• (Q4934334) (← links)
• Energy-Optimal Broadcast in a Tree with Mobile Agents (Q5056056) (← links)
• (Q5090924) (← links)
• (Q5090930) (← links)
• Assigning labels in an unknown anonymous network with a leader (Q5138359) (← links)
• Interval routing schemes allow broadcasting with linear message-complexity (Q5138363) (← links)
• Deterministic broadcasting in ad hoc radio networks (Q5138368) (← links)
• Hundreds of impossibility results for distributed computing (Q5138488) (← links)
• The Impact of Locality in the Broadcast Congested Clique Model (Q5220411) (← links)
• On the Complexity of Universal Leader Election (Q5501952) (← links)
• Balancing load versus decreasing communication: Parameterizing the tradeoff (Q5943104) (← links)
• Topology recognition and leader election in colored networks (Q5964025) (← links)
• Communication costs in a geometric communication network (Q6052702) (← links)
• Communication efficient self-stabilizing leader election (Q6535008) (← links)
• Singularly optimal randomized leader election (Q6535020) (← links)