E. Laber

Most-cited papers

LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings
E. Laber, Claudson F. Bornstein, Loana Tito Nogueira, L. Faria
2008Lecture Notes in Computer Science53 citations
Semantic Scholar
Searching in random partially ordered sets
R. Carmo, J. Donadelli, Y. Kohayakawa, E. Laber
2002Theoretical Computer Science43 citations Open access
Semantic Scholar
On the hardness of the minimum height decision tree problem
E. Laber, Loana Tito Nogueira
2004Discrete Applied Mathematics39 citations Open access
Semantic Scholar
Shallow decision trees for explainable k-means clustering
E. Laber, Lucas Murtinho, Felipe Oliveira
2021arXiv.org36 citations
Semantic Scholar
On the price of explainability for some clustering problems
E. Laber, Lucas Murtinho
2021International Conference on Machine Learning35 citations
Semantic Scholar
On the complexity of searching in trees and partially ordered structures
F. Cicalese, Tobias Jacobs, E. Laber, M. Molinaro
2011Theoretical Computer Science34 citations Open access
Semantic Scholar
Minimization of Gini Impurity: NP-completeness and Approximation Algorithm via Connections with the k-means Problem
E. Laber, Lucas Murtinho
2019Latin-American Algorithms, Graphs and Optimization Symposium29 citations Open access
Semantic Scholar
Decision Trees with Short Explainable Rules
Victor Feitosa Souza, F. Cicalese, E. Laber, M. Molinaro
2022Neural Information Processing Systems27 citations
Semantic Scholar
The binary identification problem for weighted trees
F. Cicalese, Tobias Jacobs, E. Laber, C. Valentim
2012Theoretical Computer Science27 citations Open access
Semantic Scholar
Shallow decision trees for explainable k-means clustering
E. Laber, Lucas Murtinho, Felipe Oliveira
2022Pattern Recognition26 citations Open access
Semantic Scholar
Binary Partitions with Approximate Minimum Impurity
E. Laber, M. Molinaro, Felipe de A. Mello Pereira
2018International Conference on Machine Learning26 citations
Semantic Scholar
Diagnosis determination: decision trees optimizing simultaneously worst and expected testing cost
F. Cicalese, E. Laber, A. Saettler
2014International Conference on Machine Learning25 citations
Semantic Scholar
An Approximation Algorithm for Binary Searching in Trees
E. Laber, M. Molinaro
2011Algorithmica22 citations
Semantic Scholar
On the competitive ratio of evaluating priced functions
F. Cicalese, E. Laber
2006ACM-SIAM Symposium on Discrete Algorithms22 citations
Semantic Scholar
Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence
F. Cicalese, E. Laber, Oren Weimann, R. Yuster
2012Annual Symposium on Combinatorial Pattern Matching21 citations
Semantic Scholar
On Greedy Algorithms for Decision Trees
F. Cicalese, Tobias Jacobs, E. Laber, M. Molinaro
2010International Symposium on Algorithms and Computation21 citations
Semantic Scholar
A fast and simple method for extracting relevant content from news webpages
E. Laber, C. Souza, Iam Vita Jabour, Evelin Amorim +4 more
2009International Conference on Information and Knowledge Management21 citations
Semantic Scholar
Reducing human interactions in Web directory searches
O. Gerstel, S. Kutten, E. Laber, Rachel Matichin +3 more
2007TOIS21 citations
Semantic Scholar
Decision tree classification with bounded number of errors
A. Saettler, E. Laber, Felipe de A. Mello Pereira
2017Information Processing Letters20 citations
Semantic Scholar
Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs
F. Cicalese, T. Gagie, Emanuele Giaquinta, E. Laber +3 more
2013SPIRE20 citations
Semantic Scholar
On the Complexity of Searching in Trees: Average-Case Minimization
Tobias Jacobs, F. Cicalese, E. Laber, M. Molinaro
2009International Colloquium on Automata, Languages and Programming20 citations
Semantic Scholar
Improved Approximation Algorithms for the Average-Case Tree Searching Problem
F. Cicalese, Tobias Jacobs, E. Laber, M. Molinaro
2012Algorithmica19 citations
Semantic Scholar
A new strategy for querying priced information
F. Cicalese, E. Laber
2005Symposium on the Theory of Computing19 citations
Semantic Scholar
Fast Searching in Trees
E. Laber, Loana Tito Nogueira
2001Electron. Notes Discret. Math.19 citations
Semantic Scholar
An efficient language-independent method to extract content from news webpages
Eduardo Teixeira Cardoso, Iam Vita Jabour, E. Laber, R. Rodrigues +1 more
2011ACM Symposium on Document Engineering18 citations
Semantic Scholar
Teaching with Limited Information on the Learner's Behaviour
F. Cicalese, Sergio Filho, E. Laber, M. Molinaro
2020International Conference on Machine Learning17 citations
Semantic Scholar
Bounding the Inefficiency of Length-Restricted Prefix Codes
R. Milidiú, E. Laber
2001Algorithmica17 citations
Semantic Scholar
On lower bounds for the Maximum Consecutive Subsums Problem and the (min,+)-convolution
E. Laber, Wilfredo Bardales R, F. Cicalese
20142014 IEEE International Symposium on Information Theory16 citations
Semantic Scholar
Efficient Algorithms for the Hotlink Assignment Problem: The Worst Case Search
A. Pessoa, E. Laber, Críston P. de Souza
2004International Symposium on Algorithms and Computation16 citations
Semantic Scholar
Two space-economical algorithms for calculating minimum redundancy prefix codes
R. Milidiú, A. Pessoa, E. Laber
1999Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096)16 citations
Semantic Scholar
LSHSIM: A Locality Sensitive Hashing based method for multiple-point geostatistics
P. Moura, E. Laber, H. Lopes, Daniel Mesejo +4 more
2017Computational Geosciences15 citations Open access
Semantic Scholar
Speeding up Word Mover's Distance and its variants via properties of distances between embeddings
Matheus Werner, E. Laber
2019European Conference on Artificial Intelligence14 citations Open access
Semantic Scholar
Efficient Implementation of Hotlink Assignment Algorithm for Web Sites
A. Pessoa, E. Laber, Críston P. de Souza
2004ALENEX/ANALC14 citations
Semantic Scholar
Improved bounds for asymmetric communication protocols
E. Laber, Leonardo Gomes Holanda
2002Information Processing Letters14 citations
Semantic Scholar
The WARM-UP Algorithm: A Lagrangian Construction of Length Restricted Huffman Codes
R. Milidiú, E. Laber
2000SIAM journal on computing (Print)14 citations
Semantic Scholar
On Binary Searching with Nonuniform Costs
E. Laber, R. Milidiú, A. Pessoa
2002SIAM journal on computing (Print)13 citations
Semantic Scholar
On binary searching with non-uniform costs
E. Laber, R. Milidiú, A. Pessoa
2001ACM-SIAM Symposium on Discrete Algorithms13 citations
Semantic Scholar
Pipeline Transportation of Petroleum Products with No Due Dates
R. Milidiú, A. Pessoa, E. Laber
2002Latin American Symposium on Theoretical Informatics12 citations
Semantic Scholar
Competitive Boolean function evaluation: Beyond monotonicity, and the symmetric case
F. Cicalese, T. Gagie, E. Laber, Martin Milanič
2010Discrete Applied Mathematics11 citations Open access
Semantic Scholar
A randomized competitive algorithm for evaluating priced AND/OR trees
E. Laber
2004Theoretical Computer Science10 citations Open access
Semantic Scholar
New results on information theoretic clustering
F. Cicalese, E. Laber, Lucas Murtinho
2019International Conference on Machine Learning9 citations
Semantic Scholar
Splitting criteria for classification problems with multi-valued attributes and large number of classes
E. Laber, Felipe de A. Mello Pereira
2018Pattern Recognition Letters9 citations
Semantic Scholar
Querying priced information in databases: The conjunctive case
R. Carmo, T. Feder, Y. Kohayakawa, E. Laber +4 more
2004TALG9 citations
Semantic Scholar
Decision Trees for Function Evaluation - Simultaneous Optimization of Worst and Expected Cost
F. Cicalese, E. Laber, A. Saettler
20138 citations
Semantic Scholar
An Optimal Algorithm for Querying Priced Information: Monotone Boolean Functions and Game Trees
F. Cicalese, E. Laber
2005Embedded Systems and Applications8 citations
Semantic Scholar
The computational complexity of some explainable clustering problems
E. Laber
2022Information Processing Letters7 citations Open access
Semantic Scholar
Information Theoretical Clustering Is Hard to Approximate
F. Cicalese, E. Laber
2018IEEE Transactions on Information Theory7 citations Open access
Semantic Scholar
Trading Off Worst and Expected Cost in Decision Tree Problems
A. Saettler, E. Laber, F. Cicalese
2015Algorithmica7 citations
Semantic Scholar
Function Evaluation Via Linear Programming in the Priced Information Model
F. Cicalese, E. Laber
2008International Colloquium on Automata, Languages and Programming6 citations
Semantic Scholar
A fast decoding method for prefix codes
R. Milidiú, E. Laber, Lorenza Moreno, J. C. Duarte
2003Data Compression Conference, 2003. Proceedings. DCC 20036 citations
Semantic Scholar