Searchable List of Research Output

Filter Publications
  • Alonso, O., Kamps, J., & Karlgren, J. (Eds.) (2014). ESAIR’14: proceedings of the 7th International Workshop on Exploiting Semantic Annotations in Information Retrieval : November 7, 2014, Shanghai, China. ACM. http://dl.acm.org/citation.cfm?id=2663712 >>>
  • Alonso, O., Kamps, J., & Karlgren, J. (2014). Seventh Workshop on Exploiting Semantic Annotations in Information Retrieval (ESAIR'14): CIKM 2014 workshop. In CIKM '14: proceedings of the 2014 ACM International Conference on Information and Knowledge Management: November 3-7, 2014, Shanghai, China (pp. 2094-2095). Association for Computing Machinery. https://doi.org/10.1145/2661829.2663539 >>>
  • Alonso, O., Kamps, J., & Karlgren, J. (2014). Foreword. In ESAIR'14: proceedings of the 7th International Workshop on Exploiting Semantic Annotations in Information Retrieval : November 7, 2014, Shanghai, China (pp. iii). ACM. http://dl.acm.org/citation.cfm?id=2663712 >>>
  • Alonso, O., & Kamps, J. (2013). Graph search and beyond. Dagstuhl Reports, 3(10), 108-111. https://doi.org/10.4230/DagRep.3.10.92 >>>
  • Alonso, O., & Kamps, J. (2015). Beyond graph search: Exploring and exploiting rich connected data sets. In P. Cimiano, F. Frasincar, G-J. Houben, & D. Schwabe (Eds.), Engineering the Web in the Big Data Era: 15th International Conference, ICWE 2015, Rotterdam, The Netherlands, June 23-26, 2015 : proceedings (pp. 3-12). (Lecture Notes in Computer Science; Vol. 9114). Springer. https://doi.org/10.1007/978-3-319-19890-3_1 >>>
  • Alstein, D., Hoepman, J. H., Olivier, B. E., & van der Put, P. I. A. (1994). Self-Stabilizing Mutual Exclusion on Directed Graphs (extended abstract). In E. Backer (Ed.), Computing science in the Netherlands: proceedings: CSN 94 (pp. 42-53). Stichting Mathematisch Centrum. >>>
  • Altshuler, D., & Schlöder, J. J. (2021). If pictures are stative, what does this mean for discourse interpretation? In P. G. Grosz, L. Martí, H. Pearson, Y. Sudo, & S. Zobel (Eds.), Sinn und Bedeutung 25: proceedings (pp. 19-36). University College London and Queen Mary University of London. https://doi.org/10.18148/sub/2021.v25i0.922 >>>
  • Amanatidis, G., Birmpas, G., Filos-Ratsikas, A., Hollender, A., & Voudouris, A. A. (2020). Maximum Nash welfare and other stories about EFX. In C. Bessiere (Ed.), Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence: IJCAI-20 : Yokohama (pp. 24-30). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2020/4 >>>
  • Amanatidis, G., Birmpas, G., Filos-Ratsikas, A., & Voudouris, A. A. (2020). Peeking behind the ordinal curtain: Improving distortion via cardinal queries. In AAAI-20, IAAI-20, EAAI-20 proceedings: Thirty-Fourth AAAI Conference on Artificial Intelligence, Thirty-Second Conference on Innovative Applications of Artificial Intelligence, The Tenth Symposium on Educational Advances in Artificial Intelligence : February 7–12th, 2020, New York Hilton Midtown, New York, New York, USA (Vol. 2, pp. 1782-1789). (Proceedings of the AAAI Conference on Artificial Intelligence; Vol. 34). AAAI Press. https://doi.org/10.1609/aaai.v34i02.5544 >>>
  • Amanatidis, G., Birmpas, G., & Markakis, E. (2020). A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint. Information Processing Letters, 163, [106010]. https://doi.org/10.1016/j.ipl.2020.106010 >>>
  • Amanatidis, G., Birmpas, G., Filos-Ratsikas, A., & Voudouris, A. A. (2021). A Few Queries Go a Long Way: Information-Distortion Tradeoffs in Matching. In Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI 2021) AAAI Press. https://arxiv.org/abs/2009.06543 >>>
  • Amanatidis, G., & Kleer, P. (2020). Rapid mixing of the switch Markov chain for strongly stable degree sequences. Random Structures and Algorithms, 57(3), 637-657. https://doi.org/10.1002/rsa.20949 >>>
  • 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, 841, 94-109. https://doi.org/10.1016/j.tcs.2020.07.006 >>>
  • Amano, K., Vitanyi, P. M. B., & Watanabe, O. (2000). On the length of the Monopolist Game. Computing, 2000(62), 41-48. >>>
  • Ambainis, A., Bačkurs, A., Smotrovs, J., & de Wolf, R. (2013). Optimal quantum query bounds for almost all Boolean functions. In N. Portier, & T. Wilke (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 fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.STACS.2013.446 >>>
  • Ambainis, A., Belovs, A., Regev, O., & de Wolf, R. (2016). Efficient quantum algorithms for (gapped) group testing and junta testing. In R. Krauthgamer (Ed.), 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. https://doi.org/10.1137/1.9781611974331.ch65 >>>
  • Ambainis, A., Buhrman, H. M., Gasarch, W. I., Kalayanasundaram, B., & Torenvliet, L. (2000). The communication complexity of enumeration, elimination and selection. In Proceedings 15th IEEE Conference on Computational Complexity (pp. 44-53). >>>
  • Ambainis, A., Buhrman, H. M., Gasarch, W. I., Kalayanasundaram, B., & Torenvliet, L. (2001). The communication complexity of enumeration, elimination and selection. Journal of Computer and System Sciences, 63, 148-184. https://doi.org/10.1006/jcss.2001.1761 >>>
  • 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. https://doi.org/10.1109/CCC.2013.26 >>>
  • Ambainis, A., & de Wolf, R. (2014). How Low can Approximate Degree and Quantum Query Complexity be for Total Boolean Functions? Computational Complexity, 23(2), 305-322. https://doi.org/10.1007/s00037-014-0083-2 >>>

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