Pages that link to "Item:Q2835011"
From MaRDI portal
The following pages link to Structural Information and Communication Complexity (Q2835011):
Displaying 50 items.
- Measuring the impact of adversarial errors on packet scheduling strategies (Q282242) (← links)
- A new self-stabilizing maximal matching algorithm (Q1008731) (← links)
- Node labels in local decision (Q1625609) (← links)
- On fast and robust information spreading in the vertex-congest model (Q1625611) (← links)
- Collaborative delivery with energy-constrained mobile robots (Q2292912) (← links)
- Whom to befriend to influence people (Q2292915) (← links)
- Rumor spreading with bounded in-degree (Q2292916) (← links)
- Dynamic networks of finite state machines (Q2292917) (← links)
- Byzantine gathering in networks (Q2359766) (← links)
- How Many Cooks Spoil the Soup? (Q2835012) (← links)
- Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry? (Q2835014) (← links)
- Fooling Pairs in Randomized Communication Complexity (Q2835016) (← links)
- Public vs. Private Randomness in Simultaneous Multi-party Communication Complexity (Q2835017) (← links)
- Message Lower Bounds via Efficient Network Synchronization (Q2835018) (← links)
- Recent Results on Fault-Tolerant Consensus in Message-Passing Networks (Q2835019) (← links)
- Asynchronous Coordination Under Preferences and Constraints (Q2835020) (← links)
- Concurrent Use of Write-Once Memory (Q2835021) (← links)
- In the Search for Optimal Concurrency (Q2835023) (← links)
- The F-Snapshot Problem (Q2835024) (← links)
- t-Resilient Immediate Snapshot Is Impossible (Q2835025) (← links)
- Linear Search by a Pair of Distinct-Speed Robots (Q2835026) (← links)
- Deterministic Meeting of Sniffing Agents in the Plane (Q2835027) (← links)
- Distributed Evacuation in Graphs with Multiple Exits (Q2835028) (← links)
- Universal Systems of Oblivious Mobile Robots (Q2835029) (← links)
- Communication Problems for Mobile Agents Exchanging Energy (Q2835031) (← links)
- Asynchronous Broadcasting with Bivalent Beeps (Q2835032) (← links)
- Sparsifying Congested Cliques and Core-Periphery Networks (Q2835033) (← links)
- Approximating the Size of a Radio Network in Beeping Model (Q2835036) (← links)
- An Approximation Algorithm for Path Computation and Function Placement in SDNs (Q2835038) (← links)
- Transiently Consistent SDN Updates: Being Greedy is Hard (Q2835039) (← links)
- Distributed Community Detection in Dynamic Graphs (Q2868627) (← links)
- Exploration of the T-Interval-Connected Dynamic Graphs: The Case of the Ring (Q2868628) (← links)
- A Characterization of Dynamic Networks Where Consensus Is Solvable (Q2868629) (← links)
- Self-adjusting Grid Networks to Minimize Expected Path Length (Q2868630) (← links)
- On Advice Complexity of the k-server Problem under Sparse Metrics (Q2868631) (← links)
- Connected Surveillance Game (Q2868632) (← links)
- Non-Additive Two-Option Ski Rental (Q2868633) (← links)
- Competitive FIB Aggregation for Independent Prefixes: Online Ski Rental on the Trie (Q2868634) (← links)
- A Nonmonotone Analysis with the Primal-Dual Approach: Online Routing of Virtual Circuits with Unknown Durations (Q2868635) (← links)
- Self-organizing Flows in Social Networks (Q2868636) (← links)
- Performance/Security Tradeoffs for Content-Based Routing Supported by Bloom Filters (Q2868639) (← links)
- Influence Diffusion in Social Networks under Time Window Constraints (Q2868640) (← links)
- Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications (Q2868641) (← links)
- A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery (Q2868642) (← links)
- Maintaining Balanced Trees for Structured Distributed Streaming Systems (Q2868643) (← links)
- Rendezvous of Two Robots with Constant Memory (Q2868644) (← links)
- Pattern Formation by Mobile Robots with Limited Visibility (Q2868645) (← links)
- Optimal Gathering of Oblivious Robots in Anonymous Graphs (Q2868646) (← links)
- Probabilistic Connectivity Threshold for Directional Antenna Widths (Q2868647) (← links)
- Broadcasting in Ad Hoc Multiple Access Channels (Q2868648) (← links)
