Mika Göös

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
Depth-3 circuits for inner product	2024-12-03	Paper
Depth-3 circuits for inner product	2024-10-08	Paper
Communication complexity of collision	2024-08-22	Paper
Further collapses in TFNP	2024-07-05	Paper
Lower bounds for unambiguous automata via communication complexity	2024-06-24	Paper
Further collapses in \(\mathsf{TFNP}\)	2024-05-24	Paper
https://portal.mardi4nfdi.de/entity/Q6126307	2024-04-09	Paper
Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria	2023-12-19	Paper
https://portal.mardi4nfdi.de/entity/Q6062152	2023-10-31	Paper
On the power and limitations of branch and cut	2023-07-12	Paper
https://portal.mardi4nfdi.de/entity/Q6115373	2023-07-12	Paper
String Matching: Communication, Circuits, and Learning.	2023-02-03	Paper
https://portal.mardi4nfdi.de/entity/Q5092469	2022-07-21	Paper
Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria	2022-01-07	Paper
Automating cutting planes is NP-hard	2021-01-19	Paper
https://portal.mardi4nfdi.de/entity/Q5121911	2020-09-22	Paper
Communication Lower Bounds via Critical Block Sensitivity	2018-11-07	Paper
Non-local probes do not help with many graph problems	2018-08-16	Paper
Linear-in-\(\varDelta \) lower bounds in the LOCAL model	2018-01-17	Paper
https://portal.mardi4nfdi.de/entity/Q5368739	2017-10-10	Paper
Locally checkable proofs in distributed computing	2016-12-21	Paper
Zero-information protocols and unambiguity in Arthur-Merlin communication	2016-11-29	Paper
Rectangles are nonnegative juntas	2016-10-28	Paper
Communication complexity of set-disjointness for all probabilities	2016-08-22	Paper
Separating OR, SUM, and XOR circuits	2016-04-18	Paper
Locally checkable proofs	2015-09-11	Paper
Linear-in-delta lower bounds in the LOCAL model	2015-09-03	Paper
Communication lower bounds via critical block sensitivity	2015-06-26	Paper
What can be decided locally without identifiers?	2015-03-02	Paper
Randomized distributed decision	2015-02-23	Paper
No sublogarithmic-time approximation scheme for bipartite vertex cover	2015-02-23	Paper
Lower bounds for local approximation	2014-12-05	Paper
Lower bounds for local approximation	2014-02-17	Paper
Search methods for tile sets in patterned DNA self-assembly	2014-01-28	Paper
Randomized distributed decision	2013-03-13	Paper
No sublogarithmic-time approximation scheme for bipartite vertex cover	2013-03-13	Paper
Synthesizing Minimal Tile Sets for Patterned DNA Self-assembly	2011-01-28	Paper

Research outcomes over time

This page was built for person: Mika Göös