In-Place Length-Restricted Prefix Coding. - Ruy Luiz Milidiú; Artur Alves Pessoa; Eduardo Sany Laber (SPIRE, 1998)

Efficient Implementation of the WARM-UP Algorithm for the Construction of Length-Restricted Prefix Codes. - Ruy Luiz Milidiú; Artur Alves Pessoa; Eduardo Sany Laber (ALENEX, 1999)

A Work Efficient Parallel Algorithm for Constructing Huffman Codes. - Ruy Luiz Milidiú; Eduardo Sany Laber; Artur Alves Pessoa (Data Compression Conference, 1999)

Two Space-Economical Algorithms for Calculating Minimum Redundancy Prefix Codes. - Ruy Luiz Milidiú; Artur Alves Pessoa; Eduardo Sany Laber (Data Compression Conference, 1999)

Strategies for Searching with Different Access Costs. - Eduardo Sany Laber; Ruy Luiz Milidiú; Artur Alves Pessoa (ESA, 1999)

Practical Constructions of L-restricted Alphabetic Prefix Codes. - Eduardo Sany Laber; Ruy Luiz Milidiú; Artur Alves Pessoa (SPIRE/CRIWG, 1999)

A Fast and Space-Economical Algorithm for Calculating Minimum Redundancy Prefix Codes. - Ruy Luiz Milidiú; Artur Alves Pessoa; Eduardo Sany Laber (SPIRE/CRIWG, 1999)

Bounding the Compression Loss of the FGK Algorithm. - Ruy Luiz Milidiú; Eduardo Sany Laber; Artur Alves Pessoa (J. Algorithms, 1999)

CóDigos de Prefixo: Algoritmos E Cotas. - Eduardo Sany Laber (1999)

Linear Time Recognition of Optimal L-Restricted Prefix Codes (Extended Abstract). - Ruy Luiz Milidiú; Eduardo Sany Laber (LATIN, 2000)

Fast Calculation of Optimal Strategies for Searching with Non-Uniform Costs. - Ruy Luiz Milidiú; Artur Alves Pessoa; Eduardo Sany Laber; Raúl P. Rentería (SPIRE, 2000)

The WARM-UP Algorithm: A Lagrangian Construction of Length Restricted Huffman Codes. - Ruy Luiz Milidiú; Eduardo Sany Laber (SIAM J. Comput., 2000)

On binary searching with non-uniform costs. - Eduardo Sany Laber; Ruy Luiz Milidiú; Artur Alves Pessoa (SODA, 2001)

Bounding the Inefficiency of Length-Restricted Prefix Codes. - Ruy Luiz Milidiú; Eduardo Sany Laber (Algorithmica, 2001)

On asymmetric communication protocols. - Eduardo Sany Laber; Leonardo Gomes Holanda (Electron. Notes Discret. Math., 2001)

Fast Searching in Trees. - Eduardo Sany Laber; Loana Tito Nogueira (Electron. Notes Discret. Math., 2001)

Three space-economical algorithms for calculating minimum-redundancy prefix codes. - Ruy Luiz Milidiú; Artur Alves Pessoa; Eduardo Sany Laber (IEEE Trans. Inf. Theory, 2001)

Complexity of Makespan Minimization for Pipeline Transportation of Petroleum Products. - Ruy Luiz Milidiú; Artur Alves Pessoa; Eduardo Sany Laber (APPROX, 2002)

Randomized Approximation Algorithms for Query Optimization Problems on Two Processors. - Eduardo Sany Laber; Ojas Parekh; R. Ravi 001 (ESA, 2002)

Pipeline Transportation of Petroleum Products with No Due Dates. - Ruy Luiz Milidiú; Artur Alves Pessoa; Eduardo Sany Laber (LATIN, 2002)

Improved bounds for asymmetric communication protocols. - Eduardo Sany Laber; Leonardo Gomes Holanda (Inf. Process. Lett., 2002)

On Binary Searching with Nonuniform Costs. - Eduardo Sany Laber; Ruy Luiz Milidiú; Artur Alves Pessoa (SIAM J. Comput., 2002)

A strategy for searching with different access costs. - Eduardo Sany Laber; Ruy Luiz Milidiú; Artur Alves Pessoa (Theor. Comput. Sci., 2002)

A fast decoding method for prefix codes. - Ruy Luiz Milidiú; Eduardo Sany Laber; Lorenza O. Moreno; Julio C. Duarte (DCC, 2003)

Cherry Picking: A Semantic Query Processing Strategy for the Evaluation of Expensive Predicates. - Fábio Porto 001; Eduardo Sany Laber; Patrick Valduriez (SBBD, 2003)

