publications

in reversed chronological order.

Also, you can check my updated list of papers in Google Scholar or DBLP

  1. Wordle is NP-hard
    Lokshtanov, Daniel, and Subercaseaux, Bernardo
    2022
  1. The Computational Complexity of Evil Hangman
    Barbay, Jérémy, and Subercaseaux, Bernardo
    In 10th International Conference on Fun with Algorithms, FUN 2021, May 30 to June 1, 2021, Favignana Island, Sicily, Italy 2021
  2. Foundations of Symbolic Languages for Model Interpretability
    Arenas, Marcelo, Baez, Daniel, Barceló, Pablo, Pérez, Jorge, and Subercaseaux, Bernardo
    Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021 2021
  1. Model Interpretability through the lens of Computational Complexity
    Barcel√≥, Pablo,¬†Monet, Mika√ęl,¬†P√©rez, Jorge,¬†and Subercaseaux, Bernardo
    In Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020, December 6-12, 2020, virtual 2020
  2. On the Expressiveness of LARA: A Unified Language for Linear and Relational Algebra
    Barceló, Pablo, Higuera, Nelson, Pérez, Jorge, and Subercaseaux, Bernardo
    In 23rd International Conference on Database Theory, ICDT 2020, March 30-April 2, 2020, Copenhagen, Denmark 2020
  1. Expressiveness of Matrix and Tensor Query Languages in terms of ML Operators
    Barceló, Pablo, Higuera, Nelson, Pérez, Jorge, and Subercaseaux, Bernardo
    In Proceedings of the 3rd International Workshop on Data Management for End-to-End Machine Learning, DEEM@SIGMOD 2019, Amsterdam, The Netherlands, June 30, 2019 2019
      1. Wavelet Trees for Competitive Programming
        Castro, Robinson, Lehmann, Nico, Pérez, Jorge, and Subercaseaux, Bernardo
        Olympiads in Informatics Jul 2016