default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBernardo Subercaseaux
Person information
- affiliation: Carnegie Mellon University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j1]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: 105-127 (2022)
Conference and Workshop Papers
- 2024
- [c15]Thomas Garrison, Marijn J. H. Heule, Bernardo Subercaseaux:
PackIt!: Gamified Rectangle Packing. FUN 2024: 14:1-14:19 - [c14]Bernardo Subercaseaux, Wojciech Nawrocki, James Gallicchio, Cayden R. Codel, Mario Carneiro, Marijn J. H. Heule:
Formal Verification of the Empty Hexagon Number. ITP 2024: 35:1-35:19 - [c13]Bernardo Subercaseaux:
Sometimes Hoarding is Harder than Cleaning: NP-hardness of Maximum Blocked-Clause Addition. LPAR 2024: 408-425 - [c12]Bernardo Subercaseaux, John Mackey, Marijn J. H. Heule, Ruben Martins:
Automated Mathematical Discovery and Verification: Minimizing Pentagons in the Plane. CICM 2024: 21-41 - 2023
- [c11]Bernardo Subercaseaux, Marijn Heule:
Toward Optimal Radio Colorings of Hypercubes via SAT-solving. LPAR 2023: 386-404 - [c10]Bernardo Subercaseaux, Marijn J. H. Heule:
The Packing Chromatic Number of the Infinite Square Grid is 15. TACAS (1) 2023: 389-406 - 2022
- [c9]Daniel Lokshtanov, Bernardo Subercaseaux:
Wordle Is NP-Hard. FUN 2022: 19:1-19:8 - [c8]Anupam Gupta, Debmalya Panigrahi, Bernardo Subercaseaux, Kevin Sun:
Augmenting Online Algorithms with $\varepsilon$-Accurate Predictions. NeurIPS 2022 - [c7]Marcelo Arenas, Pablo Barceló, Miguel A. Romero Orth, Bernardo Subercaseaux:
On Computing Probabilistic Explanations for Decision Trees. NeurIPS 2022 - [c6]Bernardo Subercaseaux, Marijn J. H. Heule:
The Packing Chromatic Number of the Infinite Square Grid Is at Least 14. SAT 2022: 21:1-21:16 - 2021
- [c5]Jérémy Barbay, Bernardo Subercaseaux:
The Computational Complexity of Evil Hangman. FUN 2021: 23:1-23:12 - [c4]Marcelo Arenas, Daniel Báez, Pablo Barceló, Jorge Pérez, Bernardo Subercaseaux:
Foundations of Symbolic Languages for Model Interpretability. NeurIPS 2021: 11690-11701 - 2020
- [c3]Pablo Barceló, Nelson Higuera, Jorge Pérez, Bernardo Subercaseaux:
On the Expressiveness of LARA: A Unified Language for Linear and Relational Algebra. ICDT 2020: 6:1-6:20 - [c2]Pablo Barceló, Mikaël Monet, Jorge Pérez, Bernardo Subercaseaux:
Model Interpretability through the lens of Computational Complexity. NeurIPS 2020 - 2019
- [c1]Pablo Barceló, Nelson Higuera, Jorge Pérez, Bernardo Subercaseaux:
Expressiveness of Matrix and Tensor Query Languages in terms of ML Operators. DEEM@SIGMOD 2019: 9:1-9:5
Informal and Other Publications
- 2024
- [i13]Fernanda Gutiérrez, Bernardo Subercaseaux:
Assortment Optimization For Conference Goodies With Indifferent Attendees. CoRR abs/2403.03330 (2024) - [i12]Thomas Garrison, Marijn J. H. Heule, Bernardo Subercaseaux:
PackIt! Gamified Rectangle Packing. CoRR abs/2403.12195 (2024) - [i11]Bernardo Subercaseaux, Wojciech Nawrocki, James Gallicchio, Cayden R. Codel, Mario Carneiro, Marijn J. H. Heule:
Formal Verification of the Empty Hexagon Number. CoRR abs/2403.17370 (2024) - [i10]John Mackey, Bernardo Subercaseaux:
Pentagon Minimization without Computation. CoRR abs/2409.17098 (2024) - 2023
- [i9]Bernardo Subercaseaux, Marijn J. H. Heule:
The Packing Chromatic Number of the Infinite Square Grid is 15. CoRR abs/2301.09757 (2023) - [i8]Marcelo Arenas, Pablo Barceló, Diego Bustamente, Jose Caraball, Bernardo Subercaseaux:
A Symbolic Language for Interpreting Decision Trees. CoRR abs/2310.11636 (2023) - [i7]Bernardo Subercaseaux, John Mackey, Marijn J. H. Heule, Ruben Martins:
Minimizing Pentagons in the Plane through Automated Reasoning. CoRR abs/2311.03645 (2023) - 2022
- [i6]Daniel Lokshtanov, Bernardo Subercaseaux:
Wordle is NP-hard. CoRR abs/2203.16713 (2022) - [i5]Marcelo Arenas, Pablo Barceló, Miguel Romero, Bernardo Subercaseaux:
On Computing Probabilistic Explanations for Decision Trees. CoRR abs/2207.12213 (2022) - 2021
- [i4]Marcelo Arenas, Daniel Báez, Pablo Barceló, Jorge Pérez, Bernardo Subercaseaux:
Foundations of Symbolic Languages for Model Interpretability. CoRR abs/2110.02376 (2021) - 2020
- [i3]Jérémy Barbay, Bernardo Subercaseaux:
The Computational Complexity of Evil Hangman. CoRR abs/2003.10000 (2020) - [i2]Pablo Barceló, Mikaël Monet, Jorge Pérez, Bernardo Subercaseaux:
Model Interpretability through the Lens of Computational Complexity. CoRR abs/2010.12265 (2020) - 2019
- [i1]Pablo Barceló, Nelson Higuera, Jorge Pérez, Bernardo Subercaseaux:
On the Expressiveness of LARA: A Unified Language for Linear and Relational Algebra. CoRR abs/1909.11693 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
