Pages that link to "Item:Q5177259"

The following pages link to On the complexity of distributed graph coloring (Q5177259):

Displaying 36 items.

• Randomised distributed MIS and colouring algorithms for rings with oriented edges in \(O(\sqrt{\log n})\) bit rounds (Q342718) (← links)
• On the time and the bit complexity of distributed randomised anonymous ring colouring (Q391396) (← links)
• Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings (Q391647) (← links)
• Symmetry breaking depending on the chromatic number or the neighborhood growth (Q392191) (← links)
• Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring (Q518926) (← links)
• An optimal bit complexity randomized distributed MIS algorithm (Q658666) (← links)
• About randomised distributed graph colouring and graph partition algorithms (Q710742) (← links)
• Complexity analysis of a decentralised graph colouring algorithm (Q963399) (← links)
• Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition (Q992509) (← links)
• Design patterns in beeping algorithms: examples, emulation, and analysis (Q1633808) (← links)
• Linear-in-\(\varDelta \) lower bounds in the LOCAL model (Q1689747) (← links)
• Computing large independent sets in a single round (Q1699422) (← links)
• Linial for lists (Q2104037) (← links)
• What can be sampled locally? (Q2189170) (← links)
• Combinatorial algorithms for distributed graph coloring (Q2251151) (← links)
• Distributed computing with advice: information sensitivity of graph coloring (Q2377267) (← links)
• Can we locally compute sparse connected subgraphs? (Q2399362) (← links)
• Large cuts with local algorithms on triangle-free graphs (Q2411507) (← links)
• A weakly robust PTAS for minimum clique partition in unit disk graphs (Q2428685) (← links)
• Locality and checkability in wait-free computing (Q2441537) (← links)
• Toward more localized local algorithms: removing assumptions concerning global knowledge (Q2441787) (← links)
• On the complexity of distributed graph coloring with local minimality constraints (Q3057099) (← links)
• Trading Bit, Message, and Time Complexity of Distributed Algorithms (Q3095315) (← links)
• Combinatorial Algorithms for Distributed Graph Coloring (Q3095316) (← links)
• Locality and Checkability in Wait-Free Computing (Q3095336) (← links)
• An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract) (Q3408183) (← links)
• Exact Bounds for Distributed Graph Colouring (Q3460706) (← links)
• A Time Hierarchy Theorem for the LOCAL Model (Q4646447) (← links)
• (Q5075750) (← links)
• (Q5090894) (← links)
• Distributed $(\Delta+1)$-Coloring via Ultrafast Graph Shattering (Q5112251) (← links)
• Distributed Graph Algorithms and their Complexity: An Introduction (Q5135263) (← links)
• (Q5743464) (← links)
• Weak models of distributed computing, with connections to modal logic (Q5918244) (← links)
• Distributed algorithms for the Lovász local lemma and graph coloring (Q5920074) (← links)
• A distributed low tree-depth decomposition algorithm for bounded expansion classes (Q5964897) (← links)