In: 32nd Computational Complexity Conference, CCC 2017 Leibniz International Proceedings in Informatics, LIPIcs (79) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 30:1-30:24. ISSN 1868-8969
On the polynomial parity argument complexity of the combinatorial nullstellensatz
In: Proceedings of the Seventh International Conference Digital Presentation and Preservation of Cultural and Scientific Heritage DiPP (7) Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Sofia, pp. 123-132. ISSN 1314-4006
In: K + K = 120. Papers dedicated to László Kálmán and András Kornai on the occasion of their 60th birthdays Research Institute for Linguistics, Hungarian Academy of Sciences (RIL HAS), Budapest, pp. 1-16.
Building word embeddings from dictionary definitions
In: 33rd International Symposium on Computational Geometry, SoCG 2017 Leibniz International Proceedings in Informatics, LIPIcs (77) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 3:1-3:15. ISSN 1868-8969