Eduardo Sany Laber

Searching in random partially ordered sets

Renato Carmo, Jair Donadelli, Yoshiharu Kohayakawa et al. · Theoretical Computer Science · 2004 · 39 citations

Natural Sciences, Computer Science, Mathematics +8

Shallow decision trees for explainable <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si14.svg"><mml:mi>k</mml:mi></mml:math>-means clustering

Eduardo Sany Laber, Lucas Murtinho, Felipe M F de Oliveira · Pattern Recognition · 2022 · 38 citations

Computing, Computer Science, Algorithms +8

On the hardness of the minimum height decision tree problem

Eduardo Sany Laber, Loana Tito Nogueira · Discrete Applied Mathematics · 2004 · 33 citations

Natural Sciences, Computer Science, Mathematics +9

Minimization of Gini Impurity: NP-completeness and Approximation Algorithm via Connections with the k-means Problem

Eduardo Sany Laber, Lucas Murtinho · Electronic Notes in Theoretical Computer Science · 2019 · 31 citations · Full text

Computing, Computer Science, Mathematics +10

On the complexity of searching in trees and partially ordered structures

Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber et al. · Theoretical Computer Science · 2011 · 30 citations

Computing, Computer Science, Mathematics +9