Searchable List of Research Output

Filter Publications
  • Baltag, A., van Benthem, J.F.A.K. (2024) Knowability as continuity: a topological account of informational dependence.
    ArXiv.
  • Baltag, A. (1999) Truth-as-Simulation: towards a coalgebraic perspective on logic and games.
    SEN. CWI.
    Report | UvA-DARE
  • Baltag, A. (1999) Interpolation and Preservation for Pebble Logics.
    Journal of Symbolic Logic, Vol. 64 (pp 846-858)
  • Baltag, A. (1999) STS: A Structural Theory of Sets.
    Logic Journal of the IGPL, Vol. 7 (pp 481-515)
    Article | UvA-DARE
  • Baltag, A. (2001) Logics for insecure communication.
    In Proceedings of the Eighth Conference on Theoretical Aspects of Rationality and Knowledge
    Conference contribution | UvA-DARE
  • Baltag, A. (2001) A logic for suspicious players: Epistemic actions and belief-updates in games.
    Bulletin of Economic Research, Vol. 54 (pp 1-46)
    Article | UvA-DARE
  • Baltag, A. (2008) Alexandru Baltag.
    In Hendricks, V.F. Pritchard, D. (Eds.), Epistemology: 5 questions (pp 21-37) (5 questions). Automatic Press.
    Chapter | UvA-DARE
  • Baltag, A. (2016) To Know is to Know the Value of a Variable.
    In Beklemishev, L. Demri, S. Máté, A. (Eds.), Advances in Modal Logic: AiML 11 (pp 135-155). College Publications.
  • Baltussen, L.B., Blom, J., Medjkoune, L., Pop, R., Van Gorp, J., Huurdeman, H., Haaijer, L. (2014) Hard Content, Fab Front-End: Archiving Websites of Dutch Public Broadcasters.
    Alexandria, Vol. 25 (pp 69-91)
  • Banegas, G., Bernstein, D.J., Campos, F., Chou, T., Lange, T., Meyer, M., Smith, B., Sotáková, J. (2021) CTIDH: faster constant-time CSIDH.
    IACR Transactions on Cryptographic Hardware and Embedded Systems, Vol. 2021 (pp 351–387)
  • Bani, G., Belli, D., Dagan, G., Geenen, A., Skliar, A., Venkatesh, A., Baumgärtner, T., Bruni, E., Fernández, R. (2019) Adding object detection skills to visual dialogue agents.
    In Leal-Taixé, L. Roth, S. (Eds.), Computer Vision – ECCV 2018 Workshops: Munich, Germany, September 8-14, 2018 : proceedings (pp 180-187) (Lecture Notes in Computer Science, Vol. 11132). Springer.
  • Bannink, T.R., Buhrman, H., Gilyén, A., Szegedy, M. (2019) The Interaction Light Cone of the Discrete Bak–Sneppen, Contact and other local processes.
    Journal of Statistical Physics, Vol. 176 (pp 1500-1525)
  • Bannink, T.R. (2020) Quantum and stochastic processes.
    Institute for Logic, Language and Computation.
    Thesis, fully internal | UvA-DARE
  • Bar-Haim, R., Sima'an, K., Winter, Y. (2006) Choosing an Optimal Architecture for Segmentation and POS-Tagging of Modern Hebrew.
    In Proceedings of ACL 2005. Association for Computational Linguistics.
    Conference contribution | UvA-DARE
  • Bar-Haim, R., Sima'an, K., Winter, Y. (2008) Part-of-speech tagging of Modern Hebrew text.
    Natural Language Engineering, Vol. 14 (pp 223-251)
  • Bar-Haim, Roy, Sima'an, K., Winter, Yoad (2005) Choosing an optimal architecture for segmentation and POS-tagging of modern Hebrew.
    Paper | UvA-DARE
  • Barbero, F., Schulz, K., Smets, S., Velázquez-Quesada, F.R., Xie, K. (2020) Thinking About Causation: A Causal Language with Epistemic Operators.
    In Martins, M.A. Sedlár, I. (Eds.), Dynamic Logic : New Trends and Applications: Third International Workshop, DaLí 2020, Prague, Czech Republic, October 9–10, 2020 : revised selected papers (pp 17-32) (Lecture Notes in Computer Science, Vol. 12569). Springer.
  • Barbero, F., Schulz, K., Velázquez-Quesada, F.R., Xie, K. (2023) Observing interventions: a logic for thinking about experiments.
    Journal of Logic and Computation, Vol. 33 (pp 1152-1185)
  • Barezi, Elham, Calixto, I., Cho, K., Fung, Pascale (2020) A Study on the Autoregressive and non-Autoregressive Multi-label Learning.
  • Barnum, H., Smolin, J.A., Terhal, B.M. (1997) Results on quantum channel capacity..
    Technical Report quant-ph. Unknown Publisher.
    Report | UvA-DARE

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