The following pages link to Jukka Suomela (Q642984):
Displaying 50 items.
- Analysing local algorithms in location-aware quasi-unit-disk graphs (Q642985) (← links)
- Local approximability of max-min and min-max linear programs (Q693753) (← links)
- The minimum backlog problem (Q888427) (← links)
- Synchronous counting and computational algorithm design (Q896024) (← links)
- Deterministic local algorithms, unique identifiers, and fractional graph colouring (Q896700) (← links)
- A simple local 3-approximation algorithm for vertex cover (Q987844) (← links)
- Node labels in local decision (Q1625609) (← links)
- Non-local probes do not help with many graph problems (Q1660935) (← links)
- Locally optimal load balancing (Q1664164) (← links)
- Linear-in-\(\varDelta \) lower bounds in the LOCAL model (Q1689747) (← links)
- Almost stable matchings by truncating the Gale-Shapley algorithm (Q1959728) (← links)
- Almost global problems in the LOCAL model (Q1981631) (← links)
- Algebraic methods in the congested clique (Q2010605) (← links)
- Local mending (Q2097329) (← links)
- Distributed graph problems through an automata-theoretic Lens (Q2117706) (← links)
- Improved distributed degree splitting and edge coloring (Q2189174) (← links)
- No sublogarithmic-time approximation scheme for bipartite vertex cover (Q2256970) (← links)
- Locality of not-so-weak coloring (Q2303281) (← links)
- Approximability of identifying codes and locating-dominating codes (Q2379937) (← links)
- Large cuts with local algorithms on triangle-free graphs (Q2411507) (← links)
- Distributed graph problems through an automata-theoretic lens (Q2689441) (← links)
- Towards Optimal Synchronous Counting (Q2796281) (← links)
- Survey of local algorithms (Q2875112) (← links)
- Deterministic Local Algorithms, Unique Identifiers, and Fractional Graph Colouring (Q2913210) (← links)
- Distributed maximal matching (Q2933793) (← links)
- Lower bounds for local approximation (Q2933794) (← links)
- Locally checkable proofs (Q2943393) (← links)
- Linear-in-delta lower bounds in the LOCAL model (Q2943612) (← links)
- (Q3179347) (← links)
- Constant space and non-constant time in distributed computing (Q3300833) (← links)
- Exact Bounds for Distributed Graph Colouring (Q3460706) (← links)
- Improved Approximation Algorithms for Relay Placement (Q3541099) (← links)
- A Local 2-Approximation Algorithm for the Vertex Cover Problem (Q3646226) (← links)
- No Sublogarithmic-Time Approximation Scheme for Bipartite Vertex Cover (Q4909410) (← links)
- (Q4967178) (← links)
- Lower Bounds for Maximal Matchings and Maximal Independent Sets (Q5056427) (← links)
- Almost global problems in the LOCAL model (Q5090898) (← links)
- Distributed Recoloring (Q5090902) (← links)
- The Distributed Complexity of Locally Checkable Problems on Paths is Decidable (Q5145218) (← links)
- Hardness of Minimal Symmetry Breaking in Distributed Computing (Q5145237) (← links)
- What can be decided locally without identifiers? (Q5176091) (← links)
- Distributed algorithms for edge dominating sets (Q5176213) (← links)
- Planar Subgraphs without Low-Degree Nodes (Q5199275) (← links)
- New classes of distributed time complexity (Q5230383) (← links)
- Efficient Counting with Optimal Resilience (Q5359491) (← links)
- A lower bound for the distributed Lovász local lemma (Q5361853) (← links)
- LCL Problems on Grids (Q5368949) (← links)
- Randomized algorithms for finding a majority element (Q5369511) (← links)
- Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems (Q5855211) (← links)
- How much does randomness help with locally checkable problems? (Q5855249) (← links)