A Note on multicolor bipartite Ramsey numbers for K_{2, n}. - Eduardo Sany Laber; Emerson L. Monte Carmelo (Ars Comb., 2003)

The complexity of makespan minimization for pipeline transportation. - Ruy Luiz Milidiú; Artur Alves Pessoa; Eduardo Sany Laber (Theor. Comput. Sci., 2003)

Efficient Implementation of Hotlink Assignment Algorithm for Web Sites. - Artur Alves Pessoa; Eduardo Sany Laber; Críston P. de Souza (ALENEX/ANALC, 2004)

Efficient Algorithms for the Hotlink Assignment Problem: The Worst Case Search. - Artur Alves Pessoa; Eduardo Sany Laber; Críston P. de Souza (ISAAC, 2004)

Querying Priced Information in Databases: The Conjunctive Case. - Eduardo Sany Laber; Renato Carmo; Yoshiharu Kohayakawa (LATIN, 2004)

On the hardness of the minimum height decision tree problem. - Eduardo Sany Laber; Loana Tito Nogueira (Discret. Appl. Math., 2004)

Searching in random partially ordered sets. - Renato Carmo; Jair Donadelli; Yoshiharu Kohayakawa; Eduardo Sany Laber (Theor. Comput. Sci., 2004)

An Optimal Algorithm for Querying Priced Information: Monotone Boolean Functions and Game Trees. - Ferdinando Cicalese; Eduardo Sany Laber (ESA, 2005)

A new strategy for querying priced information. - Ferdinando Cicalese; Eduardo Sany Laber (STOC, 2005)

Randomized mechanisms for limited supply multi-item auctions. - Claudson F. Bornstein; Eduardo Sany Laber; Marcelo Albuquerque Fernandes Más (Electron. Notes Discret. Math., 2005)

Hotlink Assignment on the Web. - Eduardo Sany Laber (GTIT-C, 2006)

On Behalf of the Seller and Society: Bicriteria Mechanisms for Unit-Demand Auctions. - Claudson F. Bornstein; Eduardo Sany Laber; Marcelo Mas (LATIN, 2006)

A Polite Policy for Revisiting Web Pages. - Críston P. de Souza; Eduardo Sany Laber; Caio Dias Valentim; Eduardo Teixeira Cardoso (LA-WEB, 2007)

A note on the size of minimal covers. - Vaston G. Costa; Edward Hermann Haeusler; Eduardo Sany Laber; Loana Tito Nogueira (Inf. Process. Lett., 2007)

Querying priced information in databases: The conjunctive case. - Renato Carmo; Tomás Feder; Yoshiharu Kohayakawa; Eduardo Sany Laber; Rajeev Motwani 001; Liadan O'Callaghan; Rina Panigrahy; Dilys Thomas (ACM Trans. Algorithms, 2007)

Reducing human interactions in Web directory searches. - Ornan Ori Gerstel; Shay Kutten; Eduardo Sany Laber; Rachel Matichin; David Peleg; Artur Alves Pessoa; Críston P. de Souza (ACM Trans. Inf. Syst., 2007)

Function Evaluation Via Linear Programming in the Priced Information Model. - Ferdinando Cicalese; Eduardo Sany Laber (ICALP (1), 2008)

A randomized competitive algorithm for evaluating priced AND/OR trees. - Eduardo Sany Laber (Theor. Comput. Sci., 2008)

A fast and simple method for extracting relevant content from news webpages. - Eduardo Sany Laber; Críston Pereira de Souza; Iam Vita Jabour; Evelin Carvalho Freire de Amorim; Eduardo Teixeira Cardoso; Raúl P. Rentería; Lúcio Cunha Tinoco; Caio Dias Valentim (CIKM, 2009)

Merge source coding. - Bruno Tenório Ávila; Eduardo Sany Laber (ISIT, 2009)

On the Complexity of Searching in Trees: Average-case Minimization - Ferdinando Cicalese; Eduardo Sany Laber; Marco Molinaro 001 (CoRR, 2009)

On the Complexity of Searching in Trees: Average-Case Minimization. - Tobias Jacobs; Ferdinando Cicalese; Eduardo Sany Laber; Marco Molinaro 001 (ICALP (1), 2010)

On Greedy Algorithms for Decision Trees. - Ferdinando Cicalese; Tobias Jacobs; Eduardo Sany Laber; Marco Molinaro 001 (ISAAC (2), 2010)

An efficient language-independent method to extract content from news webpages. - Eduardo Teixeira Cardoso; Iam Vita Jabour; Eduardo Sany Laber; Rogério Rodrigues; Pedro Cardoso (ACM Symposium on Document Engineering, 2011)

