Searchable List of Research Output

Filter Publications
  • Airiau, S., Endriss, U., & Halpern, J. Y. (2009). Solution to Exchanges 8.1 puzzle: Identifying the champion. SIGecom Exchanges, 8(2). http://www.sigecom.org/exchanges/volume_8/2/airiau.pdf >>>
  • Airiau, S., & Endriss, U. (2009). Iterated majority voting. In F. Rossi, & A. Tsoukias (Eds.), Algorithmic Decision Theory: First International Conference, ADT 2009, Venice, Italy, October 20-23, 2009 : proceedings (pp. 38-49). (Lecture Notes in Computer Science; Vol. 5783), (Lecture Notes in Artificial Intelligence). Springer. https://doi.org/10.1007/978-3-642-04428-1_4 >>>
  • Airiau, S., & Endriss, U. (2010). Multiagent resource allocation with sharable items: simple protocols and Nash equilibria. In W. van der Hoek, G. A. Kaminka, Y. Lespérance, M. Luck, & S. Sen (Eds.), AAMAS 2010: the 9th International Conference on Autonomous Agents and Multiagent Systems, May 10-14, 2010, Toronto, Canada : conference proceedings (Vol. 1, pp. 167-174). IFAAMAS. https://dl.acm.org/citation.cfm?id=1838206.1838230 >>>
  • Airiau, S., & Endriss, U. (2014). Multiagent Resource Allocation with Sharable Items. Autonomous Agents and Multi-Agent Systems, 28(6), 956-985. https://doi.org/10.1007/s10458-013-9245-x >>>
  • Airiau, S., & Sen, S. (2008). A fair payoff distribution for myopic rational agents. In U. Endriss, & P. W. Goldberg (Eds.), Proceedings of the 2nd International Workshop on Computational Social Choice (COMSOC-2008) (pp. 15-26). University of Liverpool, Department of Computer Science. http://www.csc.liv.ac.uk/~pwg/COMSOC-2008/papers/PDF/37-airiau.pdf >>>
  • Airiau, S., & Sen, S. (2009). A fair payoff distribution for myopic rational agents. In K. S. Decker, J. S. Sichman, C. Sierra, & C. Castelfranchi (Eds.), AAMAS 2009: the 8th International Conference on Autonomous Agents and Multiagent Systems: May 10-15, 2009, Budapest, Hungary: proceedings. - Volume 2 (pp. 1305-1306). IFAAMAS. http://portal.acm.org/citation.cfm?id=1558109.1558265 >>>
  • Airiau, S., & Sen, S. (2010). Distributed computation of Kernel-stable coalition payoff distributions. In Proceedings of the 1st Workshop on Cooperative Games in Multiagent Systems (CoopMAS-2010), Toronto, Canada >>>
  • Airiau, S., & Sen, S. (2010). On the stability of an optimal coalition structure. In H. Coelho, R. Studer, & M. Wooldridge (Eds.), 19th European Conference on Artificial Intelligence (ECAI 2010), Lisbon, Portugal (pp. 203-208). IOS Press. https://doi.org/10.3233/978-1-60750-606-5-203 >>>
  • Airiau, S. (2013). Cooperative Games and Multiagent Systems. Knowledge Engineering Review, 28(4), 381-424. https://doi.org/10.1017/S0269888913000106 >>>
  • Alagic, G., Brakerski, Z., Dulek, Y., & Schaffner, C. (2021). Impossibility of Quantum Virtual Black-Box Obfuscation of Classical Circuits. In T. Malkin, & C. Peikert (Eds.), Advances in Cryptology – CRYPTO 2021: 41st Annual International Cryptology Conference, CRYPTO 2021, virtual event, August 16–20, 2021 : proceedings (Vol. I, pp. 497-525). (Lecture Notes in Computer Science; Vol. 12825). Springer. https://doi.org/10.1007/978-3-030-84242-0_18 >>>
  • Alagic, G., Broadbent, A., Fefferman, B., Gagliardoni, T., Schaffner, C., & St. Jules, M. (2016). Computational security of quantum encryption. In A. C. A. Nascimento, & P. Barreto (Eds.), Information Theoretic Security: 9th International Conference, ICITS 2016, Tacoma, WA, USA, August 9–12, 2016 : revised selected papers (pp. 47-71). (Lecture Notes in Computer Science; Vol. 10015). Springer. https://doi.org/10.1007/978-3-319-49175-2_3 >>>
  • Alagic, G., Dulek, Y., Schaffner, C., & Speelman, F. (2017). Quantum Fully Homomorphic Encryption with Verification. In T. Takagi, & T. Peyrin (Eds.), Advances in Cryptology – ASIACRYPT 2017: 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China, December 3-7, 2017 : proceedings (Vol. 1, pp. 438-467). (Lecture Notes in Computer Science; Vol. 10624). Springer. https://doi.org/10.1007/978-3-319-70694-8_16 >>>
  • Alagic, G., Jeffery, S., Ozols, M., & Poremba, A. (2020). On quantum chosen-ciphertext attacks and learning with errors. Cryptography, 4(1), [10]. https://doi.org/10.3390/cryptography4010010 >>>
  • Alama, J., Knoks, A., & Uckelman, S. L. (2011). Dialogue games for classical logic. In M. Giese, & R. Kuznets (Eds.), TABLEAUX 2011: Workshops, Tutorials, and Short Papers (pp. 82-86). Universität Bern. http://www.tableaux11.unibe.ch/uploads/Site/proceedings.pdf >>>
  • Alberti, G., Balogh, K., & Dekker, P. J. E. (2002). Proceedings of the Seventh Symposium on Logic and Language. Pécs University. >>>
  • Alberts, H., Huang, T., Deshpande, Y., Liu, Y., Cho, K., Vania, C., & Coimbra Alves Cavalcanti Calixto, I. (2021). VisualSem: a high-quality knowledge graph for vision and language. In Proceedings of the 1st Workshop on Multilingual Representation Learning (pp. 138-152). The Association for Computational Linguistics. https://aclanthology.org/2021.mrl-1.13.pdf >>>
  • Alechina, N., Demri, S., & de Rijke, M. (2003). A modal perspective on path constraints. Journal of Logic and Computation, 13(6), 939-956. https://doi.org/10.1093/logcom/13.6.939 >>>
  • Alechina, N., Liu, F., & Logan, B. (2018). Efficient Minimal Preference Change. Journal of Logic and Computation, 28(8), 1715–1733. https://doi.org/10.1093/logcom/exv027 >>>
  • Alechina, N. A., & de Rijke, M. (1998). Describing and Querying semistructured data: some expressiveness results. In Advances in databases (-; No. -). Springer. >>>
  • Alechina, N. A., Demri, S., & de Rijke, M. (2001). Path constraints from a modal logic point of view. In Proceedings KRDB 2001 >>>

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