uva.nl

Institute for Logic, Language and Computation

Searchable List of Research Output

Filter Publications
  • Amanatidis, G., Birmpas, G., Fusco, F., Lazos, P., Leonardi, S., Reiffenhäuser, R. (2024) Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness.
    Mathematics of operations research, Vol. 49 (pp 2425-2445)
  • Amanatidis, G., Birmpas, G., Lazos, P., Leonardi, S., Reiffenhäuser, R. (2023) Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria.
    In EC 2023: Proceedings of the 24th ACM Conference on Economics and Computation : July 9-12, 2023, London, United Kingdom (pp 67-87). Association for Computing Machinery.
  • Amanatidis, G., Birmpas, G., Markakis, E. (2020) A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint.
    Information Processing Letters, Vol. 163
  • Amanatidis, G., Kleer, P., Schäfer, G. (2022) Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online.
    Mathematics of operations research, Vol. 47 (pp 2286-2309)
  • Amanatidis, G., Kleer, P. (2020) Rapid mixing of the switch Markov chain for strongly stable degree sequences.
    Random Structures and Algorithms, Vol. 57 (pp 637-657)
  • Amanatidis, G., Klumper, S., Markakis, E., Schäfer, G., Tsikiridis, A. (2024) Partial Allocations in Budget-Feasible Mechanism Design: Bridging Multiple Levels of Service and Divisible Agents.
    In Garg, J. Klimm, M. Kong, Y. (Eds.), Web and Internet Economics: 19th International Conference, WINE 2023, Shanghai, China, December 4–8, 2023 : proceedings (pp 41-58) (Lecture Notes in Computer Science
    Advanced Research in Computing and Software Science, Vol. 14413). Springer.
  • Amanatidis, G., Markakis, E., Ntokos, A. (2020) Multiple birds with one stone: Beating 1/2 for EFX and GMMS via envy cycle elimination.
    Theoretical Computer Science, Vol. 841 (pp 94-109)
  • Amanatidis, Georgios, Berger, Ben, Ezra, T., Feldman, Michal, Fusco, Federico, Reiffenhäuser, R., Tsikiridis, A. (2025) Pandora's box problem with time constraints.
    Artificial Intelligence, Vol. 349
  • Amanatidis, Georgios, Birmpas, G., Lazos, P., Leonardi, S., Reiffenhäuser, R. (2025) Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria.
    Mathematics of operations research, Vol. 50 (pp 2717-2737)
  • Amanatidis, Georgios, Birmpas, G., Lazos, P., Leonardi, S., Reiffenhäuser, R. (2025) Algorithmically Fair Maximization of Multiple Submodular Objective Functions.
    In Vorobeychik, Yevgeniy Das, Sanmay Nowe, Ann (Eds.), AAMAS '25: Proceedings of the 24th International Conference on Autonomous Agents and Multiagent Systems : May 19-23, 2025, Detroit, Michigan, USA (pp 115-123). International Foundation for Autonomous Agents and Multiagent Systems.
    Conference contribution | UvA-DARE
  • Amanatidis, Georgios, Fusco, Federico, Lazos, P., Leonardi, S., Marchetti-Spaccamela, Alberto, Reiffenhäuser, R. (2026) Submodular maximization subject to a knapsack constraint: Combinatorial algorithms with near-optimal adaptive complexity.
    Theoretical Computer Science, Vol. 1060
  • Amanatidis, Georgios, Fusco, Federico, Reiffenhäuser, R., Tsikiridis, A. (2026) Pandora’s Box Problem Over Time.
    In Mavronicolas, Marios Qi, Qi Schoenebeck, Grant (Eds.), Web and Internet Economics: 20th International Conference, WINE 2024, Edinburgh, UK, December 2–5, 2024 : proceedings (pp 494-512) (Lecture Notes in Computer Science, Vol. 15534). Springer.
  • Amano, K., Vitanyi, P.M.B., Watanabe, O. (2000) On the length of the Monopolist Game.
    Computing, Vol. 2000 (pp 41-48)
    Article | UvA-DARE
  • Ambainis, A., Bačkurs, A., Smotrovs, J., de Wolf, R. (2013) Optimal quantum query bounds for almost all Boolean functions.
    In Portier, N. Wilke, T. (Eds.), 30th International Symposium on Theoretical Aspects of Computer Science: STACS '13, February 27th to March 2nd, 2013, Kiel, Germany (pp 446-453) (Leibniz International Proceedings in Informatics, Vol. 20). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
  • Ambainis, A., Belovs, A., Regev, O., de Wolf, R. (2016) Efficient quantum algorithms for (gapped) group testing and junta testing.
    In Krauthgamer, R. (Eds.), Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms: SODA 2016 : January 10-12, 2016, Crystal Gateway Marriott, Arlington, Virginia, USA (pp 903-922). Society for Industrial and Applied Mathematics.
  • Ambainis, A., Buhrman, H., Gasarch, W.I., Kalayanasundaram, B., Torenvliet, L. (2000) The communication complexity of enumeration, elimination and selection.
    In Proceedings 15th IEEE Conference on Computational Complexity: Florence (pp 44-53)
    Conference contribution | UvA-DARE
  • Ambainis, A., Buhrman, H., Gasarch, W.I., Kalayanasundaram, B., Torenvliet, L. (2001) The communication complexity of enumeration, elimination and selection.
    Journal of Computer and System Sciences, Vol. 63 (pp 148-184)
  • Ambainis, A., de Wolf, R. (2000) Average-Case Quantum Query Complexity.
    Lecture Notes in Computer Science, Vol. 1770 (pp 133-144)
    Article | UvA-DARE
  • Ambainis, A., de Wolf, R. (2001) Average-case quantum query complexity.
    Journal of Physics. A, Mathematical and General, Vol. 34 (pp 6741-6754)
  • Ambainis, A., de Wolf, R. (2013) How Low Can Approximate Degree and Quantum Query Complexity be for Total Boolean Functions?.
    In CCC 2013 : 2013 IEEE Conference on Computational Complexity: proceedings : 5-7 June 2013, Palo Alto, California, USA (pp 179-184). IEEE.
    Conference contribution | https://doi.org/10.1109/CCC.2013.26 | UvA-DARE
1 ... 9 10 11 12 13 14 15 16 17 ... 337

The data of this list is taken from the Pure database. If you find output is missing from the list, please follow the previous link to find out how to submit to Pure. In case there are mistakes in PURE, please contact