Pages that link to "Item:Q5145170"
From MaRDI portal
The following pages link to Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (Q5145170):
Displaying 50 items.
- Local Computation Algorithms (Q5145171) (← links)
- Symmetry Breaking in the Plane (Q5145172) (← links)
- Composable Computation in Discrete Chemical Reaction Networks (Q5145173) (← links)
- How to Spread a Rumor (Q5145175) (← links)
- Efficient Size Estimation and Impossibility of Termination in Uniform Dense Population Protocols (Q5145176) (← links)
- On Counting the Population Size (Q5145177) (← links)
- Self-Stabilizing Leader Election (Q5145179) (← links)
- Logarithmic Expected-Time Leader Election in Population Protocol Model (Q5145180) (← links)
- On Site Fidelity and the Price of Ignorance in Swarm Robotic Central Place Foraging Algorithms (Q5145181) (← links)
- Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration (Q5145182) (← links)
- Fast Approximate Shortest Paths in the Congested Clique (Q5145183) (← links)
- Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model (Q5145184) (← links)
- Deterministic Distributed Dominating Set Approximation in the CONGEST Model (Q5145186) (← links)
- Optimal Distributed Covering Algorithms (Q5145187) (← links)
- Secure Distributed Computing Made (Nearly) Optimal (Q5145188) (← links)
- With Great Speed Come Small Buffers (Q5145189) (← links)
- Plain SINR is Enough! (Q5145190) (← links)
- Efficient Multiparty Interactive Coding for Insertions, Deletions, and Substitutions (Q5145191) (← links)
- Multiparty Interactive Communication with Private Channels (Q5145192) (← links)
- Coded State Machine -- Scaling State Machine Execution under Byzantine Faults (Q5145193) (← links)
- On Termination of a Flooding Process (Q5145194) (← links)
- Towards a Theory of Randomized Shared Memory Algorithms (Q5145195) (← links)
- Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion (Q5145196) (← links)
- Constant Amortized RMR Abortable Mutex for CC and DSM (Q5145197) (← links)
- A Recoverable Mutex Algorithm with Sub-logarithmic RMR on Both CC and DSM (Q5145198) (← links)
- Randomized Concurrent Set Union and Generalized Wake-Up (Q5145199) (← links)
- Strongly Linearizable Implementations of Snapshots and Other Types (Q5145201) (← links)
- Fast Concurrent Data Sketches (Q5145204) (← links)
- Self-Stabilizing Snapshot Objects for Asynchronous Failure-Prone Networked Systems (Q5145206) (← links)
- The Recoverable Consensus Hierarchy (Q5145207) (← links)
- How Fast Reads Affect Multi-Valued Register Simulations (Q5145209) (← links)
- Topological Characterization of Consensus under General Message Adversaries (Q5145210) (← links)
- Can Distributed Uniformity Testing Be Local? (Q5145212) (← links)
- Hardness of Distributed Optimization (Q5145214) (← links)
- Broadcast Congested Clique (Q5145215) (← links)
- Connectivity Lower Bounds in Broadcast Congested Clique (Q5145216) (← links)
- Does Preprocessing Help under Congestion? (Q5145217) (← links)
- The Distributed Complexity of Locally Checkable Problems on Paths is Decidable (Q5145218) (← links)
- Hardness of Exact Distance Queries in Sparse Graphs Through Hub Labeling (Q5145219) (← links)
- On the Complexity of Distributed Splitting Problems (Q5145221) (← links)
- On the Use of Randomness in Local Distributed Graph Algorithms (Q5145222) (← links)
- Message Reduction in the LOCAL Model is a Free Lunch (Q5145224) (← links)
- P-SLOCAL-Completeness of Maximum Independent Set Approximation (Q5145225) (← links)
- Engineering Distributed Systems that We Can Trust (and Also Run) (Q5145226) (← links)
- The Consensus Number of a Cryptocurrency (Q5145227) (← links)
- Communication Complexity of Byzantine Agreement, Revisited (Q5145228) (← links)
- Exact Byzantine Consensus on Undirected Graphs under Local Broadcast Model (Q5145230) (← links)
- Asymptotically Optimal Validated Asynchronous Byzantine Agreement (Q5145231) (← links)
- HotStuff (Q5145234) (← links)
- Fault Tolerant Gradient Clock Synchronization (Q5145235) (← links)
