Theo dõi
Alexandros Hollender
Alexandros Hollender
Post-Doctoral Research Fellow, All Souls College, University of Oxford
Email được xác minh tại cs.ox.ac.uk
Tiêu đề
Trích dẫn bởi
Trích dẫn bởi
Năm
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
1412021
The Complexity of Gradient Descent: CLS = PPAD ∩ PLS
J Fearnley, PW Goldberg, A Hollender, R Savani
Journal of the ACM (JACM) 70 (1), 7:1-7:74, 2022
1022022
Contiguous Cake Cutting: Hardness Results and Approximation Algorithms
PW Goldberg, A Hollender, W Suksompong
Journal of Artificial Intelligence Research (JAIR) 69, 109-141, 2020
412020
On the Complexity of Equilibrium Computation in First-Price Auctions
A Filos-Ratsikas, Y Giannakopoulos, A Hollender, P Lazos, D Poças
SIAM Journal on Computing (SICOMP) 52 (1), 80-131, 2023
372023
The Hairy Ball problem is PPAD-complete
PW Goldberg, A Hollender
Journal of Computer and System Sciences (JCSS) 122, 34-62, 2021
332021
Consensus-Halving: Does It Ever Get Easier?
A Filos-Ratsikas, A Hollender, K Sotiraki, M Zampetakis
SIAM Journal on Computing (SICOMP) 52 (2), 412-451, 2023
312023
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
292015
Separations in proof complexity and TFNP
M Göös, A Hollender, S Jain, G Maystre, W Pires, R Robere, R Tao
IEEE Symposium on Foundations of Computer Science (FOCS), 1150-1161, 2022
272022
Further collapses in TFNP
M Göös, A Hollender, S Jain, G Maystre, W Pires, R Robere, R Tao
Computational Complexity Conference (CCC), 33:1-33:15, 2022
242022
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
222021
Consensus halving for sets of items
PW Goldberg, A Hollender, A Igarashi, P Manurangsi, W Suksompong
Mathematics of Operations Research (MOR) 47 (4), 3357–3379, 2022
212022
Pure-circuit: Strong Inapproximability for PPAD
A Deligkas, J Fearnley, A Hollender, T Melissourgos
IEEE Symposium on Foundations of Computer Science (FOCS), 159-170, 2022
212022
FIXP-membership via Convex Optimization: Games, Cakes, and Markets
A Filos-Ratsikas, KA Hansen, K Høgh, A Hollender
IEEE Symposium on Foundations of Computer Science (FOCS), 827-838, 2022
202022
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
192021
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
192014
Two's Company, Three's a Crowd: Consensus-Halving for a Constant Number of Agents
A Deligkas, A Filos-Ratsikas, A Hollender
Artificial Intelligence (AIJ) 313, 2022
182022
Constant inapproximability for PPA
A Deligkas, J Fearnley, A Hollender, T Melissourgos
ACM Symposium on Theory of Computing (STOC), 1010-1023, 2022
152022
The Classes PPA-k: Existence from Arguments Modulo k
A Hollender
Theoretical Computer Science (TCS) 885, 15-29, 2021
142021
The Frontier of Intractability for EFX with Two Agents
PW Goldberg, K Høgh, A Hollender
International Symposium on Algorithmic Game Theory (SAGT), 290-307, 2023
132023
The complexity of multi-source variants of the End-of-Line problem, and the concise mutilated chessboard
A Hollender, P Goldberg
Electronic Colloquium on Computational Complexity 25, 120, 2018
92018
Hệ thống không thể thực hiện thao tác ngay bây giờ. Hãy thử lại sau.
Bài viết 1–20