Binary Identification Problems for Weighted Trees. - Ferdinando Cicalese; Tobias Jacobs; Eduardo Sany Laber; Caio Dias Valentim (WADS, 2011)

Guest Editorial: Special Issue on Latin American Theoretical Informatics Symposium (LATIN). - Eduardo Sany Laber; Claudson F. Bornstein; Cristina G. Fernandes (Algorithmica, 2011)

An Approximation Algorithm for Binary Searching in Trees. - Eduardo Sany Laber; Marco Molinaro 001 (Algorithmica, 2011)

Competitive Boolean function evaluation: Beyond monotonicity, and the symmetric case. - Ferdinando Cicalese; Travis Gagie; Eduardo Sany Laber; Martin Milanic (Discret. Appl. Math., 2011)

On the competitive ratio of evaluating priced functions. - Ferdinando Cicalese; Eduardo Sany Laber (J. ACM, 2011)

Improved approximations for the hotlink assignment problem. - Eduardo Sany Laber; Marco Molinaro 001 (ACM Trans. Algorithms, 2011)

On the complexity of searching in trees and partially ordered structures. - Ferdinando Cicalese; Tobias Jacobs; Eduardo Sany Laber; Marco Molinaro 001 (Theor. Comput. Sci., 2011)

Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence. - Ferdinando Cicalese; Eduardo Sany Laber; Oren Weimann; Raphael Yuster (CPM, 2012)

Data Structures for Detecting Rare Variations in Time Series. - Caio Dias Valentim; Eduardo Sany Laber; David Sotelo (ECML/PKDD (2), 2012)

The binary identification problem for weighted trees. - Ferdinando Cicalese; Tobias Jacobs; Eduardo Sany Laber; Caio Dias Valentim (Theor. Comput. Sci., 2012)

Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs. - Ferdinando Cicalese; Travis Gagie; Emanuele Giaquinta; Eduardo Sany Laber; Zsuzsanna Lipták; Romeo Rizzi; Alexandru I. Tomescu (SPIRE, 2013)

Decision Trees for the efficient evaluation of discrete functions: worst case and expected case analysis. - Ferdinando Cicalese; Eduardo Sany Laber; Aline Medeiros Saettler (CoRR, 2013)

Diagnosis determination: decision trees optimizing simultaneously worst and expected testing cost. - Ferdinando Cicalese; Eduardo Sany Laber; Aline Medeiros Saettler (ICML, 2014)

Function Evaluation: decision trees optimizing simultaneously worst and expected testing cost. - Ferdinando Cicalese; Eduardo Sany Laber; Aline Medeiros Saettler (ISAIM, 2014)

On lower bounds for the Maximum Consecutive Subsums Problem and the (min, +)-convolution. - Eduardo Sany Laber; Wilfredo Bardales Roncalla; Ferdinando Cicalese (ISIT, 2014)

Improved Approximation Algorithms for the Average-Case Tree Searching Problem. - Ferdinando Cicalese; Tobias Jacobs; Eduardo Sany Laber; Marco Molinaro 001 (Algorithmica, 2014)

Trading off Worst and Expected Cost in Decision Tree Problems and a Value Dependent Model. - Aline Medeiros Saettler; Eduardo Sany Laber; Ferdinando Cicalese (CoRR, 2014)

Approximating the maximum consecutive subsums of a sequence. - Ferdinando Cicalese; Eduardo Sany Laber; Oren Weimann; Raphael Yuster (Theor. Comput. Sci., 2014)

Searching for a superlinear lower bounds for the Maximum Consecutive Subsums Problem and the (min, +)-convolution. - Wilfredo Bardales Roncalla; Eduardo Sany Laber; Ferdinando Cicalese (CoRR, 2015)

Approximating decision trees with value dependent testing costs. - Aline Medeiros Saettler; Eduardo Sany Laber; Ferdinando Cicalese (Inf. Process. Lett., 2015)

On Compression Techniques for Computing Convolutions. - Eduardo Sany Laber; Pedro Moura; Lucas Pavanelli (DCC, 2016)

Decision Trees for Function Evaluation: Simultaneous Optimization of Worst and Expected Cost. - Ferdinando Cicalese; Eduardo Sany Laber; Aline Medeiros Saettler (Algorithmica, 2017)

Trading Off Worst and Expected Cost in Decision Tree Problems. - Aline Medeiros Saettler; Eduardo Sany Laber; Ferdinando Cicalese (Algorithmica, 2017)

