Mika Göös

Binding

APPROX/RANDOM, (2020)

ACM Trans. Comput. Theory, no. 3 (2020): 1-13

CCC, (2020)

Electronic Colloquium on Computational Complexity, (2020): 49

Electronic Colloquium on Computational Complexity, (2020): 64

SIAM J. Comput., no. 4 (2020)

STOC '20: 52nd Annual ACM SIGACT Symposium on Theory of Computing Chicago IL ..., pp.68-77, (2020)

Computational Complexity Conference, (2019)

APPROX-RANDOM, (2019)

TOCT, no. 1 (2018): 4:1-4:20

ACM Transactions on Computation Theory, no. 1 (2018): 4

Electronic Colloquium on Computational Complexity (ECCC), no. 1 (2018): 113-144

2016 IEEE 57TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), no. 1 (2018): 565-572

Leibniz International Proceedings in Informatics, (2018): 23:1-23:28

STOC '18: Symposium on Theory of Computing Los Angeles CA USA June, 20..., pp.902-911, (2018)

Electronic Colloquium on Computational Complexity (ECCC), (2018)

2018 IEEE 59TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), (2018): 397.0-403

2017 IEEE 58TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), (2017): 132-143

Conference on Computational Complexity, (2016): 5:1-5:16