Alexandros Hollender
Orcid: 0000-0001-5255-9349Affiliations:
- University of Oxford, UK
- EPFL, Lausanne, Switzerland (former)
According to our database1,
Alexandros Hollender
authored at least 35 papers
between 2014 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Inf. Process. Lett., 2024
PPAD-Membership for Problems with Exact Rational Solutions: A General Approach via Convex Optimization.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024
Proceedings of the 25th ACM Conference on Economics and Computation, 2024
Proceedings of the 25th ACM Conference on Economics and Computation, 2024
2023
SIAM J. Comput., February, 2023
Proceedings of the Algorithmic Game Theory - 16th International Symposium, 2023
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023
The Computational Complexity of Finding Stationary Points in Non-Convex Optimization.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023
2022
Electron. Colloquium Comput. Complex., 2022
Artif. Intell., 2022
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022
2021
Structural results for total search complexity classes with applications to game theory and optimisation.
PhD thesis, 2021
Theor. Comput. Sci., 2021
J. Artif. Intell. Res., 2021
A Topological Characterization of Modulo-<i>p</i> Arguments and Implications for Necklace Splitting.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021
2020
J. Artif. Intell. Res., 2020
A Topological Characterization of Modulo-p Arguments and Implications for Necklace Splitting.
CoRR, 2020
2019
Proceedings of the Web and Internet Economics - 15th International Conference, 2019
2018
The Complexity of Multi-source Variants of the End-of-Line Problem, and the Concise Mutilated Chessboard.
Electron. Colloquium Comput. Complex., 2018
Proceedings of the 11th International Conference on Random and Exhaustive Generation of Combinatorial Structures, 2018
2014
Attacking Suggest Boxes in Web Applications Over HTTPS Using Side-Channel Stochastic Algorithms.
IACR Cryptol. ePrint Arch., 2014