Bernardo Subercaseaux

Publication Activity (10 Years)

Years Active: 2019-2024
Publications (10 Years): 27

Top Topics

Relational Algebra

Online Algorithms

Top Venues

Publications

Thomas Garrison, Marijn J. H. Heule, Bernardo Subercaseaux
PackIt! Gamified Rectangle Packing. CoRR (2024)
Bernardo Subercaseaux, Wojciech Nawrocki, James Gallicchio, Cayden R. Codel, Mario Carneiro, Marijn J. H. Heule
Formal Verification of the Empty Hexagon Number. CoRR (2024)
Bernardo Subercaseaux
Sometimes Hoarding is Harder than Cleaning: NP-hardness of Maximum Blocked-Clause Addition. LPAR (2024)
Bernardo Subercaseaux, John Mackey, Marijn J. H. Heule, Ruben Martins
Automated Mathematical Discovery and Verification: Minimizing Pentagons in the Plane. CICM (2024)
Fernanda Gutiérrez, Bernardo Subercaseaux
Assortment Optimization For Conference Goodies With Indifferent Attendees. CoRR (2024)
Thomas Garrison, Marijn J. H. Heule, Bernardo Subercaseaux
PackIt!: Gamified Rectangle Packing. FUN (2024)
Marcelo Arenas, Pablo Barceló, Diego Bustamente, Jose Caraball, Bernardo Subercaseaux
A Symbolic Language for Interpreting Decision Trees. CoRR (2023)
Bernardo Subercaseaux, Marijn J. H. Heule
The Packing Chromatic Number of the Infinite Square Grid is 15. TACAS (1) (2023)
Bernardo Subercaseaux, John Mackey, Marijn J. H. Heule, Ruben Martins
Minimizing Pentagons in the Plane through Automated Reasoning. CoRR (2023)
Bernardo Subercaseaux, Marijn J. H. Heule
The Packing Chromatic Number of the Infinite Square Grid is 15. CoRR (2023)
Bernardo Subercaseaux, Marijn Heule
Toward Optimal Radio Colorings of Hypercubes via SAT-solving. LPAR (2023)
Pablo Barceló, Nelson Higuera, Jorge Pérez, Bernardo Subercaseaux
On the expressiveness of Lara: A proposal for unifying linear and relational algebra. Theor. Comput. Sci. 935 (2022)
Bernardo Subercaseaux, Marijn J. H. Heule
The Packing Chromatic Number of the Infinite Square Grid Is at Least 14. SAT (2022)
Anupam Gupta, Debmalya Panigrahi, Bernardo Subercaseaux, Kevin Sun
Augmenting Online Algorithms with $\varepsilon$-Accurate Predictions. NeurIPS (2022)
Daniel Lokshtanov, Bernardo Subercaseaux
Wordle is NP-hard. CoRR (2022)
Daniel Lokshtanov, Bernardo Subercaseaux
Wordle Is NP-Hard. FUN (2022)
Marcelo Arenas, Pablo Barceló, Miguel Romero, Bernardo Subercaseaux
On Computing Probabilistic Explanations for Decision Trees. CoRR (2022)
Marcelo Arenas, Pablo Barceló, Miguel A. Romero Orth, Bernardo Subercaseaux
On Computing Probabilistic Explanations for Decision Trees. NeurIPS (2022)
Marcelo Arenas, Daniel Baez, Pablo Barceló, Jorge Pérez, Bernardo Subercaseaux
Foundations of Symbolic Languages for Model Interpretability. NeurIPS (2021)
Jérémy Barbay, Bernardo Subercaseaux
The Computational Complexity of Evil Hangman. FUN (2021)
Marcelo Arenas, Daniel Baez, Pablo Barceló, Jorge Pérez, Bernardo Subercaseaux
Foundations of Symbolic Languages for Model Interpretability. CoRR (2021)
Jérémy Barbay, Bernardo Subercaseaux
The Computational Complexity of Evil Hangman. CoRR (2020)
Pablo Barceló, Mikaël Monet, Jorge Pérez, Bernardo Subercaseaux
Model Interpretability through the lens of Computational Complexity. NeurIPS (2020)
Pablo Barceló, Mikaël Monet, Jorge Pérez, Bernardo Subercaseaux
Model Interpretability through the Lens of Computational Complexity. CoRR (2020)
Pablo Barceló, Nelson Higuera, Jorge Pérez, Bernardo Subercaseaux
On the Expressiveness of LARA: A Unified Language for Linear and Relational Algebra. ICDT (2020)
Pablo Barceló, Nelson Higuera, Jorge Pérez, Bernardo Subercaseaux
Expressiveness of Matrix and Tensor Query Languages in terms of ML Operators. DEEM@SIGMOD (2019)
Pablo Barceló, Nelson Higuera, Jorge Pérez, Bernardo Subercaseaux
On the Expressiveness of LARA: A Unified Language for Linear and Relational Algebra. CoRR (2019)