Alexandros Hollender

Orcid: 0000-0001-5255-9349

Affiliations:
  • University of Oxford, UK
  • EPFL, Lausanne, Switzerland (former)


According to our database1, Alexandros Hollender authored at least 32 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Further Collapses in \(\boldsymbol{\mathsf{TFNP}}\).
SIAM J. Comput., 2024

Tight inapproximability of Nash equilibria in public goods games.
Inf. Process. Lett., 2024

The Complexity of Two-Team Polymatrix Games with Independent Adversaries.
CoRR, 2024

On the Computation of Equilibria in Discrete First-Price Auctions.
CoRR, 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

The Complexity of Computing KKT Solutions of Quadratic Programs.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

2023
Consensus-Halving: Does It Ever Get Easier?
SIAM J. Comput., April, 2023

On the Complexity of Equilibrium Computation in First-Price Auctions.
SIAM J. Comput., February, 2023

The Complexity of Gradient Descent: CLS = PPAD ∩ PLS.
J. ACM, February, 2023

The Frontier of Intractability for EFX with Two Agents.
Proceedings of the Algorithmic Game Theory - 16th International Symposium, 2023

Envy-Free Cake-Cutting for Four Agents.
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

Tight Inapproximability for Graphical Games.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Consensus Halving for Sets of Items.
Math. Oper. Res., November, 2022

Separations in Proof Complexity and TFNP.
Electron. Colloquium Comput. Complex., 2022

Further Collapses in TFNP.
Electron. Colloquium Comput. Complex., 2022

Two's company, three's a crowd: Consensus-halving for a constant number of agents.
Artif. Intell., 2022

Constant inapproximability for PPA.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Pure-Circuit: Strong Inapproximability for PPAD.
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

The classes PPA-<i>k</i>: Existence from arguments modulo <i>k</i>.
Theor. Comput. Sci., 2021

Maximum Nash welfare and other stories about EFX.
Theor. Comput. Sci., 2021

The Hairy Ball problem is PPAD-complete.
J. Comput. Syst. Sci., 2021

Optimally Deceiving a Learning Leader in Stackelberg Games.
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

FIXP-membership via Convex Optimization: Games, Cakes, and Markets.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020
Contiguous Cake Cutting: Hardness Results and Approximation Algorithms.
J. Artif. Intell. Res., 2020

A Topological Characterization of Modulo-p Arguments and Implications for Necklace Splitting.
CoRR, 2020

2019
The Classes PPA-k: Existence from Arguments Modulo k.
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

MergeShuffle: a very fast, parallel random permutation algorithm.
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


  Loading...