default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexandros Hollender
Person information
- affiliation: University of Oxford, UK
- affiliation (former): EPFL, Lausanne, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Jérémi Do Dinh, Alexandros Hollender
:
Tight inapproximability of Nash equilibria in public goods games. Inf. Process. Lett. 186: 106486 (2024)- [j12]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): 26:1-26:45 (2024) - [j11]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): 573-587 (2024) - [c24]John Fearnley, Paul W. Goldberg, Alexandros Hollender, Rahul Savani:
The Complexity of Computing KKT Solutions of Quadratic Programs. STOC 2024: 892-903 - [c23]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: 1204-1215 - [i30]Aris Filos-Ratsikas, Yiannis Giannakopoulos, Alexandros Hollender, Charalampos Kokkalis:
On the Computation of Equilibria in Discrete First-Price Auctions. CoRR abs/2402.12068 (2024) - [i29]Jérémi Do Dinh, Alexandros Hollender:
Tight Inapproximability of Nash Equilibria in Public Goods Games. CoRR abs/2402.14198 (2024) - [i28]Alexandros Hollender, Gilbert Maystre, Sai Ganesh Nagarajan:
The Complexity of Two-Team Polymatrix Games with Independent Adversaries. CoRR abs/2409.07398 (2024) - 2023
- [j10]John Fearnley, Paul Goldberg, Alexandros Hollender, Rahul Savani:
The Complexity of Gradient Descent: CLS = PPAD ∩ PLS. J. ACM 70(1): 7:1-7:74 (2023) - [j9]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): 80-131 (2023) - [j8]Aris Filos-Ratsikas, Alexandros Hollender, Katerina Sotiraki, Manolis Zampetakis:
Consensus-Halving: Does It Ever Get Easier? SIAM J. Comput. 52(2): 412-451 (2023) - [c22]Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos:
Tight Inapproximability for Graphical Games. AAAI 2023: 5600-5607 - [c21]Alexandros Hollender, Emmanouil Zampetakis:
The Computational Complexity of Finding Stationary Points in Non-Convex Optimization. COLT 2023: 5571-5572 - [c20]Alexandros Hollender, Aviad Rubinstein:
Envy-Free Cake-Cutting for Four Agents. FOCS 2023: 113-122 - [c19]Paul W. Goldberg, Kasper Høgh, Alexandros Hollender:
The Frontier of Intractability for EFX with Two Agents. SAGT 2023: 290-307 - [i27]Paul W. Goldberg, Kasper Høgh, Alexandros Hollender:
The Frontier of Intractability for EFX with Two Agents. CoRR abs/2301.10354 (2023) - [i26]Alexandros Hollender, Manolis Zampetakis:
The Computational Complexity of Finding Stationary Points in Non-Convex Optimization. CoRR abs/2310.09157 (2023) - [i25]Alexandros Hollender, Aviad Rubinstein:
Envy-Free Cake-Cutting for Four Agents. CoRR abs/2311.02075 (2023) - [i24]John Fearnley, Paul W. Goldberg, Alexandros Hollender, Rahul Savani:
The Complexity of Computing KKT Solutions of Quadratic Programs. CoRR abs/2311.13738 (2023) - [i23]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 abs/2312.01237 (2023) - 2022
- [j7]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: 103784 (2022) - [j6]Paul W. Goldberg, Alexandros Hollender, Ayumi Igarashi, Pasin Manurangsi, Warut Suksompong:
Consensus Halving for Sets of Items. Math. Oper. Res. 47(4): 3357-3379 (2022) - [c18]Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao:
Further Collapses in TFNP. CCC 2022: 33:1-33:15 - [c17]Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos:
Pure-Circuit: Strong Inapproximability for PPAD. FOCS 2022: 159-170 - [c16]Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao:
Separations in Proof Complexity and TFNP. FOCS 2022: 1150-1161 - [c15]Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos:
Constant inapproximability for PPA. STOC 2022: 1010-1023 - [i22]Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos:
Constant Inapproximability for PPA. CoRR abs/2201.10011 (2022) - [i21]Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao:
Further Collapses in TFNP. CoRR abs/2202.07761 (2022) - [i20]Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao:
Separations in Proof Complexity and TFNP. CoRR abs/2205.02168 (2022) - [i19]Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos:
Pure-Circuit: Strong Inapproximability for PPAD. CoRR abs/2209.15149 (2022) - [i18]Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos:
Tight Inapproximability for Graphical Games. CoRR abs/2209.15151 (2022) - [i17]Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao:
Further Collapses in TFNP. Electron. Colloquium Comput. Complex. TR22 (2022) - [i16]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. TR22 (2022) - 2021
- [b1]Alexandros Hollender:
Structural results for total search complexity classes with applications to game theory and optimisation. University of Oxford, UK, 2021 - [j5]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: 507-531 (2021) - [j4]Paul W. Goldberg, Alexandros Hollender:
The Hairy Ball problem is PPAD-complete. J. Comput. Syst. Sci. 122: 34-62 (2021) - [j3]Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros Hollender, Alexandros A. Voudouris:
Maximum Nash welfare and other stories about EFX. Theor. Comput. Sci. 863: 69-85 (2021) - [j2]Alexandros Hollender:
The classes PPA-k: Existence from arguments modulo k. Theor. Comput. Sci. 885: 15-29 (2021) - [c14]Aris Filos-Ratsikas, Kristoffer Arnsfelt Hansen, Kasper Høgh, Alexandros Hollender:
FIXP-membership via Convex Optimization: Games, Cakes, and Markets. FOCS 2021: 827-838 - [c13]Argyrios Deligkas, Aris Filos-Ratsikas, Alexandros Hollender:
Two's Company, Three's a Crowd: Consensus-Halving for a Constant Number of Agents. EC 2021: 347-368 - [c12]Aris Filos-Ratsikas, Yiannis Giannakopoulos, Alexandros Hollender, Philip Lazos, Diogo Poças:
On the Complexity of Equilibrium Computation in First-Price Auctions. EC 2021: 454-476 - [c11]Aris Filos-Ratsikas, Alexandros Hollender, Katerina Sotiraki, Manolis Zampetakis:
A Topological Characterization of Modulo-p Arguments and Implications for Necklace Splitting. SODA 2021: 2615-2634 - [c10]John Fearnley, Paul W. Goldberg, Alexandros Hollender, Rahul Savani:
The complexity of gradient descent: CLS = PPAD ∩ PLS. STOC 2021: 46-59 - [i15]Aris Filos-Ratsikas, Yiannis Giannakopoulos, Alexandros Hollender, Philip Lazos, Diogo Poças:
On the Complexity of Equilibrium Computation in First-Price Auctions. CoRR abs/2103.03238 (2021) - [i14]Aris Filos-Ratsikas, Kristoffer Arnsfelt Hansen, Kasper Høgh, Alexandros Hollender:
FIXP-membership via Convex Optimization: Games, Cakes, and Markets. CoRR abs/2111.06878 (2021) - 2020
- [j1]Paul W. Goldberg, Alexandros Hollender, Warut Suksompong:
Contiguous Cake Cutting: Hardness Results and Approximation Algorithms. J. Artif. Intell. Res. 69: 109-141 (2020) - [c9]Paul W. Goldberg, Alexandros Hollender, Warut Suksompong:
Contiguous Cake Cutting: Hardness Results and Approximation Algorithms. AAAI 2020: 1990-1997 - [c8]Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros Hollender, Alexandros A. Voudouris:
Maximum Nash Welfare and Other Stories About EFX. IJCAI 2020: 24-30 - [c7]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 - [c6]Aris Filos-Ratsikas, Alexandros Hollender, Katerina Sotiraki, Manolis Zampetakis:
Consensus-Halving: Does It Ever Get Easier? EC 2020: 381-399 - [c5]Paul W. Goldberg, Alexandros Hollender, Ayumi Igarashi, Pasin Manurangsi, Warut Suksompong:
Consensus Halving for Sets of Items. WINE 2020: 384-397 - [i13]Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros Hollender, Alexandros A. Voudouris:
Maximum Nash Welfare and Other Stories About EFX. CoRR abs/2001.09838 (2020) - [i12]Aris Filos-Ratsikas, Alexandros Hollender, Katerina Sotiraki, Manolis Zampetakis:
Consensus-Halving: Does it Ever Get Easier? CoRR abs/2002.11437 (2020) - [i11]Aris Filos-Ratsikas, Alexandros Hollender, Katerina Sotiraki, Manolis Zampetakis:
A Topological Characterization of Modulo-p Arguments and Implications for Necklace Splitting. CoRR abs/2003.11974 (2020) - [i10]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 abs/2006.06566 (2020) - [i9]Paul W. Goldberg, Alexandros Hollender, Ayumi Igarashi, Pasin Manurangsi, Warut Suksompong:
Consensus Halving for Sets of Items. CoRR abs/2007.06754 (2020) - [i8]Argyrios Deligkas, Aris Filos-Ratsikas, Alexandros Hollender:
Two's Company, Three's a Crowd: Consensus-Halving for a Constant Number of Agents. CoRR abs/2007.15125 (2020) - [i7]John Fearnley, Paul W. Goldberg, Alexandros Hollender, Rahul Savani:
The Complexity of Gradient Descent: CLS = PPAD ∩ PLS. CoRR abs/2011.01929 (2020)
2010 – 2019
- 2019
- [c4]Paul W. Goldberg, Alexandros Hollender:
The Hairy Ball Problem is PPAD-Complete. ICALP 2019: 65:1-65:14 - [c3]Alexandros Hollender:
The Classes PPA-k: Existence from Arguments Modulo k. WINE 2019: 214-227 - [i6]Paul W. Goldberg, Alexandros Hollender:
The Hairy Ball Problem is PPAD-Complete. CoRR abs/1902.07657 (2019) - [i5]Paul W. Goldberg, Alexandros Hollender, Warut Suksompong:
Contiguous Cake Cutting: Hardness Results and Approximation Algorithms. CoRR abs/1911.05416 (2019) - [i4]Alexandros Hollender:
The Classes PPA-k: Existence from Arguments Modulo k. CoRR abs/1912.03729 (2019) - 2018
- [c2]Axel Bacher, Olivier Bodini, Alexandros Hollender, Jérémie O. Lumbroso:
MergeShuffle: a very fast, parallel random permutation algorithm. GASCom 2018: 43-52 - [i3]Alexandros Hollender, Paul W. Goldberg:
The Complexity of Multi-source Variants of the End-of-Line Problem, and the Concise Mutilated Chessboard. Electron. Colloquium Comput. Complex. TR18 (2018) - 2015
- [i2]Axel Bacher, Olivier Bodini, Alexandros Hollender, Jérémie O. Lumbroso:
MergeShuffle: A Very Fast, Parallel Random Permutation Algorithm. CoRR abs/1508.03167 (2015) - 2014
- [c1]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: 116-130 - [i1]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: 959 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
