Attacking Suggest Boxes in Web Applications Over HTTPS Using Side-Channel Stochastic Algorithms. - Alexander Schaub 001; Emmanuel Schneider; Alexandros Hollender; Vinicius Calasans; Laurent Jolie; Robin Touillon; Annelie Heuser; Sylvain Guilley; Olivier Rioul (IACR Cryptol. ePrint Arch., 2014)

MergeShuffle: a very fast, parallel random permutation algorithm. - Axel Bacher; Olivier Bodini; Alexandros Hollender; Jérémie O. Lumbroso (GASCom, 2018)

The Complexity of Multi-source Variants of the End-of-Line Problem, and the Concise Mutilated Chessboard. - Alexandros Hollender; Paul W. Goldberg (Electron. Colloquium Comput. Complex., 2018)

The Classes PPA-k: Existence from Arguments Modulo k. - Alexandros Hollender (WINE, 2019)

A Topological Characterization of Modulo-p Arguments and Implications for Necklace Splitting. - Aris Filos-Ratsikas; Alexandros Hollender; Katerina Sotiraki; Manolis Zampetakis (CoRR, 2020)

Contiguous Cake Cutting: Hardness Results and Approximation Algorithms. - Paul W. Goldberg; Alexandros Hollender; Warut Suksompong (J. Artif. Intell. Res., 2020)

FIXP-membership via Convex Optimization: Games, Cakes, and Markets. - Aris Filos-Ratsikas; Kristoffer Arnsfelt Hansen; Kasper Høgh; Alexandros Hollender (FOCS, 2021)

A Topological Characterization of Modulo-p Arguments and Implications for Necklace Splitting. - Aris Filos-Ratsikas; Alexandros Hollender; Katerina Sotiraki; Manolis Zampetakis (SODA, 2021)

Optimally Deceiving a Learning Leader in Stackelberg Games. - Georgios Birmpas; Jiarui Gan; Alexandros Hollender; Francisco J. Marmolejo Cossío; Ninad Rajgopal; Alexandros A. Voudouris (J. Artif. Intell. Res., 2021)

The Hairy Ball problem is PPAD-complete. - Paul W. Goldberg; Alexandros Hollender (J. Comput. Syst. Sci., 2021)

Maximum Nash welfare and other stories about EFX. - Georgios Amanatidis; Georgios Birmpas; Aris Filos-Ratsikas; Alexandros Hollender; Alexandros A. Voudouris (Theor. Comput. Sci., 2021)

The classes PPA-k: Existence from arguments modulo k. - Alexandros Hollender (Theor. Comput. Sci., 2021)

Structural results for total search complexity classes with applications to game theory and optimisation. - Alexandros Hollender (2021)

Pure-Circuit: Strong Inapproximability for PPAD. - Argyrios Deligkas; John Fearnley; Alexandros Hollender; Themistoklis Melissourgos (FOCS, 2022)

Two's company, three's a crowd: Consensus-halving for a constant number of agents. - Argyrios Deligkas; Aris Filos-Ratsikas; Alexandros Hollender (Artif. Intell., 2022)

Further Collapses in TFNP. - Mika Göös; Alexandros Hollender; Siddhartha Jain 002; Gilbert Maystre; William Pires; Robert Robere; Ran Tao 013 (Electron. Colloquium Comput. Complex., 2022)

Separations in Proof Complexity and TFNP. - Mika Göös; Alexandros Hollender; Siddhartha Jain 002; Gilbert Maystre; William Pires; Robert Robere; Ran Tao 013 (Electron. Colloquium Comput. Complex., 2022)

Consensus Halving for Sets of Items. - Paul W. Goldberg; Alexandros Hollender; Ayumi Igarashi 001; Pasin Manurangsi; Warut Suksompong (Math. Oper. Res., 2022)

Tight Inapproximability for Graphical Games. - Argyrios Deligkas; John Fearnley; Alexandros Hollender; Themistoklis Melissourgos (AAAI, 2023)

Envy-Free Cake-Cutting for Four Agents. - Alexandros Hollender; Aviad Rubinstein (FOCS, 2023)

The Complexity of Gradient Descent: CLS = PPAD ∩ PLS. - John Fearnley; Paul Goldberg 001; Alexandros Hollender; Rahul Savani (J. ACM, 2023)

On the Complexity of Equilibrium Computation in First-Price Auctions. - Aris Filos-Ratsikas; Yiannis Giannakopoulos; Alexandros Hollender; Philip Lazos; Diogo Poças (SIAM J. Comput., 2023)

Consensus-Halving: Does It Ever Get Easier? - Aris Filos-Ratsikas; Alexandros Hollender; Katerina Sotiraki; Manolis Zampetakis (SIAM J. Comput., 2023)

Constant Inapproximability for Fisher Markets. - Argyrios Deligkas; John Fearnley; Alexandros Hollender; Themistoklis Melissourgos (EC, 2024)

On the Computation of Equilibria in Discrete First-Price Auctions. - Aris Filos-Ratsikas; Yiannis Giannakopoulos; Alexandros Hollender; Charalampos Kokkalis (EC, 2024)

The Complexity of Computing KKT Solutions of Quadratic Programs. - John Fearnley; Paul W. Goldberg; Alexandros Hollender; Rahul Savani (STOC, 2024)

PPAD-Membership for Problems with Exact Rational Solutions: A General Approach via Convex Optimization. - Aris Filos-Ratsikas; Kristoffer Arnsfelt Hansen; Kasper Høgh; Alexandros Hollender (STOC, 2024)

The Complexity of Symmetric Bimatrix Games with Common Payoffs. - Abheek Ghosh; Alexandros Hollender (CoRR, 2024)

Tight inapproximability of Nash equilibria in public goods games. - Jérémi Do Dinh; Alexandros Hollender (Inf. Process. Lett., 2024)

Further Collapses in ( boldsymbol{ mathsf{TFNP}} ). - Mika Göös; Alexandros Hollender; Siddhartha Jain 002; Gilbert Maystre; William Pires; Robert Robere; Ran Tao 013 (SIAM J. Comput., 2024)

Pure-Circuit: Tight Inapproximability for PPAD. - Argyrios Deligkas; John Fearnley; Alexandros Hollender; Themistoklis Melissourgos (J. ACM, 2024)

The Complexity of Two-Team Polymatrix Games with Independent Adversaries. - Alexandros Hollender; Gilbert Maystre; Sai Ganesh Nagarajan (ICLR, 2025)

Equilibrium Computation in First-Price Auctions with Correlated Priors. - Aris Filos-Ratsikas; Yiannis Giannakopoulos; Alexandros Hollender; Charalampos Kokkalis (EC, 2025)

Computing approximate roots of monotone functions. - Alexandros Hollender; Chester Lawrence; Erel Segal-Halevi (J. Complex., 2025)

Constant Inapproximability for PPA. - Argyrios Deligkas; John Fearnley; Alexandros Hollender; Themistoklis Melissourgos (SIAM J. Comput., 2025)

The frontier of intractability for EFX with two agents. - Paul W. Goldberg; Kasper Høgh; Alexandros Hollender (Theor. Comput. Sci., 2025)

The computational complexity of finding stationary points in non-convex optimization. - Alexandros Hollender; Manolis Zampetakis (Math. Program., 2025)