Alexandros Hollender

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 63

Top Topics

Stationary Points

Convex Optimization

Top Venues

Publications

John Fearnley, Paul W. Goldberg, Alexandros Hollender, Rahul Savani
The Complexity of Computing KKT Solutions of Quadratic Programs. STOC (2024)
Jérémi Do Dinh, Alexandros Hollender
Tight Inapproximability of Nash Equilibria in Public Goods Games. CoRR (2024)
Aris Filos-Ratsikas, Yiannis Giannakopoulos, Alexandros Hollender, Charalampos Kokkalis
On the Computation of Equilibria in Discrete First-Price Auctions. CoRR (2024)
Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao
Separations in Proof Complexity and TFNP. J. ACM 71 (4) (2024)
Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao
Further Collapses in \(\boldsymbol{\mathsf{TFNP}}\). SIAM J. Comput. 53 (3) (2024)
Aris Filos-Ratsikas, Kristoffer Arnsfelt Hansen, Kasper Høgh, Alexandros Hollender
PPAD-Membership for Problems with Exact Rational Solutions: A General Approach via Convex Optimization. STOC (2024)
Aris Filos-Ratsikas, Alexandros Hollender, Katerina Sotiraki, Manolis Zampetakis
Consensus-Halving: Does It Ever Get Easier? SIAM J. Comput. 52 (2) (2023)
Paul W. Goldberg, Kasper Høgh, Alexandros Hollender
The Frontier of Intractability for EFX with Two Agents. SAGT (2023)
Alexandros Hollender, Emmanouil Zampetakis
The Computational Complexity of Finding Stationary Points in Non-Convex Optimization. COLT (2023)
Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos
Tight Inapproximability for Graphical Games. AAAI (2023)
John Fearnley, Paul Goldberg, Alexandros Hollender, Rahul Savani
The Complexity of Gradient Descent: CLS = PPAD ∩ PLS. J. ACM 70 (1) (2023)
John Fearnley, Paul W. Goldberg, Alexandros Hollender, Rahul Savani
The Complexity of Computing KKT Solutions of Quadratic Programs. CoRR (2023)
Alexandros Hollender, Aviad Rubinstein
Envy-Free Cake-Cutting for Four Agents. CoRR (2023)
Alexandros Hollender, Aviad Rubinstein
Envy-Free Cake-Cutting for Four Agents. FOCS (2023)
Alexandros Hollender, Manolis Zampetakis
The Computational Complexity of Finding Stationary Points in Non-Convex Optimization. CoRR (2023)
Aris Filos-Ratsikas, Yiannis Giannakopoulos, Alexandros Hollender, Philip Lazos, Diogo Poças
On the Complexity of Equilibrium Computation in First-Price Auctions. SIAM J. Comput. 52 (1) (2023)
Aris Filos-Ratsikas, Kristoffer Arnsfelt Hansen, Kasper Høgh, Alexandros Hollender
PPAD-membership for Problems with Exact Rational Solutions: A General Approach via Convex Optimization. CoRR (2023)
Paul W. Goldberg, Kasper Høgh, Alexandros Hollender
The Frontier of Intractability for EFX with Two Agents. CoRR (2023)
Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos
Pure-Circuit: Strong Inapproximability for PPAD. FOCS (2022)
Argyrios Deligkas, Aris Filos-Ratsikas, Alexandros Hollender
Two's company, three's a crowd: Consensus-halving for a constant number of agents. Artif. Intell. 313 (2022)
Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos
Pure-Circuit: Strong Inapproximability for PPAD. CoRR (2022)
Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao
Further Collapses in TFNP. CoRR (2022)
Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao
Separations in Proof Complexity and TFNP. FOCS (2022)
Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao
Further Collapses in TFNP. CCC (2022)
Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos
Constant inapproximability for PPA. STOC (2022)
Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao
Further Collapses in TFNP. Electron. Colloquium Comput. Complex. 29 (2022)
Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos
Tight Inapproximability for Graphical Games. CoRR (2022)
Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos
Constant Inapproximability for PPA. CoRR (2022)
Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao
Separations in Proof Complexity and TFNP. CoRR (2022)
Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao
Separations in Proof Complexity and TFNP. Electron. Colloquium Comput. Complex. (2022)
Aris Filos-Ratsikas, Kristoffer Arnsfelt Hansen, Kasper Høgh, Alexandros Hollender
FIXP-membership via Convex Optimization: Games, Cakes, and Markets. FOCS (2022)
Paul W. Goldberg, Alexandros Hollender, Ayumi Igarashi, Pasin Manurangsi, Warut Suksompong
Consensus Halving for Sets of Items. Math. Oper. Res. 47 (4) (2022)
Aris Filos-Ratsikas, Yiannis Giannakopoulos, Alexandros Hollender, Philip Lazos, Diogo Poças
On the Complexity of Equilibrium Computation in First-Price Auctions. CoRR (2021)
Paul W. Goldberg, Alexandros Hollender
The Hairy Ball problem is PPAD-complete. J. Comput. Syst. Sci. 122 (2021)
Argyrios Deligkas, Aris Filos-Ratsikas, Alexandros Hollender
Two's Company, Three's a Crowd: Consensus-Halving for a Constant Number of Agents. EC (2021)
Georgios Birmpas, Jiarui Gan, Alexandros Hollender, Francisco J. Marmolejo Cossío, Ninad Rajgopal, Alexandros A. Voudouris
Optimally Deceiving a Learning Leader in Stackelberg Games. J. Artif. Intell. Res. 72 (2021)
Aris Filos-Ratsikas, Kristoffer Arnsfelt Hansen, Kasper Høgh, Alexandros Hollender
FIXP-membership via Convex Optimization: Games, Cakes, and Markets. FOCS (2021)
Aris Filos-Ratsikas, Yiannis Giannakopoulos, Alexandros Hollender, Philip Lazos, Diogo Poças
On the Complexity of Equilibrium Computation in First-Price Auctions. EC (2021)
Aris Filos-Ratsikas, Kristoffer Arnsfelt Hansen, Kasper Høgh, Alexandros Hollender
FIXP-membership via Convex Optimization: Games, Cakes, and Markets. CoRR (2021)
Alexandros Hollender
. Theor. Comput. Sci. 885 (2021)
Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros Hollender, Alexandros A. Voudouris
Maximum Nash welfare and other stories about EFX. Theor. Comput. Sci. 863 (2021)
John Fearnley, Paul W. Goldberg, Alexandros Hollender, Rahul Savani
The complexity of gradient descent: CLS = PPAD ∩ PLS. STOC (2021)
Aris Filos-Ratsikas, Alexandros Hollender, Katerina Sotiraki, Manolis Zampetakis
Arguments and Implications for Necklace Splitting. SODA (2021)
Paul Goldberg, Alexandros Hollender, Warut Suksompong
Contiguous Cake Cutting: Hardness Results and Approximation Algorithms. J. Artif. Intell. Res. 69 (2020)
Aris Filos-Ratsikas, Alexandros Hollender, Katerina Sotiraki, Manolis Zampetakis
Consensus-Halving: Does it Ever Get Easier? CoRR (2020)
Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros Hollender, Alexandros A. Voudouris
Maximum Nash Welfare and Other Stories About EFX. IJCAI (2020)
Paul W. Goldberg, Alexandros Hollender, Warut Suksompong
Contiguous Cake Cutting: Hardness Results and Approximation Algorithms. AAAI (2020)
Georgios Birmpas, Jiarui Gan, Alexandros Hollender, Francisco J. Marmolejo Cossío, Ninad Rajgopal, Alexandros A. Voudouris
Optimally Deceiving a Learning Leader in Stackelberg Games. CoRR (2020)
Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros Hollender, Alexandros A. Voudouris
Maximum Nash Welfare and Other Stories About EFX. CoRR (2020)
Aris Filos-Ratsikas, Alexandros Hollender, Katerina Sotiraki, Manolis Zampetakis
Consensus-Halving: Does It Ever Get Easier? EC (2020)
Georgios Birmpas, Jiarui Gan, Alexandros Hollender, Francisco J. Marmolejo Cossío, Ninad Rajgopal, Alexandros A. Voudouris
Optimally Deceiving a Learning Leader in Stackelberg Games. NeurIPS (2020)
Paul W. Goldberg, Alexandros Hollender, Ayumi Igarashi, Pasin Manurangsi, Warut Suksompong
Consensus Halving for Sets of Items. CoRR (2020)
Paul W. Goldberg, Alexandros Hollender, Ayumi Igarashi, Pasin Manurangsi, Warut Suksompong
Consensus Halving for Sets of Items. WINE (2020)
Argyrios Deligkas, Aris Filos-Ratsikas, Alexandros Hollender
Two's Company, Three's a Crowd: Consensus-Halving for a Constant Number of Agents. CoRR (2020)
Aris Filos-Ratsikas, Alexandros Hollender, Katerina Sotiraki, Manolis Zampetakis
A Topological Characterization of Modulo-p Arguments and Implications for Necklace Splitting. CoRR (2020)
John Fearnley, Paul W. Goldberg, Alexandros Hollender, Rahul Savani
The Complexity of Gradient Descent: CLS = PPAD ∩ PLS. CoRR (2020)
Alexandros Hollender
The Classes PPA-k: Existence from Arguments Modulo k. WINE (2019)
Alexandros Hollender
The Classes PPA-k: Existence from Arguments Modulo k. CoRR (2019)
Paul W. Goldberg, Alexandros Hollender, Warut Suksompong
Contiguous Cake Cutting: Hardness Results and Approximation Algorithms. CoRR (2019)
Paul W. Goldberg, Alexandros Hollender
The Hairy Ball Problem is PPAD-Complete. ICALP (2019)
Paul W. Goldberg, Alexandros Hollender
The Hairy Ball Problem is PPAD-Complete. CoRR (2019)
Alexandros Hollender, Paul Goldberg
The Complexity of Multi-source Variants of the End-of-Line Problem, and the Concise Mutilated Chessboard. Electron. Colloquium Comput. Complex. 25 (2018)
Axel Bacher, Olivier Bodini, Alexandros Hollender, Jérémie O. Lumbroso
MergeShuffle: a very fast, parallel random permutation algorithm. GASCom (2018)
Axel Bacher, Olivier Bodini, Alexandros Hollender, Jérémie O. Lumbroso
MergeShuffle: A Very Fast, Parallel Random Permutation Algorithm. CoRR (2015)
Alexander Schaub, Emmanuel Schneider, Alexandros Hollender, Vinicius Calasans, Laurent Jolie, Robin Touillon, Annelie Heuser, Sylvain Guilley, Olivier Rioul
Attacking Suggest Boxes in Web Applications Over HTTPS Using Side-Channel Stochastic Algorithms. CRiSIS (2014)
Alexander Schaub, Emmanuel Schneider, Alexandros Hollender, Vinicius Calasans, Laurent Jolie, Robin Touillon, Annelie Heuser, Sylvain Guilley, Olivier Rioul
Attacking Suggest Boxes in Web Applications Over HTTPS Using Side-Channel Stochastic Algorithms. IACR Cryptol. ePrint Arch. 2014 (2014)