Follow
Alexandros Hollender
Alexandros Hollender
Postdoc, EPFL & Post-Doctoral Research Fellow, All Souls College, University of Oxford
Verified email at cs.ox.ac.uk
Title
Cited by
Cited by
Year
Maximum Nash welfare and other stories about EFX
G Amanatidis, G Birmpas, A Filos-Ratsikas, A Hollender, AA Voudouris
Theoretical Computer Science (TCS) 863, 69-85, 2021
612021
The Complexity of Gradient Descent: CLS = PPAD ∩ PLS
J Fearnley, PW Goldberg, A Hollender, R Savani
ACM Symposium on Theory of Computing (STOC), 46-59, 2021
342021
The Hairy Ball problem is PPAD-complete
PW Goldberg, A Hollender
Journal of Computer and System Sciences (JCSS) 122, 34-62, 2021
232021
Contiguous Cake Cutting: Hardness Results and Approximation Algorithms
PW Goldberg, A Hollender, W Suksompong
Journal of Artificial Intelligence Research (JAIR) 69, 109-141, 2020
202020
A topological characterization of modulo-p arguments and implications for necklace splitting
A Filos-Ratsikas, A Hollender, K Sotiraki, M Zampetakis
ACM-SIAM Symposium on Discrete Algorithms (SODA), 2615-2634, 2021
182021
Consensus-Halving: Does it Ever Get Easier?
A Filos-Ratsikas, A Hollender, K Sotiraki, M Zampetakis
ACM Conference on Economics and Computation (EC), 381-399, 2020
182020
MergeShuffle: A very fast, parallel random permutation algorithm
A Bacher, O Bodini, A Hollender, J Lumbroso
International Conference on Random and Exhaustive Generation of …, 2015
172015
On the Complexity of Equilibrium Computation in First-Price Auctions
A Filos-Ratsikas, Y Giannakopoulos, A Hollender, P Lazos, D Poças
ACM Conference on Economics and Computation (EC), 454-476, 2021
142021
Attacking suggest boxes in web applications over HTTPS using side-channel stochastic algorithms
A Schaub, E Schneider, A Hollender, V Calasans, L Jolie, R Touillon, ...
International Conference on Risks and Security of Internet and Systems, 116-130, 2014
142014
Consensus halving for sets of items
PW Goldberg, A Hollender, A Igarashi, P Manurangsi, W Suksompong
Mathematics of Operations Research, 2022
122022
The Classes PPA-k: Existence from Arguments Modulo k
A Hollender
Theoretical Computer Science (TCS) 885, 15-29, 2021
122021
Two's Company, Three's a Crowd: Consensus-Halving for a Constant Number of Agents
A Deligkas, A Filos-Ratsikas, A Hollender
ACM Conference on Economics and Computation (EC), 347-368, 2021
102021
Constant inapproximability for PPA
A Deligkas, J Fearnley, A Hollender, T Melissourgos
arXiv preprint arXiv:2201.10011, 2022
92022
Optimally Deceiving a Learning Leader in Stackelberg Games
G Birmpas, J Gan, A Hollender, FJ Marmolejo-Cossío, N Rajgopal, ...
Journal of Artificial Intelligence Research (JAIR) 72, 507-531, 2021
92021
The Complexity of Multi-source Variants of the End-of-Line Problem, and the Concise Mutilated Chessboard.
A Hollender, P Goldberg
Electron. Colloquium Comput. Complex. 25, 120, 2018
62018
Separations in Proof Complexity and TFNP
M Göös, A Hollender, S Jain, G Maystre, W Pires, R Robere, R Tao
arXiv preprint arXiv:2205.02168, 2022
32022
Further Collapses in TFNP
M Göös, A Hollender, S Jain, G Maystre, W Pires, R Robere, R Tao
arXiv preprint arXiv:2202.07761, 2022
32022
FIXP-membership via Convex Optimization: Games, Cakes, and Markets
A Filos-Ratsikas, KA Hansen, K Høgh, A Hollender
Symposium on Foundations of Computer Science (FOCS), 827-838, 2022
32022
Pure-circuit: Strong inapproximability for PPAD
A Deligkas, J Fearnley, A Hollender, T Melissourgos
arXiv preprint arXiv:2209.15149, 2022
12022
Structural results for total search complexity classes with applications to game theory and optimisation
A Hollender
University of Oxford, 2021
12021
The system can't perform the operation now. Try again later.
Articles 1–20