Michael Walter
Orcid: 0000-0002-3073-1408Affiliations:
- Ruhr-University Bochum, Germany
- University of Amsterdam, The Netherlands (former)
According to our database1,
Michael Walter
authored at least 40 papers
between 2012 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2025
Computing Moment Polytopes of Tensors, with Applications in Algebraic Complexity and Quantum Information.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025
2024
IACR Cryptol. ePrint Arch., 2024
IACR Cryptol. ePrint Arch., 2024
IACR Cryptol. ePrint Arch., 2024
IACR Cryptol. ePrint Arch., 2024
Complexity theory of orbit closure intersection for tensors: reductions, completeness, and graph isomorphism hardness.
CoRR, 2024
Proceedings of the Security and Cryptography for Networks - 14th International Conference, 2024
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024
Proceedings of the 39th Computational Complexity Conference, 2024
2023
IACR Cryptol. ePrint Arch., 2023
A Simple Construction of Quantum Public-Key Encryption from Quantum-Secure One-Way Functions.
IACR Cryptol. ePrint Arch., 2023
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023
Proceedings of the 31st Annual European Symposium on Algorithms, 2023
2022
Matchgate benchmarking: Scalable benchmarking of a continuous family of many-qubit gates.
Quantum, 2022
2021
Near optimal sample complexity for matrix and tensor normal models via geodesic convexity.
CoRR, 2021
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021
Proceedings of the 36th Computational Complexity Conference, 2021
2020
IEEE Trans. Inf. Theory, 2020
CoRR, 2020
Search Problems in Algebraic Complexity, GCT, and Hardness of Generators for Invariant Rings.
Proceedings of the 35th Computational Complexity Conference, 2020
2019
Towards a theory of non-commutative optimization: geodesic first and second order methods for moment maps and polytopes.
CoRR, 2019
Towards a Theory of Non-Commutative Optimization: Geodesic 1st and 2nd Order Methods for Moment Maps and Polytopes.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019
2018
Alternating Minimization, Scaling Algorithms, and the Null-Cone Problem from Invariant Theory.
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018
2017
IEEE Trans. Inf. Theory, 2017
2014
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014
2013
2012
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012