The following pages link to Distributed Computing (Q251292):
Displaying 50 items.
- Special issue in memory of Berthold Vöcking (Q287980) (← links)
- Nearly optimal bounds for distributed wireless scheduling in the SINR model (Q287982) (← links)
- Simple and optimal randomized fault-tolerant rumor spreading (Q287985) (← links)
- Concurrent imitation dynamics in congestion games (Q287990) (← links)
- Tight bounds for parallel randomized load balancing (Q287991) (← links)
- Upper and lower bounds for deterministic broadcast in powerline communication networks (Q324622) (← links)
- Modelling and verifying the AODV routing protocol (Q324632) (← links)
- A simple population protocol for fast robust approximate majority (Q352239) (← links)
- The space complexity of unbounded timestamps (Q352241) (← links)
- Time efficient \(k\)-shot broadcasting in known topology radio networks (Q352244) (← links)
- Approximating Wardrop equilibria with finitely many agents (Q352247) (← links)
- Compact separator decompositions in dynamic trees and applications to labeling schemes (Q352249) (← links)
- A leader election algorithm for dynamic networks with causal clocks (Q360270) (← links)
- Distributed minimum dominating set approximations in restricted families of graphs (Q360271) (← links)
- Competitive throughput in multi-hop wireless networks despite adaptive jamming (Q360275) (← links)
- The topology of distributed adversaries (Q360277) (← links)
- Anonymous asynchronous systems: the case of failure detectors (Q360279) (← links)
- Consensus in the presence of mortal Byzantine faulty processes (Q424903) (← links)
- A time complexity lower bound for adaptive mutual exclusion (Q424906) (← links)
- Reconciling fault-tolerant distributed computing and systems-on-chip (Q424907) (← links)
- Knowledge, level of symmetry, and time of leader election (Q498667) (← links)
- A nearly optimal upper bound for the self-stabilization time in Herman's algorithm (Q498668) (← links)
- Localization for a system of colliding robots (Q498669) (← links)
- Fast and compact self-stabilizing verification, computation, and fault detection of an MST (Q498670) (← links)
- Determining majority in networks with local interactions and very small local memory (Q518677) (← links)
- A unified approach for gathering and exclusive searching on rings under weak assumptions (Q518678) (← links)
- A coded shared atomic memory algorithm for message passing architectures (Q518683) (← links)
- Randomized mutual exclusion on a multiple access channel (Q518923) (← links)
- Distributed algorithms for barrier coverage using relocatable sensors (Q518925) (← links)
- Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring (Q518926) (← links)
- The computability of relaxed data structures: queues and stacks as examples (Q518927) (← links)
- Special issue: DISC 2008. Selected papers based on the presentations at the 22nd international symposium on distributed computing, Arcachon, France, September 22--24, 2008 (Q656557) (← links)
- Special issue: PODC 2009. Selected papers based on the presentations at the 28th ACM symposium on the principles of distributed computing, Calgary, Canada, August 10--12, 2009 (Q656558) (← links)
- Special issue: DISC 2009. Selected papers based on the presentations at the 23rd international symposium on distributed computing, Elche, Spain, September 23--25, 2009 (Q656559) (← links)
- Incentive-compatible interdomain routing (Q658663) (← links)
- Distributed algorithms for QoS load balancing (Q658665) (← links)
- An optimal bit complexity randomized distributed MIS algorithm (Q658666) (← links)
- Verification of consensus algorithms using satisfiability solving (Q658669) (← links)
- Efficient online algorithm for identifying useless states in distributed systems (Q658673) (← links)
- Secure and highly-available aggregation queries in large-scale sensor networks via set sampling (Q658674) (← links)
- On the complexity of distributed stable matching with small messages (Q660987) (← links)
- On the power of synchronization between two adjacent processes (Q660989) (← links)
- A knowledge-based analysis of global function computation (Q660991) (← links)
- \textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networks (Q660994) (← links)
- A taxonomy of process calculi for distribution and mobility (Q660996) (← links)
- Closing the complexity gap between FCFS mutual exclusion and mutual exclusion (Q660999) (← links)
- The mailbox problem (Q661002) (← links)
- Threshold protocols in survivor set systems (Q661005) (← links)
- Randomized mutual exclusion with sub-logarithmic RMR-complexity (Q661045) (← links)
- Load balancing without regret in the bulletin board model (Q661046) (← links)
