default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMika Göös
Person information
- affiliation: EPFL, Lausanne, Switzerland
- affiliation (former): University of Toronto, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j26]Mika Göös, Ziyi Guan
, Tiberiu Mosnoi:
Depth-3 circuits for inner product. Inf. Comput. 300: 105192 (2024)- [j25]Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao:
Separations in Proof Complexity and TFNP. J. ACM 71(4): 26:1-26:45 (2024) - [j24]Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao:
Further Collapses in \(\boldsymbol{\mathsf{TFNP}}\). SIAM J. Comput. 53(3): 573-587 (2024) - [c44]Lukás Folwarczný, Mika Göös, Pavel Hubácek, Gilbert Maystre, Weiqiang Yuan:
One-Way Functions vs. TFNP: Simpler and Improved. ITCS 2024: 50:1-50:14 - [c43]Mika Göös, Ilan Newman, Artur Riazanov, Dmitry Sokolov:
Hardness Condensation by Restriction. STOC 2024: 2016-2027 - [i63]Yuting Fang, Mika Göös, Nathaniel Harms, Pooya Hatami:
Constant-Cost Communication is not Reducible to k-Hamming Distance. CoRR abs/2407.20204 (2024) - [i62]Mika Göös, Tom Gur, Siddhartha Jain, Jiawei Li:
Quantum Communication Advantage in TFNP. CoRR abs/2411.03296 (2024) - [i61]Mika Göös, Gilbert Maystre, Kilian Risse, Dmitry Sokolov:
Supercritical Tradeoffs for Monotone Circuits. CoRR abs/2411.14268 (2024) - [i60]Tyler Besselman, Mika Göös, Siyao Guo, Gilbert Maystre, Weiqiang Yuan:
Direct Sums for Parity Decision Trees. Electron. Colloquium Comput. Complex. TR24 (2024) - [i59]Mika Göös, Tom Gur, Siddhartha Jain, Jiawei Li:
Quantum Communication Advantage in TFNP. Electron. Colloquium Comput. Complex. TR24 (2024) - [i58]Mika Göös, Gilbert Maystre, Kilian Risse, Dmitry Sokolov:
Supercritical Tradeoffs for Monotone Circuits. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [j23]Mika Göös, Aviad Rubinstein:
Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria. SIAM J. Comput. 52(6): S18-316 (2023) - [c42]Mika Göös, Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov:
Top-Down Lower Bounds for Depth-Four Circuits. FOCS 2023: 1048-1055 - [c41]Mika Göös, Ziyi Guan, Tiberiu Mosnoi:
Depth-3 Circuits for Inner Product. MFCS 2023: 51:1-51:12 - [i57]Mika Göös, Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov:
Top-Down Lower Bounds for Depth-Four Circuits. CoRR abs/2304.02555 (2023) - [i56]Mika Göös, Ziyi Guan, Tiberiu Mosnoi:
Depth-3 Circuits for Inner Product. Electron. Colloquium Comput. Complex. TR23 (2023) - [i55]Mika Göös, Ilan Newman, Artur Riazanov, Dmitry Sokolov:
Hardness Condensation by Restriction. Electron. Colloquium Comput. Complex. TR23 (2023) - [i54]Mika Göös, Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov:
Top-Down Lower Bounds for Depth-Four Circuits. Electron. Colloquium Comput. Complex. TR23 (2023) - [i53]Lukás Folwarczný, Mika Göös, Pavel Hubácek, Gilbert Maystre, Weiqiang Yuan:
One-Way Functions vs. TFNP: Simpler and Improved. IACR Cryptol. ePrint Arch. 2023: 945 (2023) - 2022
- [j22]Susanna F. de Rezende, Mika Göös, Robert Robere:
Guest Column: Proofs, Circuits, and Communication. SIGACT News 53(1): 59-82 (2022) - [c40]Mika Göös, Siddhartha Jain:
Communication Complexity of Collision. APPROX/RANDOM 2022: 19:1-19:9 - [c39]Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao:
Further Collapses in TFNP. CCC 2022: 33:1-33:15 - [c38]Shalev Ben-David, Eric Blais, Mika Göös, Gilbert Maystre:
Randomised Composition and Small-Bias Minimax. FOCS 2022: 624-635 - [c37]Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao:
Separations in Proof Complexity and TFNP. FOCS 2022: 1150-1161 - [c36]Mika Göös, Stefan Kiefer, Weiqiang Yuan:
Lower Bounds for Unambiguous Automata via Communication Complexity. ICALP 2022: 126:1-126:13 - [c35]Noah Fleming, Mika Göös, Stefan Grosser, Robert Robere:
On Semi-Algebraic Proofs and Algorithms. ITCS 2022: 69:1-69:25 - [i52]Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao:
Further Collapses in TFNP. CoRR abs/2202.07761 (2022) - [i51]Susanna F. de Rezende, Mika Göös, Robert Robere:
Proofs, Circuits, and Communication. CoRR abs/2202.08909 (2022) - [i50]Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao:
Separations in Proof Complexity and TFNP. CoRR abs/2205.02168 (2022) - [i49]Mika Göös, Siddhartha Jain:
Communication Complexity of Collision. CoRR abs/2208.00029 (2022) - [i48]Shalev Ben-David, Eric Blais, Mika Göös, Gilbert Maystre:
Randomised Composition and Small-Bias Minimax. CoRR abs/2208.12896 (2022) - [i47]Shalev Ben-David, Eric Blais, Mika Göös, Gilbert Maystre:
Randomised Composition and Small-Bias Minimax. Electron. Colloquium Comput. Complex. TR22 (2022) - [i46]Noah Fleming, Stefan Grosser, Mika Göös, Robert Robere:
On Semi-Algebraic Proofs and Algorithms. Electron. Colloquium Comput. Complex. TR22 (2022) - [i45]Mika Göös, Siddhartha Jain:
Communication Complexity of Collision. Electron. Colloquium Comput. Complex. TR22 (2022) - [i44]Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao:
Further Collapses in TFNP. Electron. Colloquium Comput. Complex. TR22 (2022) - [i43]Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao:
Separations in Proof Complexity and TFNP. Electron. Colloquium Comput. Complex. TR22 (2022) - [i42]Mika Göös, Stefan Kiefer, Weiqiang Yuan:
Lower Bounds for Unambiguous Automata via Communication Complexity. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c34]Noah Fleming, Mika Göös, Russell Impagliazzo, Toniann Pitassi, Robert Robere, Li-Yang Tan, Avi Wigderson:
On the Power and Limitations of Branch and Cut. CCC 2021: 6:1-6:30 - [c33]Mika Göös, Gilbert Maystre:
A Majority Lemma for Randomised Query Complexity. CCC 2021: 18:1-18:15 - [c32]Kaspars Balodis, Shalev Ben-David, Mika Göös, Siddhartha Jain, Robin Kothari:
Unambiguous DNFs and Alon-Saks-Seymour. FOCS 2021: 116-124 - [c31]Susanna F. de Rezende, Mika Göös, Jakob Nordström, Toniann Pitassi, Robert Robere, Dmitry Sokolov:
Automating algebraic proof systems is NP-hard. STOC 2021: 209-222 - [i41]Noah Fleming, Mika Göös, Russell Impagliazzo, Toniann Pitassi, Robert Robere, Li-Yang Tan, Avi Wigderson:
On the Power and Limitations of Branch and Cut. CoRR abs/2102.05019 (2021) - [i40]Shalev Ben-David, Mika Göös, Siddhartha Jain, Robin Kothari:
Unambiguous DNFs from Hex. CoRR abs/2102.08348 (2021) - [i39]Mika Göös, Stefan Kiefer:
Lower Bounds on Unambiguous Automata Complementation and Separation via Communication Complexity. CoRR abs/2109.09155 (2021) - [i38]Shalev Ben-David, Mika Göös, Siddhartha Jain, Robin Kothari:
Unambiguous DNFs from Hex. Electron. Colloquium Comput. Complex. TR21 (2021) - [i37]Noah Fleming, Mika Göös, Russell Impagliazzo, Toniann Pitassi, Robert Robere, Li-Yang Tan, Avi Wigderson:
On the Power and Limitations of Branch and Cut. Electron. Colloquium Comput. Complex. TR21 (2021) - [i36]Mika Göös, Gilbert Maystre:
A Majority Lemma for Randomised Query Complexity. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j21]Mika Göös, Toniann Pitassi, Thomas Watson:
Query-to-Communication Lifting for BPP. SIAM J. Comput. 49(4) (2020) - [j20]Ankit Garg, Mika Göös, Pritish Kamath, Dmitry Sokolov:
Monotone Circuit Lower Bounds from Resolution. Theory Comput. 16: 1-30 (2020) - [j19]Mika Göös, Thomas Watson:
A Lower Bound for Sampling Disjoint Sets. ACM Trans. Comput. Theory 12(3): 20:1-20:13 (2020) - [c30]Shalev Ben-David, Mika Göös, Robin Kothari, Thomas Watson:
When Is Amplification Necessary for Composition in Randomized Query Complexity? APPROX-RANDOM 2020: 28:1-28:16 - [c29]Mika Göös, Pritish Kamath, Katerina Sotiraki, Manolis Zampetakis:
On the Complexity of Modulo-q Arguments and the Chevalley - Warning Theorem. CCC 2020: 19:1-19:42 - [c28]Andrew Bassilakis, Andrew Drucker, Mika Göös, Lunjia Hu, Weiyun Ma, Li-Yang Tan:
The Power of Many Samples in Query Complexity. ICALP 2020: 9:1-9:18 - [c27]Mika Göös, Sajin Koroth, Ian Mertz, Toniann Pitassi:
Automating cutting planes is NP-hard. STOC 2020: 68-77 - [i35]Andrew Bassilakis, Andrew Drucker, Mika Göös, Lunjia Hu, Weiyun Ma, Li-Yang Tan:
The Power of Many Samples in Query Complexity. CoRR abs/2002.10654 (2020) - [i34]Mika Göös, Sajin Koroth, Ian Mertz, Toniann Pitassi:
Automating Cutting Planes is NP-Hard}. CoRR abs/2004.08037 (2020) - [i33]Shalev Ben-David, Mika Göös, Robin Kothari, Thomas Watson:
When Is Amplification Necessary for Composition in Randomized Query Complexity? CoRR abs/2006.10957 (2020) - [i32]Andrew Bassilakis, Andrew Drucker, Mika Göös, Lunjia Hu, Weiyun Ma, Li-Yang Tan:
The Power of Many Samples in Query Complexity. Electron. Colloquium Comput. Complex. TR20 (2020) - [i31]Mika Göös, Sajin Koroth, Ian Mertz, Toniann Pitassi:
Automating Cutting Planes is NP-Hard. Electron. Colloquium Comput. Complex. TR20 (2020) - [i30]Mika Göös, Jakob Nordström, Toniann Pitassi, Robert Robere, Dmitry Sokolov, Susanna F. de Rezende:
Automating Algebraic Proof Systems is NP-Hard. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j18]Mika Göös, Pritish Kamath, Toniann Pitassi, Thomas Watson:
Query-to-Communication Lifting for P NP. Comput. Complex. 28(1): 113-144 (2019) - [j17]Mika Göös, Pritish Kamath, Toniann Pitassi, Thomas Watson:
Correction to: Query-to-Communication Lifting for P NP. Comput. Complex. 28(3): 543-544 (2019) - [c26]Mika Göös, Thomas Watson:
A Lower Bound for Sampling Disjoint Sets. APPROX-RANDOM 2019: 51:1-51:13 - [c25]Alexander Golovnev, Mika Göös, Daniel Reichman, Igor Shinkar:
String Matching: Communication, Circuits, and Learning. APPROX-RANDOM 2019: 56:1-56:20 - [c24]Mika Göös, Pritish Kamath, Robert Robere, Dmitry Sokolov:
Adventures in Monotone Complexity and TFNP. ITCS 2019: 38:1-38:19 - [i29]Mika Göös, Pritish Kamath, Katerina Sotiraki, Manolis Zampetakis:
On the Complexity of Modulo-q Arguments and the Chevalley-Warning Theorem. CoRR abs/1912.04467 (2019) - 2018
- [j16]Mika Göös, Toniann Pitassi, Thomas Watson:
The Landscape of Communication Complexity Classes. Comput. Complex. 27(2): 245-304 (2018) - [j15]Mika Göös, Rahul Jain, Thomas Watson:
Extension Complexity of Independent Set Polytopes. SIAM J. Comput. 47(1): 241-269 (2018) - [j14]Mika Göös, Toniann Pitassi:
Communication Lower Bounds via Critical Block Sensitivity. SIAM J. Comput. 47(5): 1778-1806 (2018) - [j13]Mika Göös, Toniann Pitassi, Thomas Watson:
Deterministic Communication vs. Partition Number. SIAM J. Comput. 47(6): 2435-2450 (2018) - [j12]Mika Göös, T. S. Jayram, Toniann Pitassi, Thomas Watson:
Randomized Communication versus Partition Number. ACM Trans. Comput. Theory 10(1): 4:1-4:20 (2018) - [c23]Yi-Hsiu Chen, Mika Göös, Salil P. Vadhan, Jiapeng Zhang:
A Tight Lower Bound for Entropy Flattening. CCC 2018: 23:1-23:28 - [c22]Mika Göös, Aviad Rubinstein:
Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria. FOCS 2018: 397-403 - [c21]Ankit Garg, Mika Göös, Pritish Kamath, Dmitry Sokolov:
Monotone circuit lower bounds from resolution. STOC 2018: 902-911 - [i28]Mika Göös, Aviad Rubinstein:
Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria. CoRR abs/1805.06387 (2018) - [i27]Yi-Hsiu Chen, Mika Göös, Salil P. Vadhan, Jiapeng Zhang:
A Tight Lower Bound for Entropy Flattening. Electron. Colloquium Comput. Complex. TR18 (2018) - [i26]Mika Göös, Pritish Kamath, Robert Robere, Dmitry Sokolov:
Adventures in Monotone Complexity and TFNP. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [b1]Mika Göös:
Communication Lower Bounds via Query Complexity. University of Toronto, Canada, 2017 - [j11]Mika Göös, Juho Hirvonen, Jukka Suomela:
Linear-in-Δ lower bounds in the LOCAL model. Distributed Comput. 30(5): 325-338 (2017) - [c20]Mika Göös, Pritish Kamath, Toniann Pitassi, Thomas Watson:
Query-to-Communication Lifting for P^NP. CCC 2017: 12:1-12:16 - [c19]Mika Göös, Toniann Pitassi, Thomas Watson:
Query-to-Communication Lifting for BPP. FOCS 2017: 132-143 - [c18]Mika Göös, T. S. Jayram, Toniann Pitassi, Thomas Watson:
Randomized Communication vs. Partition Number. ICALP 2017: 52:1-52:15 - [i25]Mika Göös, Toniann Pitassi, Thomas Watson:
Query-to-Communication Lifting for BPP. CoRR abs/1703.07666 (2017) - [i24]Ankit Garg, Mika Göös, Pritish Kamath, Dmitry Sokolov:
Monotone Circuit Lower Bounds from Resolution. Electron. Colloquium Comput. Complex. TR17 (2017) - [i23]Mika Göös, Pritish Kamath, Toniann Pitassi, Thomas Watson:
Query-to-Communication Lifting for P^NP. Electron. Colloquium Comput. Complex. TR17 (2017) - [i22]Mika Göös, Toniann Pitassi, Thomas Watson:
Query-to-Communication Lifting for BPP. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j10]Mika Göös, Toniann Pitassi, Thomas Watson:
Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication. Algorithmica 76(3): 684-719 (2016) - [j9]Magnus Find, Mika Göös, Matti Järvisalo, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen:
Separating OR, SUM, and XOR circuits. J. Comput. Syst. Sci. 82(5): 793-801 (2016) - [j8]Mika Göös, Shachar Lovett, Raghu Meka, Thomas Watson, David Zuckerman:
Rectangles Are Nonnegative Juntas. SIAM J. Comput. 45(5): 1835-1869 (2016) - [j7]Mika Göös, Thomas Watson:
Communication Complexity of Set-Disjointness for All Probabilities. Theory Comput. 12(1): 1-23 (2016) - [j6]Mika Göös, Jukka Suomela:
Locally Checkable Proofs in Distributed Computing. Theory Comput. 12(1): 1-33 (2016) - [c17]Mika Göös, T. S. Jayram:
A Composition Theorem for Conical Juntas. CCC 2016: 5:1-5:16 - [c16]Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Göös, Rahul Jain, Robin Kothari, Troy Lee, Miklos Santha:
Separations in Communication Complexity Using Cheat Sheets and Information Complexity. FOCS 2016: 555-564 - [c15]Mika Göös, Rahul Jain, Thomas Watson:
Extension Complexity of Independent Set Polytopes. FOCS 2016: 565-572 - [c14]Mika Göös, Toniann Pitassi, Thomas Watson:
The Landscape of Communication Complexity Classes. ICALP 2016: 86:1-86:15 - [c13]Mika Göös, Juho Hirvonen, Reut Levi, Moti Medina, Jukka Suomela:
Non-local Probes Do Not Help with Many Graph Problems. DISC 2016: 201-214 - [i21]Mika Göös, Rahul Jain, Thomas Watson:
Extension Complexity of Independent Set Polytopes. CoRR abs/1604.07062 (2016) - [i20]Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Göös, Rahul Jain, Robin Kothari, Troy Lee, Miklos Santha:
Separations in communication complexity using cheat sheets and information complexity. CoRR abs/1605.01142 (2016) - [i19]Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Göös, Rahul Jain, Robin Kothari, Troy Lee, Miklos Santha:
Separations in communication complexity using cheat sheets and information complexity. Electron. Colloquium Comput. Complex. TR16 (2016) - [i18]Mika Göös, Rahul Jain, Thomas Watson:
Extension Complexity of Independent Set Polytopes. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c12]Mika Göös:
Lower Bounds for Clique vs. Independent Set. FOCS 2015: 1066-1076 - [c11]Mika Göös, Toniann Pitassi, Thomas Watson:
Deterministic Communication vs. Partition Number. FOCS 2015: 1077-1088 - [c10]Mika Göös, Toniann Pitassi, Thomas Watson:
Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication. ITCS 2015: 113-122 - [c9]Mika Göös, Shachar Lovett, Raghu Meka, Thomas Watson, David Zuckerman:
Rectangles Are Nonnegative Juntas. STOC 2015: 257-266 - [i17]Mika Göös, Juho Hirvonen, Reut Levi, Moti Medina, Jukka Suomela:
Non-Local Probes Do Not Help with Graph Problems. CoRR abs/1512.05411 (2015) - [i16]Mika Göös:
Lower Bounds for Clique vs. Independent Set. Electron. Colloquium Comput. Complex. TR15 (2015) - [i15]Mika Göös, T. S. Jayram:
A Composition Theorem for Conical Juntas. Electron. Colloquium Comput. Complex. TR15 (2015) - [i14]Mika Göös, T. S. Jayram, Toniann Pitassi, Thomas Watson:
Randomized Communication vs. Partition Number. Electron. Colloquium Comput. Complex. TR15 (2015) - [i13]Mika Göös, Toniann Pitassi, Thomas Watson:
The Landscape of Communication Complexity Classes. Electron. Colloquium Comput. Complex. TR15 (2015) - [i12]Mika Göös, Toniann Pitassi, Thomas Watson:
Deterministic Communication vs. Partition Number. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j5]Pierre Fraigniaud, Mika Göös, Amos Korman, Merav Parter, David Peleg:
Randomized distributed decision. Distributed Comput. 27(6): 419-434 (2014) - [j4]Mika Göös, Jukka Suomela:
No sublogarithmic-time approximation scheme for bipartite vertex cover. Distributed Comput. 27(6): 435-443 (2014) - [j3]Mika Göös, Tuomo Lempiäinen, Eugen Czeizler, Pekka Orponen:
Search methods for tile sets in patterned DNA self-assembly. J. Comput. Syst. Sci. 80(1): 297-319 (2014) - [c8]Mika Göös, Thomas Watson:
Communication Complexity of Set-Disjointness for All Probabilities. APPROX-RANDOM 2014: 721-736 - [c7]Mika Göös, Juho Hirvonen, Jukka Suomela:
Linear-in-delta lower bounds in the LOCAL model. PODC 2014: 86-95 - [c6]Mika Göös, Toniann Pitassi:
Communication lower bounds via critical block sensitivity. STOC 2014: 847-856 - [i11]Mika Göös, Tuomo Lempiäinen, Eugen Czeizler, Pekka Orponen:
Search Methods for Tile Sets in Patterned DNA Self-Assembly. CoRR abs/1412.7219 (2014) - [i10]Mika Göös, Shachar Lovett, Raghu Meka, Thomas Watson, David Zuckerman:
Rectangles Are Nonnegative Juntas. Electron. Colloquium Comput. Complex. TR14 (2014) - [i9]Mika Göös, Toniann Pitassi, Thomas Watson:
Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication. Electron. Colloquium Comput. Complex. TR14 (2014) - [i8]Mika Göös, Thomas Watson:
Communication Complexity of Set-Disjointness for All Probabilities. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j2]Mika Göös, Juho Hirvonen, Jukka Suomela:
Lower bounds for local approximation. J. ACM 60(5): 39:1-39:23 (2013) - [c5]Pierre Fraigniaud, Mika Göös, Amos Korman, Jukka Suomela:
What can be decided locally without identifiers? PODC 2013: 157-165 - [i7]Pierre Fraigniaud, Mika Göös, Amos Korman, Jukka Suomela:
What can be decided locally without identifiers? CoRR abs/1302.2570 (2013) - [i6]Magnus Find, Mika Göös, Matti Järvisalo, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen:
Separating OR, SUM, and XOR Circuits. CoRR abs/1304.0513 (2013) - [i5]Mika Göös, Juho Hirvonen, Jukka Suomela:
Linear-in-$Δ$ Lower Bounds in the LOCAL Model. CoRR abs/1304.1007 (2013) - [i4]Mika Göös, Toniann Pitassi:
Communication Lower Bounds via Critical Block Sensitivity. CoRR abs/1311.2355 (2013) - 2012
- [j1]Mika Göös:
Review of DISC 2012. SIGACT News 43(4): 112-115 (2012) - [c4]Mika Göös, Juho Hirvonen, Jukka Suomela:
Lower bounds for local approximation. PODC 2012: 175-184 - [c3]Mika Göös, Jukka Suomela:
No Sublogarithmic-Time Approximation Scheme for Bipartite Vertex Cover. DISC 2012: 181-194 - [i3]Mika Göös, Juho Hirvonen, Jukka Suomela:
Lower Bounds for Local Approximation. CoRR abs/1201.6675 (2012) - [i2]Mika Göös, Jukka Suomela:
No Sublogarithmic-time Approximation Scheme for Bipartite Vertex Cover. CoRR abs/1205.4605 (2012) - 2011
- [c2]Mika Göös, Jukka Suomela:
Locally checkable proofs. PODC 2011: 159-168 - 2010
- [c1]Mika Göös, Pekka Orponen:
Synthesizing Minimal Tile Sets for Patterned DNA Self-assembly. DNA 2010: 71-82
2000 – 2009
- 2009
- [i1]Mika Göös, Pekka Orponen:
Synthesizing Minimal Tile Sets for Patterned DNA Self-Assembly. CoRR abs/0911.2924 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-02 19:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
