Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #101 to #150.

Adapting to Point Contention with Long-Lived Safe Agreement: Label: en
Distance-k Information in Self-stabilizing Algorithms: Label: en
Self-stabilizing Space Optimal Synchronization Algorithms on Trees: Label: en
Approximate Top-k Queries in Sensor Networks: Label: en
Dynamic Asymmetric Communication: Label: en
On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem: Label: en
Combinatorial Algorithms for Compressed Sensing: Label: en
L(h,1,1)-Labeling of Outerplanar Graphs: Label: en
Average-Time Complexity of Gossiping in Radio Networks: Label: en
3-D Minimum Energy Broadcasting: Label: en
Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks: Label: en
Discovering Network Topology in the Presence of Byzantine Faults: Label: en
On Fractional Dynamic Faults with Threshold: Label: en
Strongly Terminating Early-Stopping k-Set Agreement in Synchronous Systems with General Omission Failures: Label: en
An Optimal Rebuilding Strategy for a Decremental Tree Problem: Label: en
Short Labels by Traversal and Jumping: Label: en
Approximation Strategies for Routing Edge Disjoint Paths in Complete Graphs: Label: en
Efficient Distributed Weighted Matchings on Trees: Label: en
Fast Algorithms for min independent dominating set: Label: en
A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs: Label: en
Strong Orientations of Planar Graphs with Bounded Stretch Factor: Label: en
Multipath Spanners: Label: en
Maximum Interference of Random Sensors on a Line: Label: en
Optimal Deterministic Ring Exploration with Oblivious Asynchronous Robots: Label: en
A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots: Label: en
Periodic Data Retrieval Problem in Rings Containing a Malicious Host: Label: en
Distributed Tree Comparison with Nodes of Limited Memory: Label: en
Algorithms for Extracting Timeliness Graphs: Label: en
Average Long-Lived Memoryless Consensus: The Three-Value Case: Label: en
Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings: Label: en
Space-Optimal Rendezvous of Mobile Agents in Asynchronous Trees: Label: en
Asynchronous Deterministic Rendezvous in Bounded Terrains: Label: en
Event Extent Estimation: Label: en
Traffic Grooming in Star Networks via Matching Techniques: Label: en
Distributed Weighted Stable Marriage Problem: Label: en
Towards Network Games with Social Preferences: Label: en
On the Impact of Local Taxes in a Set Cover Game: Label: en
Fast Radio Broadcasting with Advice: Label: en
Centralized Communication in Radio Networks with Strong Interference: Label: en
Gathering with Minimum Delay in Tree Sensor Networks: Label: en
Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs: Label: en
Self-stabilizing Cuts in Synchronous Networks: Label: en
On the Performance of Beauquier and Debas’ Self-stabilizing Algorithm for Mutual Exclusion: Label: en
Computing Approximate Nash Equilibria in Network Congestion Games: Label: en
Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games: Label: en
Word of Mouth: Rumor Dissemination in Social Networks: Label: en
Best Effort and Priority Queuing Policies for Buffered Crossbar Switches: Label: en
On the Power of Local Orientations: Label: en
Equal-Area Locus-Based Convex Polygon Decomposition: Label: en
Recovering the Long-Range Links in Augmented Graphs: Label: en