Mika Göös - RankMe

153 papers A* 28A 17B 2Journal 101Unranked 4

Year	Rank	Type	Title / Venue / Authors
2025	A*	`conf`	Constant-Cost Communication Is Not Reducible to k-Hamming Distance. STOC Yuting Fang, Mika Göös, Nathaniel Harms, Pooya Hatami
2025	A	`conf`	Direct Sums for Parity Decision Trees. CCC Tyler Besselman, Mika Göös, Siyao Guo, Gilbert Maystre, Weiqiang Yuan
2025	A	`conf`	Equality Is Far Weaker Than Constant-Cost Communication. APPROX/RANDOM Mika Göös, Nathaniel Harms, Artur Riazanov
2025	J	`jnl`	Equality is Far Weaker Than Constant-Cost Communication. Electron. Colloquium Comput. Complex. Mika Göös, Nathaniel Harms, Artur Riazanov
2025	J	`jnl`	Equality is Far Weaker than Constant-Cost Communication. CoRR Mika Göös, Nathaniel Harms, Artur Riazanov
2025	A	`conf`	Generalised Linial-Nisan Conjecture Is False for DNFs. CCC Yaroslav Alekseev, Mika Göös, Ziyi Guan, Gilbert Maystre, Artur Riazanov, Dmitry Sokolov, Weiqiang Yuan
2025	J	`jnl`	Generalised Linial-Nisan Conjecture is False for DNFs. Electron. Colloquium Comput. Complex. Yaroslav Alekseev, Mika Göös, Ziyi Guan, Gilbert Maystre, Artur Riazanov, Dmitry Sokolov, Weiqiang Yuan
2025	J	`jnl`	Monotone Circuit Complexity of Matching. CoRR Bruno Cavalar, Mika Göös, Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov
2025	J	`jnl`	Monotone Circuit Complexity of Matching. Electron. Colloquium Comput. Complex. Bruno Pasqualotto Cavalar, Mika Göös, Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov
2025	J	`jnl`	Pseudodeterministic Communication Complexity. CoRR Mika Göös, Nathaniel Harms, Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov, Weiqiang Yuan
2025	J	`jnl`	Pseudodeterministic Communication Complexity. Electron. Colloquium Comput. Complex. Mika Göös, Nathaniel Harms, Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov, Weiqiang Yuan
2025	A*	`conf`	Quantum Communication Advantage in TFNP. STOC Mika Göös, Tom Gur, Siddhartha Jain, Jiawei Li
2025	J	`jnl`	Sampling Permutations with Cell Probes is Hard. CoRR Yaroslav Alekseev, Mika Göös, Konstantin Myasnikov, Artur Riazanov, Dmitry Sokolov
2025	J	`jnl`	Sampling Permutations with Cell Probes is Hard. Electron. Colloquium Comput. Complex. Yaroslav Alekseev, Mika Göös, Konstantin Myasnikov, Artur Riazanov, Dmitry Sokolov
2025	J	`jnl`	Sign-Rank of CoRR Mika Göös, Nathaniel Harms, Valentin Imbach, Dmitry Sokolov
2025	J	`jnl`	Sign-Rank of $k$-Hamming Distance is Constant. Electron. Colloquium Comput. Complex. Mika Göös, Nathaniel Harms, Valentin Imbach, Dmitry Sokolov
2025	A*	`conf`	Sign-Rank of k-Hamming Distance is Constant. FOCS Mika Göös, Nathaniel Harms, Valentin Imbach, Dmitry Sokolov
2025	A*	`conf`	Supercritical Tradeoffs for Monotone Circuits. STOC Mika Göös, Gilbert Maystre, Kilian Risse, Dmitry Sokolov
2024	J	`jnl`	Constant-Cost Communication is not Reducible to k-Hamming Distance. CoRR Yuting Fang, Mika Göös, Nathaniel Harms, Pooya Hatami
2024	J	`jnl`	Depth-3 circuits for inner product. Inf. Comput. Mika Göös, Ziyi Guan, Tiberiu Mosnoi
2024	J	`jnl`	Direct Sums for Parity Decision Trees. CoRR Tyler Besselman, Mika Göös, Siyao Guo, Gilbert Maystre, Weiqiang Yuan
2024	J	`jnl`	Direct Sums for Parity Decision Trees. Electron. Colloquium Comput. Complex. Tyler Besselman, Mika Göös, Siyao Guo, Gilbert Maystre, Weiqiang Yuan
2024	J	`jnl`	Further Collapses in $\boldsymbol{\mathsf{TFNP}}$. SIAM J. Comput. Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao
2024	A*	`conf`	Hardness Condensation by Restriction. STOC Mika Göös, Ilan Newman, Artur Riazanov, Dmitry Sokolov
2024	A	`conf`	One-Way Functions vs. TFNP: Simpler and Improved. ITCS Lukás Folwarczný, Mika Göös, Pavel Hubácek, Gilbert Maystre, Weiqiang Yuan
2024	J	`jnl`	Quantum Communication Advantage in TFNP. CoRR Mika Göös, Tom Gur, Siddhartha Jain, Jiawei Li
2024	J	`jnl`	Quantum Communication Advantage in TFNP. Electron. Colloquium Comput. Complex. Mika Göös, Tom Gur, Siddhartha Jain, Jiawei Li
2024	J	`jnl`	Separations in Proof Complexity and TFNP. J. ACM Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao
2024	J	`jnl`	Supercritical Tradeoffs for Monotone Circuits. CoRR Mika Göös, Gilbert Maystre, Kilian Risse, Dmitry Sokolov
2024	J	`jnl`	Supercritical Tradeoffs for Monotone Circuits. Electron. Colloquium Comput. Complex. Mika Göös, Gilbert Maystre, Kilian Risse, Dmitry Sokolov
2023	B	`conf`	Depth-3 Circuits for Inner Product. MFCS Mika Göös, Ziyi Guan, Tiberiu Mosnoi
2023	J	`jnl`	Depth-3 Circuits for Inner Product. Electron. Colloquium Comput. Complex. Mika Göös, Ziyi Guan, Tiberiu Mosnoi
2023	J	`jnl`	Hardness Condensation by Restriction. Electron. Colloquium Comput. Complex. Mika Göös, Ilan Newman, Artur Riazanov, Dmitry Sokolov
2023	J	`jnl`	Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria. SIAM J. Comput. Mika Göös, Aviad Rubinstein
2023	J	`jnl`	One-Way Functions vs. TFNP: Simpler and Improved. IACR Cryptol. ePrint Arch. Lukás Folwarczný, Mika Göös, Pavel Hubácek, Gilbert Maystre, Weiqiang Yuan
2023	A*	`conf`	Top-Down Lower Bounds for Depth-Four Circuits. FOCS Mika Göös, Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov
2023	J	`jnl`	Top-Down Lower Bounds for Depth-Four Circuits. CoRR Mika Göös, Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov
2023	J	`jnl`	Top-Down Lower Bounds for Depth-Four Circuits. Electron. Colloquium Comput. Complex. Mika Göös, Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov
2022	A	`conf`	Communication Complexity of Collision. APPROX/RANDOM Mika Göös, Siddhartha Jain
2022	J	`jnl`	Communication Complexity of Collision. CoRR Mika Göös, Siddhartha Jain
2022	J	`jnl`	Communication Complexity of Collision. Electron. Colloquium Comput. Complex. Mika Göös, Siddhartha Jain
2022	A	`conf`	Further Collapses in TFNP. CCC Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao
2022	J	`jnl`	Further Collapses in TFNP. CoRR Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao
2022	J	`jnl`	Further Collapses in TFNP. Electron. Colloquium Comput. Complex. Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao
2022	J	`jnl`	Guest Column: Proofs, Circuits, and Communication. SIGACT News Susanna F. de Rezende, Mika Göös, Robert Robere
2022	A*	`conf`	Lower Bounds for Unambiguous Automata via Communication Complexity. ICALP Mika Göös, Stefan Kiefer, Weiqiang Yuan
2022	J	`jnl`	Lower Bounds for Unambiguous Automata via Communication Complexity. Electron. Colloquium Comput. Complex. Mika Göös, Stefan Kiefer, Weiqiang Yuan
2022	A	`conf`	On Semi-Algebraic Proofs and Algorithms. ITCS Noah Fleming, Mika Göös, Stefan Grosser, Robert Robere
2022	J	`jnl`	On Semi-Algebraic Proofs and Algorithms. Electron. Colloquium Comput. Complex. Noah Fleming, Stefan Grosser, Mika Göös, Robert Robere
2022	J	`jnl`	Proofs, Circuits, and Communication. CoRR Susanna F. de Rezende, Mika Göös, Robert Robere
2022	A*	`conf`	Randomised Composition and Small-Bias Minimax. FOCS Shalev Ben-David, Eric Blais, Mika Göös, Gilbert Maystre
2022	J	`jnl`	Randomised Composition and Small-Bias Minimax. CoRR Shalev Ben-David, Eric Blais, Mika Göös, Gilbert Maystre
2022	J	`jnl`	Randomised Composition and Small-Bias Minimax. Electron. Colloquium Comput. Complex. Shalev Ben-David, Eric Blais, Mika Göös, Gilbert Maystre
2022	A*	`conf`	Separations in Proof Complexity and TFNP. FOCS Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao
2022	J	`jnl`	Separations in Proof Complexity and TFNP. CoRR Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao
2022	J	`jnl`	Separations in Proof Complexity and TFNP. Electron. Colloquium Comput. Complex. Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao
2021	A	`conf`	A Majority Lemma for Randomised Query Complexity. CCC Mika Göös, Gilbert Maystre
2021	J	`jnl`	A Majority Lemma for Randomised Query Complexity. Electron. Colloquium Comput. Complex. Mika Göös, Gilbert Maystre
2021	A*	`conf`	Automating algebraic proof systems is NP-hard. STOC Susanna F. de Rezende, Mika Göös, Jakob Nordström, Toniann Pitassi, Robert Robere, Dmitry Sokolov
2021	J	`jnl`	Lower Bounds on Unambiguous Automata Complementation and Separation via Communication Complexity. CoRR Mika Göös, Stefan Kiefer
2021	A	`conf`	On the Power and Limitations of Branch and Cut. CCC Noah Fleming, Mika Göös, Russell Impagliazzo, Toniann Pitassi, Robert Robere, Li-Yang Tan, Avi Wigderson
2021	J	`jnl`	On the Power and Limitations of Branch and Cut. CoRR Noah Fleming, Mika Göös, Russell Impagliazzo, Toniann Pitassi, Robert Robere, Li-Yang Tan, Avi Wigderson
2021	J	`jnl`	On the Power and Limitations of Branch and Cut. Electron. Colloquium Comput. Complex. Noah Fleming, Mika Göös, Russell Impagliazzo, Toniann Pitassi, Robert Robere, Li-Yang Tan, Avi Wigderson
2021	A*	`conf`	Unambiguous DNFs and Alon-Saks-Seymour. FOCS Kaspars Balodis, Shalev Ben-David, Mika Göös, Siddhartha Jain, Robin Kothari
2021	J	`jnl`	Unambiguous DNFs from Hex. CoRR Shalev Ben-David, Mika Göös, Siddhartha Jain, Robin Kothari
2021	J	`jnl`	Unambiguous DNFs from Hex. Electron. Colloquium Comput. Complex. Shalev Ben-David, Mika Göös, Siddhartha Jain, Robin Kothari
2020	J	`jnl`	A Lower Bound for Sampling Disjoint Sets. ACM Trans. Comput. Theory Mika Göös, Thomas Watson
2020	J	`jnl`	Automating Algebraic Proof Systems is NP-Hard. Electron. Colloquium Comput. Complex. Mika Göös, Jakob Nordström, Toniann Pitassi, Robert Robere, Dmitry Sokolov, Susanna F. de Rezende
2020	J	`jnl`	Automating Cutting Planes is NP-Hard. Electron. Colloquium Comput. Complex. Mika Göös, Sajin Koroth, Ian Mertz, Toniann Pitassi
2020	J	`jnl`	Automating Cutting Planes is NP-Hard}. CoRR Mika Göös, Sajin Koroth, Ian Mertz, Toniann Pitassi
2020	A*	`conf`	Automating cutting planes is NP-hard. STOC Mika Göös, Sajin Koroth, Ian Mertz, Toniann Pitassi
2020	J	`jnl`	Monotone Circuit Lower Bounds from Resolution. Theory Comput. Ankit Garg, Mika Göös, Pritish Kamath, Dmitry Sokolov
2020	A	`conf`	On the Complexity of Modulo-q Arguments and the Chevalley - Warning Theorem. CCC Mika Göös, Pritish Kamath, Katerina Sotiraki, Manolis Zampetakis
2020	J	`jnl`	Query-to-Communication Lifting for BPP. SIAM J. Comput. Mika Göös, Toniann Pitassi, Thomas Watson
2020	A*	`conf`	The Power of Many Samples in Query Complexity. ICALP Andrew Bassilakis, Andrew Drucker, Mika Göös, Lunjia Hu, Weiyun Ma, Li-Yang Tan
2020	J	`jnl`	The Power of Many Samples in Query Complexity. CoRR Andrew Bassilakis, Andrew Drucker, Mika Göös, Lunjia Hu, Weiyun Ma, Li-Yang Tan
2020	J	`jnl`	The Power of Many Samples in Query Complexity. Electron. Colloquium Comput. Complex. Andrew Bassilakis, Andrew Drucker, Mika Göös, Lunjia Hu, Weiyun Ma, Li-Yang Tan
2020	—	`conf`	When Is Amplification Necessary for Composition in Randomized Query Complexity? APPROX-RANDOM Shalev Ben-David, Mika Göös, Robin Kothari, Thomas Watson
2020	J	`jnl`	When Is Amplification Necessary for Composition in Randomized Query Complexity? CoRR Shalev Ben-David, Mika Göös, Robin Kothari, Thomas Watson
2019	—	`conf`	A Lower Bound for Sampling Disjoint Sets. APPROX-RANDOM Mika Göös, Thomas Watson
2019	A	`conf`	Adventures in Monotone Complexity and TFNP. ITCS Mika Göös, Pritish Kamath, Robert Robere, Dmitry Sokolov
2019	J	`jnl`	Correction to: Query-to-Communication Lifting for P NP. Comput. Complex. Mika Göös, Pritish Kamath, Toniann Pitassi, Thomas Watson
2019	J	`jnl`	On the Complexity of Modulo-q Arguments and the Chevalley-Warning Theorem. CoRR Mika Göös, Pritish Kamath, Katerina Sotiraki, Manolis Zampetakis
2019	J	`jnl`	Query-to-Communication Lifting for P NP. Comput. Complex. Mika Göös, Pritish Kamath, Toniann Pitassi, Thomas Watson
2019	—	`conf`	String Matching: Communication, Circuits, and Learning. APPROX-RANDOM Alexander Golovnev, Mika Göös, Daniel Reichman, Igor Shinkar
2018	A	`conf`	A Tight Lower Bound for Entropy Flattening. CCC Yi-Hsiu Chen, Mika Göös, Salil P. Vadhan, Jiapeng Zhang
2018	J	`jnl`	A Tight Lower Bound for Entropy Flattening. Electron. Colloquium Comput. Complex. Yi-Hsiu Chen, Mika Göös, Salil P. Vadhan, Jiapeng Zhang
2018	J	`jnl`	Adventures in Monotone Complexity and TFNP. Electron. Colloquium Comput. Complex. Mika Göös, Pritish Kamath, Robert Robere, Dmitry Sokolov
2018	J	`jnl`	Communication Lower Bounds via Critical Block Sensitivity. SIAM J. Comput. Mika Göös, Toniann Pitassi
2018	J	`jnl`	Deterministic Communication vs. Partition Number. SIAM J. Comput. Mika Göös, Toniann Pitassi, Thomas Watson
2018	J	`jnl`	Extension Complexity of Independent Set Polytopes. SIAM J. Comput. Mika Göös, Rahul Jain, Thomas Watson
2018	A*	`conf`	Monotone circuit lower bounds from resolution. STOC Ankit Garg, Mika Göös, Pritish Kamath, Dmitry Sokolov
2018	A*	`conf`	Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria. FOCS Mika Göös, Aviad Rubinstein
2018	J	`jnl`	Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria. CoRR Mika Göös, Aviad Rubinstein
2018	J	`jnl`	Randomized Communication versus Partition Number. ACM Trans. Comput. Theory Mika Göös, T. S. Jayram, Toniann Pitassi, Thomas Watson
2018	J	`jnl`	The Landscape of Communication Complexity Classes. Comput. Complex. Mika Göös, Toniann Pitassi, Thomas Watson
2017	—	`—`	Communication Lower Bounds via Query Complexity. Mika Göös
2017	J	`jnl`	Linear-in-Δ lower bounds in the LOCAL model. Distributed Comput. Mika Göös, Juho Hirvonen, Jukka Suomela
2017	J	`jnl`	Monotone Circuit Lower Bounds from Resolution. Electron. Colloquium Comput. Complex. Ankit Garg, Mika Göös, Pritish Kamath, Dmitry Sokolov
2017	A*	`conf`	Query-to-Communication Lifting for BPP. FOCS Mika Göös, Toniann Pitassi, Thomas Watson
2017	J	`jnl`	Query-to-Communication Lifting for BPP. CoRR Mika Göös, Toniann Pitassi, Thomas Watson
2017	J	`jnl`	Query-to-Communication Lifting for BPP. Electron. Colloquium Comput. Complex. Mika Göös, Toniann Pitassi, Thomas Watson
2017	A	`conf`	Query-to-Communication Lifting for P^NP. CCC Mika Göös, Pritish Kamath, Toniann Pitassi, Thomas Watson
2017	J	`jnl`	Query-to-Communication Lifting for P^NP. Electron. Colloquium Comput. Complex. Mika Göös, Pritish Kamath, Toniann Pitassi, Thomas Watson
2017	A*	`conf`	Randomized Communication vs. Partition Number. ICALP Mika Göös, T. S. Jayram, Toniann Pitassi, Thomas Watson
2016	A	`conf`	A Composition Theorem for Conical Juntas. CCC Mika Göös, T. S. Jayram
2016	J	`jnl`	Communication Complexity of Set-Disjointness for All Probabilities. Theory Comput. Mika Göös, Thomas Watson
2016	A*	`conf`	Extension Complexity of Independent Set Polytopes. FOCS Mika Göös, Rahul Jain, Thomas Watson
2016	J	`jnl`	Extension Complexity of Independent Set Polytopes. CoRR Mika Göös, Rahul Jain, Thomas Watson
2016	J	`jnl`	Extension Complexity of Independent Set Polytopes. Electron. Colloquium Comput. Complex. Mika Göös, Rahul Jain, Thomas Watson
2016	J	`jnl`	Locally Checkable Proofs in Distributed Computing. Theory Comput. Mika Göös, Jukka Suomela
2016	A	`conf`	Non-local Probes Do Not Help with Many Graph Problems. DISC Mika Göös, Juho Hirvonen, Reut Levi, Moti Medina, Jukka Suomela
2016	J	`jnl`	Rectangles Are Nonnegative Juntas. SIAM J. Comput. Mika Göös, Shachar Lovett, Raghu Meka, Thomas Watson, David Zuckerman
2016	J	`jnl`	Separating OR, SUM, and XOR circuits. J. Comput. Syst. Sci. Magnus Find, Mika Göös, Matti Järvisalo, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen
2016	A*	`conf`	Separations in Communication Complexity Using Cheat Sheets and Information Complexity. FOCS Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Göös, Rahul Jain, Robin Kothari, Troy Lee, Miklos Santha
2016	J	`jnl`	Separations in communication complexity using cheat sheets and information complexity. CoRR Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Göös, Rahul Jain, Robin Kothari, Troy Lee, Miklos Santha
2016	J	`jnl`	Separations in communication complexity using cheat sheets and information complexity. Electron. Colloquium Comput. Complex. Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Göös, Rahul Jain, Robin Kothari, Troy Lee, Miklos Santha
2016	A*	`conf`	The Landscape of Communication Complexity Classes. ICALP Mika Göös, Toniann Pitassi, Thomas Watson
2016	J	`jnl`	Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication. Algorithmica Mika Göös, Toniann Pitassi, Thomas Watson
2015	J	`jnl`	A Composition Theorem for Conical Juntas. Electron. Colloquium Comput. Complex. Mika Göös, T. S. Jayram
2015	A*	`conf`	Deterministic Communication vs. Partition Number. FOCS Mika Göös, Toniann Pitassi, Thomas Watson
2015	J	`jnl`	Deterministic Communication vs. Partition Number. Electron. Colloquium Comput. Complex. Mika Göös, Toniann Pitassi, Thomas Watson
2015	A*	`conf`	Lower Bounds for Clique vs. Independent Set. FOCS Mika Göös
2015	J	`jnl`	Lower Bounds for Clique vs. Independent Set. Electron. Colloquium Comput. Complex. Mika Göös
2015	J	`jnl`	Non-Local Probes Do Not Help with Graph Problems. CoRR Mika Göös, Juho Hirvonen, Reut Levi, Moti Medina, Jukka Suomela
2015	J	`jnl`	Randomized Communication vs. Partition Number. Electron. Colloquium Comput. Complex. Mika Göös, T. S. Jayram, Toniann Pitassi, Thomas Watson
2015	A*	`conf`	Rectangles Are Nonnegative Juntas. STOC Mika Göös, Shachar Lovett, Raghu Meka, Thomas Watson, David Zuckerman
2015	J	`jnl`	The Landscape of Communication Complexity Classes. Electron. Colloquium Comput. Complex. Mika Göös, Toniann Pitassi, Thomas Watson
2015	A	`conf`	Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication. ITCS Mika Göös, Toniann Pitassi, Thomas Watson
2014	—	`conf`	Communication Complexity of Set-Disjointness for All Probabilities. APPROX-RANDOM Mika Göös, Thomas Watson
2014	J	`jnl`	Communication Complexity of Set-Disjointness for All Probabilities. Electron. Colloquium Comput. Complex. Mika Göös, Thomas Watson
2014	A*	`conf`	Communication lower bounds via critical block sensitivity. STOC Mika Göös, Toniann Pitassi
2014	A*	`conf`	Linear-in-delta lower bounds in the LOCAL model. PODC Mika Göös, Juho Hirvonen, Jukka Suomela
2014	J	`jnl`	No sublogarithmic-time approximation scheme for bipartite vertex cover. Distributed Comput. Mika Göös, Jukka Suomela
2014	J	`jnl`	Randomized distributed decision. Distributed Comput. Pierre Fraigniaud, Mika Göös, Amos Korman, Merav Parter, David Peleg
2014	J	`jnl`	Rectangles Are Nonnegative Juntas. Electron. Colloquium Comput. Complex. Mika Göös, Shachar Lovett, Raghu Meka, Thomas Watson, David Zuckerman
2014	J	`jnl`	Search Methods for Tile Sets in Patterned DNA Self-Assembly. CoRR Mika Göös, Tuomo Lempiäinen, Eugen Czeizler, Pekka Orponen
2014	J	`jnl`	Search methods for tile sets in patterned DNA self-assembly. J. Comput. Syst. Sci. Mika Göös, Tuomo Lempiäinen, Eugen Czeizler, Pekka Orponen
2014	J	`jnl`	Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication. Electron. Colloquium Comput. Complex. Mika Göös, Toniann Pitassi, Thomas Watson
2013	J	`jnl`	Communication Lower Bounds via Critical Block Sensitivity. CoRR Mika Göös, Toniann Pitassi
2013	J	`jnl`	Linear-in-$Δ$ Lower Bounds in the LOCAL Model CoRR Mika Göös, Juho Hirvonen, Jukka Suomela
2013	J	`jnl`	Lower bounds for local approximation. J. ACM Mika Göös, Juho Hirvonen, Jukka Suomela
2013	J	`jnl`	Separating OR, SUM, and XOR Circuits CoRR Magnus Find, Mika Göös, Matti Järvisalo, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen
2013	A*	`conf`	What can be decided locally without identifiers? PODC Pierre Fraigniaud, Mika Göös, Amos Korman, Jukka Suomela
2013	J	`jnl`	What can be decided locally without identifiers? CoRR Pierre Fraigniaud, Mika Göös, Amos Korman, Jukka Suomela
2012	J	`jnl`	Lower Bounds for Local Approximation CoRR Mika Göös, Juho Hirvonen, Jukka Suomela
2012	A*	`conf`	Lower bounds for local approximation. PODC Mika Göös, Juho Hirvonen, Jukka Suomela
2012	A	`conf`	No Sublogarithmic-Time Approximation Scheme for Bipartite Vertex Cover. DISC Mika Göös, Jukka Suomela
2012	J	`jnl`	No Sublogarithmic-time Approximation Scheme for Bipartite Vertex Cover CoRR Mika Göös, Jukka Suomela
2012	J	`jnl`	Review of DISC 2012. SIGACT News Mika Göös
2011	A*	`conf`	Locally checkable proofs. PODC Mika Göös, Jukka Suomela
2010	B	`conf`	Synthesizing Minimal Tile Sets for Patterned DNA Self-assembly. DNA Mika Göös, Pekka Orponen
2009	J	`jnl`	Synthesizing Minimal Tile Sets for Patterned DNA Self-Assembly CoRR Mika Göös, Pekka Orponen