Skip to content

Mika Gs

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

33

Venues

6

Active years

2010–2026

Best venue rank

A*

Where they publish

Papers

33 indexed papers, newest first.

YearVenueTitleAuthors
2026STOCSampling Permutations with Cell Probes Is Hard.Yaroslav Alekseev, Mika Gs, Konstantin Myasnikov, Artur Riazanov, Dmitry Sokolov
2026STOCMonotone Circuit Complexity of Matching.Bruno Cavalar, Mika Gs, Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov
2026STOCPseudodeterministic Communication Complexity.Mika Gs, Nathaniel Harms, Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov, Weiqiang Yuan
2025FOCSSign-Rank of k-Hamming Distance is Constant.Mika Gs, Nathaniel Harms, Valentin Imbach, Dmitry Sokolov
2025STOCConstant-Cost Communication Is Not Reducible to k-Hamming Distance.Yuting Fang, Mika Gs, Nathaniel Harms, Pooya Hatami
2025STOCQuantum Communication Advantage in TFNP.Mika Gs, Tom Gur, Siddhartha Jain, Jiawei Li
2025STOCSupercritical Tradeoffs for Monotone Circuits.Mika Gs, Gilbert Maystre, Kilian Risse, Dmitry Sokolov
2024STOCHardness Condensation by Restriction.Mika Gs, Ilan Newman, Artur Riazanov, Dmitry Sokolov
2023FOCSTop-Down Lower Bounds for Depth-Four Circuits.Mika Gs, Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov
2023MFCSDepth-3 Circuits for Inner Product.Mika Gs, Ziyi Guan, Tiberiu Mosnoi
2022FOCSRandomised Composition and Small-Bias Minimax.Shalev Ben-David, Eric Blais, Mika Gs, Gilbert Maystre
2022FOCSSeparations in Proof Complexity and TFNP.Mika Gs, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao
2022ICALPLower Bounds for Unambiguous Automata via Communication Complexity.Mika Gs, Stefan Kiefer, Weiqiang Yuan
2021FOCSUnambiguous DNFs and Alon-Saks-Seymour.Kaspars Balodis, Shalev Ben-David, Mika Gs, Siddhartha Jain, Robin Kothari
2021STOCAutomating algebraic proof systems is NP-hard.Susanna F. de Rezende, Mika Gs, Jakob Nordstrm, Toniann Pitassi, Robert Robere, Dmitry Sokolov
2020ICALPThe Power of Many Samples in Query Complexity.Andrew Bassilakis, Andrew Drucker, Mika Gs, Lunjia Hu, Weiyun Ma, Li-Yang Tan
2020STOCAutomating cutting planes is NP-hard.Mika Gs, Sajin Koroth, Ian Mertz, Toniann Pitassi
2018FOCSNear-Optimal Communication Lower Bounds for Approximate Nash Equilibria.Mika Gs, Aviad Rubinstein
2018STOCMonotone circuit lower bounds from resolution.Ankit Garg, Mika Gs, Pritish Kamath, Dmitry Sokolov
2017FOCSQuery-to-Communication Lifting for BPP.Mika Gs, Toniann Pitassi, Thomas Watson
2017ICALPRandomized Communication vs. Partition Number.Mika Gs, T. S. Jayram, Toniann Pitassi, Thomas Watson
2016FOCSSeparations in Communication Complexity Using Cheat Sheets and Information Complexity.Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Gs, Rahul Jain, Robin Kothari, Troy Lee, Miklos Santha
2016FOCSExtension Complexity of Independent Set Polytopes.Mika Gs, Rahul Jain, Thomas Watson
2016ICALPThe Landscape of Communication Complexity Classes.Mika Gs, Toniann Pitassi, Thomas Watson
2015FOCSLower Bounds for Clique vs. Independent Set.Mika Gs
2015FOCSDeterministic Communication vs. Partition Number.Mika Gs, Toniann Pitassi, Thomas Watson
2015STOCRectangles Are Nonnegative Juntas.Mika Gs, Shachar Lovett, Raghu Meka, Thomas Watson, David Zuckerman
2014PODCLinear-in-delta lower bounds in the LOCAL model.Mika Gs, Juho Hirvonen, Jukka Suomela
2014STOCCommunication lower bounds via critical block sensitivity.Mika Gs, Toniann Pitassi
2013PODCWhat can be decided locally without identifiers?Pierre Fraigniaud, Mika Gs, Amos Korman, Jukka Suomela
2012PODCLower bounds for local approximation.Mika Gs, Juho Hirvonen, Jukka Suomela
2011PODCLocally checkable proofs.Mika Gs, Jukka Suomela
2010DNASynthesizing Minimal Tile Sets for Patterned DNA Self-assembly.Mika Gs, Pekka Orponen