Bernardo Subercaseaux

Orcid: 0000-0003-2295-1299

Affiliations:
  • Carnegie Mellon University, USA


According to our database1, Bernardo Subercaseaux authored at least 21 papers between 2019 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Pentagon Minimization without Computation.
CoRR, 2024

Assortment Optimization For Conference Goodies With Indifferent Attendees.
CoRR, 2024

Automated Mathematical Discovery and Verification: Minimizing Pentagons in the Plane.
Proceedings of the Intelligent Computer Mathematics - 17th International Conference, 2024

Sometimes Hoarding is Harder than Cleaning: NP-hardness of Maximum Blocked-Clause Addition.
Proceedings of the LPAR 2024: Proceedings of 25th Conference on Logic for Programming, 2024

A Uniform Language to Explain Decision Trees.
Proceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning, 2024

Formal Verification of the Empty Hexagon Number.
Proceedings of the 15th International Conference on Interactive Theorem Proving, 2024

PackIt!: Gamified Rectangle Packing.
Proceedings of the 12th International Conference on Fun with Algorithms, 2024

2023
Minimizing Pentagons in the Plane through Automated Reasoning.
CoRR, 2023

A Symbolic Language for Interpreting Decision Trees.
CoRR, 2023

The Packing Chromatic Number of the Infinite Square Grid is 15.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2023

Toward Optimal Radio Colorings of Hypercubes via SAT-solving.
Proceedings of the LPAR 2023: Proceedings of 24th International Conference on Logic for Programming, 2023

2022
On the expressiveness of Lara: A proposal for unifying linear and relational algebra.
Theor. Comput. Sci., 2022

The Packing Chromatic Number of the Infinite Square Grid Is at Least 14.
Proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing, 2022

On Computing Probabilistic Explanations for Decision Trees.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Augmenting Online Algorithms with $\varepsilon$-Accurate Predictions.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Wordle Is NP-Hard.
Proceedings of the 11th International Conference on Fun with Algorithms, 2022

2021
Foundations of Symbolic Languages for Model Interpretability.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

The Computational Complexity of Evil Hangman.
Proceedings of the 10th International Conference on Fun with Algorithms, 2021

2020
Model Interpretability through the lens of Computational Complexity.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

On the Expressiveness of LARA: A Unified Language for Linear and Relational Algebra.
Proceedings of the 23rd International Conference on Database Theory, 2020

2019
Expressiveness of Matrix and Tensor Query Languages in terms of ML Operators.
Proceedings of the 3rd International Workshop on Data Management for End-to-End Machine Learning, 2019


  Loading...