uva.nl

Institute for Logic, Language and Computation

Searchable List of Research Output

Filter Publications
  • 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., Filos-Ratsikas, A., & Voudouris, A. A. (2021). A Few Queries Go a Long Way: Information-Distortion Tradeoffs in Matching. In AAAI-21, IAAI-21, EAAI-21 proceedings: a virtual conference, February 2-9, 2021 : Thirty-Fifth AAAI Conference on Artificial Intelligence, Thirty-Third Conference on Innovative Applications of Articicial Intelligence, Eleventh Symposium on Educational Advances in Artificial Intelligence (Vol. 6, pp. 5078-5085). (Proceedings of the AAAI Conference on Artificial Intelligence; Vol. 35). AAAI Press. https://doi.org/10.48550/arXiv.2009.06543, https://doi.org/10.1609/aaai.v35i6.16642 >>>
  • Amanatidis, G., Birmpas, G., & Markakis, E. (2020). A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint. Information Processing Letters, 163, Article 106010. Advance online publication. https://doi.org/10.1016/j.ipl.2020.106010 >>>
  • 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. Advance online publication. 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. Advance online publication. 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 >>>
  • Ambainis, A., & de Wolf, R. M. (2000). Average-Case Quantum Query Complexity. Lecture Notes in Computer Science, 1770, 133-144. >>>
  • Ambainis, A., & de Wolf, R. M. (2001). Average-case quantum query complexity. Journal of Physics. A, Mathematical and General, 34(35), 6741-6754. https://doi.org/10.1088/0305-4470/34/35/302 >>>
  • Ambainis, A., Mosca, M., Tapp, A., & de Wolf, R. M. (2000). Private quantum channels. In Proceedings of the 41st IEEE Foundations of Computer Science (FOCS 2000) (pp. 547-553) >>>
  • Ambainis, A., Spalek, R., & de Wolf, R. M. (2005). Quantum Direct Product Theorems for Symmetric Functions and Time-Space Tradeoffs. Unknown Publisher. >>>
  • Ambainis, A., Spalek, R., & de Wolf, R. M. (2006). A New Quantum Lower Bound Method, with Applications to Direct ProductTheorems and Time-Space Tradeoffs. In Proceedings of 38th Annual ACM Symposium on Theory of Computing (STOC'06) (pp. 618-633). >>>
  • Ambainis, A., & Spalek, R. (2006). Quantum Algorithms for Matching and Network Flows. Lecture Notes in Computer Science, 3884, 172-183. >>>
  • Ambati, B. R., Deoskar, T., & Steedman, M. (2016). Shift-Reduce CCG Parsing using Neural Network Models. In K. Knight, A. Nenkova, & O. Rambow (Eds.), NAACL HLT 2016 : The 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies: Proceedings of the Conference : June 12-17, 2016, San Diego, California, USA (pp. 447-453). The Association for Computational Linguistics. https://doi.org/10.18653/v1/N16-1052 >>>
  • Ambos-Spies, K. (Guest ed.), Beckmann, A. (Guest ed.), Buss, S. R. (Guest ed.), & Löwe, B. (Guest ed.) (2012). Computability in Europe 2009. Annals of Pure and Applied Logic, 163(5), 483-620. https://www.sciencedirect.com/journal/annals-of-pure-and-applied-logic/vol/163/issue/5 >>>
1 ... 7 8 9 10 11 12 13 14 15 ... 289

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