LSHSIM: A Locality Sensitive Hashing based method for multiple-point geostatistics. - Pedro Moura; Eduardo Sany Laber; Hélio Lopes 001; Daniel Mesejo; Lucas Pavanelli; João Jardim; Francisco Thiesen; Gabriel Pujol (Comput. Geosci., 2017)

Decision tree classification with bounded number of errors. - Aline Medeiros Saettler; Eduardo Sany Laber; Felipe de A. Mello Pereira (Inf. Process. Lett., 2017)

Binary Partitions with Approximate Minimum Impurity. - Eduardo Sany Laber; Marco Molinaro 001; Felipe de A. Mello Pereira (ICML, 2018)

Correction to: Trading Off Worst and Expected Cost in Decision Tree Problems. - Aline Medeiros Saettler; Eduardo Sany Laber; Ferdinando Cicalese (Algorithmica, 2018)

Approximation Algorithms for Clustering via Weighted Impurity Measures. - Ferdinando Cicalese; Eduardo Sany Laber (CoRR, 2018)

Minimization of Gini impurity via connections with the k-means problem. - Eduardo Sany Laber; Lucas Murtinho (CoRR, 2018)

Splitting criteria for classification problems with multi-valued attributes and large number of classes. - Eduardo Sany Laber; Felipe de A. Mello Pereira (Pattern Recognit. Lett., 2018)

New results on information theoretic clustering. - Ferdinando Cicalese; Eduardo Sany Laber; Lucas Murtinho (ICML, 2019)

Minimization of Gini Impurity: NP-completeness and Approximation Algorithm via Connections with the k-means Problem. - Eduardo Sany Laber; Lucas Murtinho (LAGOS, 2019)

Speeding up Word Mover's Distance and Its Variants via Properties of Distances Between Embeddings. - Matheus Werner; Eduardo Sany Laber (ECAI, 2020)

Teaching with Limited Information on the Learner's Behaviour. - Ferdinando Cicalese; Sergio Filho; Eduardo Sany Laber; Marco Molinaro 001 (ICML, 2020)

On the price of explainability for some clustering problems. - Eduardo Sany Laber; Lucas Murtinho (ICML, 2021)

On the star decomposition of a graph: Hardness results and approximation for the max-min optimization problem. - Ferdinando Cicalese; Eduardo Sany Laber (Discret. Appl. Math., 2021)

Information Theoretical Clustering Is Hard to Approximate. - Ferdinando Cicalese; Eduardo Sany Laber (IEEE Trans. Inf. Theory, 2021)

Time-Constrained Learning. - Sergio Filho; Eduardo Sany Laber; Pedro Lazera; Marco Molinaro 001 (CoRR, 2022)

Bete: A Brazilian Portuguese Dataset for Named Entity Recognition and Relation Extraction in the Diabetes Healthcare Domain. - Lucas Pavanelli; Yohan Bonescki Gumiel; Thiago Castro Ferreira; Adriana S. Pagano; Eduardo Sany Laber (BRACIS (3), 2023)

Optimization of Inter-group criteria for clustering with minimum size constraints. - Eduardo Sany Laber; Lucas Murtinho (NeurIPS, 2023)

Nearly tight bounds on the price of explainability for the k-center and the maximum-spacing clustering problems. - Eduardo Sany Laber; Lucas Murtinho (Theor. Comput. Sci., 2023)

Shallow decision trees for explainable k-means clustering. - Eduardo Sany Laber; Lucas Murtinho; Felipe Oliveira (Pattern Recognit., 2023)

Time-constrained learning. - Sérgio Freitas; Eduardo Sany Laber; Pedro Lazera; Marco Molinaro 001 (Pattern Recognit., 2023)

New Bounds on the Cohesion of Complete-link and Other Linkage Methods for Agglomerative Clustering. - Sanjoy Dasgupta; Eduardo Sany Laber (ICML, 2024)

New bounds on the cohesion of complete-link and other linkage methods for agglomeration clustering. - Sanjoy Dasgupta; Eduardo Sany Laber (CoRR, 2024)

On the cohesion and separability of average-link for hierarchical agglomerative clustering. - Eduardo Sany Laber; Miguel Bastista (CoRR, 2024)

Extracting section structure from resumes in Brazilian Portuguese. - Matheus Werner; Eduardo Sany Laber (Expert Syst. Appl., 2024)

The computational complexity of some explainable clustering problems. - Eduardo Sany Laber (Inf. Process. Lett., 2024)

Decision trees with short explainable rules. - Victor Feitosa Souza; Ferdinando Cicalese; Eduardo Sany Laber; Marco Molinaro 001 (Theor. Comput. Sci., 2025)