pith. machine review for the scientific record. sign in

Mika G\"o\"os

Identifiers

  • name variant Mika G\"o\"os 0.60 · backfill

Papers (14)

  1. No Constant-Cost Protocol for Point--Line Incidence cs.CC · 2026 · author #1
  2. Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria cs.CC · 2018 · author #1
  3. String Matching: Communication, Circuits, and Learning cs.CC · 2017 · author #2
  4. Query-to-Communication Lifting for BPP cs.CC · 2017 · author #1
  5. Separations in communication complexity using cheat sheets and information complexity quant-ph · 2016 · author #4
  6. Extension Complexity of Independent Set Polytopes cs.CC · 2016 · author #1
  7. Non-Local Probes Do Not Help with Graph Problems cs.DS · 2015 · author #1
  8. Search Methods for Tile Sets in Patterned DNA Self-Assembly cs.ET · 2014 · author #1
  9. Communication Lower Bounds via Critical Block Sensitivity cs.CC · 2013 · author #1
  10. Separating OR, SUM, and XOR Circuits cs.CC · 2013 · author #2
  11. What can be decided locally without identifiers? cs.DC · 2013 · author #2
  12. No Sublogarithmic-time Approximation Scheme for Bipartite Vertex Cover cs.DC · 2012 · author #1
  13. Lower Bounds for Local Approximation cs.DC · 2012 · author #1
  14. Synthesizing Minimal Tile Sets for Patterned DNA Self-Assembly cs.DS · 2009 · author #1

Mentions

  • 0911.2924 #1 · backfill · confidence 0.70 Mika G\"o\"os

Frequent Coauthors