The following pages link to Mika Göös (Q269490):
Displayed 26 items.
- Separating OR, SUM, and XOR circuits (Q269494) (← links)
- Search methods for tile sets in patterned DNA self-assembly (Q395021) (← links)
- Non-local probes do not help with many graph problems (Q1660935) (← links)
- Linear-in-\(\varDelta \) lower bounds in the LOCAL model (Q1689747) (← links)
- Randomized distributed decision (Q2256969) (← links)
- No sublogarithmic-time approximation scheme for bipartite vertex cover (Q2256970) (← links)
- Lower bounds for local approximation (Q2933794) (← links)
- Locally checkable proofs (Q2943393) (← links)
- Linear-in-delta lower bounds in the LOCAL model (Q2943612) (← links)
- Synthesizing Minimal Tile Sets for Patterned DNA Self-assembly (Q3070963) (← links)
- (Q3179347) (← links)
- Communication Lower Bounds via Critical Block Sensitivity (Q4554052) (← links)
- No Sublogarithmic-Time Approximation Scheme for Bipartite Vertex Cover (Q4909410) (← links)
- Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria (Q5020727) (← links)
- (Q5092469) (← links)
- (Q5121911) (← links)
- Automating cutting planes is NP-hard (Q5144898) (← links)
- What can be decided locally without identifiers? (Q5176091) (← links)
- Communication lower bounds via critical block sensitivity (Q5259621) (← links)
- (Q5368739) (← links)
- (Q5875515) (← links)
- (Q6062152) (← links)
- (Q6115357) (← links)
- (Q6115373) (← links)
- (Q6126307) (← links)
- Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria (Q6139831) (← links)