Entity usage
From MaRDI portal
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 #1 to #50.
- Divide \& Scale: formalization and roadmap to robust sharding: Label: en
- \textsc{FnF-BFT}: a BFT protocol with provable performance under attack: Label: en
- Self-adjusting linear networks with ladder demand graph: Label: en
- Lockless blockchain sharding with multiversion control: Label: en
- Distributed coloring of hypergraphs: Label: en
- Learning hierarchically-structured concepts. II: Overlapping concepts, and networks with feedback: Label: en
- About informatics, distributed computing, and our job: a personal view: Label: en
- Thirty years of SIROCCO a data and graph mining comparative analysis of its temporal evolution: Label: en
- Degree realization by bipartite multigraphs: Label: en
- Weighted packet selection for rechargeable links in cryptocurrency networks: complexity and approximation: Label: en
- Exact distributed sampling: Label: en
- Packet forwarding with swaps: Label: en
- Overcoming probabilistic faults in disoriented linear search: Label: en
- Spanning trees with few branch vertices in graphs of bounded neighborhood diversity: Label: en
- Energy-efficient distributed algorithms for synchronous networks: Label: en
- On the power of threshold-based algorithms for detecting cycles in the CONGEST model: Label: en
- The communication complexity of functions with large outputs: Label: en
- Minimum cost flow in the CONGEST model: Label: en
- Cops \& robber on periodic temporal graphs: characterization and improved bounds: Label: en
- Boundary sketching with asymptotically optimal distance and rotation: Label: en
- Distributed half-integral matching and beyond: Label: en
- Search and rescue on the line: Label: en
- The energy complexity of diameter and minimum cut computation in bounded-genus networks: Label: en
- Zero-memory graph exploration with unknown inports: Label: en
- Compatibility of convergence algorithms for autonomous mobile robots (extended abstract): Label: en
- Lessons from the Congested Clique Applied to MapReduce: Label: en
- Randomized Lower Bound for Distributed Spanning-Tree Verification: Label: en
- Distributed Approximation of Minimum Routing Cost Trees: Label: en
- Secluded Path via Shortest Path: Label: en
- Approximation of the Degree-Constrained Minimum Spanning Hierarchies: Label: en
- The Simultaneous Number-in-Hand Communication Model for Networks: Private Coins, Public Coins and Determinism: Label: en
- The Complexity Gap between Consensus and Safe-Consensus: Label: en
- Distributed Transactional Contention Management as the Traveling Salesman Problem: Label: en
- Reliable Shared Memory Abstraction on Top of Asynchronous Byzantine Message-Passing Systems: Label: en
- The Beachcombers’ Problem: Walking and Searching with Mobile Robots: Label: en
- Improved Periodic Data Retrieval in Asynchronous Rings with a Faulty Host: Label: en
- A Recursive Approach to Multi-robot Exploration of Trees: Label: en
- Move-Optimal Partial Gathering of Mobile Agents in Asynchronous Trees: Label: en
- Rendezvous of Heterogeneous Mobile Agents in Edge-Weighted Networks: Label: en
- Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs: Label: en
- What Do We Need to Know to Elect in Networks with Unknown Participants?: Label: en
- How Many Ants Does It Take to Find the Food?: Label: en
- Exploration of Constantly Connected Dynamic Graphs Based on Cactuses: Label: en
- Distributed Barrier Coverage with Relocatable Sensors: Label: en
- Patrolling by Robots Equipped with Visibility: Label: en
- Network Creation Games with Traceroute-Based Strategies: Label: en
- Continuous Aggregation in Dynamic Ad-Hoc Networks: Label: en
- Local Broadcasting with Arbitrary Transmission Power in the SINR Model: Label: en
- Oblivious Rendezvous in Cognitive Radio Networks: Label: en
- Upper Bounds and Algorithms for Parallel Knock-Out Numbers: Label: en