| 2024 | ICML | New Bounds on the Cohesion of Complete-link and Other Linkage Methods for Agglomerative Clustering. | Sanjoy Dasgupta, Eduardo Sany Laber |
| 2021 | ICML | On the price of explainability for some clustering problems. | Eduardo Sany Laber, Lucas Murtinho |
| 2020 | ECAI | Speeding up Word Mover's Distance and Its Variants via Properties of Distances Between Embeddings. | Matheus Werner, Eduardo Sany Laber |
| 2020 | ICML | Teaching with Limited Information on the Learner's Behaviour. | Ferdinando Cicalese, Sergio Filho, Eduardo Sany Laber, Marco Molinaro |
| 2019 | ICML | New results on information theoretic clustering. | Ferdinando Cicalese, Eduardo Sany Laber, Lucas Murtinho |
| 2018 | ICML | Binary Partitions with Approximate Minimum Impurity. | Eduardo Sany Laber, Marco Molinaro, Felipe de A. Mello Pereira |
| 2016 | DCC | On Compression Techniques for Computing Convolutions. | Eduardo Sany Laber, Pedro Moura, Lucas Pavanelli |
| 2015 | ISAAC | Trading off Worst and Expected Cost in Decision Tree Problems. | Aline Medeiros Saettler, Eduardo Sany Laber, Ferdinando Cicalese |
| 2014 | ICML | Diagnosis determination: decision trees optimizing simultaneously worst and expected testing cost. | Ferdinando Cicalese, Eduardo Sany Laber, Aline Medeiros Saettler |
| 2014 | ISAIM | Function Evaluation: decision trees optimizing simultaneously worst and expected testing cost. | Ferdinando Cicalese, Eduardo Sany Laber, Aline Medeiros Saettler |
| 2014 | ISIT | On lower bounds for the Maximum Consecutive Subsums Problem and the (min, +)-convolution. | Eduardo Sany Laber, Wilfredo Bardales Roncalla, Ferdinando Cicalese |
| 2013 | SPIRE | Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs. | Ferdinando Cicalese, Travis Gagie, Emanuele Giaquinta, Eduardo Sany Laber, Zsuzsanna Liptk, Romeo Rizzi, Alexandru I. Tomescu |
| 2012 | CPM | 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 |
| 2011 | DocEng | An efficient language-independent method to extract content from news webpages. | Eduardo Teixeira Cardoso, Iam Vita Jabour, Eduardo Sany Laber, Rogrio Rodrigues, Pedro Cardoso |
| 2011 | WADS | Binary Identification Problems for Weighted Trees. | Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Caio Dias Valentim |
| 2010 | ICALP | On the Complexity of Searching in Trees: Average-Case Minimization. | Tobias Jacobs, Ferdinando Cicalese, Eduardo Sany Laber, Marco Molinaro |
| 2010 | ISAAC | On Greedy Algorithms for Decision Trees. | Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Marco Molinaro |
| 2009 | CIKM | A fast and simple method for extracting relevant content from news webpages. | Eduardo Sany Laber, Crston Pereira de Souza, Iam Vita Jabour, Evelin Carvalho Freire de Amorim, Eduardo Teixeira Cardoso, Ral P. Rentera, Lcio Cunha Tinoco, Caio Dias Valentim |
| 2009 | ISIT | Merge source coding. | Bruno Tenrio vila, Eduardo Sany Laber |
| 2008 | ICALP | Function Evaluation Via Linear Programming in the Priced Information Model. | Ferdinando Cicalese, Eduardo Sany Laber |
| 2008 | ICALP | An Approximation Algorithm for Binary Searching in Trees. | Eduardo Sany Laber, Marco Molinaro |
| 2006 | LATIN | On Behalf of the Seller and Society: Bicriteria Mechanisms for Unit-Demand Auctions. | Claudson F. Bornstein, Eduardo Sany Laber, Marcelo Mas |
| 2006 | SODA | On the competitive ratio of evaluating priced functions. | Ferdinando Cicalese, Eduardo Sany Laber |
| 2005 | ESA | An Optimal Algorithm for Querying Priced Information: Monotone Boolean Functions and Game Trees. | Ferdinando Cicalese, Eduardo Sany Laber |
| 2005 | STOC | A new strategy for querying priced information. | Ferdinando Cicalese, Eduardo Sany Laber |
| 2004 | ALENEX | Efficient Implementation of Hotlink Assignment Algorithm for Web Sites. | Artur Alves Pessoa, Eduardo Sany Laber, Crston P. de Souza |
| 2004 | ISAAC | Efficient Algorithms for the Hotlink Assignment Problem: The Worst Case Search. | Artur Alves Pessoa, Eduardo Sany Laber, Crston P. de Souza |
| 2004 | LATIN | Querying Priced Information in Databases: The Conjunctive Case. | Eduardo Sany Laber, Renato Carmo, Yoshiharu Kohayakawa |
| 2004 | STACS | A Randomized Competitive Algorithm for Evaluating Priced AND/OR Trees. | Eduardo Sany Laber |
| 2003 | DCC | A fast decoding method for prefix codes. | Ruy Luiz Milidi, Eduardo Sany Laber, Lorenza O. Moreno, Julio C. Duarte |
| 2002 | ESA | Randomized Approximation Algorithms for Query Optimization Problems on Two Processors. | Eduardo Sany Laber, Ojas Parekh, R. Ravi |
| 2002 | LATIN | Searching in Random Partially Ordered Sets. | Renato Carmo, Jair Donadelli, Yoshiharu Kohayakawa, Eduardo Sany Laber |
| 2002 | LATIN | Pipeline Transportation of Petroleum Products with No Due Dates. | Ruy Luiz Milidi, Artur Alves Pessoa, Eduardo Sany Laber |
| 2001 | SODA | On binary searching with non-uniform costs. | Eduardo Sany Laber, Ruy Luiz Milidi, Artur Alves Pessoa |
| 2000 | LATIN | Linear Time Recognition of Optimal L-Restricted Prefix Codes (Extended Abstract). | Ruy Luiz Milidi, Eduardo Sany Laber |
| 2000 | SPIRE | Fast Calculation of Optimal Strategies for Searching with Non-Uniform Costs. | Ruy Luiz Milidi, Artur Alves Pessoa, Eduardo Sany Laber, Ral P. Rentera |
| 1999 | ALENEX | Efficient Implementation of the WARM-UP Algorithm for the Construction of Length-Restricted Prefix Codes. | Ruy Luiz Milidi, Artur Alves Pessoa, Eduardo Sany Laber |
| 1999 | DCC | A Work Efficient Parallel Algorithm for Constructing Huffman Codes. | Ruy Luiz Milidi, Eduardo Sany Laber, Artur Alves Pessoa |
| 1999 | DCC | Bounding the Compression Loss of the FGK Algorithm. | Ruy Luiz Milidi, Eduardo Sany Laber, Artur Alves Pessoa |
| 1999 | DCC | Two Space-Economical Algorithms for Calculating Minimum Redundancy Prefix Codes. | Ruy Luiz Milidi, Artur Alves Pessoa, Eduardo Sany Laber |
| 1999 | ESA | Strategies for Searching with Different Access Costs. | Eduardo Sany Laber, Ruy Luiz Milidi, Artur Alves Pessoa |
| 1999 | SPIRE | Practical Constructions of L-restricted Alphabetic Prefix Codes. | Eduardo Sany Laber, Ruy Luiz Milidi, Artur Alves Pessoa |
| 1999 | SPIRE | A Fast and Space-Economical Algorithm for Calculating Minimum Redundancy Prefix Codes. | Ruy Luiz Milidi, Artur Alves Pessoa, Eduardo Sany Laber |
| 1998 | SPIRE | In-Place Length-Restricted Prefix Coding. | Ruy Luiz Milidi, Artur Alves Pessoa, Eduardo Sany Laber |