Hoogland, E. (1999) Algebraic Characterizations of Various Beth Definability Properties.

vg logic/info (oud WINS).

Report | UvA-DARE

Hoogland, E. (2000) Algebraic characterizations of various Beth definability properties.

Studia Logica, Vol. 65 (pp 91-112)

Article | UvA-DARE

Hoogland, E. (2001) Definability and Interpolation: Model-theoretic investigations.

Institute for Logic, Language and Computation.

Thesis, fully internal | UvA-DARE

Hornischer, L. (2019) Toward a Logic for Neural Networks.

In Sedlár, I. Blicha, M. (Eds.), The Logica Yearbook 2018 (pp 133-148). College Publications.

Hornischer, L. (2020) Logics of Synonymy.

Journal of Philosophical Logic, Vol. 49 (pp 767–805)

Article | https://doi.org/10.1007/s10992-019-09537-5 | UvA-DARE

Hornischer, L. (2021) The Logic of Information in State Spaces.

Review of Symbolic Logic, Vol. 14 (pp 155-186)

Article | https://doi.org/10.1017/S1755020320000222 | UvA-DARE

Hornischer, L.A. (2021) Dynamical systems via domains: Toward a unified foundation of symbolic and non-symbolic computation.

ILLC dissertation series. Institute for Logic, Language and Computation.

Thesis, fully internal | UvA-DARE

Hoshi, T. (2009) Epistemic Dynamics and Protocol Information.

Thesis, fully external | UvA-DARE

Hosseini, K., Beelen, K., Colavizza, G., Ardanuy, M.C. (2021) Neural Language Models for Nineteenth-Century English.

Journal of Open Humanities Data, Vol. 7

Article | https://doi.org/10.48550/arXiv.2105.11321 | UvA-DARE

Hoyer, P., Lee, T.J., Spalek, R. (2006) Negative weights makes adversaries stronger.

Berkeley University.

Working paper | UvA-DARE

Hoyer, P., Spalek, R. (2003) Quantum circuits with unbounded fan-out.

In Symposium on Theoretical Aspects of Computer Science

Hoyer, P., Spalek, R. (2005) Quantum Fan-out is Powerful.

Theory of Computing, Vol. 1 (pp 83-101)

Article | http://theoryofcomputing.org/articles/main/v001/a005/index.html | UvA-DARE

Hoyer, P., Spalek, R. (2005) Tight adversary bounds for composite functions.

Unknown Publisher.

Report | http://homepages.cwi.nl/~sr/papers/compose.pdf | UvA-DARE

Hoyer, P., Spalek, R. (2005) Lower Bounds on Quantum Query Complexity.

Bulletin of the European Association for Theoretical Computer Science, Vol. 87 (pp 78-103)

Article | http://www.eatcs.org/images/bulletin/beatcs87.pdf | UvA-DARE

Hsu, A.S., Chater, N., Vitányi, P. (2013) Language learning from positive evidence, reconsidered: A simplicity-based approach.

Topics in Cognitive Science, Vol. 5 (pp 35-55)

Article | https://doi.org/10.1111/tops.12005 | UvA-DARE

Hsu, A.S., Chater, N., Vitányi, P.M.B. (2011) The probabilistic analysis of language acquisition: Theoretical, computational, and experimental analysis.

Cognition, Vol. 120 (pp 380-390)

Article | https://doi.org/10.1016/j.cognition.2011.02.013 | UvA-DARE

Hu, Z., Havrylov, S., Titov, I., Cohen, S.B. (2020) Obfuscation for privacy-preserving syntactic parsing.

In Bouma, G. Matsumoto, Y. Oepen, S. Sagae, K. Seddah, D. Sun, W. Søgaard, A. Tsarfaty, R. Zeman, D. (Eds.), The 16th International Conference on Parsing Technologies and IWPT 2020 Shared Task on Parsing into Enhanced Universal Dependencies: IWPT 2020 : Proceedings of the Conference : July 9, 2020 (pp 62-72). Association for Computational Linguistics.

Huang, J., Chang, Y., Cheng, X., Kamps, J., Murdock, V., Wen, J.-R., Liu, Y. (2020) SIGIR '20: proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval : July 25-30, 2020, virtual event, China.

Association for Computing Machinery.

Book (Editorship) | https://doi.org/10.1145/3397271 | UvA-DARE

Huang, N.T., Deshpande, Y.R., Liu, Y., Alberts, H., Cho, K., Vania, C., Calixto, I. (2020) Learning Robust Multimodal Knowledge Graph Representations.

Paper | https://nhuang37.github.io/publication/multimodalkb/ | UvA-DARE

Huang, Xuan, Burgoyne, J.A., Honing, H. (2022) What We Remember is the Prototypical: Pop Music in China from the 1970s to 2010s.

Poster | UvA-DARE